Tabu search heuristics for the vehicle routing problem with time windows.
type: Item
instance of: scholarly article
title: Tabu search heuristics for the vehicle routing problem with time windows.
zbMATH Open document ID: 1038.90005
DOI: 10.1007/BF02579017
author: Olli Bräysy
author: Michel Gendreau
published in: Top
publication date: 2002-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90-02
zbMATH DE Number: 1907711
zbMATH Keywords: metaheuristics
zbMATH Keywords: tabu search
zbMATH Keywords: vehicle routing
zbMATH Keywords: time windows
describes a project that uses: VRP
describes a project that uses: Tabu search
describes a project that uses: MACS-VRPTW
MaRDI profile type: Publication
Wikidata QID: Q110032636
cites work: The simulated trading heuristic for solving vehicle routing problems
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: Q4735035
cites work: Q4495169
cites work: Local search and variable neighborhood: search algorithms for the vehicle routing problem with time windows
cites work: Q4532234
cites work: A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
cites work: Q4532229
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Planning models for freight transportation
cites work: Q4495172
cites work: Solving vehicle routing problems using constraint programming and metaheuristics
cites work: Q3783827
cites work: Q5687193
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
cites work: A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
cites work: Parallelization of a two-phase metaheuristic for routing problems with time windows
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: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Q4354785
cites work: Q4039765
cites work: Q4532232
cites work: Q4365130
cites work: Q4079017
cites work: Q4495181
cites work: Variable neighborhood search
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
cites work: An Exchange Heuristic for Routeing Problems with Time Windows
cites work: The Vehicle Routing Problem with Time Windows Part I: Tabu Search
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: A parallel algorithm for the vehicle routing problem with time window constraints
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems
cites work: Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
description: scientific article; zbMATH DE number 1907711