Solving the shortest route cut and fill problem using simulated annealing

DOI10.1016/S0377-2217(02)00206-0zbMATH Open1012.90043MaRDI QIDQ1869428FDOQ1869428

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)

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

zbMATH Keywords

simulated annealingheuristicstraveling salesman problemlocal search algorithmsshortest route problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

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

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)