A Tabu Search Heuristic for the Vehicle Routing Problem
From MaRDI portal
Publication:4834331
DOI10.1287/mnsc.40.10.1276zbMath0822.90053OpenAlexW2108536179MaRDI QIDQ4834331
Alain Hertz, Gilbert 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)
Related Items
Simple heuristics for the multi-period fleet size and mix vehicle routing problem, A guided local search heuristic for the capacitated arc routing problem, Scheduling the replenishment of just-in-time supermarkets in assembly plants, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, État de l'art des méthodes “d'optimisation globale”, A queueing framework for routing problems with time-dependent travel times, A variable neighborhood search algorithm for the vehicle routing problem with multiple trips, Comparison of Tabu/2-opt heuristic and optimal tree search method for assignment problems, A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem, A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem, A guided tabu search for the vehicle routing problem with two-dimensional loading constraints, An evolutionary algorithm for the vehicle routing problem with route balancing, A variable neighbourhood search algorithm for the open vehicle routing problem, Multi-ant colony system (MACS) for a vehicle routing problem with backhauls, Simulated annealing heuristic for the general share-a-ride problem, A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations, Routing problems: A bibliography, Adaptive large neighborhood search for the curriculum-based course timetabling problem, Common due-date determination and sequencing using tabu search, The simulated trading heuristic for solving vehicle routing problems, A tabu search heuristic for the multi-depot vehicle routing problem, A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem, Diversification strategies in tabu search algorithms for the maximum clique problem, Tabu search for graph partitioning, Metaheuristics: A bibliography, A metaheuristic based on tabu search for solving a technician routing and scheduling problem, Designing and reporting on computational experiments with heuristic methods, Probabilistic diversification and intensification in local search for vehicle routing, A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings, Generating Fingerings for Polyphonic Piano Music with a Tabu Search Algorithm, The close-open mixed vehicle routing problem, A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty, Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare, Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems, A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment, Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier, Metaheuristics: A Canadian Perspective, Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery, A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows, Vehicle routing with dynamic travel times: a queueing approach, A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup, MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems, Bike sharing systems: solving the static rebalancing problem, A threshold accepting approach to the Open Vehicle Routing problem, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, Heuristics for the lexicographic Max-ordering vehicle routing problem, A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm, A tabu search procedure for coordinating production, inventory and distribution routing problems, The Period Vehicle Routing Problem and its Extensions, Parallel Solution Methods for Vehicle Routing Problems, An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods, Applying an Intensification Strategy on Vehicle Routing Problem, An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing, Hybrid heuristic for the location‐inventory‐routing problem in closed‐loop supply chain, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Granular tabu search for the pickup and delivery problem with time windows and electric vehicles, Gossip algorithms for heterogeneous multi-vehicle routing problems, The dial-a-ride problem: Models and algorithms, A tabu search approach for the livestock collection problem, Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints, Sequential search and its application to vehicle-routing problems, Path relinking for the vehicle routing problem, Creating very large scale neighborhoods out of smaller ones by compounding moves, Layout optimization considering production uncertainty and routing flexibility, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, Self-imposed time windows in vehicle routing problems, A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints, Edge assembly-based memetic algorithm for the capacitated vehicle routing problem, A two-stage vehicle routing model for large-scale bioterrorism emergencies, A hybrid algorithm for time-dependent vehicle routing problem with time windows, Adaptive memory programming: a unified view of metaheuristics, Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks, Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time, Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem, Chain partitioning as a key element for building vehicle routing problem heuristics, A Hybrid Heuristic for an Inventory Routing Problem, A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem, The ALGACEA‐1 method for the capacitated vehicle routing problem, An infeasible space exploring matheuristic for the production routing problem, The periodic Vehicle routing problem: classification and heuristic, A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition, A tailored Benders decomposition approach for last-mile delivery with autonomous robots, Fairness in ambulance routing for post disaster management, A tabu search heuristic for the truck and trailer routing problem, A new ILP-based refinement heuristic for vehicle routing problems, A visual interactive approach to vehicle routing, Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, A genetic algorithm for the vehicle routing problem, Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry, Using the tabu search method for the distribution of supplies in a hospital, A comparison of five heuristics for the multiple depot vehicle scheduling problem, A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints, Genetic algorithms and tabu search: Hybrids for optimization, A TSSP+1 decomposition strategy for the vehicle routing problem, An adaptive large neighborhood search for relocating vehicles in electric carsharing services, A multi-objective evolutionary algorithm for examination timetabling, 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, The vehicle-routing problem with time windows and driver-specific times, Adaptive memory programming for the vehicle routing problem with multiple trips, A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods, The multi-depot vehicle routing problem with inter-depot routes, A memetic algorithm for the travelling salesperson problem with hotel selection, Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design, A vehicle routing problem with flexible time windows, Scheduled penalty variable neighborhood search, 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 solution method for a two-layer sustainable supply chain distribution model, Minimum cost VRP with time-dependent speed data and congestion charge, A tabu search algorithm for the multi-period inspector scheduling problem, Managing platelet supply through improved routing of blood collection vehicles, A heuristic algorithm for a single vehicle static bike sharing rebalancing problem, An iterated tabu search for the multi-compartment vehicle routing problem, A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection, 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, An adaptive memory heuristic for a class of vehicle routing problems with minmax objective, Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem, A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing, A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding, A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost, Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems, 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, Routing problems with loading constraints, Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities, A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem, Improvement heuristics for the vehicle routing problem based on simulated annealing, Competitiveness based on logistic management: a real case study, A variable neighborhood search algorithm for the capacitated vehicle routing problem, Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery, Heuristic and exact algorithms for a min-max selective vehicle routing problem, Resource constrained routing and scheduling: review and research prospects, Designing granular solution methods for routing problems with time windows, Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem, From theory to practice: maximizing revenues for on-line dial-a-ride, Guidelines for the use of meta-heuristics in combinatorial optimization., Optimised crossover genetic algorithm for capacitated vehicle routing problem, Using tabu search with longer-term memory and relaxation to create examination timetables., Vehicle routing with arrival time diversification, Integrating purchasing and routing in a propane gas supply chain., D-Ants: Savings Based Ants divide and conquer the vehicle routing problem., Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics, A neural-tabu search heuristic for the real time vehicle routing problem, Local search heuristics for the probabilistic dial-a-ride problem, Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network, Solving fixed charge transportation problem with truck load constraint using metaheuristics, Ant colony optimization with clustering for solving the dynamic location routing problem, A randomized granular tabu search heuristic for the split delivery vehicle routing problem, EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem, The capacity and distance constrained plant location problem, Ant colony optimization for the two-dimensional loading vehicle routing problem, Scheduling in-house transport vehicles to feed parts to automotive assembly lines, A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints, Solving the truck and trailer routing problem based on a simulated annealing heuristic, Honey bees mating optimization algorithm for large scale vehicle routing problems, A TABU search heuristic for the team orienteering problem, Using local search to speed up filtering algorithms for some NP-hard constraints, A tabu search algorithm for the open vehicle routing problem, The undirected capacitated arc routing problem with profits, Single-point stochastic search algorithms for the multi-level lot-sizing problem, A heuristic algorithm for the truckload and less-than-truckload problem, Vehicle routing with stochastic time-dependent travel times, A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem, Solving the vehicle routing problem with adaptive memory programming methodology, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, A dynamic vehicle routing problem with time-dependent travel times, Vehicle routing and appointment scheduling with team assignment for home services, Construction and improvement algorithms for dispersion problems, An efficient heuristic for reliability design optimization problems, Lasso solution strategies for the vehicle routing problem with pickups and deliveries, Extensions to the generalised assignment heuristic for vehicle routing, A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem, A tabu search algorithm for the multi-trip vehicle routing and scheduling problem, Planning models for freight transportation, Metaheuristics for vehicle routing problems with three-dimensional loading constraints, A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars, Approximative solutions to the bicriterion vehicle routing problem with time windows, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Heuristic algorithms for the multi-depot ring-star problem, Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands, Location of hubs in a competitive environment, A sweep-based algorithm for the fleet size and mix vehicle routing problem, The periodic vehicle routing problem with intermediate facilities, Heuristic solutions to multi-depot location-routing problems, Search strategies for the feeder bus network design problem, A tabu search heuristic and adaptive memory procedure for political districting
