Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

DOI10.1007/BF02023004zbMath0775.90153MaRDI QIDQ2367016

Publication date: 16 August 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Use of the BATA algorithm and MIS to solve the mail carrier problem, Using cost change estimates in a local search heuristic for the pollution routing problem, A parallel hybrid genetic algorithm for the vehicle routing problem with time windows, A user's guide to tabu search, A tabu-search heuristic for the flexible-resource flow shop scheduling problem, An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup, A heuristic for the routing and carrier selection 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, Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm, Multi-ant colony system (MACS) for a vehicle routing problem with backhauls, An improved ant colony optimization for vehicle routing problem, Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem, Thirty years of heterogeneous vehicle routing, Dynamic vehicle routing using genetic algorithms, An adaptive evolutionary approach for real-time vehicle routing and dispatching, A hybrid algorithm for a class of vehicle routing problems, A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, A simple and effective evolutionary algorithm for the capacitated location-routing problem, Managing platelet supply through improved routing of blood collection vehicles, An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen, A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Routing problems: A bibliography, A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run, A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost, The simulated trading heuristic for solving vehicle routing problems, Designing multi-period supply chain network considering risk and emission: a multi-objective approach, A tabu search heuristic for the multi-depot vehicle routing problem, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Focused simulated annealing search: An application to job shop scheduling, A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm, Diversification strategies in tabu search algorithms for the maximum clique problem, Tabu search for graph partitioning, A tabu search algorithm for frequency assignment, Metaheuristics: A bibliography, Multiobjective vehicle routing problem with fixed delivery and optional collections, Active-guided evolution strategies for large-scale capacitated vehicle routing problems, Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism, Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control, Multiconstrained network intensive vehicle routing adaptive ant colony algorithm in the context of neural network analysis, A simulated annealing approach to the traveling tournament problem, Using tabu search for solving a dynamic multi-terminal truck dispatching problem, Improvement heuristics for the vehicle routing problem based on simulated annealing, Multi-trip pickup and delivery problem with time windows and synchronization, The late acceptance hill-climbing heuristic, Solving the continuous flow-shop scheduling problem by metaheuristics., Optimised crossover genetic algorithm for capacitated vehicle routing problem, Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW, A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems, Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes, Integrating purchasing and routing in a propane gas supply chain., D-Ants: Savings Based Ants divide and conquer the vehicle routing problem., Comparing backhauling strategies in vehicle routing using ant colony optimization, 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, Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations, Ant colony optimization with clustering for solving the dynamic location routing problem, Integrating multi-product production and distribution in newspaper logistics, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, Heuristics for the lexicographic Max-ordering vehicle routing problem, EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem, Location of facility based on simulated annealing and ``ZKW algorithms, Honey bees mating optimization algorithm for large scale vehicle routing problems, The case for strategic oscillation, Active guided evolution strategies for large-scale vehicle routing problems with time windows, NeuroGenetic approach for combinatorial optimization: an exploratory analysis, A tabu search algorithm for the open vehicle routing problem, A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery, The multi-shift vehicle routing problem with overtime, A two-phase hybrid metaheuristic for the vehicle routing problem with time windows, A heuristic algorithm for the truckload and less-than-truckload problem, Solving the vehicle routing problem with adaptive memory programming methodology, Industrial aspects and literature survey: fleet composition and routing, A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits, A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm, A route-neighborhood-based metaheuristic for vehicle routing problem with time windows, Extensions to the generalised assignment heuristic for vehicle routing, A local search heuristic for the pre- and end-haulage of intermodal container terminals, A genetic algorithm for service level based vehicle scheduling, General local search methods, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, A multi-level composite heuristic for the multi-depot vehicle fleet mix problem, Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem, 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, An evolutionary approach for the target search problem in uncertain environment, A sweep-based algorithm for the fleet size and mix vehicle routing problem, Heuristic solutions to multi-depot location-routing problems, A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls, Search strategies for the feeder bus network design problem, A two-phase tabu search approach to the location routing problem, A visual interactive approach to vehicle routing, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows, A genetic algorithm for the vehicle routing problem, Metaheuristics in combinatorial optimization, Tabu search heuristics for the vehicle routing problem with time windows., Simple heuristics for the multi-period fleet size and mix vehicle routing problem, Hybrid simulated annealing with memory: an evolution-based diversification approach, The mixed capacitated general routing problem under uncertainty, A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit, A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem, Iterated local search for the vehicle routing problem with a private fleet and a common carrier, Route optimization cold chain logistic distribution using greedy search method, Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery, Algorithms for the Vehicle Routing Problems with Time Deadlines, An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem, A variable neighborhood search for flying sidekick traveling salesman problem, Ant algorithm for GPS surveying problem with fuzzy pheromone updating, Heuristics for a cash-collection routing problem with a cluster-first route-second approach, Hybrid Ant Colony Optimization Algorithms—Behaviour Investigation Based on Intuitionistic Fuzzy Logic, Routing Courier Delivery Services with Urgent Demand, Fast upper and lower bounds for a large‐scale real‐world arc routing problem, An Investigation on Compound Neighborhoods for VRPTW, Local Search Algorithms for the Maximal Planar Layout Problem, Recent progress of local search in handling the time window constraints of the vehicle routing problem, An Approximation-Based Approach for Chance-Constrained Vehicle Routing and Air Traffic Control Problems, A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm, An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems, Applying an Intensification Strategy on Vehicle Routing Problem, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation, Recent progress of local search in handling the time window constraints of the vehicle routing problem, A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem, Sequential search and its application to vehicle-routing problems, A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem, Fast and high precision algorithms for optimization in large-scale genomic problems, Path relinking for the vehicle routing problem, Creating very large scale neighborhoods out of smaller ones by compounding moves, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, A two-stage vehicle routing model for large-scale bioterrorism emergencies, Adaptive memory programming: a unified view of metaheuristics, A Hybrid Genetic Approach for the Dynamic Vehicle Routing Problem with Time Windows, Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem, Chain partitioning as a key element for building vehicle routing problem heuristics, From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future, Unnamed Item, Heuristic approaches to vehicle routing with backhauls and time windows, New Notation and Classification Scheme for Vehicle Routing Problems, A scatter search heuristic for the capacitated clustering problem, Scatter search for the vehicle routing problem with time windows, A tabu search heuristic for the truck and trailer routing problem, Fast local search algorithms for the handicapped persons transportation problem, Savings based ant colony optimization for the capacitated minimum spanning tree problem

Uses Software

VRP

Cites Work