The vehicle routing problem: An overview of exact and approximate algorithms

doi:10.1016/0377-2217(92)90192-C

European Journal of Operational Research

Volume 59, Issue 3, 25 June 1992, Pages 345-358

https://doi.org/10.1016/0377-2217(92)90192-C Get rights and content

Abstract

In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed. The paper is organized as follows: (1) definition; (2) exact algorithms; (3) heuristic algorithms; (4) conclusion.

References (41)

M. Desrochers et al.
A classification scheme for vehicle routing and scheduling problems
European Journal of Operational Research
(1990)
G. Laporte et al.
Exact algorithms for the vehicle routing problem
M.D. Nelson et al.
Implementation techniques for the vehicle routing problem
Computer & Operations Research
(1985)
H. Paessens
The savings algorithm for the vehicle problem, Europeam Journal Operational Research
European Journal of Operational Research
(1988)
C. Toregas et al.
Location under time or distance constraints
Papers
(1972)
Y. Agarwal et al.
A set-partitioning-based algorithm for the vehicle routing problem
Networks
(1989)
M. Balinski et al.
On an integer program for a delivery problem
Operations Research
(1964)
J.F. Benders
Partitioning procedures for solving mixed-variables programming problems
Numerische Mathematik
(1962)
L.D. Bodin et al.
Routing and scheduling of vehicles and crews. The state of the art
Computers and Operations Research
(1983)
N. Christofides
Vehicle routing

N. Christofides

Vehicle scheduling and routing

N. Christofides et al.

The vehicle routing problem

N. Christofides et al.

Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations

Mathematical Programming

(1981)

N. Christofides et al.

State space relaxation procedures for the computation of bounds to routing problems

Networks

(1981)

G. Clarke et al.

Scheduling of vehicles from a central depot to a number of delivery points

Operations Research

(1964)

M. Desrochers et al.

A new optimization algorithm for the vehicle routing problem with time windows

Operations Research

(1991)

J. Desrosiers et al.

Routing with time windows by column generation

Networks

(1984)

S. Eilon et al.

Distribution Management: Mathematical Modelling and Practical Analysis

(1971)

M.L. Fisher et al.

A decomposition algorithm for large-scale vehicle routing

M.L. Fisher et al.

A generalized assignment heuristic for vehicle routing

Networks

(1981)

Cited by (1253)

A second-pricing based incentive-compatible mechanism for matching and pricing in ride-sharing
2024, Expert Systems with Applications
As a novel and economical transportation way, ride-sharing has attracted more and more passengers and drivers to participate. How to match passengers with drivers efficiently has become a key issue. Specifically, drivers are usually heterogeneous with different costs, and they may behave strategically (e.g. reveal their private cost information untruthfully) in order to make more profits. Drivers’ strategic behavior may lead to inefficient matching, which results in the loss of social welfare of ride-sharing platforms and drivers. In this paper, an incentive-compatible and efficient mechanism is proposed to solve this issue, which can match passengers with drivers and determine the payments to drivers in order to maximize social welfare while ensuring drivers reveal their cost information truthfully. Specifically, an order matching algorithm with branch and bound based route planning is designed to accelerate the matching process. Meanwhile, the payments to drivers are computed based on the second-pricing algorithm. In so doing, a second-pricing based ride-sharing mechanism (SPRM) is proposed, which satisfies incentive compatibility, individual rationality, budget balance and computational efficiency. Based on the real Manhattan taxi order data and vehicle fuel consumption data, extensive experiments are conducted to evaluate the proposed mechanism. The experimental results show that SPRM can guarantee drivers’ profits and improve the ratio of drivers’ participation and the ratio of served orders, and eventually achieve greater social welfare than four typical benchmark approaches, GPri, ND, mT-share and mdp. The research of this paper can provide useful insights for designing efficient ride-sharing system to maximize the social welfare of all participants in the real life.
Shared autonomous electric vehicle: Towards social economy of energy and mobility from power-transportation nexus perspective
2024, Renewable and Sustainable Energy Reviews
In addressing the detrimental impacts of greenhouse gas emissions and decarbonization targets, the imperative shift towards electrification in the transportation sector is underscored, with additional advantages arising from shared features. Nevertheless, technological progress, particularly in the realm of connected and autonomous features, brings forth notable benefits but also introduces challenges related to safety, cost, and implementation. The convergence of connectivity, autonomy, shared mobility, and electric propulsion leads to the concept of shared autonomous electric vehicles. In practical integration scenarios several concerns encompassing the transportation network, power network, and user satisfaction. This paper conducts a thorough analysis of various aspects of shared autonomous electric vehicles, rigorously evaluating the feasibility of their integration within a coupled power and transportation network. The analysis highlights allocation, routing, charging, battery swapping, social-economic considerations, and modelling as pivotal areas warranting focused research attention in the realm of shared autonomous electric vehicles.
A comprehensive survey on the generalized traveling salesman problem
2024, European Journal of Operational Research
The generalized traveling salesman problem (GTSP) is an extension of the classical traveling salesman problem (TSP) and it is among the most researched combinatorial optimization problems due to its theoretical properties, complexity aspects and real-life applications in various areas: location-routing problems, material flow design problem, distribution of medical supplies, urban waste collection management, airport selection and routing the courier airplanes, image retrieval and ranking, digital garment manufacturing, etc. Even though the importance of this combinatorial optimization problem was highlighted in several publications and there were developed several methods for solving it, there is no survey dedicated to the GTSP. The scope of this paper is to close this gap by providing a comprehensive survey on mathematical formulations, solution approaches and latest advances regarding the GTSP. The paper is organized around the following issues: problem definition, variations and related problems, real-life applications of the GTSP, mathematical formulations, solution approaches designed for solving the investigated problem, datasets, computational results and comparative analysis of the performance of the existing state-of-the-art algorithms. Additionally, we discuss certain open problems and potential research directions.
Delay-resistant robust vehicle routing with heterogeneous time windows
2024, Computers and Operations Research
We consider a robust variant of the vehicle routing problem with heterogeneous time windows (RVRP-HTW) with a focus on delay-resistant solutions. Here, customers have different availability time windows for every vehicle and must be provided with a preferably tight appointment window for the planned service. Different vehicles are a possibility to model different days on which one physical vehicle can serve a customer. This is the main reason why different time windows for different vehicles are of high practical relevance. To ensure that the appointment windows are adhered to as much as possible, we introduce a new objective function that penalizes delays. Our novel approach allows us to find solutions that are robust with respect to uncertainties in travel and service times limited by a budget polytope. We present a set-partitioning model, the solution of which is based on column generation and employs a labeling algorithm that integrates robustness into the calculations and is adapted to our problem-specific constraints. In a Monte-Carlo simulation on real-life data, we evaluate this method in terms of runtime and solution quality. Our solutions show very good performance, even if the data is more uncertain than assumed for the optimization, incurring only marginal extra travel time compared to a naive deterministic planning scheme.
A survey of Flex-Route Transit problem and its link with Vehicle Routing Problem
2024, Transportation Research Part C: Emerging Technologies
Flexible transport systems such as Demand Responsive Transit (DRT) are becoming more and more popular over the last few years due to their convenience for customers. However, this convenience comes at a price. Transport authorities are currently looking for ways to improve service flexibility of Conventional Public Transport (CPT), which is undoubtedly cheaper than DRT. This justifies the need for Flex-Route Transit (FRT), which combines the flexibility of DRT and the low cost of CPT. This paper surveys research developments on FRT, as a promising alternative mode of public transport. Based on this survey, we discuss current research gaps that may be filled to increase FRT applicability. Moreover, we show how literature on classic Operations Research problems is of help to do so. In particular, we study similarities and differences between FRT and Vehicle Routing Problem, and specifically with one of its variant named Dial-a-Ride Problem. The analysis illustrates promising techniques that may be of use for solving FRT.
A large-scale last-mile consolidation model for e-commerce home delivery
2024, Expert Systems with Applications
E-commerce's rapid growth, combined with customer demand for fast shipping, has significantly escalated last-mile transportation, particularly home deliveries. This surge calls for novel strategies to optimize vehicle utilization while maintaining timely delivery. In response, many online retailers are incentivizing customers to embrace delayed home deliveries by offering economic incentives. Nonetheless, current transportation systems fall short in accommodating orders with extended delivery windows, primarily adhering to the First-In-First-Out rule and distance minimization via the Vehicle Routing Problem (VRP). In this paper, we introduce a new consolidation-based delivery methodology that addresses these challenges. Our approach accounts for orders with daily-based time windows and also anticipates future demand realizations (i.e., expected incoming orders). We characterize this consolidation problem using a Mixed Integer Linear Programming model and propose a custom metaheuristic approach that can tackle the problem on a large-scale setting, introducing a significant novelty approach in last-mile delivery research. We applied our methodology to one of Mexico's largest retailers and compared its performance against the company's existing transportation systems. Our approach substantially improves vehicle utilization and yields considerable reductions in distance traveled, time, and overall transportation costs, achieving cost savings of up to 52%. These savings represent tangible benefits, enabling potential revenue enhancements for businesses and cost-effective, timely deliveries for consumers. Additionally, the increased vehicle utilization implies fewer vehicles are needed for the same volume of deliveries, thereby enhancing operational efficiency. This innovative approach, therefore, presents a practical and highly effective solution for managing large-scale last-mile delivery scenarios.

View all citing articles on Scopus

View full text

Invited reviewThe vehicle routing problem: An overview of exact and approximate algorithms

Abstract

European Journal of Operational Research

Computer & Operations Research

European Journal of Operational Research

Papers

A set-partitioning-based algorithm for the vehicle routing problem

Networks

On an integer program for a delivery problem

Operations Research

Partitioning procedures for solving mixed-variables programming problems

Numerische Mathematik

Routing and scheduling of vehicles and crews. The state of the art

Computers and Operations Research

Vehicle routing

Vehicle scheduling and routing

The vehicle routing problem

Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations

Mathematical Programming

State space relaxation procedures for the computation of bounds to routing problems

Networks

Scheduling of vehicles from a central depot to a number of delivery points

Operations Research

A new optimization algorithm for the vehicle routing problem with time windows

Operations Research

Routing with time windows by column generation

Networks

Distribution Management: Mathematical Modelling and Practical Analysis

A decomposition algorithm for large-scale vehicle routing

A generalized assignment heuristic for vehicle routing

Networks

Invited review
The vehicle routing problem: An overview of exact and approximate algorithms