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
A continuous approach to the design of physical distribution systems
TL;DR: The optimization model presented in this paper sets the district boundaries and seeks the best fleet of vehicles as to minimize total daily transport costs, and is a combination of a gradient method with random perturbations, and a hybrid genetic algorithm.
59
A savings based method for real-life vehicle routing problems
TL;DR: In this paper, a savings-based algorithm for the extended vehicle routing problem is proposed. But the authors compare the routing plans of both algorithms according to non-standard quality measures that help to evaluate the "visual attractiveness" of the plan.
Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
TL;DR: This paper considers a dial-a-ride problem where the objective is to maximize the passenger occupancy rate from an on-demand transportation system developed in a rural zone in France, and addresses the solution of the problem with a column generation approach applied to a set partitioning formulationWhere the objective function is fractional.
58
An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
Guillaume Marquès,Guillaume Marquès,Ruslan Sadykov,Ruslan Sadykov,Jean-Christophe Deschamps,Rémy Dupas +5 more
TL;DR: This paper proposes a branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem in which delivery of products from a depot to customers is performed using intermediate depots called satellites and can solve to optimality all literature instances with up to 200 customers and 10 satellites for the first time.
58
A continuous approximation model for the fleet composition problem
TL;DR: In this article, the authors present a continuous approximation model to determine the long-term vehicle fleet composition needed to perform distribution activities, where the types of vehicles differ in terms of their capacities, fixed costs and variable costs.
57