Abstract
The Labour Scheduling problem in the context of any transport company is a complex optimization problem of that belongs to the class of NP-Hard problems. In these cases, it is not viable to try to find an exact solution and therefore, they require methods that assure the optimal management of the available resources in the tracing of the work calendars under the most suitable criteria of economy of times and costs. The main purpose of this research is to propose an efficient method to determine optimal shifts in a generic transport company, using bio-inspired methods. This method employs a two-step approach to obtain a solution. In a first stage, a Grasp algorithm is used to generate a viable solution. Then in a second stage, this preliminary solution is tuned, in order to obtain an optimal one, by using a Scatter Search algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brusco, M.J., Jacobs, L.W.: Personnel tour scheduling when starting time restrictions are present. Management Science 44, 534–547 (1998)
Rezanov, N., Ryan, D.: The train driver recovery problem. A set partitioning based model and solution method. Computers & Operations Research 37(5), 845–856 (2010)
Tang, J., Zhang, J., Pan, Z.: A Scatter Search Algorithm for solving vehicle routing problem with loading cost. Expert Systems with Applications 37(6), 4073–4083 (2010)
Portugal, R., Ramalhingo-Lourenco, H., Paixao, J.P.: Driver Scheduling Problem Modelling. Public Transp. 1, 103–120 (2009)
Ramalhingo-Lourenco, H.: The Crew-Scheduling Module in the GIST System. UPF Economics Working Paper No. 547 (2001)
Carraresi, P., Gallo, G., Rousseau, J.M.: Relaxation approaches to large scale bus driver scheduling problems. Transportation Research Part B: Methodological 16(5), 383–397 (1982)
Mesquita, M., Paias, A.: Set Partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem. Computers & Operations Research 35(5), 1562–1575 (2008)
Abbink, E.J.W.: Solving large scale crew scheduling problems by using iterative partitioning. In: 7th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2007 (2007)
Laurent, B., Hao, J.-K.: Simultaneous Vehicle and Crew Scheduling for Extra Urban Transports. Computers & Industrial Engineering 53(3), 542–558 (2007)
Ramalhingo-Lourenco, H., Portugal, R.: Metaheuristics for The Bus-Driver Scheduling Problem. Economic Working Papers Series, vol. 304. Universitat Pompeu Fabra (1998)
Abbink, E.J.W., et al.: Solving Large Scale Crew Scheduling Problems in Practice. Research Paper. Report/Econometric Institute, Erasmus University Rotterdam, pp. 1-19. Erasmus School of Economics (ESE). This publication is part of collection Econometric Institute Research Papers Published by Econometric Institute (2010)
Kwan, R., Kwan, A.: ASK Effective search space control for large and/or complex driver scheduling problems. Annals of Operations Research 155(1), 417–435 (2007)
Tavakkoli-Moghaddam, R., Makui, A., Mazloomi, Z.: A new integrated mathematical model for a bi-objective scatter search algorithm. Journal of Manufacturing Systems 29(2-3), 111–119 (2010)
De Leone, R., Festa, P., Marchitto, E.: The Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution. Tech. Rep. 22, University of Napoli, Federico II (2006)
Danzing, G.B.: A Comment on Edieś ‘Traffic Delays at Toll Boothś. Operations Research 2(3), 339–341 (1954)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)
Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133 (1995)
Glover, F., Laguna, M., Martí, R.: Scatter Search. In Advances in Evolutionary Computation: Theory and Applications, pp. 519–537. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vaquerizo, M.B., Baruque, B., Corchado, E. (2012). Combining Metaheuristic Algorithms to Solve a Scheduling Problem. In: Corchado, E., Snášel, V., Abraham, A., Woźniak, M., Graña, M., Cho, SB. (eds) Hybrid Artificial Intelligent Systems. HAIS 2012. Lecture Notes in Computer Science(), vol 7209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28931-6_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-28931-6_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28930-9
Online ISBN: 978-3-642-28931-6
eBook Packages: Computer ScienceComputer Science (R0)