IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v292y2021i1p327-338.html
   My bibliography  Save this article

The traveling salesman puts-on a hard hat – Tower crane scheduling in construction projects

Author

Listed:
  • Tarhini, Hussein
  • Maddah, Bacel
  • Hamzeh, Farook

Abstract

Effective use of site equipment is an essential aspect of construction projects. In particular, tower cranes are critical in large scale projects. This research aims to optimize the cranes’ usage in construction projects by efficiently scheduling the sequence of activities that are processed by each crane on the site while addressing several constraints such as crane collisions and tasks precedence constraints. An integer linear program is developed that is based on the Multiple Travelling Salesmen Problem (MTSP). Two sets of valid inequalities have been added to improve the tractability of the model. This model is then tested on a real-world case study of a large construction site with two tower cranes. In addition, heuristic approaches are introduced to increase the tractability of the model and are compared to the integer program in terms of solution quality and computation time by generating a large data-set of problems with different sizes. The heuristics are based on the cluster-first, route-second idea, where an optimization-based clustering method is used to pre-assign activities to cranes.

Suggested Citation

  • Tarhini, Hussein & Maddah, Bacel & Hamzeh, Farook, 2021. "The traveling salesman puts-on a hard hat – Tower crane scheduling in construction projects," European Journal of Operational Research, Elsevier, vol. 292(1), pages 327-338.
    • Handle: RePEc:eee:ejores:v:292:y:2021:i:1:p:327-338
    DOI: 10.1016/j.ejor.2020.10.029
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172030905X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.10.029?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.

    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:eee:ejores:v:292:y:2021:i:1:p:327-338. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.