IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v97y2020ics0305048319300866.html
   My bibliography  Save this article

Covering polygons with discs: The problem of crane selection and location on construction sites

Author

Listed:
  • Briskorn, Dirk
  • Dienstknecht, Michael

Abstract

Cranes are a key element in construction projects as they are the primary lifting equipment and among the most expensive construction equipment. Thus, crane selection and location are important factors for a construction project’s operational and economic success. In this research, we focus on a site with supply and demand areas that have to be connected by tower cranes. There are several tower crane models differing in certain specifications such as costs or operating radius. The objective is to select cranes and determine their locations so that each demand area is connected to its supply area at minimum cost. We detail the problem setting and show how to obtain a discrete set of candidate locations for each crane model without losing optimality. This discretization allows us to reduce our problem to the classic set cover problem. Despite its NP-hardness, instances of considerable size can be solved to optimality within reasonable computing time using a standard solver. In an extensive computational study, we analyze the performance of the proposed approach in terms of solution quality, computation times, and drivers of computational effort.

Suggested Citation

  • Briskorn, Dirk & Dienstknecht, Michael, 2020. "Covering polygons with discs: The problem of crane selection and location on construction sites," Omega, Elsevier, vol. 97(C).
    • Handle: RePEc:eee:jomega:v:97:y:2020:i:c:s0305048319300866
    DOI: 10.1016/j.omega.2019.102114
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048319300866
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2019.102114?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. Briskorn, Dirk & Dienstknecht, Michael, 2019. "Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference," European Journal of Operational Research, Elsevier, vol. 273(1), pages 160-174.
    2. Y. Stoyan & V. Patsuk, 2010. "Covering a compact polygonal set by identical circles," Computational Optimization and Applications, Springer, vol. 46(1), pages 75-92, May.
    3. Anil Sawhney & Andre Mund, 2001. "IntelliCranes: an integrated crane type and model selection system," Construction Management and Economics, Taylor & Francis Journals, vol. 19(2), pages 227-237.
    4. Chen Liao & Shiyan Hu, 2010. "Polynomial time approximation schemes for minimum disk cover problems," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 399-412, November.
    5. Murray, Alan T. & Wei, Ran, 2013. "A computational approach for eliminating error in the solution of the location set covering problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 52-64.
    6. Balázs Bánhelyi & Endre Palatinus & Balázs Lévai, 2015. "Optimal circle covering problems and their applications," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 815-832, December.
    7. C. M. Tam & Thomas Tong, 2003. "GA-ANN model for optimizing the locations of tower crane and supply points for high-rise public housing construction," Construction Management and Economics, Taylor & Francis Journals, vol. 21(3), pages 257-266.
    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. Pelegrín, Mercedes & Xu, Liding, 2023. "Continuous covering on networks: Improved mixed integer programming formulations," Omega, Elsevier, vol. 117(C).
    2. Michael Dienstknecht, 2023. "A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference," 4OR, Springer, vol. 21(1), pages 105-123, March.

    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. Alan T. Murray, 2017. "Regional analytics," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 59(1), pages 1-13, July.
    2. Botond Bertók & Tibor Csendes & Tibor Illés, 2015. "Editorial," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 811-813, December.
    3. Sadeghi, Mohammad & Yaghoubi, Saeed, 2024. "Optimization models for cloud seeding network design and operations," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1146-1167.
    4. Hu, Xiaoxuan & Zhu, Waiming & Ma, Huawei & An, Bo & Zhi, Yanling & Wu, Yi, 2021. "Orientational variable-length strip covering problem: A branch-and-price-based algorithm," European Journal of Operational Research, Elsevier, vol. 289(1), pages 254-269.
    5. Matjaž Hozjan & Uroš Klanšek, 2023. "Optimal Positioning of Mobile Cranes on Construction Sites Using Nonlinear Programming with Discontinuous Derivatives," Sustainability, MDPI, vol. 15(24), pages 1-19, December.
    6. K. C. Lam & C. M. Tang & W. C. Lee, 2005. "Application of the entropy technique and genetic algorithms to construction site layout planning of medium-size projects," Construction Management and Economics, Taylor & Francis Journals, vol. 23(2), pages 127-145.
    7. Ran Wei, 2016. "Coverage Location Models," International Regional Science Review, , vol. 39(1), pages 48-76, January.
    8. Muren, & Li, Hao & Mukhopadhyay, Samar K. & Wu, Jian-jun & Zhou, Li & Du, Zhiping, 2020. "Balanced maximal covering location problem and its application in bike-sharing," International Journal of Production Economics, Elsevier, vol. 223(C).
    9. Murray, Alan T. & Feng, Xin, 2016. "Public street lighting service standard assessment and achievement," Socio-Economic Planning Sciences, Elsevier, vol. 53(C), pages 14-22.
    10. Michael Dienstknecht, 2023. "A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference," 4OR, Springer, vol. 21(1), pages 105-123, March.
    11. Elshaikh, Abdalla & Salhi, Said & Nagy, Gábor, 2015. "The continuous p-centre problem: An investigation into variable neighbourhood search with memory," European Journal of Operational Research, Elsevier, vol. 241(3), pages 606-621.
    12. Xuefeng Zhao & Haodong Chen & Jing Liu & Jiaqi Liu & Meng Zhang & Yibing Tao & Junbo Li & Xuyang Wang, 2023. "Research on Full-Element and Multi-Time-Scale Modeling Method of BIM for Lean Construction," Sustainability, MDPI, vol. 15(17), pages 1-17, August.
    13. Ran Wei & Alan Murray & Rajan Batta, 2014. "A bounding-based solution approach for the continuous arc covering problem," Journal of Geographical Systems, Springer, vol. 16(2), pages 161-182, April.
    14. Pém Attila & Mályusz Levente, 2016. "Arrangement of material depots for line segment– modeled structures using continuous conditions," Organization, Technology and Management in Construction, Sciendo, vol. 8(1), pages 1518-1527, December.
    15. Yusuf Kuvvetli, 2023. "A goal programming model for two-stage COVID19 test sampling centers location-allocation problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(1), pages 1-20, March.
    16. Huanfa Chen & Alan T. Murray & Rui Jiang, 2021. "Open-source approaches for location cover models: capabilities and efficiency," Journal of Geographical Systems, Springer, vol. 23(3), pages 361-380, 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:eee:jomega:v:97:y:2020:i:c:s0305048319300866. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.