Path planning in construction sites: Performance evaluation of the dijkstra, a*, and GA search algorithms

Advanced Engineering Informatics

Volumn 16, Issue 4, 2002, Pages 291-303

  Soltani, A R ^a   Tawfik, H ^a   Goulermas, J Y ^a   Fernando, T ^a  

^a UNIVERSITY OF SALFORD   (United Kingdom)

Author keywords

Construction site; Multi criteria; Optimisation algorithms; Path finding

Indexed keywords

ACCIDENT PREVENTION; CONSTRUCTION INDUSTRY; COST ACCOUNTING; GENETIC ALGORITHMS; OPTIMIZATION; TRANSPORTATION;

SEARCH ALGORITHMS;

MOTION PLANNING;

EID: 0041427756     PISSN: 14740346     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1474-0346(03)00018-1     Document Type: Article

References (48)

1. Akinci B, Fischer M, Levitt R, Carlson B. Formalisation and automation of time-space conflict analysis. J Comput Civil Engng 2002;6(2):124-35.
2. Akkanen J, Nurminen JK. Case study of the evolution of routing algorithms in a network of planning tool. J Syst Software 2001;58: 181-98.
3. Barraquand J, Langlois B, Latombe J. Numerical potential field techniques for robot path planning. IEEE Trans Syst Man Cybernet 1992;22(2):224-41.
4. Benedikt ML. To take hold of space: isovists and isovists fields. Environ Plann 1979;B6:47-65.
5. Boroujerdi A, Uhlmann J. An efficient algorithm for computing least cost paths with turn constraints. Inform Process Lett 1998;67:317-21.
6. Charles SH, Kincho HL, Latombe J, Kunz J. A performance-based approach to wheelchair accessible route analysis. Adv Engng Inform 2002;36:53-75.
7. Chen M, Zalzala A. A genetic approach to motion planning of redundant mobile manipulator systems considering safety and configuration. J Robotic Syst 1997;14(7):529-44.
8. Cormen TH, Leiserson CE, Rivest RL. Introduction to algorithms. Massachusetts: McGraw-Hill; 1990.
9. Dijkstra EW. A note on two problems in connection with graphs. Numeriche Mathematik 1959;1:269-71.
10. Duxbury PM, Dorbin R. Greedy algorithms in disordered systems. Physica A 1999;270:263-9.
11. Elbeltagi E, Hegazy T, Hosny AD, Eldosouky A. Schedule-dependent evolution of site layout planning. Constr Manage Econ 2001;19: 689-97.
12. Fernando T, Kahkonen K, Leinonen J, Murray N, Tawfik H. Facilitation of collaborative communication for building construction with virtual reality technology. Conference on Applied Virtual Reality in Engineering and Construction Application, AVR II & CONVR, Gothenberg 2001; p. 1-17.
13. Garg DP, Kumar M. Optimisation techniques applied to multiple manipulators for path planning and torque minimisation. Engng Appl Artif Intell 2002;15:241-52.
14. Gen M, Chengh R, Oren SS. Network design techniques using adapted genetic algorithms. Adv Engng Software 2001;32:732-44.
15. Goldberg DE. Genetic algorithms in search, optimisation and machine learning. Reading, MA, USA: Addison-Wesley; 1989.
16. Hart PE, Nilsson NJ, Raphael B. Correction to 'A formal basis for the heuristic determination of minimum cost paths'. SIGART Newslett 1972;37:28-9.
17. Hassoun MH, Sanghvi AJ. Fast computation of optimal paths in two- and higher-dimension maps. Neural Netw 1989;3:355-6.
18. Health and Safety Executive, Safety of construction transport, A Survey of Standards and Accidents Associated with Construction Vehicle, UK.; 2001.
19. Holland J. Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press; 1975.
20. Hurley S, Moutinho L. Approximate algorithms for marketing management problems. J Retailing Consumer Serv 1996;3(3): 145-54.
21. Jung ES, Dohyung K. A man-machine interface model with improved visibility and reach functions. Comput Ind Engng 1996;30(3): 475-86.
22. Kei LS, Srikanthan T. Dynamic multicast routing in VLSI. Comput Commun 2000;23:1055-63.
23. Khoo L.P., Ng T.K. A genetic algorithm-based planning system for PCB component placement. Int J Prod Econ 1998;54:321-32.
24. Kolen AW, Kan AH, Trienekens HW. Vehicle routing with time windows. Oper Res 1987;35(2):199-204.
25. Lee S, Adams TM, Ryoo B. A fuzzy navigation system for mobile construction robots. Autom Constr 1997;6:97-107.
26. Li H, Love PED. Genetic search for solving construction site-level unequal-area facility layout problems. Autom Constr 2000;9: 197-215.
27. Li Z, Anson M, Li G. A procedure for quantitatively site layout alternatives. Constr Manage Econ 2001;19:459-67.
28. Lobo FG, Goldberg DE, Pelkian M. Time complexity of genetic algorithms on exponentially scaled problems. IlliGAL Report No. 2000015. Illinois Genetic Algorithm Laboratory, University of Illinois at Urbana-Champaign; 2000.
29. Mahjoubi L, Yang JL. An intelligent materials routing system on complex construction site. Logistics Inform Manage 2001;14(5/6): 337-43.
30. Mercedes Gomez-Albarran M, Fernandez-Pampilon-Cestors AM, Sanchez-Perez JM. A routing strategy based on generic algorithm. Microelectron J 1997;28(6-7):641-56.
31. Modesti P, Sciomachen A. A utility measure for finding multi-objective shortest path in urban transportation networks. Eur J Oper Res 1998;111:495-508.
32. Mustafa MA, Al-Bahar JF. Project risk assessment using the analytic hierarchy process. IEEE Trans Engng Manage 1991;38:46-52.
33. Neapolitan R, Naimipour K. Foundations of algorithms, 2nd ed. Massachusetts: Jones and Bartlett Publishers; 1998.
34. Perry JG, Hayes RW. Risk and its management in construction projects. Proceedings of Institution of Civil Engineers 1985:78(1):499-521.
35. Qu L, Xu G, WangG. Optimisation of the measuring path on a coordinate measuring machine using genetic algorithms. Measurements 1998;23:159-70.
36. Romeijn HE, Smith RL. Parallel algorithms for solving aggregated shortest path problems. Comput Oper Res 1999;26:941-53.
37. Russell S, NorvigP. Artificial intelligence: a modern approach. New Jersey: Prentice-Hall; 1995.
38. Sandurkar S, ChenW. GARPUS - genetic algorithms based pipe routing using tessellated objects. Comput Ind 1999;38:209-23.
39. Schalkoff RJ. Artificial intelligence: an engineering approach. Singapore: McGraw-Hill; 1990.
40. Seo KS, Lee YJ. Applicability of genetic algorithms to optimal evaluation of path predicates in object-oriented queries. Inform Process Lett 1996;58:123-8.
41. Solka JL, Perry JC, Poellinger BR, Rogers GW. Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints. Neurocomputing 1995;8:195-212.
42. Soltani AR, Tawfik H, FernandoT. A multi-criteria based path finding application for construction site layout. Sixth International Conference on Information Visualisation, London 2002;779-84.
43. Sung K, Bell MGH, Seong M, ParkS. Shortest paths in a network with time-dependent flow speeds. Eur J Oper Res 2000;121:23-39.
44. TakaokaT. Shortest path algorithms for nearly acyclic directed graphs. Theor Comput Sci 1998;203:143-50.
45. Tawfik H., Fernando T. A simulation environment for construction site planning. Fifth International Conference on Information Visualisation, London 2001;199-205.
46. Tawfik H, FernandoT. A parallel genetic algorithm for optimising construction site layouts. Applied simulation and modelling. Proceedings of the IASTED International Conference, Spain 2001;250-4.
47. Youssef H, Sadiq MS, AdicheH. Evolutionary algorithms, simulated annealing and tabu search: a comparative study. Engng Appl Artif Intell 2001;14:167-81.
48. Yu G, YangJ. On the robust shortest path problem. Comput Oper Res 1998;25(6):457-68.