The crew-scheduling module in the GIST system
The public transportation is gaining importance every year basically due the population growth, environmental policies and, route and street congestion. Too able an efficient management of all the resources related to public transportation, several techniques from different areas are being applied and several projects in Transportation Planning Systems, in different countries, are being developed. In this work, we present the GIST Planning Transportation Systems, a Portuguese project involving two universities and six public transportation companies. We describe in detail one of the most relevant modules of this project, the crew-scheduling module. The crew-scheduling module is based on the application of meta-heuristics, in particular GRASP, tabu search and genetic algorithm to solve the bus-driver-scheduling problem. The metaheuristics have been successfully incorporated in the GIST Planning Transportation Systems and are actually used by several companies.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Beasley, J. E., 1987. "An algorithm for set covering problem," European Journal of Operational Research, Elsevier, vol. 31(1), pages 85-93, July.
- Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
When requesting a correction, please mention this item's handle: RePEc:upf:upfgen:547. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.