Tabu search embedded simulated annealing for the shortest route cut and fill problem
From MaRDI portal
Publication:5318358
DOI10.1057/palgrave.jors.2601900zbMath1084.90037OpenAlexW2076831888MaRDI QIDQ5318358
No author found.
Publication date: 26 September 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601900
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
An integrated approach for earthwork allocation, sequencing and routing ⋮ A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem ⋮ Models and algorithms to improve earthwork operations in road design using mixed integer linear programming
This page was built for publication: Tabu search embedded simulated annealing for the shortest route cut and fill problem
