Simulated annealing metaheuristics for the vehicle routing problem with time windows
type: Item
instance of: scholarly article
title: Simulated annealing metaheuristics for the vehicle routing problem with time windows
zbMATH Open document ID: 0849.90054
DOI: 10.1007/BF02601637
author: Wen-Chyuan Chiang
author: Robert A. Russell
published in: Annals of Operations Research
publication date: 1996-09-18T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 910197
zbMATH Keywords: simulated annealing metaheuristics
zbMATH Keywords: vehicle routing
zbMATH Keywords: time window constraints
zbMATH Keywords: large-scale real-world problems
describes a project that uses: MACS-VRPTW
describes a project that uses: Tabu search
describes a project that uses: GIDEON
MaRDI profile type: Publication
cites work: Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
cites work: The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: An improved annealing scheme for the QAP
cites work: The period routing problem
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: A user's guide to tabu search
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Optimization by Simulated Annealing
cites work: An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
cites work: Bandwidth Packing: A Tabu Search Approach
cites work: A controlled search simulated annealing method for the single machine weighted tardiness problem
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
cites work: Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
cites work: Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems
cites work: Q3783826
cites work: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
cites work: Q3785827
full work available at URL: https://doi.org/10.1007/bf02601637
OpenAlex ID: W2014412090
description: scientific article; zbMATH DE number 910197