A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Optimizing Heavy Lift Plans for Industrial Construction Sites Using Dijkstra’s Algorithm
Planning 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.
Optimizing Heavy Lift Plans for Industrial Construction Sites Using Dijkstra’s Algorithm
Planning 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.
Optimizing Heavy Lift Plans for Industrial Construction Sites Using Dijkstra’s Algorithm
Mousaei, Ali (author) / Taghaddos, Hosein (author) / Marzieh Bagheri, S. (author) / Hermann, Ulrich (author)
2021-09-15
Article (Journal)
Electronic Resource
Unknown
Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm
| DOAJ | 2016
Simulation-Based Multiple Heavy Lift Planning in Industrial Construction
| British Library Conference Proceedings | 2010