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

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

Alexandre Le Bouthillier, Teodor Gabriel Crainic

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 searchParallel meta-heuristicsSolution warehouse strategyVehicle routing with time windows

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items

A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain, A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows, A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows, Fast machine reassignment, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, A general heuristic for vehicle routing problems, A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run, Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands, A cooperative hyper-heuristic search framework, Metaheuristics: A Canadian Perspective, Multiobjective quantum evolutionary algorithm for the vehicle routing problem with customer satisfaction, A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, Parallel Solution Methods for Vehicle Routing Problems, Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering, A cooperative parallel metaheuristic for the capacitated vehicle routing problem, A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery, A Comparative Study of Task Assignment and Path Planning Methods for Multi-UGV Missions, A library of local search heuristics for the vehicle routing problem, An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows, Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem, A branch-and-price-based large neighborhood search algorithm for the 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, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

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