Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/103720
Authors: 
Rieck, Julia
Zimmermann, Jürgen
Year of Publication: 
2013
Citation: 
[Journal:] BuR - Business Research [ISSN:] 1866-8658 [Volume:] 6 [Year:] 2013 [Issue:] 1 [Pages:] 77-92
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.
Subjects: 
mixed-integer linear programming
reverse logistics
simultaneous delivery and pick-up
vehicle routing
Persistent Identifier of the first edition: 
Document Type: 
Article

Files in This Item:
File
Size
346.32 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.