Abstract
In this paper we consider the problem of a single depot distribution/collection system servicing a set of customers by means of a homogeneous fleet of vehicles. Each customer requires the simultaneous delivery and pick-up of products to be carried out by the same vehicle within a given time window. Products to be delivered are loaded at the depot and picked-up products are transported back to the depot. The objective is to minimize the overall distance traveled by the vehicles while servicing all the customers. To the best of our knowledge no exact algorithms have been introduced for this problem. We implement a Branch and Price approach based on a set covering formulation for the master problem. A relaxation of the elementary shortest path problem with time windows and capacity constraints is used as pricing problem. Branch and Bound is applied to obtain integer solutions. Known benchmark instances for the VRP with time windows have been properly modified to be used for the experimental analysis.
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
Desrochers M., Desrosiers J., Solomon M. (1992): A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40(2), 342–354.
Desrochers M., Soumis F. (1988): A reoptimization algorithm for the Shortest Path Problem with Time Windows. European Journal of Operational Research, 35, 242–254.
Desrochers M., Soumis F. (1988): A generalized permament labeling algorithm for the Shortest Path Problem with Time Windows. INFOR 26 193–214.
Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F. (1995): Time constrained routing and scheduling. M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (eds.). Networks Routing, Handbooks in Operations Research and Management Science 8, North-Holland, Amsterdam, 35–139.
Dror M. (1994): Note on the complexity of the shortest path models for column generation in VRPTW, Operations Research 42(5) 977–978.
Dumas Y., Desrosiers J. e Soumis F. (1991): The Pickup and Delivery Problem with Time Windows. European Journal of Operational Research 54, 7–22.
Gelinas S., Desrochers M., Desrosiers J., Solomon M.M. (1995): A new branching strategy for time constrained routing problems with application to backhauling. Annals of Operations Research 61, 91–109.
Halse K. (1992): Modeling and solving complex vehicle routing problems. PhD Thesis no.60, IMSOR, The Technical University of Denmark.
Houck D.J., Picar, J.C., Queyranne and Vemuganti R.R., (1980): The Travelling Salesman Problem as a Constrained Shortest Path Problem: Theory and Computational Experience, Opsearch, 17, 93–109.
Kohl N., Madsen O. (1997): An optimization algorithm for the Vehicle Routing Problem with Time Windows based on Lagrangian Relaxation, Operations Research, 45(3), 395–406.
Kohl N., Desrosiers J., Madsen O., Solomon M., Soumis F. (1999): 2-path Cuts for the Vehicle Routing Problem with Time Windows, Transportation Science, 33(1), 101–116.
Miller C., Tucker A. and Zemlin R. (1960): Integer programming formulation and travelling salesman problems. Journal of ACM 7, 326–329.
Mingozzi A., Baldacci R., Giorgi S. (1999): An exact method for the Vehicle Routing Problem with Backhauls, Transportation Science 33(3), 315–329.
Sol M., Savelsbergh M.W.P. (1995): A Branch and Price Algorithm for the Pickup and Delivery Problem with Time Windows. Report of Computational Optimization Center, Georgia Institute of Technology, Atlanta, Georgia.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angelelli, E., Mansini, R. (2002). The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery. In: Klose, A., Speranza, M.G., Van Wassenhove, L.N. (eds) Quantitative Approaches to Distribution Logistics and Supply Chain Management. Lecture Notes in Economics and Mathematical Systems, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56183-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-56183-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43690-4
Online ISBN: 978-3-642-56183-2
eBook Packages: Springer Book Archive