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
Workforce routing and scheduling for electricity network maintenance with downtime minimization
Asvin Goel,Frank Meisel +1 more
TL;DR: A Large Neighborhood Search meta-heuristic with mathematical programming techniques is combined with network data derived from network data of a German electricity provider to solve a combined routing and scheduling problem for the maintenance of electricity networks.
63
An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
TL;DR: The Integer L-shaped algorithm is adapted to solve the VRPSD in a branch-and-cut framework and several lower bounding schemes are developed to approximate the expected recourse cost.
62
Timing problems and algorithms: Time decisions for sequences of activities
TL;DR: A classification of timing problems and features are introduced, as well as a unifying multidisciplinary analysis of timing algorithms, in relation to frequent application cases within branching schemes or neighborhood searches, and the efficient resolution of series of similar timing subproblems is analyzed.
61
Empirical analysis for the VRPTW with a multigraph representation for the road network
TL;DR: This study investigates in depth a special representation of the road network proposed in the literature and called a multigraph, which enables one to maintain all these alternative paths in the solution space with branch-and-price algorithms developed for the different types of graphs.
61
On service consistency in multi-period vehicle routing
TL;DR: Analysis of the multi-period vehicle routing problem with time windows and limited visiting quota (MVRPTW-LVQ) shows that when demand fluctuation is relatively small compared to vehicle capacity, enforcing consistent service can increase customer satisfaction with only a slight increase in the operational cost.
60