A Tabu Search Heuristic for the Vehicle Routing Problem

DOI10.1287/MNSC.40.10.1276zbMATH Open0822.90053OpenAlexW2108536179MaRDI QIDQ4834331FDOQ4834331

Authors: Michel Gendreau, Alain Hertz, G. Laporte 

Publication date: 28 May 1995

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.40.10.1276

Recommendations

• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• scientific article; zbMATH DE number 2209651
• A tabu search algorithm for the vehicle routing problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Tabu search heuristics for the vehicle routing problem with time windows.

zbMATH Keywords

vehicle routingtabu search heuristiccapacity and route length restrictionsTABUROUTE

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Cited In (only showing first 100 items - show all)

• A tabu search heuristic and adaptive memory procedure for political districting
• A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
• A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
• A two-stage vehicle routing model for large-scale bioterrorism emergencies
• A hybrid heuristic for an inventory routing problem
• The granular tabu search and its application to the vehicle-routing problem
• Routing problems with loading constraints
• A threshold accepting approach to the Open Vehicle Routing problem
• A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods
• A solution method for a two-layer sustainable supply chain distribution model
• Applying the attribute based hill climber heuristic to the vehicle routing problem
• A tabu search algorithm for the open vehicle routing problem
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• A tabu search method for the truck and trailer routing problem
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
• Solving the truck and trailer routing problem based on a simulated annealing heuristic
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• Planning models for freight transportation
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• Vehicle routing problem with stochastic travel times including soft time windows and service costs
• Tabu search embedded simulated annealing for the shortest route cut and fill problem
• Heuristic solutions to multi-depot location-routing problems
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• A genetic algorithm for the vehicle routing problem
• A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
• An efficient heuristic for reliability design optimization problems
• An Improved Petal Heuristic for the Vehicle Routeing Problem
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
• The multi-compartment vehicle routing problem with flexible compartment sizes
• Adaptive memory programming for the vehicle routing problem with multiple trips
• A sweep-based algorithm for the fleet size and mix vehicle routing problem
• Title not available (Why is that?)
• A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
• The vehicle-routing problem with time windows and driver-specific times
• Minimum cost VRP with time-dependent speed data and congestion charge
• A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
• Bike sharing systems: solving the static rebalancing problem
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Heuristic algorithms for the multi-depot ring-star problem
• A variable neighbourhood search algorithm for the open vehicle routing problem
• An evolutionary algorithm for the vehicle routing problem with route balancing
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
• A tabu search heuristic for the truck and trailer routing problem
• The periodic vehicle routing problem with intermediate facilities
• A new ILP-based refinement heuristic for vehicle routing problems
• A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
• The undirected capacitated arc routing problem with profits
• A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
• A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
• The multi-depot vehicle routing problem with inter-depot routes
• The period vehicle routing problem and its extensions
• A heuristic algorithm for the truckload and less-than-truckload problem
• A guided local search heuristic for the capacitated arc routing problem
• A library of local search heuristics for the vehicle routing problem
• Solving transportation problems with nonlinear side constraints with tabu search
• Routing problems: A bibliography
• A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
• Using tabu search with longer-term memory and relaxation to create examination timetables.
• EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
• Managing platelet supply through improved routing of blood collection vehicles
• A tabu search heuristic for the heterogeneous fleet vehicle routing problem
• Location of hubs in a competitive environment
• A TABU search heuristic for the team orienteering problem
• Parallel solution methods for vehicle routing problems
• Recent models and algorithms for one-to-one pickup and delivery problems
• Probabilistic diversification and intensification in local search for vehicle routing
• New heuristics for the vehicle routing problem
• From single-objective to multi-objective vehicle routing problems: motivations, case studies, and methods
• A tabu search approach for the livestock collection problem
• Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
• The dial-a-ride problem: Models and algorithms
• Extensions to the generalised assignment heuristic for vehicle routing
• Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
• A tabu search heuristic for the multi-depot vehicle routing problem
• Diversification strategies in tabu search algorithms for the maximum clique problem
• Designing and reporting on computational experiments with heuristic methods
• Metaheuristics: A bibliography
• Heuristics for the lexicographic Max-ordering vehicle routing problem
• A new tabu search algorithm for the vehicle routing problem with backhauls
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
• Gossip algorithms for heterogeneous multi-vehicle routing problems
• A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Vehicle routing with dynamic travel times: a queueing approach
• Comparison of tabu/2-opt heuristic and optimal tree search method for assignment problems
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
• A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
• A queueing framework for routing problems with time-dependent travel times
• Using local search to speed up filtering algorithms for some NP-hard constraints
• Sequential search and its application to vehicle-routing problems
• Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem

This page was built for publication: A Tabu Search Heuristic for the Vehicle Routing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834331)