An integrated approach for earthwork allocation, sequencing and routing
DOI10.1016/J.EJOR.2014.04.036zbMATH Open1338.90228OpenAlexW2037421132MaRDI QIDQ296873FDOQ296873
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
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
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)
Cites Work
- Network flows. Theory, algorithms, and applications.
- A classification of formulations for the (time-dependent) traveling salesman problem
- An application of branch and cut to open pit mine scheduling
- Solving LP relaxations of large-scale precedence constrained problems
- A mathematical programming viewpoint for solving the ultimate pit problem
- Solving the shortest route cut and fill problem using simulated annealing
- A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
- The time dependent traveling salesman problem: polyhedra and algorithm
- A sequencing approach for creating new train timetables
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- 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
- A sliding time window heuristic for open pit mine block sequencing
- The new Fundamental Tree Algorithm for production scheduling of open pit mines
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
Cited In (10)
- A flexible job shop scheduling approach with operators for coal export terminals
- A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction
- Title not available (Why is that?)
- Multi-objective models and techniques for analysing the absolute capacity of railway networks
- Optimisation models for expanding a railway's theoretical capacity
- Optimizing horizontal alignment of roads in a specified corridor
- A two-stage optimizing method for earth-rock allocation based on improved VIKOR
- Stockpile scheduling with geometry constraints in dry bulk terminals
- A generalized constructive algorithm using insertion-based heuristics
- Title not available (Why is that?)
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)
