Journal Article10.1007/S10732-013-9232-Z
Experience with a framework for developing heuristics for solving rich vehicle routing problems
Ulrich Derigs,Ulrich Vogel +1 more
24
TL;DR: This computational study on five RVRP reveals that the heuristic approach is rather robust with respect to parameterization and that the solvers which have been customized from the framework can compete with state-of-the-art special purpose developments.
read more
Abstract: According to Cordeau et al. (J Oper Res Soc 53(5):512---522, 2002) 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 simple heuristics. This heuristic framework has been implemented as flexible software framework. The user-friendly design enables flexible customization of problem-specific solvers. Our computational study on five RVRP reveals that the heuristic approach is rather robust with respect to parameterization and that the solvers which have been customized from the framework can compete with state-of-the-art special purpose developments.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Rich vehicle routing problems: From a taxonomy to a definition
TL;DR: The purpose of the paper is to provide a comprehensive and relevant taxonomy for the RVRP literature and to propose an elaborate definition of RVRPs.
299
Truck and trailer routing-Problems, heuristics and computational experience
TL;DR: A simple and flexible hybrid approach which is based on local search and large neighborhood search as well as standard metaheuristic control strategies is presented which can compete with complex state-of-the-art approaches with respect to speed and accuracy on the TTRP.
123
Rich vehicle routing with auxiliary depots and anticipated deliveries: An application to pharmaceutical distribution
TL;DR: A multi-start iterated local search algorithm making use of several neighborhoods is proposed to solve a rich vehicle routing problem based on a practical distribution problem faced by a third-party logistics provider, whose aim is to deliver pharmaceutical products to healthcare facilities in Tuscany.
A Hybrid Heuristic for a Broad Class of Vehicle Routing Problems with Heterogeneous Fleet
TL;DR: A hybrid metaheuristic which combines an iterated local search with variable neighborhood descent, for solution improvement, and a set partitioning formulation, to exploit the memory of the past search is proposed, which produces high quality solutions with low standard deviation in comparison with previous methods.
44
A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems
TL;DR: A unified heuristic algorithm for a large class of earliness–tardiness (E–T) scheduling problems that is capable of producing high-quality solutions when compared to the best ones available in the literature that were obtained by specific methods is proposed.
43
References
Tabu Search—Part II
TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
6.1K
The vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
- 01 Jan 2001
TL;DR: In this paper, the authors present a comprehensive overview of the most important techniques proposed for the solution of hard combinatorial problems in the area of vehicle routing problems, focusing on a specific family of problems.
4.2K
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
G. Clarke,J. W. Wright +1 more
TL;DR: An iterative procedure is developed that enables the rapid selection of an optimum or near-optimum route and has been programmed for a digital computer but is also suitable for hand computation.
4.1K
Algorithms for the vehicle routing and scheduling problems with time window constraints
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
3.7K
The Truck Dispatching Problem
George B. Dantzig,J. H. Ramser +1 more
TL;DR: A procedure based on a linear programming formulation is given for obtaining a near optimal solution to the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal.
3.7K