Thumbnail
Access Restriction
Open

Author Friberg, Christian ♦ Haase, Knut
Source CiteSeerX
Content type Text
Publisher Springer
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Column Generation ♦ Polyhedral Cut ♦ Internal Regulation ♦ Main Part ♦ Exact Algorithm ♦ Exact Solution ♦ Great Variety ♦ Crew Scheduling Problem ♦ Column Generation Algorithm ♦ Great Number ♦ Desired Trip ♦ Wage Agreement ♦ Set Partitioning Problem ♦ Vehicle Scheduling ♦ Clique Detection ♦ Crew Scheduling ♦ Bound Approach ♦ Urban Public Transport System ♦ Real World Aspect ♦ Continuous Relaxation
Description We present a model for the vehicle and crew scheduling problem in urban public transport systems by combining models for vehicle and crew scheduling that cover a great variety of real world aspects, especially constraints for crews resulting from wage agreements and internal regulations. The main part of the model consists of a set partitioning formulation to cover the desired trips of the schedule. Because of the great number of columns, e.g. more than 5 million for a problem with 30 trips, a column generation algorithm is implemented to use all columns implicitly for the calculation of the continuous relaxation of the set partitioning problem. The column generation algorithm is embedded in a branch and bound approach to generate an exact solution for the problem. To generate even better lower bound, polyhedral cuts basing on clique detection and a variant of the column generation algorithm that suits the cuts were tested. (Crew Scheduling, Vehicle Scheduling, Column Generation, Set ...
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1996-01-01
Publisher Institution Computer-Aided Transit Scheduling. Volume 471 of Lecture Notes in Economics and Mathematical Systems