Solving the shortest route cut and fill problem using simulated annealing-Reference-Cited by-同舟云学术

Solving the shortest route cut and fill problem using simulated annealing

Published:2003-02 Issue:1 Volume:145 Page:72-84
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

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

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference13 articles.

1. Local Search in Combinatorial Optimization;Aarts,1997

2. Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries;Anily;Naval Research Logistics,1999

3. The swapping problem;Anily;Networks,1992

4. Estimating and Bidding for Heavy Construction;Bartholomew,2000

5. P. Chalasani and R. Motwani, Approximating capacitated routing and delivery problems, Working Paper, Department of Computer Science, Stanford University, Palo Alto, CA, 1995

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dynamic Fleet Configuration Model for Optimizing Earthmoving Operations Using Mixed Integer Linear Programming;Journal of Construction Engineering and Management;2024-11

2. Review of factors affecting earthworks greenhouse gas emissions and fuel use;Renewable and Sustainable Energy Reviews;2024-04

3. Optimization Model for Earthwork Allocations Considering the Construction of Multiple Haul Roads: GIS-Based Integrated Approach;Journal of Construction Engineering and Management;2024-04

4. Reinforcement learning-based dynamic planning of cut and fill operations for earthwork optimization;Automation in Construction;2023-12

5. A Review of Alignment Optimization Research for Roads, Railways and Rail Transit Lines;IEEE Transactions on Intelligent Transportation Systems;2023-05