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

DOI10.1023/A:1018948011707zbMATH Open0922.90059OpenAlexW1565836903MaRDI QIDQ1290169FDOQ1290169

Authors: Jürgen Schulze, Torsten Fahle 

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

Recommendations

• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
• Tabu search heuristics for the vehicle routing problem with time windows.
• A parallel algorithm for the vehicle routing problem
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• scientific article; zbMATH DE number 1054962

zbMATH Keywords

vehicle routingtime window constraintsparallel tabu search heuristic

Mathematics Subject Classification ID

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

Cited In (24)

• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
• A parallel algorithm for the vehicle routing problem
• Implementing an insertion heuristic for vehicle routing on parallel hardware
• A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
• A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
• Applying the attribute based hill climber heuristic to the vehicle routing problem
• A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain
• Parallelization of a two-phase metaheuristic for routing problems with time windows
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Multiconstrained network intensive vehicle routing adaptive ant colony algorithm in the context of neural network analysis
• Optimisation enhancement using self‐organising fuzzy control
• Parallel solution methods for vehicle routing problems
• Tabu search heuristics for the vehicle routing problem with time windows.
• A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
• Vehicle routing problem with time windows and a limited number of vehicles.
• 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 cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• Solving variants of the vehicle routing problem with a simple parallel iterated tabu search
• Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
• A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290169)