Show simple item record

contributor authorAli Mousaei
contributor authorHosein Taghaddos
contributor authorS. Marzieh Bagheri
contributor authorUlrich Hermann
date accessioned2022-02-01T21:46:18Z
date available2022-02-01T21:46:18Z
date issued11/1/2021
identifier other%28ASCE%29CO.1943-7862.0002157.pdf
identifier urihttp://yetl.yabesh.ir/yetl1/handle/yetl/4272001
description abstractPlanning lift activities of mobile cranes for a modular project can raise productivity and improve safety. An optimized lift plan is essential for multiple lifts due to high rental cost of heavy lift cranes. However, choosing among a large number of available lift options (e.g., types, configurations, and locations of cranes) to develop multilift plans can be challenging. Despite numerous efforts in this area, there is still room for improvement to enhance the optimality of solutions, which leads to considerable cost reduction. This paper introduces an integrated framework to automatically generate an optimum lift plan based on a predetermined lifting sequence. Dijkstra’s search algorithm is utilized in the current study to select each module’s optimum lift option. This study contributes to the body of knowledge by proposing an enhanced graph-based optimization algorithm for multiple concurrent heavy lift operations. The suggested framework is validated successfully in an actual modular construction project in Alberta, Canada. The results are also compared with the previously developed lift planning algorithms, showing a remarkable reduction in the project’s total cost.
publisherASCE
titleOptimizing Heavy Lift Plans for Industrial Construction Sites Using Dijkstra’s Algorithm
typeJournal Paper
journal volume147
journal issue11
journal titleJournal of Construction Engineering and Management
identifier doi10.1061/(ASCE)CO.1943-7862.0002157
journal fristpage04021160-1
journal lastpage04021160-16
page16
treeJournal of Construction Engineering and Management:;2021:;Volume ( 147 ):;issue: 011
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record