{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:50:08Z","timestamp":1773514208813,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T00:00:00Z","timestamp":1214438400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fuzzy Optim Decis Making"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s10700-008-9035-0","type":"journal-article","created":{"date-parts":[[2008,6,25]],"date-time":"2008-06-25T15:12:15Z","timestamp":1214406735000},"page":"257-267","source":"Crossref","is-referenced-by-count":119,"title":["Multiple UAVs path planning algorithms: a comparative study"],"prefix":"10.1007","volume":"7","author":[{"given":"B. Moses","family":"Sathyaraj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. C.","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Finn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Drake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,26]]},"reference":[{"key":"9035_CR1","doi-asserted-by":"crossref","unstructured":"Cavendish, D., & Gerla, M. (1998). Internet QoS routing using the Bellman-Ford algorithm. In International Conference on High Performance Networking (HPN\u201998).","DOI":"10.1007\/978-0-387-35388-3_37"},{"key":"9035_CR2","unstructured":"Chabini, I., & Ganupati, S. (2001). Design and implementation of parallel dynamic shortest path algorithms for intelligent transportation systems applications, Transportation Research Record No. 1771. Washington, DC: National Academy Press."},{"issue":"2","key":"9035_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"B.V. Cherkassky","year":"1996","unstructured":"Cherkassky B.V., Goldberg A.V., Radzik T. (1996) Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming 73(2): 129\u2013174","journal-title":"Mathematical Programming"},{"key":"9035_CR4","first-page":"82","volume":"1","author":"Z. Cvetanovic","year":"1990","unstructured":"Cvetanovic Z., Nofsinger C. (1990) Parallel Astar search on message-passing architectures. IEEE Computer Society 1: 82\u201390","journal-title":"IEEE Computer Society"},{"key":"9035_CR5","unstructured":"Finn, A., Kabacinski, K., & Drake, S. P. (2007). Design challenges for an autonomous cooperative of UAV\u2019s. Defence Science & Technology Organisation, Department of Defence, Australia, IDC 2007."},{"key":"9035_CR6","unstructured":"Fu, L. (1996). Real-time vehicle routing and scheduling in dynamic and stochastic traffic networks. Unpublished Ph.D. Dissertation, University of Alberta, Edmonton, Alberta."},{"key":"9035_CR7","first-page":"227","volume-title":"Transportation planning models","author":"G. Gallo","year":"1984","unstructured":"Gallo G., Pallottino S. (1984). Shortest path methods. In: Florian M. (eds). Transportation planning models. Amsterdam, Elsevier Science Publishers, pp. 227\u2013256"},{"key":"9035_CR8","unstructured":"Gayraud, T., & Authie, G. (1992). A parallel algorithm for the all pairs shortest path problem. In Proceedings of the International Conference on Parallel Computing."},{"issue":"2","key":"9035_CR9","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"E.P. Hart","year":"1968","unstructured":"Hart E.P., Nilsson N.J., Raphael B. (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Transaction, System Science and Cybernetics, SSC- 4(2): 100\u2013107","journal-title":"IEEE Transaction, System Science and Cybernetics, SSC-"},{"issue":"6","key":"9035_CR10","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0305-0548(88)90052-4","volume":"15","author":"S.M. Hung","year":"1988","unstructured":"Hung S.M., Divoky J.J. (1988) A computational study of efficient shortest path algorithms. Computers and Operations Research 15(6): 567\u2013576","journal-title":"Computers and Operations Research"},{"key":"9035_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/347792.347814","volume":"4","author":"R. Jacob","year":"1999","unstructured":"Jacob R., Marathe M., Nagel K. (1999) A computational study of routing algorithms for realistic transportation networks. Journal of Experimental Algorithmics 4: 1\u201319","journal-title":"Journal of Experimental Algorithmics"},{"key":"9035_CR12","first-page":"819","volume":"39","author":"W.-W. Li","year":"2005","unstructured":"Li W.-W. (2005) New trends in route guidance algorithm research of intelligent transportation system. Journal of Zhejiang University 39: 819\u2013824","journal-title":"Journal of Zhejiang University"},{"key":"9035_CR13","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1109\/TSMCC.2002.801727","volume":"32","author":"J.J. Murray","year":"2002","unstructured":"Murray J.J., Cox C.J., Lendaris G.G., Saeks R. (2002) Adaptive dynamic programming. IEEE Transactions on Systems, Man and Cybernetics 32: 140\u2013153","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"9035_CR14","volume-title":"Human problem solving","author":"A. Newell","year":"1972","unstructured":"Newell, A., & Simon, H. A. (1972). Human problem solving. Englewood Cliffs, NJ: Prentice-Hall."},{"key":"9035_CR15","volume-title":"Problem-solving methods in artificial intelligence","author":"J.N. Nilsson","year":"1971","unstructured":"Nilsson J.N. (1971) Problem-solving methods in artificial intelligence. McGraw-Hill, NewYork"},{"key":"9035_CR16","unstructured":"Pearl, J. (1984). Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley Publishing Company."},{"key":"9035_CR17","doi-asserted-by":"crossref","unstructured":"Royer, E. M., & Toh, C.-K. (1999). A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications Magazine, April 1999, 46\u201355.","DOI":"10.1109\/98.760423"},{"key":"9035_CR18","unstructured":"Sathyaraj, B., Chellappa Doss, R. (2005). Route maintenance using mobility prediction for mobile ad hoc networks. IEEE international conference: Mobile adhoc and sensor systems conference, MASS 2005."},{"key":"9035_CR19","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/s11771-006-0111-8","volume":"13","author":"G.-Z. Tan","year":"2006","unstructured":"Tan G.-Z., He H., Sloman A. (2006) Global optimal path planning for mobile robot based on improved Dijkstra algorithm and ant system algorithm. Journal of Central South University of Technology 13: 80\u201386","journal-title":"Journal of Central South University of Technology"},{"key":"9035_CR20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1080\/03081068808717360","volume":"12","author":"V.T. Vuren","year":"1988","unstructured":"Vuren V.T., Jansen G.R.M. (1988) Recent developments in path finding algorithms: A review. Transportation Planning and Technology 12: 57\u201371","journal-title":"Transportation Planning and Technology"},{"issue":"1","key":"9035_CR21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/trsc.32.1.65","volume":"32","author":"F.B. Zhan","year":"1998","unstructured":"Zhan F.B., Noon C.E. (1998) Shortest path algorithms: An evaluation using real road networks. Transportation Science, 32(1): 65\u201373","journal-title":"Transportation Science"}],"container-title":["Fuzzy Optimization and Decision Making"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10700-008-9035-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10700-008-9035-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10700-008-9035-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:01:14Z","timestamp":1559239274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10700-008-9035-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,26]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["9035"],"URL":"https:\/\/doi.org\/10.1007\/s10700-008-9035-0","relation":{},"ISSN":["1568-4539","1573-2908"],"issn-type":[{"value":"1568-4539","type":"print"},{"value":"1573-2908","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,26]]}}}