Path planning in construction sites: performance evaluation of the Dijkstra, A<sup>x</sup>, and GA search algorithms: Fid-Bau Portal

Fachinformationsdienst BAUdigital

A platform for research: civil engineering, architecture and urbanism

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

Soltani, A.R. / Tawfik, H. / Goulermas, J.Y. / Fernando, T.

We present the application of path planning in construction sites according to multiple objectives. It quantitatively evaluates the performance of three optimisation algorithms namely: Dijkstra, A^x, and genetic algorithms that are used to find multicriteria 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 multiobjective 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.

Access

Check availability in my library

Order at Subito €

Page navigation

Document information

Export, share and cite

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

Soltani, A.R. / Tawfik, H. / Goulermas, J.Y. / Fernando, T.

We present the application of path planning in construction sites according to multiple objectives. It quantitatively evaluates the performance of three optimisation algorithms namely: Dijkstra, A^x, and genetic algorithms that are used to find multicriteria 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 multiobjective 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.

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

Soltani, A.R. / Tawfik, H. / Goulermas, J.Y. / Fernando, T.

We present the application of path planning in construction sites according to multiple objectives. It quantitatively evaluates the performance of three optimisation algorithms namely: Dijkstra, A^x, and genetic algorithms that are used to find multicriteria 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 multiobjective 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.

Access

Check availability in my library

Order at Subito €

Page navigation

Document information

Export, share and cite

Document information

Title:

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

Contributors:

Soltani, A.R. (author) / Tawfik, H. (author) / Goulermas, J.Y. (author) / Fernando, T. (author)

Published in:

Advanced Engineering Informatics ; 16 ; 291-303

Publication date:

2002

Size:

13 Seiten, 48 Quellen

ISSN:

DOI:

https://doi.org/10.1016/S1474-0346(03)00018-1

Type of media:

Article (Journal)

Type of material:

Print

Language:

English

Keywords:

Berechnungskomplexität , Konstruktion , Methode des kritischen Weges , genetischer Algorithmus , Bahnplanung , Leistungsbewertung , Suchalgorithmus , Transport , Baustelle , Optimierungsalgorithmus

Similar titles

Dıjkstra Algorıthm Usıng Uav Path Plannıng ; Dıjkstra Algoritması Kullanılarak İha Yol Planlaması

Dhulkefl, Elaf / Durdu, Akif / Terzi̇oğlu, Hakan | BASE | 2020

Free access

Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms

Online Contents | 2013

Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms

Pradhan, A. / Mahinthakumar, G. | British Library Online Contents | 2013

Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms

Pradhan, Anu / Mahinthakumar, G. (Kumar) | ASCE | 2012

Modern welstandstoezicht - Interview met Tjeerd Dijkstra

Oosterman, Arjen | Online Contents | 1998