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. 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.
    2. 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.
    3. 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.
    4. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Gao, Shangce & Wang, Yirui & Cheng, Jiujun & Inazumi, Yasuhiro & Tang, Zheng, 2016. "Ant colony optimization with clustering for solving the dynamic location routing problem," Applied Mathematics and Computation, Elsevier, vol. 285(C), pages 149-173.
    10. Jose Gonzalez-Velarde & Salvador Garcia-Lumbreras & Alberto Garcia-Diaz, 2008. "A multi-stop routing problem," Annals of Operations Research, Springer, vol. 157(1), pages 153-167, January.
    11. Huasheng Liu & Yuqi Zhao & Jin Li & Yu Li & Xiaowen Li & Sha Yang, 2022. "A Two-Phase, Joint-Commuting Model for Primary and Secondary Schools Considering Parking Sharing," IJERPH, MDPI, vol. 19(11), pages 1-25, May.
    12. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
    13. Sina Abolhoseini & Ali Asghar Alesheikh, 2021. "Dynamic routing with ant system and memory-based decision-making process," Environment Systems and Decisions, Springer, vol. 41(2), pages 198-211, June.
    14. Cheung, Bernard K.-S. & Choy, K.L. & Li, Chung-Lun & Shi, Wenzhong & Tang, Jian, 2008. "Dynamic routing model and solution methods for fleet management with mobile technologies," International Journal of Production Economics, Elsevier, vol. 113(2), pages 694-705, June.
    15. Ellegood, William A. & Solomon, Stanislaus & North, Jeremy & Campbell, James F., 2020. "School bus routing problem: Contemporary trends and research directions," Omega, Elsevier, vol. 95(C).
    16. Ashraf Elazouni & Osama Salem, 2011. "Progress monitoring of construction projects using pattern recognition techniques," Construction Management and Economics, Taylor & Francis Journals, vol. 29(4), pages 355-370.
    17. Briseida Sarasola & Karl Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
    18. Ansari, Azadeh & Farrokhvar, Leily & Kamali, Behrooz, 2021. "Integrated student to school assignment and school bus routing problem for special needs students," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    19. N Wassan, 2007. "Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1630-1641, December.
    20. Mostafa Khatami & Seyed Hessameddin Zegordi, 2017. "Coordinative production and maintenance scheduling problem with flexible maintenance time intervals," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 857-867, April.

    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.