{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T09:57:35Z","timestamp":1775210255162,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T00:00:00Z","timestamp":1194307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s00500-007-0264-x","type":"journal-article","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T12:07:27Z","timestamp":1194264447000},"page":"981-994","source":"Crossref","is-referenced-by-count":66,"title":["Hybrid ant colony algorithms for path planning in sparse graphs"],"prefix":"10.1007","volume":"12","author":[{"given":"Kwee Kim","family":"Lim","sequence":"first","affiliation":[]},{"given":"Yew-Soon","family":"Ong","sequence":"additional","affiliation":[]},{"given":"Meng Hiot","family":"Lim","sequence":"additional","affiliation":[]},{"given":"Xianshun","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Agarwal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,6]]},"reference":[{"key":"264_CR1","unstructured":"Agarwal A, Lim MH, Xu YL, Ong YS (2003) Evolutionary graph mining for the discovery of site visitation sequences for a single URAV. 2nd International conference on computational intelligence, robotics and autonomous systems, 2003"},{"key":"264_CR2","volume-title":"Model-solution framework for minimal risk planning for URAVs. Military and security applications of evolutionary computation workshop","author":"A Agarwal","year":"2004","unstructured":"Agarwal A, Lim MH and Er MJ (2004a). Model-solution framework for minimal risk planning for URAVs. Military and security applications of evolutionary computation workshop. GECCO, Seattle, USA"},{"key":"264_CR3","doi-asserted-by":"crossref","unstructured":"Agarwal A, Lim MH, Chew CY, Poo TK, Er MJ, Leong YK (2004b) Solution to the fixed airbase problem for autonomous URAV site visitation sequencing. In: Proceedings of genetic and evolutionary computation conference, Seattle, vol 2, USA, pp 850\u2013858","DOI":"10.1007\/978-3-540-24855-2_99"},{"key":"264_CR4","doi-asserted-by":"crossref","unstructured":"Agarwal A, Lim MH, Er MJ, Maung YWK (2004c) Inflight rerouting for an unmanned aerial vehicle. In: Proceedings of genetic and evolutionary computation conference, Seattle, vol 2, USA, pp 859\u2013868","DOI":"10.1007\/978-3-540-24855-2_100"},{"issue":"1\u20132","key":"264_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1163\/156855307779293698","volume":"21","author":"A Agarwal","year":"2007","unstructured":"Agarwal A, Lim MH, Er MJ and Nguyen TN (2007). Rectilinear workspace partitioning for parallel coverage using multiple UAVs. Adv Robot 21(1\u20132): 105\u2013120","journal-title":"Adv Robot"},{"key":"264_CR6","volume-title":"MetaHeuristics: advances and trends in local search paradigms for optimization","author":"B Bullnheimer","year":"1999","unstructured":"Bullnheimer B, Hartl RF and Strauss C (1999). Applying the ant system to the vehicle routing problem. In: Voss, S, Martello, S, Osman, IH, and Roucairol, C (eds) MetaHeuristics: advances and trends in local search paradigms for optimization, Kluwer, Boston"},{"key":"264_CR7","first-page":"315","volume-title":"Combinatorial optimization","author":"N Christofides","year":"1979","unstructured":"Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides, N, Mingozzi, A, Toth, P, and Sandi, C (eds) Combinatorial optimization, pp 315\u2013338. Wiley, Chichester"},{"issue":"2","key":"264_CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1080\/03052150210918","volume":"34","author":"CAC Coello","year":"2002","unstructured":"Coello CAC, Guti\u00e8rrez RLZ, Garc\u00eda BM and Aguirre AH (2002). Automated design of combinational logic circuits using the ant system. Eng Optim 34(2): 109\u2013127","journal-title":"Eng Optim"},{"issue":"1","key":"264_CR9","first-page":"39","volume":"34","author":"A Colorni","year":"1994","unstructured":"Colorni A, Dorigo M, Maniezzo V and Trubian M (1994). Ant system for Job-Shop Scheduling. Belg J Oper Res Stat Comput Sci 34(1): 39\u201353","journal-title":"Belg J Oper Res Stat Comput Sci"},{"key":"264_CR10","first-page":"317","volume":"9","author":"G Di Caro","year":"1998","unstructured":"Di Caro G and Dorigo M (1998). AntNet: Distributed stigmergetic control for communications networks. J Art Intell Res 9: 317\u2013365","journal-title":"J Art Intell Res"},{"issue":"2","key":"264_CR11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M Dorigo","year":"1999","unstructured":"Dorigo M, Caro GD and Gambardella LM (1999). Ant algorithms for discrete optimization.. Art Life 5(2): 137\u2013172","journal-title":"Art Life"},{"issue":"1","key":"264_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M and Gambardella LM (1997a). Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1): 53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"264_CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M and Gambardella LM (1997b). Ant colonies for the traveling salesman problem. BioSystems 43: 73\u201381","journal-title":"BioSystems"},{"key":"264_CR14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"MM Flood","year":"1956","unstructured":"Flood MM (1956). The traveling salesman problem. Oper Res 4: 61\u201375","journal-title":"Oper Res"},{"key":"264_CR15","volume-title":"An ant system for bus driver scheduling. 7th International workshop on computer-aided scheduling of public transport","author":"P Forsyth","year":"1997","unstructured":"Forsyth P and Wren A (1997). An ant system for bus driver scheduling. 7th International workshop on computer-aided scheduling of public transport. Boston, USA"},{"key":"264_CR16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"LM Gambardella","year":"1999","unstructured":"Gambardella LM, Taillard E and Dorigo M (1999). Ant colonies for the quadratic assignment problem. J Oper Res Soc 50: 167\u2013176","journal-title":"J Oper Res Soc"},{"key":"264_CR17","volume-title":"HAS-SOP: an hybrid ant system for sequential ordering problem. Technical report no IDSIA 97\u201311","author":"LM Gambardella","year":"1997","unstructured":"Gambardella LM and Dorigo M (1997). HAS-SOP: an hybrid ant system for sequential ordering problem. Technical report no IDSIA 97\u201311. Lugano, Switzerland"},{"key":"264_CR18","doi-asserted-by":"crossref","unstructured":"Goss S, Beckers R, Deneubourg JL, Aron S, Pasteels JM (1990) How Trail laying and trail following can solve foraging problems for ant colonies. In: Hughes RN (ed) NATO-ASI series behavioral mechanisms of food selection","DOI":"10.1007\/978-3-642-75118-9_32"},{"key":"264_CR19","unstructured":"Gross J, Yellen J, Raton B (1999) Graph theory and its applications: CRC Press series on Discrete Mathematics and its Applications, ISBN: 0849339820"},{"key":"264_CR20","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1057\/jors.1996.190","volume":"47","author":"G Laporte","year":"1996","unstructured":"Laporte G, Vaziri AA and Srikandarajah C (1996). Some applications of the generalized travelling salesman problem. J Oper Res Soc 47: 1461\u20131467","journal-title":"J Oper Res Soc"},{"key":"264_CR21","first-page":"736","volume":"B-2","author":"ALH Labordere","year":"1969","unstructured":"Labordere ALH (1969). The record balancing problem: a dynamic programming solution of a generalized traveling salesman problem. RIBO B-2: 736\u2013743","journal-title":"RIBO"},{"key":"264_CR22","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/A:1019972523847","volume":"23","author":"MH Lim","year":"2002","unstructured":"Lim MH, Yuan Y and Omatu S (2002). Extensive testing of a hybrid genetic algorithm for solving quadratic assignment problems. Comput Optim Appl 23: 47\u201364","journal-title":"Comput Optim Appl"},{"issue":"2","key":"264_CR23","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S and Kernighan B (1973). An effective heuristic algorithm for the traveling salesman problem. Oper Res 21(2): 498\u2013516","journal-title":"Oper Res"},{"issue":"5","key":"264_CR24","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/69.806935","volume":"11","author":"V Maniezzo","year":"1999","unstructured":"Maniezzo V and Colorni A (1999). The ant system applied to the quadratic assignment problem. IEEE Trans Knowl Data Eng 11(5): 769\u2013778","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"264_CR25","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"YS Ong","year":"2004","unstructured":"Ong YS and Keane AJ (2004). Meta-Lamarckian learning in Memetic Algorithm. IEEE Trans Evol Comput 8(2): 99\u2013110","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"264_CR26","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"YS Ong","year":"2006","unstructured":"Ong YS, Lim MH, Zhu N and Wong KW (2006). Classification of adaptive Memetic algorithms: a comparative study. IEEE Trans Syst, Man Cybern Part B, 36(1): 141\u2013152","journal-title":"IEEE Trans Syst, Man Cybern Part B,"},{"issue":"4","key":"264_CR27","first-page":"313","volume":"5","author":"HG Sandalidis","year":"2001","unstructured":"Sandalidis HG, Mavromoustakis K and Stavroulakis P (2001). Performance measures of an ant based Decentralised routing scheme for circuit switching communication networks. Soft Comput A Fusion Found Meth Appl 5(4): 313\u2013317","journal-title":"Soft Comput A Fusion Found Meth Appl"},{"issue":"2","key":"264_CR28","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1177\/105971239700500203","volume":"5","author":"R Schoonderwoerd","year":"1997","unstructured":"Schoonderwoerd R, Holland O, Bruten J and Rothkrantz L (1997). Ant-based load balancing in telecommunications networks. Adap Behav 5(2): 169\u2013207","journal-title":"Adap Behav"},{"key":"264_CR29","doi-asserted-by":"crossref","unstructured":"St\u00fctzle T, Hoos H (1997) The max\u2013min ant system and Local search for the traveling salesman problem. In: Proceedings of the 4th IEEE international conference on evolutionary computation, IEEE Press: 308\u2013313","DOI":"10.1109\/ICEC.1997.592327"},{"issue":"5","key":"264_CR30","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/S0305-0548(03)00038-8","volume":"31","author":"KC Ying","year":"2004","unstructured":"Ying KC and Liao CJ (2004). An ant colony system for permutation flow-shop sequencing. Sour Comput Oper Res Arch 31(5): 791\u2013801","journal-title":"Sour Comput Oper Res Arch"},{"key":"264_CR31","unstructured":"Sparse Graphs, http:\/\/www.ntu.edu.sg\/home\/asysong\/sparse\/default.htm"},{"key":"264_CR32","unstructured":"University of Heidelberg, Department of Computer Science. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-007-0264-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-007-0264-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-007-0264-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:39:52Z","timestamp":1559093992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-007-0264-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,6]]},"references-count":32,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["264"],"URL":"https:\/\/doi.org\/10.1007\/s00500-007-0264-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,6]]}}}