Abstract
Our problem is about a routing of a vehicle with pickup and delivery of product with time window constraints. This problem requires to be attended with large scale instances (nodes ≥ 100). A strong active time window exists (≥90%) with a large factor of amplitude (≥75%). The problem is NP-hard and for that reason the application of an exact method is limited by the computational time. We propose a hybrid methodology which offers good solutions in computational times that do useful its application.
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
M. Savelsberg (1995), Local search in routing problem with time windows, Annals of Operations Research, Rotherdam, the Netherlands, Journal of Heuristics, pp. 285–305.
M. Palmgren (2001), A column generation algorithm for the log truck scheduling problem. Department of Science and Technology, LiTH-MAT-R, Linköping University, Norrköping Sweden, pp. 3–15.
D. Applegate, P. Bixby, and V. Chvátal (1998), On the solution of traveling salesman problems, Documenta Mathematica Extra Volume ICM III, Journal der Deutschen Mathematiker-Vereinigung, pp. 645–656.
Y. Dumas, J. Desrosiers, and M. Solomon (1995), An algorithm for the traveling salesman problem with time windows. Operations Research USA, 43 (2), pp. 367–371.
J. Tsitsiklis (1992), Traveling salesman and repairman problems with TW, Networks, USA, 22, pp. 263–282.
Mitrovic, Snezana (1998), Pickup and Delivery Problem with Time Windows. In: Technical Report SFU CMPT TR 1998–12, Journées de l’optimization School of Computing Science, University, Burnaby, BC Canada, pp. 38–39.
N Ascheuer, M Fischetti, M. Grostchel, (2001), Solving ATSP with Time Windows by Branch-And-Cut. Springer-Verlag, Germany. pp. 475–506.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Fabián, J., Pérez, L. (2006). A HYBRID META-HEURISTIC FOR A ROUTING PROBLEM. In: LIU, G., TAN, V., HAN, X. (eds) Computational Methods. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-3953-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4020-3953-9_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-3952-2
Online ISBN: 978-1-4020-3953-9
eBook Packages: EngineeringEngineering (R0)