Abstract
In this paper a real and complex transportation problem including routing, scheduling and loading tasks is presented. Most of the related works only involve the solution of routing and scheduling, as a combination of up to five different types of VRPs (Rich VRP), leaving away the loading task, which are not enough to define more complex real-world cases. We propose a solution methodology for transportation instances that involve six types of VRPs, a new constraint that limits the number of vehicles that can be attended simultaneously and the loading tasks. They are solved using an Ant Colony System algorithm, which is a distributed metaheuristic. Results from a computational test using real-world instances show that the proposed approach outperforms the transportation planning related to manual designs. Besides a well-known VRP benchmark was solved to validate the approach.
This research was supported in part by CONACYT and DGEST.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Toth, P., Vigo, D.: The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)
Blasum, U., Hochstätter, W.: Application of the Branch and Cut Method to the Vehicle Routing Problem. Universität zu Köln, BTU Cotbus (May15, 2002)
Gambardella, L., Taillar, E., Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. Technical Report IDSIA. IDSIA-06-99. Lugano, Switzerland (1999)
Mingozzi, A., Vallet, A.: An exact Algorithm for Period and Multi-Depot Vehicle Routing Problems. Department of Mathematics, University of Bologna, Bolonga, Italy (2003)
Archetti, C., Mansini, R., Speranza, M.: The Vehicle Routing Problem with capacity 2 and 3, General Distances and Multiple Customer visits. In: ORP 2001, Paris (September 26-29, 2001)
Taillard, E., Laport, G., Gendreau, M.: Vehicle Routing Problem with Multiple Use of Vehicles. Centre de Recherche sur les transports. Publicacin CRT-95-19 (March 1995)
Taillard, E.: A Heuristic Column Generation Method For the Heterogeneous Fleet VRP. Istituto Dalle Moli di Studi sull Inteligenza Artificiale, Switzerland. CRI-96-03 (May 1996)
Psinger, D., Ropke, S.: A general Heuristic for Vehicle Routing Problems. DIKU, University of Copenhagen (February 25, 2005)
Bräysy, O.: A Reactive Variable Neighborhood Search Algorithm for the Vehicle Routing Problem with Time Windows. Working paper, SINTEF Applied Mathematics, Department of Optimization, Norway (2001)
Berger, J., Barkaoui, M., Bräysy, O.: A Parallel Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows. Working Paper, Defense Research Establishment Valcartier, Canada (2001)
Homberger, J., Gehring, H.: Two Evolutionary Meta-heuristics for the Vehicle Routing Problem with Time Windows. Infor. 37, 297–318 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cruz Reyes, L. et al. (2007). A Distributed Metaheuristic for Solving a Real-World Scheduling-Routing-Loading Problem. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds) Parallel and Distributed Processing and Applications. ISPA 2007. Lecture Notes in Computer Science, vol 4742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74742-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-74742-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74741-3
Online ISBN: 978-3-540-74742-0
eBook Packages: Computer ScienceComputer Science (R0)