Solving the shortest route cut and fill problem using simulated annealing

DOI10.1016/S0377-2217(02)00206-0zbMath1012.90043MaRDI QIDQ1869428

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

Publication date: 10 April 2003

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

zbMATH Keywords

heuristicssimulated annealingtraveling salesman problemlocal search algorithmsshortest route problem

Mathematics Subject Classification ID

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

Related Items (2)

An integrated approach for earthwork allocation, sequencing and routing ⋮ Models and algorithms to improve earthwork operations in road design using mixed integer linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Simulated annealing: A tool for operational research
• Metaheuristics for a flexible assembly system design problem
• Integer Programming Formulation of Traveling Salesman Problems
• The swapping problem
• Approximating Capacitated Routing and Delivery Problems
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• Validation of subgradient optimization
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II

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