Implementing an insertion heuristic for vehicle routing on parallel hardware

doi:10.1016/0305-0548(93)90060-V

Computers & Operations Research

Volume 20, Issue 7, September 1993, Pages 737-745

https://doi.org/10.1016/0305-0548(93)90060-V Get rights and content

Abstract

In this paper, we report about the implementation of an insertion heuristic for the vehicle routing and scheduling problem with time windows on transputers. As it is experimentally demonstrated on a standard set of test problems, a good parallel implementation can produce a very substantial reduction in computation time. In particular, two procedures are described for reducing communication and idle time when the number of processors grows up.

References (6)

L. Bodin et al.
Routing and scheduling of vehicles and crews: the state of the art
Computers Ops Res.
(1983)
M.M. Solomon et al.
Time window constrained routing and scheduling problems
Transport. Sci.
(1988)
J.Y. Potvin et al.
A parallel route building algorithm for the vehicle routing and scheduling problem with time windows

There are more references available in the full text version of this article.

Cited by (10)

A parallel implementation of the TSSP + 1 decomposition for the capacity-constrained vehicle routing problem
1996, Computers and Operations Research
Vehicle routing problems (VRPs) are known to be computationally intractable. The amount of time required to solve a VRP increases significantly given a modest increase in problem size. Only small VRPs may be solved exactly using existing mathematical programming techniques on single processor computers. In recent years, multiple processor computers have emerged as powerful tools for solving computationally difficult problems. Problems are divided into several smaller parts or modules that can be solved simultaneously (or in parallel) to decrease computation time. The degree of speedup depends on the particular parallelization strategy as well as the system architecture. This paper presents a parallel optimization technique for solving the basic, capacity-constrained VRP. It includes: (1) a description of a decomposition algorithm for the VRP; (2) a description of the serial algorithm and the strategy used to implement the decomposition in parallel; (3) validation of the effectiveness of the parallel implementation; and (4) performance analysis comparing the parallel and serial implementations. The parallel approach to the VRP significantly reduces computation time and maintains solution quality.
A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints
1994, Computers and Operations Research
This paper describes a parallel Tabu search heuristic for the Vehicle Routing Problem with Time Windows. The parallel algorithm is synchronous and runs on a Multiple-Instruction Multiple-Data computer architecture. Parallelism is exploited by considering many different neighborhoods of the current solution, and by applying many modifications at once to the current solution. Computational results are reported on a standard set of test problems.
Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
2022, arXiv
Modelo de distribución urbana de mercancías en empresa dedicada al transporte de carga
2017, Proceedings of the International Conference on Industrial Engineering and Operations Management
A survey of hybrid artificial intelligence algorithms for dynamic vehicle routing problem
2015, Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Models for practical routing problems in logistics: Design and practices
2014, Models for Practical Routing Problems in Logistics: Design and Practices

View all citing articles on Scopus

^†: He received his M.Sc. degree in Electrical Engineering from Montreal University. His current research interests are in the implementation of functional languages on parallel architectures.

View full text

Implementing an insertion heuristic for vehicle routing on parallel hardware

Abstract

Routing and scheduling of vehicles and crews: the state of the art

Computers Ops Res.

Time window constrained routing and scheduling problems

Transport. Sci.

A parallel route building algorithm for the vehicle routing and scheduling problem with time windows