Path planning in construction sites: performance evaluation of the Dijkstra, A*, and GA search algorithms

Path planning in construction sites: performance evaluation of the Dijkstra, A*, and GA search algorithms

0.00 Avg rating0 Votes
Article ID: iaor20071862
Country: Netherlands
Volume: 16
Issue: 4
Start Page Number: 291
End Page Number: 303
Publication Date: Oct 2002
Journal: Advanced Engineering Informatics
Authors: , , ,
Keywords: networks: flow
Abstract:

This paper presents the application of path planning in construction sites according to multiple objectives. It quantitatively evaluates the performance of three optimisation algorithms namely: Dijkstra, A*, and Genetic algorithms that are used to find multi-criteria paths in construction sites based on transportation and safety-related cost. During a construction project, site planners need to select paths for site operatives and vehicles, which are characterised by short distance, low risks and high visibility. These path evaluation criteria are combined using a multi-objective approach. The criteria can be optimised to present site planners with the shortest path, the safest path, the most visible path or a path that reflects a combination of short distance, low risk and high visibility. The accuracy of the path solutions and the time complexities of the optimisation algorithms are compared and critically analysed.

Reviews

Required fields are marked *. Your email address will not be published.