Journal Article10.1057/PALGRAVE.JORS.2601319
A guide to vehicle routing heuristics
TL;DR: Several of the most important classical and modern heuristics for the vehicle routing problem are summarized and compared using four criteria: accuracy, speed, simplicity and flexibility.
read more
Abstract: Several of the most important classical and modern heuristics for the vehicle routing problem are summarized and compared using four criteria: accuracy, speed, simplicity and flexibility. Computational results are reported.
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
Agricultural routing planning: A narrative review of literature
Amalia Utamima,Arif Djunaidy +1 more
TL;DR: The agricultural routing planning problem (ARP) as mentioned in this paper is a subset of the vehicle routing problem (VRP) that focuses on agricultural operations and considers field and vehicle configurations, and has been studied extensively in the literature.
25
Vehicle Routing Problem Using Reinforcement Learning: Recent Advancements
01 Jan 2022
TL;DR: In this paper , the authors explore the recent advancements in solving vehicle routing problems using reinforcement learning (RL) and present the issues and challenges that emerged with the use of RL to solve the VRP variants.
24
Simulated annealing heuristic for the general share-a-ride problem
Vincent F. Yu,Sesya Sri Purwanti,Sesya Sri Purwanti,A. A. N. Perwira Redi,Chung-Cheng Lu,Suprayogi Suprayogi,Parida Jewpanya,Parida Jewpanya +7 more
TL;DR: A simulated annealing (SA) algorithm is proposed to solve the general share-a-ride problem (G-SARP), and the proposed SA algorithm outperforms basic SA and TS algorithms.
24
Experience with a framework for developing heuristics for solving rich vehicle routing problems
Ulrich Derigs,Ulrich Vogel +1 more
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.
24
Multidepot pickup and delivery problems in multiple regions: a typology and integrated model
TL;DR: This work introduces a new type of problem scenario combining various attributes: a pickup and delivery problem with multiple regions, multiple depots, and multiple transportation modes.
24
References
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
46.9K
•Book
Adaptation in natural and artificial systems
John H. Holland
- 01 Jan 1975
TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
Future paths for integer programming and links to artificial intelligence
TL;DR: Four key areas of Integer programming are examined from a framework that links the perspectives of artificial intelligence and operations research, and each has characteristics that appear usefully relevant to developments on the horizon.
4.5K
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