An integrated approach for earthwork allocation, sequencing and routing

DOI10.1016/J.EJOR.2014.04.036MaRDI QIDQ296873zbMATHOpenAlexFDO

Authors Robert Burdett, Erhan Kozan

Publication date 23 June 2016

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

Full work available at URL https://eprints.qut.edu.au/70486/1/masshaul_paper_4_2014_preprint.pdf

zbMATH Keywords

meta-heuristicsearthworksroad designterrain modelling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Recommendations

• Solving the shortest route cut and fill problem using simulated annealing
• A two-stage optimizing method for earth-rock allocation based on improved VIKOR
• Spline technique for modeling roadway profile to minimize earthwork cost
• Dynamic optimization algorithm for vertical alignment of highways
• Optimum ramp design in open pit mines

Cites work

• A classification of formulations for the (time-dependent) traveling salesman problem
• A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
• A mathematical programming viewpoint for solving the ultimate pit problem
• A sequencing approach for creating new train timetables
• A sliding time window heuristic for open pit mine block sequencing
• An application of branch and cut to open pit mine scheduling
• Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
• LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
• Models and algorithms to improve earthwork operations in road design using mixed integer linear programming
• Network flows. Theory, algorithms, and applications.
• Solving LP relaxations of large-scale precedence constrained problems
• Solving the shortest route cut and fill problem using simulated annealing
• Tabu search embedded simulated annealing for the shortest route cut and fill problem
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The new Fundamental Tree Algorithm for production scheduling of open pit mines
• The time dependent traveling salesman problem: polyhedra and algorithm

Cited in

(10)

• Stockpile scheduling with geometry constraints in dry bulk terminals
• A two-stage optimizing method for earth-rock allocation based on improved VIKOR
• A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction
• scientific article; zbMATH DE number 2006562 (Why is no real title available?)
• A generalized constructive algorithm using insertion-based heuristics
• scientific article; zbMATH DE number 2006563 (Why is no real title available?)
• Multi-objective models and techniques for analysing the absolute capacity of railway networks
• Optimisation models for expanding a railway's theoretical capacity
• A flexible job shop scheduling approach with operators for coal export terminals
• Optimizing horizontal alignment of roads in a specified corridor

This page was built for publication: An integrated approach for earthwork allocation, sequencing and routing

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