Solving the shortest route cut and fill problem using simulated annealing
type: Item
instance of: scholarly article
title: Solving the shortest route cut and fill problem using simulated annealing
zbMATH Open document ID: 1012.90043
DOI: 10.1016/S0377-2217(02)00206-0
author: Darrall Henderson
author: Diane E. Vaughan
author: Ron R. Wakefield
author: E. C. Sewell
author: Sheldon H. Jacobson
published in: European Journal of Operational Research
publication date: 2003-04-10T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1896761
zbMATH Keywords: heuristics
zbMATH Keywords: simulated annealing
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: local search algorithms
zbMATH Keywords: shortest route problem
MaRDI profile type: Publication
cites work: Q4365126
cites work: Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
cites work: The swapping problem
cites work: Approximating Capacitated Routing and Delivery Problems
cites work: Simulated annealing: A tool for operational research
cites work: Q4198056
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Validation of subgradient optimization
cites work: Metaheuristics for a flexible assembly system design problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
Recommended article: Tabu search embedded simulated annealing for the shortest route cut and fill problem
Recommended article: Using simulated annealing to solve routing and location problems
Recommended article: A simulated annealing approach for the circular cutting problem
Recommended article: An application of simulated annealing to the cutting stock problem
Recommended article: Solving the shortest path problem on curved surfaces based on the simulated annealing algorithm
Recommended article: Solution for the constrained Guillotine cutting problem by simulated annealing
Recommended article: A simulated annealing algorithm for routing problems with fuzzy constrains
Recommended article: Q4817406
description: scientific article; zbMATH DE number 1896761