Simulated annealing metaheuristics for the vehicle routing problem with time windows

DOI10.1007/BF02601637zbMath0849.90054OpenAlexW2014412090MaRDI QIDQ1919832

Wen-Chyuan Chiang, Roberta S. Russell

Publication date: 18 September 1996

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

Full work available at URL: https://doi.org/10.1007/bf02601637

zbMATH Keywords

vehicle routingtime window constraintslarge-scale real-world problemssimulated annealing metaheuristics

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items

Heuristic solutions for the vehicle routing problem with time windows and synchronized visits, A multi-start local search algorithm for the vehicle routing problem with time windows, An improved ant colony optimization for vehicle routing problem, Routing problems: A bibliography, A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing, Metaheuristics: A bibliography, An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows, An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs, Demand management in time-slotted last-mile delivery via dynamic routing with forecast orders, Local search with annealing-like restarts to solve the VRPTW, High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows, Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands, COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM, An iterative three-component heuristic for the team orienteering problem with time windows, Optimal information location for adaptive routing, Active guided evolution strategies for large-scale vehicle routing problems with time windows, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, A two-phase hybrid metaheuristic for the vehicle routing problem with time windows, A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length, A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows, A vehicle routing problem with distribution uncertainty in deadlines, A route-neighborhood-based metaheuristic for vehicle routing problem with time windows, Vehicle routing problem with time windows and a limited number of vehicles., A stochastic dynamic traveling salesman problem with hard time windows

Uses Software

• MACS-VRPTW
• Tabu search
• GIDEON

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• An improved annealing scheme for the QAP
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• A controlled search simulated annealing method for the single machine weighted tardiness problem
• The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
• Future paths for integer programming and links to artificial intelligence
• A user's guide to tabu search
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The period routing problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
• Tabu Search—Part I
• An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
• Tabu Search—Part II
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• Bandwidth Packing: A Tabu Search Approach
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• Hybrid Heuristics for the Vehicle Routing Problem with Time Windows