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
The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs
TL;DR: This paper extends the traditional DJRP to the DJRP with Approximated Transportation Costs (DJRP-AT) by taking transportation considerations into account, and a solution approach based on Branch- and-Cut-and-Price is validated using test instances from the literature.
24
Interactive Heuristic for Practical Vehicle Routing Problem with Solution Shape Constraints
Hao Tang,Elise Miller-Hooks +1 more
TL;DR: In this article, an interactive heuristic is proposed for the vehicle routing problem (VRP) with shape constraints, and the results of the experiments show that the heuristic coupled with effective shape measures can provide solutions with significantly improved layout while maintaining satisfactory results in terms of conventional VRP measures (e.g., required fleet size and total cost).
23
The bi-objective two-dimensional loading vehicle routing problem with partial conflicts
TL;DR: In this article, a two-dimensional loading vehicle routing problem with partial conflicts is considered, where some materials can be partially conflicting and an additional constraint on the distance separating them must be respected.
23
Assigning Delivery Routes to Drivers Under Variable Customer Demands
TL;DR: A rule is proposed to guide the decision of interest: daily assignment of delivery routes to drivers, which targets customer service goals by trying to maximize the likelihood that each customer will continue to be served by the driver who is most familiar with that customer.
21
Distribution with Quality of Service Considerations: The Capacitated Routing Problem with Profits and Service Level Requirements
TL;DR: A branch-and-cut algorithm is designed and the usefulness of valid inequalities that have been effectively used for the capacitated vehicle routing problem and, more recently, for other routing problems with profits are evaluated.