{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T04:49:37Z","timestamp":1782794977767,"version":"3.54.5"},"reference-count":48,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Advanced Engineering Informatics"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s1474-0346(03)00018-1","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T15:31:06Z","timestamp":1060702266000},"page":"291-303","source":"Crossref","is-referenced-by-count":235,"title":["Path planning in construction sites: performance evaluation of the Dijkstra, A\u2217, and GA search algorithms"],"prefix":"10.1016","volume":"16","author":[{"given":"A.R.","family":"Soltani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H.","family":"Tawfik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.Y.","family":"Goulermas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T.","family":"Fernando","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S1474-0346(03)00018-1_BIB1","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1061\/(ASCE)0887-3801(2002)16:2(124)","article-title":"Formalisation and automation of time-space conflict analysis","volume":"6","author":"Akinci","year":"2002","journal-title":"J Comput Civil Engng"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0164-1212(01)00037-1","article-title":"Case study of the evolution of routing algorithms in a network of planning tool","volume":"58","author":"Akkanen","year":"2001","journal-title":"J Syst Software"},{"issue":"2","key":"10.1016\/S1474-0346(03)00018-1_BIB3","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/21.148426","article-title":"Numerical potential field techniques for robot path planning","volume":"22","author":"Barraquand","year":"1992","journal-title":"IEEE Trans Syst Man Cybernet"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1068\/b060047","article-title":"To take hold of space: isovists and isovists fields","volume":"B6","author":"Benedikt","year":"1979","journal-title":"Environ Plann"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB5","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0020-0190(98)00134-3","article-title":"An efficient algorithm for computing least cost paths with turn constraints","volume":"67","author":"Boroujerdi","year":"1998","journal-title":"Inform Process Lett"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB6","first-page":"53","article-title":"A performance-based approach to wheelchair accessible route analysis","volume":"36","author":"Charles","year":"2002","journal-title":"Adv Engng Inform"},{"issue":"7","key":"10.1016\/S1474-0346(03)00018-1_BIB7","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1002\/(SICI)1097-4563(199707)14:7<529::AID-ROB2>3.0.CO;2-P","article-title":"A genetic approach to motion planning of redundant mobile manipulator systems considering safety and configuration","volume":"14","author":"Chen","year":"1997","journal-title":"J Robotic Syst"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB8","series-title":"Introduction to algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numeriche Mathematik"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0378-4371(99)00132-6","article-title":"Greedy algorithms in disordered systems","volume":"270","author":"Duxbury","year":"1999","journal-title":"Physica A"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB11","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1080\/01446190110066713","article-title":"Schedule-dependent evolution of site layout planning","volume":"19","author":"Elbeltagi","year":"2001","journal-title":"Constr Manage Econ"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB12","article-title":"Facilitation of collaborative communication for building construction with virtual reality technology","author":"Fernando","year":"2001","journal-title":"Conference on Applied Virtual Reality in Engineering and Construction Application, AVR II & CONVR, Gothenberg"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB13","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0952-1976(02)00067-2","article-title":"Optimisation techniques applied to multiple manipulators for path planning and torque minimisation","volume":"15","author":"Garg","year":"2002","journal-title":"Engng Appl Artif Intell"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB14","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1016\/S0965-9978(01)00007-2","article-title":"Network design techniques using adapted genetic algorithms","volume":"32","author":"Gen","year":"2001","journal-title":"Adv Engng Software"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB15","series-title":"Genetic algorithms in search, optimisation and machine learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB16","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1056777.1056779","article-title":"Correction to \u2018A formal basis for the heuristic determination of minimum cost paths\u2019","volume":"37","author":"Hart","year":"1972","journal-title":"SIGART Newslett"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB17","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0893-6080(90)90078-Y","article-title":"Fast computation of optimal paths in two- and higher-dimension maps","volume":"3","author":"Hassoun","year":"1989","journal-title":"Neural Netw"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB18","series-title":"Safety of construction transport, A Survey of Standards and Accidents Associated with Construction Vehicle, UK","year":"2001"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB19","series-title":"Adaptation in natural and artificial systems","author":"Holland","year":"1975"},{"issue":"3","key":"10.1016\/S1474-0346(03)00018-1_BIB20","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0969-6989(95)00067-4","article-title":"Approximate algorithms for marketing management problems","volume":"3","author":"Hurley","year":"1996","journal-title":"J Retailing Consumer Serv"},{"issue":"3","key":"10.1016\/S1474-0346(03)00018-1_BIB21","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/0360-8352(96)00019-8","article-title":"A man-machine interface model with improved visibility and reach functions","volume":"30","author":"Jung","year":"1996","journal-title":"Comput Ind Engng"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB22","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1016\/S0140-3664(00)00170-5","article-title":"Dynamic multicast routing in VLSI","volume":"23","author":"Kei","year":"2000","journal-title":"Comput Commun"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB23","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0925-5273(98)00010-3","article-title":"A genetic algorithm-based planning system for PCB component placement","volume":"54","author":"Khoo","year":"1998","journal-title":"Int J Prod Econ"},{"issue":"2","key":"10.1016\/S1474-0346(03)00018-1_BIB24","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1287\/opre.35.2.266","article-title":"Vehicle routing with time windows","volume":"35","author":"Kolen","year":"1987","journal-title":"Oper Res"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB25","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0926-5805(96)00185-9","article-title":"A fuzzy navigation system for mobile construction robots","volume":"6","author":"Lee","year":"1997","journal-title":"Autom Constr"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB26","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0926-5805(99)00006-0","article-title":"Genetic search for solving construction site-level unequal-area facility layout problems","volume":"9","author":"Li","year":"2000","journal-title":"Autom Constr"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB27","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1080\/01446193.2001.9709622","article-title":"A procedure for quantitatively site layout alternatives","volume":"19","author":"Li","year":"2001","journal-title":"Constr Manage Econ"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB28","series-title":"IlliGAL Report No. 2000015","article-title":"Time complexity of genetic algorithms on exponentially scaled problems","author":"Lobo","year":"2000"},{"issue":"5\/6","key":"10.1016\/S1474-0346(03)00018-1_BIB29","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1108\/09576050110404422","article-title":"An intelligent materials routing system on complex construction site","volume":"14","author":"Mahjoubi","year":"2001","journal-title":"Logistics Inform Manage"},{"issue":"6\u20137","key":"10.1016\/S1474-0346(03)00018-1_BIB30","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0026-2692(96)00150-4","article-title":"A routing strategy based on genetic algorithm","volume":"28","author":"Mercedes Gomez-Albarran","year":"1997","journal-title":"Microelectron J"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB31","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/S0377-2217(97)00376-7","article-title":"A utility measure for finding multi-objective shortest path in urban transportation networks","volume":"111","author":"Modesti","year":"1998","journal-title":"Eur J Oper Res"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB32","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/17.65759","article-title":"Project risk assessment using the analytic hierarchy process","volume":"38","author":"Mustafa","year":"1991","journal-title":"IEEE Trans Engng Manage"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB33","series-title":"Foundations of algorithms","author":"Neapolitan","year":"1998"},{"issue":"1","key":"10.1016\/S1474-0346(03)00018-1_BIB34","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1680\/iicep.1985.859","article-title":"Risk and its management in construction projects","volume":"78","author":"Perry","year":"1985","journal-title":"Proceedings of Institution of Civil Engineers"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB35","first-page":"159","article-title":"Optimisation of the measuring path on a coordinate measuring machine using genetic algorithms","volume":"23","author":"Qu","year":"1998","journal-title":"Measurements"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB36","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1016\/S0305-0548(99)00029-5","article-title":"Parallel algorithms for solving aggregated shortest path problems","volume":"26","author":"Romeijn","year":"1999","journal-title":"Comput Oper Res"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB37","series-title":"Artificial intelligence: a modern approach","author":"Russell","year":"1995"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB38","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0166-3615(98)00130-4","article-title":"GARPUS\u2014genetic algorithms based pipe routing using tessellated objects","volume":"38","author":"Sandurkar","year":"1999","journal-title":"Comput Ind"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB39","series-title":"Artificial intelligence: an engineering approach","author":"Schalkoff","year":"1990"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB40","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(96)00036-1","article-title":"Applicability of genetic algorithms to optimal evaluation of path predicates in object-oriented queries","volume":"58","author":"Seo","year":"1996","journal-title":"Inform Process Lett"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB41","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0925-2312(94)00018-N","article-title":"Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints","volume":"8","author":"Solka","year":"1995","journal-title":"Neurocomputing"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB42","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1109\/IV.2002.1028868","article-title":"A multi-criteria based path finding application for construction site layout","author":"Soltani","year":"2002","journal-title":"Sixth International Conference on Information Visualisation, London"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB43","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0377-2217(99)00035-1","article-title":"Shortest paths in a network with time-dependent flow speeds","volume":"121","author":"Sung","year":"2000","journal-title":"Eur J Oper Res"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB44","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0304-3975(97)00292-2","article-title":"Shortest path algorithms for nearly acyclic directed graphs","volume":"203","author":"Takaoka","year":"1998","journal-title":"Theor Comput Sci"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB45","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/IV.2001.942059","article-title":"A simulation environment for construction site planning","author":"Tawfik","year":"2001","journal-title":"Fifth International Conference on Information Visualisation, London"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB46","first-page":"250","article-title":"A parallel genetic algorithm for optimising construction site layouts. Applied simulation and modelling","author":"Tawfik","year":"2001","journal-title":"Proceedings of the IASTED International Conference, Spain"},{"key":"10.1016\/S1474-0346(03)00018-1_BIB47","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0952-1976(00)00065-8","article-title":"Evolutionary algorithms, simulated annealing and tabu search: a comparative study","volume":"14","author":"Youssef","year":"2001","journal-title":"Engng Appl Artif Intell"},{"issue":"6","key":"10.1016\/S1474-0346(03)00018-1_BIB48","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0305-0548(97)00085-3","article-title":"On the robust shortest path problem","volume":"25","author":"Yu","year":"1998","journal-title":"Comput Oper Res"}],"container-title":["Advanced Engineering Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1474034603000181?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1474034603000181?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T20:31:36Z","timestamp":1552595496000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1474034603000181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S1474034603000181"],"URL":"https:\/\/doi.org\/10.1016\/s1474-0346(03)00018-1","relation":{},"ISSN":["1474-0346"],"issn-type":[{"value":"1474-0346","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}