A Tabu Search Heuristic for the Vehicle Routing Problem
From MaRDI portal
Publication:4834331
DOI10.1287/MNSC.40.10.1276zbMATH Open0822.90053OpenAlexW2108536179MaRDI QIDQ4834331FDOQ4834331
Alain Hertz, G. Laporte, Michel Gendreau
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
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cited In (only showing first 100 items - show all)
- 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 List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
- 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
- Common due-date determination and sequencing using tabu search
- Using local search to speed up filtering algorithms for some NP-hard constraints
- Sequential search and its application to vehicle-routing problems
- A variable neighborhood search algorithm for the capacitated vehicle routing problem
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- Single-point stochastic search algorithms for the multi-level lot-sizing problem
- Resource constrained routing and scheduling: review and research prospects
- Comparing descent heuristics and metaheuristics for the vehicle routing problem
- Vehicle routing and appointment scheduling with team assignment for home services
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
- Optimised crossover genetic algorithm for capacitated vehicle routing problem
- A tabu search procedure for coordinating production, inventory and distribution routing problems
- Path relinking for the vehicle routing problem
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
- Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- Competitiveness based on logistic management: a real case study
- An adaptive large neighborhood search for relocating vehicles in electric carsharing services
- A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- An iterated local search heuristic for the split delivery vehicle routing problem
- A two level metaheuristic for the operating room scheduling and assignment problem
- A tabu search algorithm for the multi-period inspector scheduling problem
- Simulated annealing heuristic for the general share-a-ride problem
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- A multi-objective evolutionary algorithm for examination timetabling
- Layout optimization considering production uncertainty and routing flexibility
- Hybrid heuristic for the location‐inventory‐routing problem in closed‐loop supply chain
- The capacity and distance constrained plant location problem
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- Vehicle routing with stochastic time-dependent travel times
- Construction and improvement algorithms for dispersion problems
- Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry
- Search strategies for the feeder bus network design problem
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- A neural-tabu search heuristic for the real time vehicle routing problem
- Adaptive memory programming: a unified view of metaheuristics
- Simple heuristics for the multi-period fleet size and mix vehicle routing problem
- Tabu search for graph partitioning
- Local search heuristics for the probabilistic dial-a-ride problem
- Genetic algorithms and tabu search: Hybrids for optimization
- The periodic Vehicle routing problem: classification and heuristic
- A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
- Solving fixed charge transportation problem with truck load constraint using metaheuristics
- A dynamic vehicle routing problem with time-dependent travel times
- A metaheuristic based on tabu search for solving a technician routing and scheduling problem
- 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
- The Period Vehicle Routing Problem and its Extensions
- 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
- Parallel Solution Methods for Vehicle Routing Problems
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
- 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
- A tabu search algorithm for the open vehicle routing problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Edge assembly-based memetic algorithm for the capacitated vehicle 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
- From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods
- 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
- 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
- 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 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
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)