Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
From MaRDI portal
Publication:2367016
DOI10.1007/BF02023004zbMath0775.90153MaRDI QIDQ2367016
Publication date: 16 August 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
90B06: Transportation, logistics and supply chain management
90C27: Combinatorial optimization
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Algorithms for the Vehicle Routing Problems with Time Deadlines, A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem, AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS, Unnamed Item, Local Search Algorithms for the Maximal Planar Layout Problem, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Adaptive memory programming: a unified view of metaheuristics, A tabu search algorithm for the open vehicle routing problem, A two-phase hybrid metaheuristic for the vehicle routing problem with time windows, Metaheuristics in combinatorial optimization, A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Active-guided evolution strategies for large-scale capacitated vehicle routing problems, A simulated annealing approach to the traveling tournament problem, Comparing backhauling strategies in vehicle routing using ant colony optimization, EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem, 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, A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints, Genetic algorithms and tabu search: Hybrids for optimization, Using tabu search for solving a dynamic multi-terminal truck dispatching problem, Improvement heuristics for the vehicle routing problem based on simulated annealing, Solving the continuous flow-shop scheduling problem by metaheuristics., Integrating purchasing and routing in a propane gas supply chain., D-Ants: Savings Based Ants divide and conquer the vehicle routing problem., Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing 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, Use of the BATA algorithm and MIS to solve the mail carrier problem, Active guided evolution strategies for large-scale vehicle routing problems with time windows, A heuristic algorithm for the truckload and less-than-truckload problem, Solving the vehicle routing problem with adaptive memory programming methodology, A route-neighborhood-based metaheuristic for vehicle routing problem with time windows, Extensions to the generalised assignment heuristic for vehicle routing, A sweep-based algorithm for the fleet size and mix vehicle routing problem, A visual interactive approach to vehicle routing, A genetic algorithm for the vehicle routing problem, Tabu search heuristics for the vehicle routing problem with time windows., A parallel hybrid genetic algorithm for the vehicle routing problem with time windows, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Routing problems: A bibliography, 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, 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, Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control, A user's guide to tabu search, A tabu-search heuristic for the flexible-resource flow shop scheduling problem, A heuristic for the routing and carrier selection problem, Multi-ant colony system (MACS) for a vehicle routing problem with backhauls, An improved ant colony optimization for vehicle routing problem, Dynamic vehicle routing using genetic algorithms, 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, A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm, Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation, 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, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem, Heuristic approaches to vehicle routing with backhauls and time windows, 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, A Hybrid Genetic Approach for the Dynamic Vehicle Routing Problem with Time Windows
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A Lagrangean relaxation heuristic for vehicle routing
- Implementation techniques for the vehicle routing problem
- The savings algorithm for the vehicle routing problem
- Future paths for integer programming and links to artificial intelligence
- Optimal Routing under Capacity and Distance Restrictions
- Bounds and Heuristics for Capacitated Routing Problems
- State-space relaxation procedures for the computation of bounds to routing problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Parallel Savings Based Heuristics for the Delivery Problem
- Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
- A set‐partitioning‐based exact algorithm for the vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
