Solving the shortest route cut and fill problem using simulated annealing

DOI10.1016/S0377-2217(02)00206-0MaRDI QIDQ1869428zbMATH OpenFDO

Authors Darrall Henderson, Diane E. Vaughan, Ron R. Wakefield, E. C. Sewell, Sheldon H. Jacobson

Publication date 10 April 2003

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(02)00206-0

zbMATH Keywords

heuristicslocal search algorithmsshortest route problemsimulated annealingtraveling salesman problem

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Tabu search embedded simulated annealing for the shortest route cut and fill problem
• Using simulated annealing to solve routing and location problems
• A simulated annealing approach for the circular cutting problem
• An application of simulated annealing to the cutting stock problem
• Solving the shortest path problem on curved surfaces based on the simulated annealing algorithm
• Solution for the constrained Guillotine cutting problem by simulated annealing
• A simulated annealing algorithm for routing problems with fuzzy constrains
• scientific article; zbMATH DE number 2102229

Cites work

• Approximating Capacitated Routing and Delivery Problems
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1082099 (Why is no real title available?)
• Integer Programming Formulation of Traveling Salesman Problems
• Metaheuristics for a flexible assembly system design problem
• Simulated annealing: A tool for operational research
• The swapping problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Validation of subgradient optimization

Cited in

(4)

• Solution for the constrained Guillotine cutting problem by simulated annealing
• An integrated approach for earthwork allocation, sequencing and routing
• Models and algorithms to improve earthwork operations in road design using mixed integer linear programming
• Tabu search embedded simulated annealing for the shortest route cut and fill problem

This page was built for publication: Solving the shortest route cut and fill problem using simulated annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869428)