Improvement heuristics for the vehicle routing problem based on simulated annealing
type: Item
instance of: scholarly article
title: Improvement heuristics for the vehicle routing problem based on simulated annealing
zbMATH Open document ID: 0914.90107
DOI: 10.1016/0377-2217(94)00064-J
author: Alex Van Breedam
published in: European Journal of Operational Research
publication date: 1999-05-05T00:00:00Z
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 1175031
zbMATH Keywords: heuristics
zbMATH Keywords: vehicle routing
zbMATH Keywords: simulated annealing
describes a project that uses: Tabu search
describes a project that uses: VRP
MaRDI profile type: Publication
cites work: Parallel Savings Based Heuristics for the Delivery Problem
cites work: Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
cites work: Simulated Annealing – An Annotated Bibliography
cites work: An improved annealing scheme for the QAP
cites work: Simulated annealing: A tool for operational research
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A Heuristic Algorithm for the Vehicle-Dispatch Problem
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: A user's guide to tabu search
cites work: Using simulated annealing to solve routing and location problems
cites work: Cooling Schedules for Optimal Annealing
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: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: Q4003232
cites work: An efficient implementation of local search algorithms for constrained routing problems
cites work: Solving real-life vehicle routing problems efficiently using tabu search
cites work: Parallel iterative search methods for vehicle routing problems
cites work: Q3785827
full work available at URL: 0377-2217(94)00064-j
OpenAlex ID: W2074709462
Wikidata QID: Q127212310
Recommended article: Q4817406
Recommended article: Solving the truck and trailer routing problem based on a simulated annealing heuristic
Recommended article: Q4494449
Recommended article: Simulated annealing metaheuristics for the vehicle routing problem with time windows
Recommended article: Q3170975
Recommended article: An improved heuristic for the period vehicle routing problem
Recommended article: A simulated annealing heuristic for the capacitated green vehicle routing problem
Recommended article: A simulated annealing heuristic for the open location-routing problem
Recommended article: A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
description: scientific article; zbMATH DE number 1175031