IDEAS home Printed from https://ideas.repec.org/a/taf/conmgt/v25y2007i11p1127-1137.html
   My bibliography  Save this article

An integrated system for earthmoving planning

Author

Listed:
  • Chi Ming Tam
  • Thomas Tong
  • Bill Wong

Abstract

In earthmoving operations, there are a number of activities that need to be considered; for example, path identification, plant selection, assessing the compatibility of the paths and the plants so selected, cost and productivity comparison of alternatives, safety and environmental considerations, etc. The traditional approach to this problem by heuristic rules generated from the experience of planners cannot guarantee an optimal solution. Hence, a scientific method is proposed to automate the earthmoving planning by integrating: (1) a path-finding algorithm; (2) a plant selection system; (3) application of extenics theory to address the compatibility; and (4) the use of genetic algorithms to optimize the alternatives in terms of costs, productivity, safety and environmental considerations. The integrated system is illustrated step by step using a genuine construction project as an example. The result demonstrates the effectiveness of the system in automating the earthmoving planning exercise.

Suggested Citation

  • Chi Ming Tam & Thomas Tong & Bill Wong, 2007. "An integrated system for earthmoving planning," Construction Management and Economics, Taylor & Francis Journals, vol. 25(11), pages 1127-1137.
    • Handle: RePEc:taf:conmgt:v:25:y:2007:i:11:p:1127-1137
    DOI: 10.1080/01446190701468836
    as

    Download full text from publisher

    File URL: http://www.tandfonline.com/doi/abs/10.1080/01446190701468836
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01446190701468836?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. R. Navon & Y. Shpatnitsky, 2005. "A model for automated monitoring of road construction," Construction Management and Economics, Taylor & Francis Journals, vol. 23(9), pages 941-951.
    2. N A Wassan, 2006. "A reactive tabu search for the vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 111-116, January.
    3. R. Montemanni & L. M. Gambardella & A. E. Rizzoli & A. V. Donati, 2005. "Ant Colony System for a Dynamic Vehicle Routing Problem," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 327-343, December.
    4. J Pacheco & R Martí, 2006. "Tabu search for a multi-objective routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 29-37, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Burdett, R.L. & Kozan, E., 2014. "An integrated approach for earthwork allocation, sequencing and routing," European Journal of Operational Research, Elsevier, vol. 238(3), pages 741-759.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lars M. Hvattum & Arne Løkketangen & Gilbert Laporte, 2006. "Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic," Transportation Science, INFORMS, vol. 40(4), pages 421-438, November.
    2. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    3. Izdebski, Mariusz & Jacyna-Gołda, Ilona & Gołda, Paweł, 2022. "Minimisation of the probability of serious road accidents in the transport of dangerous goods," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    4. Nicolas Jozefowiez & Gilbert Laporte & Frédéric Semet, 2012. "A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 554-564, November.
    5. Fagui Liu & Lvshengbiao Wang & Mengke Gui & Yang Zhang & Yulin Lan & Chengqi Lai & Boyuan Zhu, 2023. "A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window," Journal of Heuristics, Springer, vol. 29(2), pages 269-311, June.
    6. Ellegood, William A. & Campbell, James F. & North, Jeremy, 2015. "Continuous approximation models for mixed load school bus routing," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 182-198.
    7. Cristián E. Cortés & Doris Sáez & Alfredo Núñez & Diego Muñoz-Carpintero, 2009. "Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 43(1), pages 27-42, February.
    8. Mariusz Izdebski & Marianna Jacyna, 2021. "An Efficient Hybrid Algorithm for Energy Expenditure Estimation for Electric Vehicles in Urban Service Enterprises," Energies, MDPI, vol. 14(7), pages 1-23, April.
    9. Bian, Zheyong & Liu, Xiang & Bai, Yun, 2020. "Mechanism design for on-demand first-mile ridesharing," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 77-117.
    10. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    11. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    12. Jie Zhang & Yifan Zhu & Tao Wang & Weiping Wang & Rui Wang & Xiaobo Li, 2022. "An Improved Intelligent Auction Mechanism for Emergency Material Delivery," Mathematics, MDPI, vol. 10(13), pages 1-30, June.
    13. Abdelkader Sbihi & Richard W. Eglese, 2007. "The Relationship between Vehicle Routing & Scheduling and Green Logistics - A Literature Survey," Working Papers hal-00644133, HAL.
    14. Jean-Charles Créput & Amir Hajjam & Abderrafiaa Koukam & Olivier Kuhn, 2012. "Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 437-458, November.
    15. Wang, Zhongxiang & Haghani, Ali, 2020. "Column generation-based stochastic school bell time and bus scheduling optimization," European Journal of Operational Research, Elsevier, vol. 286(3), pages 1087-1102.
    16. C Alabas-Uslu, 2008. "A self-tuning heuristic for a multi-objective vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 988-996, July.
    17. Schyns, M., 2015. "An ant colony system for responsive dynamic vehicle routing," European Journal of Operational Research, Elsevier, vol. 245(3), pages 704-718.
    18. D. G. N. D. Jayarathna, 2024. "Survey on Thirty Years of Vehicle Routing Problems: Mathematical Models, Solution Methods, and Real-Life Applications," International Journal of Research and Scientific Innovation, International Journal of Research and Scientific Innovation (IJRSI), vol. 11(7), pages 435-449, July.
    19. Fátima M. Souza Lima & Davi S. D. Pereira & Samuel V. Conceição & Ricardo S. Camargo, 2017. "A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads," 4OR, Springer, vol. 15(4), pages 359-386, December.
    20. Daqing Wu & Rong Yan & Hongtao Jin & Fengmao Cai, 2023. "An Adaptive Nutcracker Optimization Approach for Distribution of Fresh Agricultural Products with Dynamic Demands," Agriculture, MDPI, vol. 13(7), pages 1-21, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:conmgt:v:25:y:2007:i:11:p:1127-1137. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RCME20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.