Tabu search heuristics for the vehicle routing problem with time windows.

DOI10.1007/BF02579017zbMath1038.90005WikidataQ110032636 ScholiaQ110032636MaRDI QIDQ1871417

Michel Gendreau, Olli Bräysy

Publication date: 2002

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

metaheuristics; tabu search; vehicle routing; time windows

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

A hybrid search method for the vehicle routing problem with time windows, Metaheuristics in combinatorial optimization, Comparing backhauling strategies in vehicle routing using ant colony optimization, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, Routing relatively few customers per route, A dial-a-ride problem for client transportation in a health-care organization, A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows, Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics

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
• Planning models for freight transportation
• 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
• Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
• Variable neighborhood search
• Future paths for integer programming and links to artificial intelligence
• Parallelization of a two-phase metaheuristic for routing problems with time windows
• The simulated trading heuristic for solving vehicle routing problems
• Probabilistic diversification and intensification in local search for vehicle routing
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Tabu Search—Part I
• Tabu Search—Part II
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
• A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
• A unified tabu search heuristic for vehicle routing problems with time windows
• An Exchange Heuristic for Routeing Problems with Time Windows
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
• Solving vehicle routing problems using constraint programming and metaheuristics