A parallel algorithm for the vehicle routing problem with time window constraints

DOI10.1023/A:1018948011707zbMath0922.90059OpenAlexW1565836903MaRDI QIDQ1290169

Torsten Fahle, Jürgen Schulze

Publication date: 10 June 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018948011707

zbMATH Keywords

vehicle routingparallel tabu search heuristictime window constraints

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Parallel numerical computation (65Y05)

Related Items (16)

A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain ⋮ Applying the attribute based hill climber heuristic to the vehicle routing problem ⋮ Multiconstrained network intensive vehicle routing adaptive ant colony algorithm in the context of neural network analysis ⋮ New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ Parallel Solution Methods for Vehicle Routing Problems ⋮ COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem ⋮ A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery ⋮ A two-phase hybrid metaheuristic for the vehicle routing problem with time windows ⋮ A cooperative parallel meta-heuristic for the vehicle routing problem with time windows ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ Optimisation enhancement using self‐organising fuzzy control ⋮ Vehicle routing problem with time windows and a limited number of vehicles. ⋮ A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows ⋮ Tabu search heuristics for the vehicle routing problem with time windows.

This page was built for publication: A parallel algorithm for the vehicle routing problem with time window constraints