Abstract
In reverse logistics networks, products (e.g., bottles or containers) have to be transported from a depot to customer locations and, after use, from customer locations back to the depot. In order to operate economically beneficial, companies prefer a simultaneous delivery and pick-up service. The resulting Vehicle Routing Problem with Simultaneous Delivery and Pick-up (VRPSDP) is an operational problem, which has to be solved daily by many companies. We present two mixed-integer linear model formulations for the VRPSDP, namely a vehicle-flow and a commodity-flow model. In order to strengthen the models, domain-reducing preprocessing techniques, and effective cutting planes are outlined. Symmetric benchmark instances known from the literature as well as new asymmetric instances derived from real-world problems are solved to optimality using CPLEX 12.1.
Article PDF
Similar content being viewed by others
References
Ai, The Jin and Voratas Kachitvichyanukul (2009): A Particle Swarm Optimization for the Vehicle Routing Problem with Simultaneous Pickup and Delivery, Computers and Operations Research, 36 (5): 1693–1702.
Akçalγ, Elif, Sila CCetinkaya, and Halit Üster (2009): Network Design for Reverse and Closed-Loop Supply Chains: An Annotated Bibliography of Models and Solution Approaches, Networks, 53 (3): 231–248.
Angelelli, Enrico and Renata Mansini (2002): The Vehicle Routing Problem With Time Windows and Simultaneous Pick-Up and Delivery, in: Andreas Klose, Maria Gracia Speranza, and Luk N. Van Wassenhove (eds.): Quantitative Approaches to Distribution Logistics and Supply Chain Management, Springer: Berlin, 249–267.
Bianchessi, Nicola and Giovanni Righini (2007): Heuristic Algorithms for the Vehicle Routing Problem With Simultaneous Pick-Up and Delivery, Computers and Operations Research, 34 (2): 578–594.
Bostel, Nathalie, Pierre Dejax, and Zhiqiang Lu (2005): The Design, Planning, and Optimization of Reverse Logistics Networks, in: André Langevin and Diane Riopel (eds.): Logistics Systems: Design and Optimization, Springer: New York, NY, 171–212.
Chen, Jeng-Fung and Tai-Hsi Wu (2006): Vehicle Routing Problem With Simultaneous Deliveries and Pickups, Journal of the Operational Research Society, 57 (5): 579–587.
Christofides, Nicos, Aristide Mingozzi, and Paolo Toth (1979): The Vehicle Routing Problem, in: Nicos Christofides, Aristide Mingozzi, Paolo Toth, and Claudio Sandi (eds.): Combinatorial Optimization, Wiley: Chichester, UK et al., 315–338.
De Koster, René B. M., Marisa P. De Brito, and Majsa A. Van De Vendel (2002): How to Organise Return Handling: An Exploratory Study With Nine Retailer Warehouses, International Journal of Retail and Distribution Management, 30 (8): 407–421.
Dell’Amico, Mauro, Giovanni Righini, and Matteo Salani (2006): A Branch-and-Price Approach to the Vehicle Routing Problem With Simultaneous Distribution and Collection, Transportation Science, 40 (2): 235–247.
Dethloff, Jan (2001): Vehicle Routing and Reverse Logistics: The Vehicle Routing Problem With Simultaneous Delivery and Pick-Up, OR Spektrum, 23 (1): 79–96.
Fukasawa, Ricardo, Humberto Longo, Jens Lysgaard, Marcus P. De Aragao, Marcelo Reis, Eduardo Uchoa, and Renato F. Werneck (2006): Robust Branch-and-Cutand- Price for the Capacitated Vehicle Routing Problem, Mathematical Programming, 106 (3): 491–511.
Gajpal, Yuvraj and Prakash Abad (2009): An Ant Colony System (ACS) for Vehicle Routing Problem With Simultaneous Delivery and Pickup, Computers and Operations Research, 36 (12): 3215–3223.
Garey, Michael R. and David S. Johnson (1979): Computers and Intractablility: A Guide to the Theory of NP-Completeness, Freeman: San Francisco, CA et al.
Gillett, Billy E. and Leland R. Miller (1974): A Heuristic Algorithm for the Vehicle Dispatch Problem, Operations Research, 22 (2): 340–349.
Gomes Salema, Maria I., Ana P. Barbosa Póvoa, and Augusto Q. Novais (2009): A Strategic and Tactical Model for Closed-Loop Supply Chains, OR Spectrum, 31 (3): 573–599.
Gomes Salema, Maria I., Ana P. Barbosa Póvoa, and Augusto Q. Novais (2010): Simultaneous Design and Planning of Supply Chains With Reverse Flows: A Generic Modelling Framework, European Journal of Operational Research, 203 (2): 336–349.
Gu, Qiaolun and Hanhua Ji (2008): An Integrated Logistics Operational Model for Remanufacturing/ Manufacturing System Based on the Consumer Market, International Journal of Logistics Systems and Management, 4 (1): 21–39.
Halse, Karsten (1990): Vehicle Routing Problem With Simultaneous Delivery and Pick-Up Points, Technical Report No. 4/90, Technical University of Denmark, Lingby.
Homberger, Jörg and Hermann Gehring (2002): Parallelization of a Two-Phase Metaheuristic for Routing Problems With Time Windows, Journal of Heuristics, 8 (3): 251–276.
Irnich, Stefan (2008): Resource Extension Functions: Properties, Inversion, and Generalization to Segments, OR Spectrum, 30 (1): 113–148.
Lysgaard, Jens (2003): CVRPSEP: A package of Separation Routines for the Capacitated Vehicle Routing Problem, Working Paper, University of Aarhus.
Min, Hokey (1989): The Multiple Vehicle Routing Problem With Simultaneous Delivery and Pick-up Points, Transportation Research Part A, 23A (5): 377–386.
Mitra, Subrata (2005): An Algorithm for the Generalized Vehicle Routing Problem With Backhauling, Asia-Pacific Journal of Operational Research, 22 (2): 153–169.
Montané, Fermín Alfredo T. and Roberto D. Galvão (2006): A Tabu Search Algorithm for the Vehicle Routing Problem With Simultaneous Pick-Up and Delivery Service, Computers and Operations Research, 33 (3): 595–619.
Nagy, Gábor and Saïd Salhi (2005): Heuristic Algorithms for Single and Multiple Depot Vehicle Routing Problems With Pickups and Deliveries, European Journal of Operational Research, 162 (1): 126–141.
Parragh, Sophie N., Karl F. Doerner, and Richard F. Hartl (2008): A Survey on Pickup and Delivery Problems, Part I: Transportation Between Customers and Depot, Journal für Betriebswirtschaft, 58 (1): 21–51.
Privé, Julie, Jacques Renaud, Fayez Boctor, and Gilbert Laporte (2006): Solving a Vehicle-Routing Problem Arising in Soft-Drink Distribution, Journal of the Operational Research Society, 57 (9): 1045–1052.
Rieck, Julia and Jürgen Zimmermann (2009): A Hybrid Algorithm for Vehicle Routing of Less-Than-Truckload Carriers, in: Martin J. Geiger, Walter Habenicht, Marc Sevaux, and Kenneth Sörensen (eds.): Metaheuristics in the Service Industry, Springer: Berlin, 155–171.
Ryan, David M., Curt Hjorring, and Fred Glover (1993): Extensions of the Petal Method for Vehicle Routeing, Journal of the Operational Research Society, 44 (3): 289–296.
Salhi, Saïd and Gábor Nagy (1999): A Cluster Insertion Heuristic for Single and Multiple Depot Vehicle Routing Problems With Backhauling, Journal of the Operational Research Society, 50 (10): 1035–1042.
Sheu, Jiuh-Biing, Yi-Hwa Chou, and Chun-Chia Hu (2005): An Integrated Logistics Operational Model for Green-Supply Chain Management, Transportation Research Part E, 41 (4): 287–313.
Solomon, Marius M. (1987): Algorithms for the Vehicle Routing and Scheduling Problem With Time Window Constraints, Operations Research, 35 (2): 254–265.
Subramanian, Anand, Lúcia M. A. Drummond, Cristiana Bentes, Luiz S. Ochi, and Ricardo Farias (2010): A Parallel Heuristic for the Vehicle Routing Problem With Simultaneous Pickup and Delivery, Computers and Operations Research, 37 (11): 1899–1911.
Subramanian, Anand, Eduardo Uchoa, and Luiz S. Ochi (2010): New Lower Bounds for the Vehicle Routing Problem With Simultaneous Pickup and Delivery, in: Paola Festa (ed.): Experimental Algorithms, Springer: Berlin, 276–287.
Subramanian, Anand, Eduardo Uchoa, Artur A. Pessoa, and Luiz S. Ochi (2011): Branch-and-Cut With Lazy Separation for the Vehicle Routing Problem With Simultaneous Pickup and Delivery, Operations Research Letters, 39 (5): 338–341.
Toth, Paolo and Daniele Vigo (2002): An Overview of Vehicle Routing Problems, in: Paolo Toth and Daniele Vigo (eds.): The Vehicle Routing Problem, SIAM: Philadelphia, PA, 1–26.
Wassan, Niaz A., Abdul H. Wassan, and Gábor Nagy (2008): A Reactive Tabu Search Algorithm for the Vehicle Routing Problem With Simultaneous Pick-Ups and Deliveries, Journal of Combinatorial Optimization, 15 (4): 368–386.
Zachariadis, Emmanouil E., Christos D. Tarantilis, and Chris T. Kiranoudis (2009): A Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem With Simultaneous Delivery and Pick-Up Service, Expert Systems With Applications, 36 (2): 1070–1081.
Zachariadis, Emmanouil E., Christos D. Tarantilis, and Chris T. Kiranoudis (2010): An Adaptive Memory Methodology for the Vehicle Routing Problem With Simultaneous Pick-Ups and Deliveries, European Journal of Operational Research, 202 (2): 401–411.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Rieck, J., Zimmermann, J. Exact Solutions to the Symmetric and Asymmetric Vehicle Routing Problem with Simultaneous Delivery and Pick-Up. Bus Res 6, 77–92 (2013). https://doi.org/10.1007/BF03342743
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03342743