A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
type: Item
instance of: scholarly article
title: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
zbMATH Open document ID: 1074.90006
author: Alexandre Le Bouthillier
author: Teodor Gabriel Crainic
published in: Computers \& Operations Research
publication date: 2005-05-12T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2167998
zbMATH Keywords: Vehicle routing with time windows
zbMATH Keywords: Parallel meta-heuristics
zbMATH Keywords: Cooperative search
zbMATH Keywords: Solution warehouse strategy
describes a project that uses: MACS-VRPTW
describes a project that uses: VRP
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2003.11.023
OpenAlex ID: W2133671109
cites work: Q5692635
cites work: Q4495194
cites work: Q4955273
cites work: Parallel Strategies for Meta-Heuristics
cites work: Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
cites work: Strategies for the parallel implementation of metaheuristics
cites work: A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
cites work: Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
cites work: A parallel algorithm for the vehicle routing problem with time window constraints
cites work: Q4532229
cites work: Tabu search heuristics for the vehicle routing problem with time windows.
cites work: A guide to vehicle routing heuristics
cites work: Q3048611
cites work: Q5687193
cites work: Q4955266
cites work: Q5687192
cites work: Q4532228
cites work: Q4039765
cites work: Q4955265
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: Q4532227
cites work: Q4955264
cites work: The vehicle routing problem
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: 2-path cuts for the vehicle routing problem with time windows
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Q4354785
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Using constraint-based operators to solve the vehicle routing problem with time windows
cites work: Variable neighborhood search
cites work: Q4495203
cites work: Developments of variable neighborhood search
cites work: A reactive variable neighborhood search for the vehicle-routing problem with time windows
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: Q4350070
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: A generalized insertion heuristic for the travelling salesman problem with time windows
cites work: A subpath ejection method for the vehicle routing problem
cites work: Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
cites work: Heuristics for large constrained vehicle routing problems
cites work: Q4365135
cites work: Solving vehicle routing problems using constraint programming and metaheuristics
cites work: Fast Algorithms for Geometric Traveling Salesman Problems
DOI: 10.1016/J.COR.2003.11.023
description: scientific article; zbMATH DE number 2167998