Scheduling train crews: a case study for the Dutch Railways

In this paper the problem of scheduling train crew is considered. We discuss a general framework of which the method for solving the train crew scheduling problem is a special case. In particular, our method is a heuristic branch-and-price algorithm suitable for large scale crew scheduling problems. This algorithm is applied to a real life train guard scheduling problem which is provided to us by the Dutch Railways. Computational results show that our algorithm is capable of getting sub-optimal solutions for a large scale instance within reasonable computation time

A decision support system for crew planning in passenger transportation using a flexible branch-and-price algorithm

This paper discusses a decision support system for airline and railway crew planning. The system is a state-of-the-art branch-and-price solver that is used for crew scheduling and crew rostering. We briefly discuss the mathematical background of the solver, of which most part is covered in the Operations Research literature. Crew scheduling is crew planning for one or a few days that results in crew duties or pairings, and crew rostering is crew planning for at least one week for individual crew members. Technical issues about the system and its implementation are covered in more detail, as well as several applications. In particular, we focus on

A Comparison of Optimization Methods for Solving the Depot Matching and Parking Problem

We consider the Train Unit Shunting Problem, an important plan- ning problem for passenger railway operators. This problem entails assigning physical train units to scheduled train services in such a way that the resulting shunting yard operations are feasible. As such, it arises at every shunting yard in the railway network and involves matching train units to arriving and departing train services as well as assigning the selected matchings to appropriate shunting yard tracks. We present a comparison benchmark of multiple solution approaches for this problem. In particular, we have developed a Constraint Pro- gramming formulation, a Column Generation approach, and a random- ized greedy heuristic. We compare and benchmark these approaches against slightly adjusted existing methods based on a a Mixed Inte- ger Linear Program, and a Two-Stage heuristic. The benchmark con- tains multiple real-life instances provided by the Danish State Rail- ways (DSB) and Netherlands Railways (NS). The results highlight the strengths and weaknesses of the considered approaches

Determination of two-body potentials from n-body spectra

We show how the two-body potential may be uniquely determined from n-body spectra where the hypercentral approximation is valid. We illustrate this by considering an harmonic oscillator potential which has been altered by changing the energy or normalisation constant of the ground state of the n-body system and finding how this modifies the two-body potential. It is shown that with increasing number of particles the spectrum must be known more precisely to obtain the two-body potential to the same degree of accuracy.Comment: 13 pages of text (LATEX), 3 figures (not included, available from authors), NIKHEF-93-P

Shunting of Passenger Train Units in a Railway Station

In this paper we introduce the problem of shunting passenger train units in a railway station. Shunting occurs whenever train units are temporarily not necessary to operate a given timetable. We discuss several aspects of this problem and focus on two subproblems. We propose mathematical models for these subproblems together with a solution method based on column generation. Furthermore, a new efficient and speedy solution technique for pricing problems in column generation algorithms is introduced. Finally, we present computational results based on real life instances from Netherlands Railways

Bone tissue engineering

Medical advances have led to a welcome increase in life expectancy. However, accompanying longevity introduces new challenges: increases in age-related diseases and associated reductions in quality of life. The loss of skeletal tissue that can accompany trauma, injury, disease or advancing years can result in significant morbidity and significant socio-economic cost and emphasise the need for new, more reliable skeletal regeneration strategies. To address the unmet need for bone augmentation, tissue engineering and regenerative medicine have come to the fore in recent years with new approaches for de novo skeletal tissue formation. Typically, these approaches seek to harness stem cells, innovative scaffolds and biological factors that promise enhanced and more reliable bone formation strategies to improve the quality of life for many. This review provides an overview of recent developments in bone tissue engineering focusing on skeletal stem cells, vascular development, bone formation and the translation from preclinical in vivo models to clinical delivery

Extraction of the D13(1520) photon-decay couplings from pion- and eta-photoproduction data

We compare results for the D13(1520) photon-decay amplitudes determined in analyses of eta- and pion-photoproduction data. The ratio of helicity amplitudes (A_3/2 / A_1/2), determined from eta-photoproduction data, is quite different from that determined in previous analyses of pion-photoproduction data. We consider how strongly the existing pion-photoproduction data constrain both this ratio and the individual photon-decay amplitudes.Comment: 7 pages, 2 figure

Reference Genome Assembly for Australian Ascochyta rabiei Isolate ArME14

Copyright © 2020 Mohd Shah et al. Ascochyta rabiei is the causal organism of ascochyta blight of chickpea and is present in chickpea crops worldwide. Here we report the release of a high-quality PacBio genome assembly for the Australian A. rabiei isolate ArME14. We compare the ArME14 genome assembly with an Illumina assembly for Indian A. rabiei isolate, ArD2. The ArME14 assembly has gapless sequences for nine chromosomes with telomere sequences at both ends and 13 large contig sequences that extend to one telomere. The total length of the ArME14 assembly was 40,927,385 bp, which was 6.26 Mb longer than the ArD2 assembly. Division of the genome by OcculterCut into GC-balanced and AT-dominant segments reveals 21% of the genome contains gene-sparse, AT-rich isochores. Transposable elements and repetitive DNA sequences in the ArME14 assembly made up 15% of the genome. A total of 11,257 protein-coding genes were predicted compared with 10,596 for ArD2. Many of the predicted genes missing from the ArD2 assembly were in genomic regions adjacent to AT-rich sequence. We compared the complement of predicted transcription factors and secreted proteins for the two A. rabiei genome assemblies and found that the isolates contain almost the same set of proteins. The small number of differences could represent real differences in the gene complement between isolates or possibly result from the different sequencing methods used. Prediction pipelines were applied for carbohydrate-active enzymes, secondary metabolite clusters and putative protein effectors. We predict that ArME14 contains between 450 and 650 CAZymes, 39 putative protein effectors and 26 secondary metabolite clusters

Solution Approaches for Vehicle and Crew Scheduling with Electric Buses

The use of electric buses is expected to rise due to its environmental benefits. However, electric vehicles are less exible than conventional diesel buses due to their limited driving range and longer recharging times. Therefore, scheduling electric vehicles adds further operational dificulties. Additionally, various labor regulations challenge public transport companies to find a cost-effcient crew schedule. Vehicle and crew scheduling problems essentially define the cost of operations. In practice, these two problems are often solved sequentially. In this paper, we introduce the integrated electric vehicle and crew scheduling problem (E-VCSP). Given a set of timetabled trips and recharging stations, the E-VCSP is concerned with finding vehicle and crew schedules that cover the timetabled trips and satisfy operational constraints, such as limited driving range of electric vehicles and labor regulations for the crew while minimizing total operational cost. An adaptive large neighborhood search that utilizes branch-and-price heuristics is proposed to tackle the E-VCSP. The proposed method is tested on real-life instances from public transport companies in Denmark and Sweden that contain up to 1,109 timetabled trips. The heuristic approach provides evidence of improving efficiency of transport systems when the electric vehicle and crew scheduling aspects are considered simultaneously. By comparing to the traditional sequential approach, the heuristic finds improvements in the range of 1.17-4.37% on average. A sensitivity analysis of the electric bus technology is carried out to indicate its implications for the crew schedule and the total operational cost. The analysis shows that the operational cost decreases with increasing driving range (120 to 250 kilometers) of electric vehicles