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

Grid-based construction site layout planning with Particle Swarm Optimisation and Travel Path Distance

Author

Listed:
  • Vacharapoom Benjaoran
  • Vachara Peansupap

Abstract

Many temporary facilities are required during on-site construction operations of most projects. They must be situated in convenient locations as ease of access can have a significant impact on the efficiency and safety of the construction project. The feasible locations and layouts that satisfy all specified conditions and constraints can still be very large in number; thus, optimal layout planning can be very challenging, even for experienced engineers. A model for solving the construction site layout problem (CSLP) is proposed. A grid system is implemented to simulate sites and facilities more realistically. This model incorporates an algorithm that imitates and calculates the distances of typical travel paths of workers between a pair of facilities during construction operations. In addition, Particle Swarm Optimisation is adopted to solve the problem model. The prototype program was developed and tested on a real construction project case. The results show that the model was able to lay out the site efficiently and optimally. The resulting layouts were better than those from engineers and conventional distance calculation methods.

Suggested Citation

  • Vacharapoom Benjaoran & Vachara Peansupap, 2020. "Grid-based construction site layout planning with Particle Swarm Optimisation and Travel Path Distance," Construction Management and Economics, Taylor & Francis Journals, vol. 38(8), pages 673-688, August.
    • Handle: RePEc:taf:conmgt:v:38:y:2020:i:8:p:673-688
    DOI: 10.1080/01446193.2019.1600708
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01446193.2019.1600708
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01446193.2019.1600708?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.

    More about this item

    Statistics

    Access and download statistics

    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:38:y:2020:i:8:p:673-688. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.