New Models and Methods for Arc Routing

The talk presents two non-standard extensions for single-vehicle arc-routing problems a.k.a. postman problems: First, street segments that require a service on both sides of the street can be covered either by two separate services or by a single zigzag service. Instead of deciding the type of service beforehand, we propose to take into account the zigzagging option when designing a tour. We present MIP models for the extension of Undirected Chinese and Rural Postman Problem (UCPP, URPP). We show that these models can be solved reasonable well using a cutting-plane or branch-and-cut algorithm. Second, capacitated postman problems occur as subproblems in column-generation and Lagrangian-relaxation approaches of the capacitated arc-routing problem. In order to model these and similar subproblems or submodels, we present the Profitable Capacitated Rural Postman Problem (PCRPP): In the PCRPP, edges that are serviced give a profit, but deadheading through edges generates costs. Both service and deadheading consume time. The task is to find a tour that maximizes the difference of profits and costs, while the overall duration of the tour must not exceed a given bound. The solution approach for this problem is again based on branch-and-cut

Уроки Армина Генриховича Стромберга

Один из старейших профессоров Томского политехнического университета Армин Генрихович Стромберг (1910-2004) являлся видным ученым в области физической химии, автором учебника по физической химии и сборника задач по химической термодинамике. А. Г. Стромберг основал школу электроаналитиков в г. Томске. Своими научными работами он внес большой вклад в развитие метода инверсионной вольтамперометрии. У него была интересная жизнь, вполне в духе той эпохи, в которой он жил и работал

Aktive implantierbare medizinische Geräte: Rechtsmedizinische Aspekte

Zusammenfassung: Aktive implantierbare medizinische Geräte ("active implantable medical devices", AIMD) wie Herzschrittmacher ("pacemaker", PM) und Defibrillatoren ("implantable cardioverter-defibrillator", ICD) erfreuen sich seit nunmehr einem halben Jahrhundert (erste PM-Implantation 1958 von Elmqvist und Senning) resp. mehr als 30Jahren (erste ICD-Implantation 1980 von Mirowski) steigender Beliebtheit und werden mit zunehmender Häufigkeit eingesetzt. Statistiken zeigen, dass allein in Deutschland jährlich mehr als 98.000, vorwiegend ältere Patienten (mittleres Alter 75Jahre) einen PM und mehr als 21.000Menschen einen ICD erhalten. Auf 1Mio. Einwohner entfallen somit rund 1200PM und mehr als 260ICD. Auch im rechtsmedizinischen Obduktionsgut und im Rahmen von Leichenschauen spielen derartige Implantate eine wichtige Rolle. Hier stellt sich bei der Begutachtung u.a. die Frage nach möglicherweise todesursächlichen Komplikationen während und nach Implantation sowie Dysfunktionen der Systeme. Wichtige Details für die forensische Arbeit und den postmortalen Umgang mit diesen Implantaten wie Bildgebung (CT, MRT), Präparationstechnik und Explantation sowie das Auslesen und Interpretieren der gespeicherten Daten werden vorgestellt. Zudem wird auf die Möglichkeit der Leichenidentifikation mithilfe von Implantaten hingewiese

Branch-and-Cut for the split delivery vehicle routing problem with time windows

The split delivery vehicle routing problem with time windows (SDVRPTW) is a notoriously hard combinatorial optimization problem. First, it is hard to find a useful compact mixed-integer programming (MIP) formulation for the SDVRPTW. Standard modeling approaches either suffer from inherent symmetries (mixed-integer programs with a vehicle index) or cannot exactly capture all aspects of feasibility. Because of the possibility to visit customers more than once, the standard mechanisms to propagate load and time along the routes fail. Second, the lack of useful formulations has rendered any direct MIP-based approach impossible. Up to now, the most effective exact algorithms for the SDVRPTW have been branch-and-price-and-cut approaches using path-based formulations. In this paper, we propose a new and tailored branch-and-cut algorithm to solve the SDVRPTW. It is based on a new, relaxed compact model, in which some integer solutions are infeasible for the SDVRPTW. We use known and introduce some new classes of valid inequalities to cut off such infeasible solutions. One new class is path-matching constraints that generalize infeasible-path constraints. However, even with the valid inequalities, some integer solutions to the new compact formulation remain to be tested for feasibility. For a given integer solution, we build a generally sparse subnetwork of the original instance. On this subnetwork, all time-window-feasible routes can be enumerated, and a path-based residual problem then solved to decide on the selection of routes, the delivery quantities, and thereby the overall feasibility. All infeasible solutions need to be cut off. For this reason, we derive some strengthened feasibility cuts exploiting the fact that solutions often decompose into clusters. Computational experiments show that the new approach is able to prove optimality for several previously unsolved instances from the literature

The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints

In classical routing problems, each customer is visited exactly once. By contrast, when allowing split deliveries, customers may be served through multiple visits. This potentially results in substantial savings in travel costs. Even if split deliveries are beneficial to the transport company, several visits may be undesirable on the customer side: at each visit the customer has to interrupt his primary activities and handle the goods receipt. The contribution of the present paper consists in a thorough analysis of the possibilities and limitations of split delivery distribution strategies. To this end, we investigate two different types of measures for limiting customer inconvenience (a maximum number of visits and the temporal synchronization of deliveries) and evaluate the impact of these measures on carrier efficiency by means of different objective functions (comprising variable routing costs, costs related to route durations, fixed fleet costs). We consider the vehicle routing problem with time windows in which split deliveries are allowed (SDVRPTW) and define the corresponding generalization that takes into account customer inconvenience constraints (SDVRPTW-IC). We design an extended branch-and-cut algorithm to solve the SDVRPTW-IC and report on experimental results showing the impact of customer inconvenience constraints. We finally draw useful insights for logistics managers on the basis of the experimental analysis carried out

A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand

The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously selecting suppliers and routing a fleet of homogeneous vehicles to purchase different products at the selected suppliers so that all product demands are fulfilled and traveling and purchasing costs are minimized. We consider variants of the MVTPP in which the capacity of the vehicles can become binding and the demand for each product is one unit. Corresponding solution algorithms from the literature are either branch-and-cut or branch-and-price algorithms, where in the latter case the route-generation subproblem is solved on an expanded graph by applying standard dynamic-programming techniques. Our branch-price-and-cut algorithm employs a novel labeling algorithm that works directly on the original network and postpones the purchasing decisions until the route has been completely defined. Moreover, we define a new branching rule generally applicable in case of unitary product demands, introduce a new family of valid inequalities to apply when suppliers can be visited at most once, and show how product incompatibilities can be handled without considering additional resources in the pricing problem. In comprehensive computational experiments with standard benchmark sets we prove that the new branch-price-and-cut approach is highly competitive

High Temporal Summation of Pain Predicts Immediate Analgesic Effect of Acupuncture in Chronic Pain Patients—A Prospective Cohort Study

Objectives: This prospective cohort study explored whether two distinguished sensory parameters predicted acupuncture effects in chronic pain patients; namely high temporal summation of pain (TS) indicating spinal synaptic facilitation as well as a low vibration detection threshold (VDT) indicating a loss of Aβ-fiber function. Methods: Pinprick induced TS and VDT were assessed by standardized, validated methods at the most painful body site and a pain free control site in 100 chronic pain patients receiving six acupuncture sessions as part of an interdisciplinary multimodal pain treatment (IMPT). Immediate change in pain intensity after the first acupuncture session (first treatment on the first day of IMPT) was assessed by the verbal rating scale (VRS, 0–100). After 4 weeks of treatment, patients indicated in a questionnaire whether acupuncture had relieved pain immediately and whether it had contributed to overall pain reduction and well-being after IMPT. Results: Logistic regression analysis revealed an association between high TS at the control site and a reduction in pain intensity of at least 30% (VRS) after the first acupuncture (OR [95%-CI] 4.3 [1.6–11.8]). Questionnaire ratings of immediate pain relief after acupuncture were associated with high TS at the control site (OR [95%-CI] 3.8 [1.4–10.2] any pain relief, OR [95%-CI] 5.5 [1.7–17.1] over 50% pain reduction) and at the pain site (OR [95%-CI] 3.2 [1.2–8.9] any pain relief). Appraisals of the contribution of acupuncture to overall pain reduction and well-being after IMPT were not associated with TS. The VDT was not associated with any outcome. Conclusion: This explorative study provides first-time evidence that high TS, especially at a pain free control site, but not VDT, might predict immediate analgesic response to acupuncture in chronic pain patients. Thus, highly centrally sensitized chronic pain patients might respond particularly well to acupuncture

Is Sham Laser a Valid Control for Acupuncture Trials?

Methodological problems of acupuncture trials focus on adequate placebo controls. In this trial we evaluated the use of sham laser acupuncture as a control procedure. Thirty-four healthy volunteers received verum laser (invisible infrared laser emission and red light, 45 s and 1 J per point) and sham laser (red light) treatment at three acupuncture points (LI4, LU7 and LR3) in a randomized, double-blinded, cross-over design. The main outcome measure was the ratio of correct to incorrect ratings of treatment immediately after each session. The secondary outcome measure was the occurrence of deqi-like sensations at the acupuncture points and their intensity on a 10-fold visual analog scale (VAS; 10 being the strongest sensible sensation). We pooled the results of three former trials to evaluate the credibility of sham laser acupuncture when compared to needle acupuncture. Fifteen out of 34 (44%) healthy volunteers (age: 28 ± 10.7 years) identified the used laser device after the first session and 14 (41%) after the second session. Hence, both treatments were undistinguishable (P = .26). Deqi-like sensations occurred in 46% of active laser (2.34 VAS) and in 49.0% of sham laser beams (2.49 VAS). The credibility of sham laser was not different from needle acupuncture. Sham laser acupuncture can serve as a valid placebo control in laser acupuncture studies. Due to similar credibility and the lack of sensory input on the peripheral nervous system, sham laser acupuncture can also serve as a sham control for acupuncture trials, in order to evaluate needling effects per se

Acupuncture randomized trials (ART) in patients with chronic low back pain and osteoarthritis of the knee - Design and protocols

Background: We report on the study design and protocols of two randomized controlled trials (Acupuncture Randomized Trials = ART) that investigate the efficacy of acupuncture in the treatment of chronic low back pain and osteoarthritis of the knee, respectively. Objective: To investigate whether acupuncture is more efficacious than (a) no treatment or (b) minimal acupuncture in the treatment of low back pain and osteoarthritis. Design: Two randomized, controlled, multicenter trials with three treatment arms and a total follow-up time of 52 weeks. Setting: 30 practitioners and outpatient units in Germany specialized in acupuncture treatment. Patients: 300 patients will be included in each study. In the low back pain trial, patients will be included according to clinical diagnosis. In the osteoarthritis pain trial, patients will be included according to the American College of Rheumatology criteria. Interventions: Patients are randomly assigned to receive either (1) semi-standardized acupuncture (150 patients), (2) minimal acupuncture at non-acupuncture points (75 patients), or (3) no treatment for two months followed by semi-standardized acupuncture (75 patients, waiting list control). Acupuncture treatment consists of 12 sessions per patient over a period of 8 weeks. Main Outcome Measure: The main outcome measure is the difference between baseline and the end of the 8-week treatment period in the following parameters: pain intensity as measured by a visual analogue scale (VAS; 0-100 mm) in the low back pain trial and by the Western Ontario and McMaster Universities Osteoarthritis Score (WOMAC) in the osteoarthritis trial. Outlook: The results of these two studies (available in 2004) will provide health care providers and policy makers with the information needed to make scientifically sound assessments of acupuncture therapy

Hypnotic relaxation results in elevated thresholds of sensory detection but not of pain detection

Background: Many studies show an effectiveness of hypnotic analgesia. It has been discussed whether the analgesic effect is mainly caused by the relaxation that is concomitant to hypnosis. This study was designed to evaluate the effects of hypnotic relaxation suggestion on different somatosensory detection and pain thresholds. Methods: Quantitative sensory testing (QST) measurements were performed before and during hypnosis in twenty-three healthy subjects on the dorsum of the right hand. Paired t-test was used to compare threshold changes. The influence of hypnotic susceptibility was evaluated by calculating correlation coefficients for threshold changes and hypnotic susceptibility (Harvard group scale). Results: During hypnosis significantly changed somatosensory thresholds (reduced function) were observed for the following sensory detection thresholds: Cold Detection Threshold (CDT), Warm Detection Threshold (WDT), Thermal Sensory Limen (TSL) and Mechanical Detection Threshold (MDT). The only unchanged sensory detection threshold was Vibration Detection Threshold (VDT). No significant changes were observed for the determined pain detection thresholds (Cold Pain Thresholds, Heat Pain Thresholds, Mechanical Pain Sensitivity, Dynamic Mechanical Allodynia, Wind-up Ratio and Pressure Pain Threshold). No correlation of hypnotic susceptibility and threshold changes were detected. Conclusion: Hypnotic relaxation without a specific analgesic suggestion results in thermal and mechanical detection, but not pain threshold changes. We thus conclude that a relaxation suggestion has no genuine effect on sensory pain thresholds