Abstract
In this paper, we develop heuristic algorithms for a complex locomotive scheduling problem in freight transport that arises at Deutsche Bahn AG. While for small instances an approach based on an ILP formulation and its solution by a commercial ILP solver was rather successful, it was found that effective heuristic algorithms are needed for providing better initial upper bounds and for tackling large instances. The main contribution of this paper is the development of heuristic algorithms that strongly improve over the performance of the greedy algorithm used in the previous research efforts. The development process was done on a step-by-step basis ranging from improvements over the initial greedy construction heuristic, the development of a simple local search algorithm, the further extension to an iterated greedy procedure to the adoption of population-based stochastic local search methods. Our computational results show that the iterated greedy algorithm combined with a simple local search is a powerful algorithm for this real-world freight train scheduling problem.
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
Fügenschuh, A., Homfeld, H., Huck, A., Martin, A., Yuan, Z.: Scheduling locomotives and car transfers in freight transport (preprint), http://www.hausdorff-research-institute.uni-bonn.de/files/preprints/2006transsci.pdf (submitted to Transportation Science)
ILOG Ltd.: ILOG Cplex 10 Solver Suite. Technical report, ILOG Cplex Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA (2006)
Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177(3), 2033–2049 (2007)
Balaprakash, P., Birattari, M., Stützle, T.: Improvement strategies for the f-race algorithm: Sampling design and iterative refinement. In: Bartz-Beielstein, T., et al. (eds.) HM 2007. LNCS, vol. 4771, pp. 108–122. Springer, Berlin (2007)
Fügenschuh, A.: Parametrized Greedy Heuristics in Theory and Practice. In: Blesa, M.J., Blum, C., Roli, A., Sampels, M. (eds.) HM 2005. LNCS, vol. 3636, pp. 21–31. Springer, Heidelberg (2005)
Charon, I., Hudry, O.: The noising method: A new method for combinatorial optimization. Operations Research Letters 14(3), 133–137 (1993)
Hoos, H.H., Stützle, T.: Stochastic Local Search—Foundations and Applications. Morgan Kaufmann Publishers/Elsevier, San Francisco (2004)
Wiesemann, W., Stützle, T.: Iterated ants: An experimental study for the quadratic assignment problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 179–190. Springer, Heidelberg (2006)
Stützle, T., Hoos, H.: \(\cal MAX\)–\(\cal MIN\) Ant System and local search for combinatorial optimization problems. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 137–154. Kluwer Academic Publishers, Dordrecht (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yuan, Z., Fügenschuh, A., Homfeld, H., Balaprakash, P., Stützle, T., Schoch, M. (2008). Iterated Greedy Algorithms for a Real-World Cyclic Train Scheduling Problem. In: Blesa, M.J., et al. Hybrid Metaheuristics. HM 2008. Lecture Notes in Computer Science, vol 5296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88439-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-88439-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88438-5
Online ISBN: 978-3-540-88439-2
eBook Packages: Computer ScienceComputer Science (R0)