Implementing an insertion heuristic for vehicle routing on parallel hardware

DOI10.1016/0305-0548(93)90060-VzbMath0781.90031OpenAlexW1974811662MaRDI QIDQ690016

Jean-Yves Potvin, Christian Foisy

Publication date: 17 February 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(93)90060-v

zbMATH Keywords

vehicle routingparallel implementationtime windowsinsertion heuristic

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints ⋮ Routing problems: A bibliography ⋮ A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem

Uses Software

• VRP

Cites Work

• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Unnamed Item

This page was built for publication: Implementing an insertion heuristic for vehicle routing on parallel hardware