Open AccessPosted Content
A concise guide to existing and emerging vehicle routing problem variants.
TL;DR: This article provides a concise overview of existing and emerging problem variants of vehicle routing problems and organizes the main problem attributes within this structured framework.
read more
Abstract: Vehicle routing problems have been the focus of extensive research over the past sixty years, driven by their economic importance and their theoretical interest. The diversity of applications has motivated the study of a myriad of problem variants with different attributes. In this article, we provide a concise overview of existing and emerging problem variants. Models are typically refined along three lines: considering more relevant objectives and performance metrics, integrating vehicle routing evaluations with other tactical decisions, and capturing fine-grained yet essential aspects of modern supply chains. We organize the main problem attributes within this structured framework. We discuss recent research directions and pinpoint current shortcomings, recent successes, and emerging challenges.
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
A review of vehicle routing with simultaneous pickup and delivery
TL;DR: This paper aims to comprehensively review the existing work on the VRPSPD, surveys mathematical formulations, algorithms, variants, case studies, and industrial applications, and provides an overview of trends in the literature.
152
An efficient parallel genetic algorithm solution for vehicle routing problem in cloud implementation of the intelligent transportation systems
Mahdi Abbasi,Milad Rafiee,Mohammad Reza Khosravi,Mohammad Reza Khosravi,Alireza Jolfaei,Varun G. Menon,Javad Mokhtari Koushyar +6 more
TL;DR: A novel parallelization method of genetic algorithm (GA) solution of the Traveling Salesman Problem (TSP) is presented and the results confirm the efficiency of the proposed method for parallelizing GAs on many-core as well as on multi-core systems.
Vehicle routing and location-routing with intermediate stops: A review
Maximilian Schiffer,Michael Schneider,Grit Walther,Gilbert Laporte +3 more
- 01 Jun 2017
TL;DR: This paper reviews the literature on vehicle routing problems and location routing problems with intermediate stops and classify publications into different categories from both an application-base and a user-base basis.
90
A hyper heuristic for the green vehicle routing problem with simultaneous pickup and delivery
TL;DR: A hyper-heuristic algorithm based on iterative local search and variable neighborhood descent heuristics to effectively solve the green vehicle routing problem with simultaneous pickup and delivery is developed.
87
Pragmatic real-time logistics management with traffic IoT infrastructure: Big data predictive analytics of freight travel time for Logistics 4.0
TL;DR: A novel method to forecast travel time based on big data collected from the industrial IoT infrastructure that separates the global regression tree model based on the gradient boosting decision tree into several partitions to capture the time-varying features simultaneously.
86
References
Euclidean Hub-and-Spoke Networks
John Gunnar Carlsson,Fan Jia +1 more
TL;DR: This paper considers the problem of designing an optimal hub-and-spoke network in continuous Euclidean space: the “spokes” of the network are distributed uniformly over a service region, and the objective is to determine the optimal number of hub nodes and their locations.
28
A continuous approximation model for time definite many-to-many transportation
TL;DR: In this paper, a continuous approximation model for time definite transportation from many origins to many destinations is presented. But the model is restricted by the high levels of service to provide less circuitous routings.
27
Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints
TL;DR: An Iterated Local Search algorithm for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints is presented and results show that integrating axleWeight constraints does not lead to a large cost increase.
26
The vehicle routing problem with arrival time diversification on a multigraph
TL;DR: An adaptive large neighborhood search is introduced, which exploits piecewise-linear penalty functions for insertion evaluations, efficient local searches, and an adaptive destruction rate that leads to very significant distance savings subject to the same arrival-time diversification constraints.
26
An adaptive and diversified vehicle routing approach to reducing the security risk of cash-in-transit operations
TL;DR: An adaptive randomized bi‐objective path selection algorithm that uses the composite risk measure that is a weighted sum of two risk components in choosing alternative paths between origin‐destination pairs over a sequence of days is developed.
26