A cooperative parallel meta-heuristic for the vehicle routing problem with time windows

DOI10.1016/j.cor.2003.11.023zbMath1074.90006MaRDI QIDQ1777146

Teodor Gabriel Crainic, Alexandre Le Bouthillier

Publication date: 12 May 2005

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

Full work available at URL: https://doi.org/10.1016/j.cor.2003.11.023

zbMATH Keywords

Cooperative search; Parallel meta-heuristics; Solution warehouse strategy; Vehicle routing with time windows

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B20: Traffic problems in operations research

Related Items

A general heuristic for vehicle routing problems, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method, Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering

Uses Software

• VRP
• MACS-VRPTW
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vehicle routing problem: An overview of exact and approximate algorithms
• A parallel algorithm for the vehicle routing problem with time window constraints
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
• Variable neighborhood search
• Heuristics for large constrained vehicle routing problems
• Tabu search heuristics for the vehicle routing problem with time windows.
• Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
• Probabilistic diversification and intensification in local search for vehicle routing
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• The Vehicle Routing Problem
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• A Subpath Ejection Method for the Vehicle Routing Problem
• A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Tabu Search—Part I
• Tabu Search—Part II
• Fast Algorithms for Geometric Traveling Salesman Problems
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• Parallel Strategies for Meta-Heuristics
• A guide to vehicle routing heuristics
• A unified tabu search heuristic for vehicle routing problems with time windows
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
• Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
• Solving vehicle routing problems using constraint programming and metaheuristics
• Using constraint-based operators to solve the vehicle routing problem with time windows