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

DOI10.1007/BF02023004zbMath0775.90153MaRDI QIDQ2367016

Ibrahim. H Osman

Publication date: 16 August 1993

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

Mathematics Subject Classification ID

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 (only showing first 100 items - show all)

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.

Uses Software

• VRP

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

This page was built for publication: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem