TITLE

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

AUTHOR(S)
Rieck, Julia; Zimmermann, Jürgen
PUB. DATE
May 2013
SOURCE
Business Research;May2013, Vol. 6 Issue 1, p77
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
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.
ACCESSION #
91271751

 

Related Articles

  • Sweep Algorithm and Mixed Integer Linear Program for Vehicle Routing Problem with Time Windows. Savitri, H.; Kurniawati, D. A. // Journal of Advanced Manufacturing Systems;Dec2018, Vol. 17 Issue 4, p505 

    CV. Jogja Transport is a company that distribute cakes "Sari Roti" in Yogyakarta, Indonesia. It has responsibility to distribute the cakes for every customer during the customers' time windows. The distribution problem of CV. Jogja Transport belongs to Vehicle Routing Problem with Time Window...

  • Evolutionary Algorithms for Vehicle Routing. Potvin, Jean-Yves // INFORMS Journal on Computing;Fall2009, Vol. 21 Issue 4, p518 

    This paper is a survey of the literature on applications of evolutionary algorithms for vehicle routing problems. It reports on genetic algorithms, evolution strategies, and particle swarm optimization when applied to the classical capacitated vehicle routing problem and many of its variants....

  • A Firework Algorithm for Solving Capacitated Vehicle Routing Problem. Abdulmajeed, Noora Hani; Ayob, Masri // International Journal of Advancements in Computing Technology;Jan2014, Vol. 6 Issue 1, p79 

    The capacitated vehicle routing problem (CVRP) is a combinatorial optimization problem that is very hard to solve for optimality. In CVRP, a set of vehicles of the same capacity located at a central depot need to be routed to serve a set of customers with known demands. This work presents a...

  • Time-dependent and bi-objective vehicle routing problem with time windows. Zhao, P. X.; Luo, W. H.; Han, X. // Advances in Production Engineering & Management;Jun2019, Vol. 14 Issue 2, p1 

    The optimization of bi-objective vehicle routing problem has become a research hotspot in recent years. In this paper, a time-dependent and biobjective vehicle routing problem with time windows (TD-BO-VRPTW) is proposed, which is a new extension of classical vehicle routing problem....

  • Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems. Muter, İbrahim; Birbil, Ş. İlker; ŞŞSahin, Güvenç // INFORMS Journal on Computing;Fall2010, Vol. 22 Issue 4, p603 

    No abstract available.

  • Parallel Methods of Solving of Supply Problem Using Ant Colony Optimization. Piecka, Stanislav // Information Sciences & Technologies: Bulletin of the ACM Slovaki;Mar2013, Vol. 5 Issue 1, p1 

    Presented work focuses on solving of the vehicle routing problem, which is considered as a basic supply problem. The main motivation is to achieve high quality solutions of the vehicle routing problem in the shortest possible time. It tries to achieve this goal via parallelization of the ant...

  • Erratum to: A hybrid genetic algorithm for the multi-depot open vehicle routing problem. Liu, Ran; Jiang, Zhibin; Geng, Na // OR Spectrum;Mar2014, Vol. 36 Issue 2, p423 

    No abstract available.

  • Experience with a framework for developing heuristics for solving rich vehicle routing problems. Derigs, Ulrich; Vogel, Ulrich // Journal of Heuristics;Feb2014, Vol. 20 Issue 1, p75 

    According to Cordeau et al. (J Oper Res Soc 53(5):512-522, ) a good VRP heuristic should fulfill four criteria: accuracy, speed, simplicity, and flexibility. In this paper we report experience with a heuristic framework for solving rich vehicle routing problems (RVRP), which is based on rather...

  • An Evolutionary Algorithm Based on Repeated Mutations for Solving the Capacitated Vehicle Routing Problem. Puljić, Krunoslav // Journal of Computing & Information Technology;Mar2012, Vol. 20 Issue 1, p51 

    An evolutionary algorithm for solving the capacitated vehicle routing problem is described. The algorithm employs repeated mutations in a manner similar to local search. Experiments are presented, where the algorithm has been implemented and tested on some benchmark problem instances.

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics