(Enter summary)
Abstract: In planning urban bus operations, scheduling the drivers is the next stage after
allocating buses to the timetabled journeys to produce a set of bus workings. Driver
scheduling involves constructing a set of shifts such that every bus is always assigned
a driver; the number of shifts is minimized; and each shift obeys the agreed rules on
such matters as maximum driving time, minimum mealbreak time, and so on. The
bus driver scheduling problem can be modelled as an integer linear programming... (Update)
Context of citations to this paper: More
...have impelled us to seek alternative approaches, so that we may consistently solve larger and more complex problems. Layfield et al. [32] have used constraint programming to build several alternative sets of shifts (as sets S and T in Figure 1) covering critical periods of...
Cited by: More
Hybrid Genetic Algorithms for Scheduling Bus and Train Drivers - Wren, Kwan, Kwan (2000)
(Correct)
Active bibliography (related documents): More All
0.9: Column Generation Approaches to Bus Driver Scheduling - Fores (1996)
(Correct)
0.6: Experiences with a Flexible Driver Scheduler - Fores, Proll, Wren (2000)
(Correct)
0.4: Increasing Constraint Propagation by Redundant Modeling.. - Cheng, Choi, Lee, Wu (1999)
(Correct)
Similar documents based on text: More All
0.4: Installing an Urban Transport Scheduling System - Wren, Kwan (1998)
(Correct)
0.4: Producing Train Driver Shifts by Computer - Kwan, Kwan, Parker, Wren (1996)
(Correct)
Related documents from co-citation: More All
2: Computer-Aided Transit Scheduling (context) - Daduna, Branco et al. - 1995
2: Producing train driver schedules under differing operating strategies
- Kwan, Kwan et al. - 1999
BibTeX entry: (Update)
Layfield, C.J., Smith, B.M. and Wren, A., Bus Relief Point Selection using Constraint Programming. In Proceedings of the 1st International Conference on the Practical Applications of Constraint Technologies and Logic Programming (PACLP99), The Practical Application Company. p.537, 1999. 21 http://citeseer.ist.psu.edu/layfield98bu.html More
@misc{ layfield99bus,
author = "C. Layfield and B. Smith and A. Wren",
title = "Bus Relief Point Selection using Constraint Programming",
text = "Layfield, C.J., Smith, B.M. and Wren, A., Bus Relief Point Selection using
Constraint Programming. In Proceedings of the 1st International Conference
on the Practical Applications of Constraint Technologies and Logic Programming
(PACLP99), The Practical Application Company. p.537, 1999. 21",
year = "1999",
url = "citeseer.ist.psu.edu/layfield98bu.html" }
Citations (may not include all citations):
13
ILOG Solver reference manual -- version (context) - Solver, version - 1996
9
Experiences with a crew scheduling system based on set cover.. (context) - Wren, Smith - 1988
8
Producing train driver shifts by computer
- Kwan, Kwan et al. - 1996
4
IMPACS - a bus crew scheduling system using integer programm.. (context) - Smith - 1988
3
ILOG Solver user manual -- version (context) - Solver, version - 1996
3
Bus crew scheduling using mathematical programming (context) - Smith - 1986
3
A glossary of terms in bus and crew scheduling (context) - Hartley - 1981
2
Driver scheduling by integer linear programming - the TRACS ..
- Fores, Proll - 1998
Documents on the same site (http://www.scs.leeds.ac.uk/bms/papers.html): More
Locating the Phase Transition in Binary Constraint Satisfaction.. - Smith (1994)
(Correct)
Modelling Exceptionally Hard Constraint Satisfaction Problems - Smith, Grant (1997)
(Correct)
In Search of Exceptionally Difficult Constraint Satisfaction.. - Smith (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC