Ademir Aparecido Constantino
Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm
Constantino, Ademir Aparecido; de Mendonca, Candido F.X.; de Araujo, Silvio Alexandre; Landa-Silva, Dario; Calvi, Rogerio; dos Santos, Allainclair Flausino
Authors
Candido F.X. de Mendonca
Silvio Alexandre de Araujo
Professor DARIO LANDA SILVA DARIO.LANDASILVA@NOTTINGHAM.AC.UK
PROFESSOR OF COMPUTATIONAL OPTIMISATION
Rogerio Calvi
Allainclair Flausino dos Santos
Abstract
The bus driver scheduling problem (BDSP) under study consists in finding a set of duties that covers the bus schedule from a Brazilian public transportation bus company with the objective of minimizing the total cost. A deterministic 2-phase heuristic algorithm is proposed using multiple assignment problems that arise from a model based on a weighted multipartite graph. In the first phase, the algorithm constructs an initial feasible solution by solving a number of assignment problems. In the second phase, the algorithm attempts to improve the solution by two different procedures. One procedure takes the whole set of duties and divides them in a set of partial duties which are recombined. The other procedure seeks to improve single long duties by eliminating the overtime time and inserting it into another duty. Computational tests are performed using large-scale real-world data with more than 2,300 tasks and random instances extracted from real data. Three different objective functions are analyzed. The overall results indicate that the proposed approach is competitive to solve large BDSP.
Citation
Constantino, A. A., de Mendonca, C. F., de Araujo, S. A., Landa-Silva, D., Calvi, R., & dos Santos, A. F. (2017). Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm. Journal of Universal Computer Science, 23(5),
Journal Article Type | Article |
---|---|
Acceptance Date | Apr 23, 2017 |
Publication Date | May 28, 2017 |
Deposit Date | Aug 10, 2017 |
Publicly Available Date | Aug 10, 2017 |
Journal | Journal of Universal Computer Science |
Print ISSN | 0948-695X |
Electronic ISSN | 0948-6968 |
Publisher | Graz University of Technology, Institut für Informationssysteme und Computer Medien |
Peer Reviewed | Peer Reviewed |
Volume | 23 |
Issue | 5 |
Keywords | bus driver scheduling, crew management, heuristic, large real-world instances, transportation |
Public URL | https://nottingham-repository.worktribe.com/output/862152 |
Publisher URL | http://www.jucs.org/jucs_23_5/solving_a_large_real |
Contract Date | Aug 10, 2017 |
Files
dls_jucs2017.pdf
(209 Kb)
PDF
Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf
You might also like
Local-global methods for generalised solar irradiance forecasting
(2024)
Journal Article
UAV Path Planning for Area Coverage and Energy Consumption in Oil and Gas Exploration Environment
(2023)
Presentation / Conference Contribution
Towards Blockchain-based Ride-sharing Systems
(2021)
Presentation / Conference Contribution
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: discovery-access-systems@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search