Comparison of heuristic approaches for the multiple depot vehicle scheduling problem

Given a set of timetabled tasks, the multi-depot vehicle scheduling problemis a well-known problem that consists of determining least-cost schedulesfor vehicles assigned to several depots such that each task is accomplishedexactly once by a vehicle. In this paper, we propose to compare theperformance of five different heuristic approaches for this problem,namely, a heuristic \\mip solver, a Lagrangian heuristic, a columngeneration heuristic, a large neighborhood search heuristic using columngeneration for neighborhood evaluation, and a tabu search heuristic. Thefirst three methods are adaptations of existing methods, while the last twoare novel approaches for this problem. Computational results on randomlygenerated instances show that the column generation heuristic performs thebest when enough computational time is available and stability is required,while the large neighborhood search method is the best alternative whenlooking for a compromise between computational time and solution quality.tabu search;column generation;vehicle scheduling;heuristics;Lagrangian heuristic;large neighborhood search;multiple depot

Column generation with dynamic duty selection for railway crew rescheduling

The Dutch railway network experiences about three large disruptions per day on average. In this paper, we present an algorithm to reschedule the crews when such a disruption occurs. The algorithm is based on column generation techniques combined with Lagrangian heuristics. Since the number of duties is very large in practical instances, we first define a core problem of tractable size. If some tasks remain uncovered in the solution of the core problem, we perform a neighborhood exploration to improve the solution. Computational experiments with real-life instances show that our method is capable of producing good solutions within a couple of minutes of Computation time

Comparison of heuristic approaches for the multiple depot vehicle scheduling problem

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a well-known problem that consists of determining least-cost schedules for vehicles assigned to several depots such that each task is accomplished exactly once by a vehicle. In this paper, we propose to compare the performance of five different heuristic approaches for this problem, namely, a heuristic \\mip solver, a Lagrangian heuristic, a column generation heuristic, a large neighborhood search heuristic using column generation for neighborhood evaluation, and a tabu search heuristic. The first three methods are adaptations of existing methods, while the last two are novel approaches for this problem. Computational results on randomly generated instances show that the column generation heuristic performs the best when enough computational time is available and stability is required, while the large neighborhood search method is the best alternative when looking for a compromise between computational time and solution quality

Workforce scheduling and routing problems: literature survey and computational study

In the context of workforce scheduling, there are many scenarios in which personnel must carry out tasks at different locations hence requiring some form of transportation. Examples of these type of scenarios include nurses visiting patients at home, technicians carrying out repairs at customers’ locations and security guards performing rounds at different premises, etc. We refer to these scenarios as workforce scheduling and routing problems (WSRP) as they usually involve the scheduling of personnel combined with some form of routing in order to ensure that employees arrive on time at the locations where tasks need to be performed. The first part of this paper presents a survey which attempts to identify the common features of WSRP scenarios and the solution methods applied when tackling these problems. The second part of the paper presents a study on the computational difficulty of solving these type of problems. For this, five data sets are gathered from the literature and some adaptations are made in order to incorporate the key features that our survey identifies as commonly arising in WSRP scenarios. The computational study provides an insight into the structure of the adapted test instances, an insight into the effect that problem features have when solving the instances using mathematical programming, and some benchmark computation times using the Gurobi solver running on a standard personal computer

Binding of aminoglycoside antibiotics to helix 69 of 23S rRNA

Aminoglycosides antibiotics negate dissociation and recycling of the bacterial ribosome’s subunits by binding to Helix 69 (H69) of 23S rRNA. The differential binding of various aminoglycosides to the chemically synthesized terminal domains of the Escherichia coli and human H69 has been characterized using spectroscopy, calorimetry and NMR. The unmodified E. coli H69 hairpin exhibited a significantly higher affinity for neomycin B and tobramycin than for paromomycin (Kds = 0.3 ± 0.1, 0.2 ± 0.2 and 5.4 ± 1.1 µM, respectively). The binding of streptomycin was too weak to assess. In contrast to the E. coli H69, the human 28S rRNA H69 had a considerable decrease in affinity for the antibiotics, an important validation of the bacterial target. The three conserved pseudouridine modifications (Ψ1911, Ψ1915, Ψ1917) occurring in the loop of the E. coli H69 affected the dissociation constant, but not the stoichiometry for the binding of paromomycin (Kd = 2.6 ± 0.1 µM). G1906 and G1921, observed by NMR spectrometry, figured predominantly in the aminoglycoside binding to H69. The higher affinity of the E. coli H69 for neomycin B and tobramycin, as compared to paromomycin and streptomycin, indicates differences in the efficacy of the aminoglycosides

Reparameterization of RNA χ Torsion Parameters for the AMBER Force Field and Comparison to NMR Spectra for Cytidine and Uridine

A reparameterization of the torsional parameters for the glycosidic dihedral angle, χ, for the AMBER99 force field in RNA nucleosides is used to provide a modified force field, AMBER99χ. Molecular dynamics simulations of cytidine, uridine, adenosine, and guanosine in aqueous solution using the AMBER99 and AMBER99χ force fields are compared with NMR results. For each nucleoside and force field, 10 individual molecular dynamics simulations of 30 ns each were run. For cytidine with AMBER99χ force field, each molecular dynamics simulation time was extended to 120 ns for convergence purposes. Nuclear magnetic resonance (NMR) spectroscopy, including one-dimensional (1D) 1H, steady-state 1D 1H nuclear Overhauser effect (NOE), and transient 1D 1H NOE, was used to determine the sugar puckering and preferred base orientation with respect to the ribose of cytidine and uridine. The AMBER99 force field overestimates the population of syn conformations of the base orientation and of C2′-endo sugar puckering of the pyrimidines, while the AMBER99χ force field’s predictions are more consistent with NMR results. Moreover, the AMBER99 force field prefers high anti conformations with glycosidic dihedral angles around 310° for the base orientation of purines. The AMBER99χ force field prefers anti conformations around 185°, which is more consistent with the quantum mechanical calculations and known 3D structures of folded ribonucleic acids (RNAs). Evidently, the AMBER99χ force field predicts the structural characteristics of ribonucleosides better than the AMBER99 force field and should improve structural and thermodynamic predictions of RNA structures