Exact Solutions to the Symmetric and Asymmetric Vehicle Routing Problem with Simultaneous Delivery and Pick-Up

Artikel

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.

Object Details

• Language: Englisch

References and Relationships

• Bibliographic citation: Journal: BuR - Business Research ; ISSN: 1866-8658 ; Volume: 6 ; Year: 2013 ; Issue: 1 ; Pages: 77-92 ; Göttingen: VHB - Verband der Hochschullehrer für Betriebswirtschaft, German Academic Association of Business Research

Classification and Topics

• Classification: Management
• Subject: mixed-integer linear programming ; reverse logistics ; simultaneous delivery and pick-up ; vehicle routing ; Tourenplanung ; Betriebliche Kreislaufwirtschaft ; Lieferkette ; Transportlogistik ; Mathematische Optimierung

Contributors, Places and Time

• Event: Geistige Schöpfung
• (who): Rieck, Julia ; Zimmermann, Jürgen
• Event: Veröffentlichung
• (who): VHB - Verband der Hochschullehrer für Betriebswirtschaft, German Academic Association of Business Research
• (where): Göttingen
• (when): 2013

Further information

• DOI: doi:10.1007/BF03342743
• Handle: http://hdl.handle.net/10419/103720
• URN: urn:nbn:de:0009-20-36470
• Last update: 10.03.2025, 11:44 AM CET