{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T13:04:31Z","timestamp":1748869471820,"version":"3.37.3"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T00:00:00Z","timestamp":1525219200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004412","name":"T\u00fcrkiye Bilimler Akademisi","doi-asserted-by":"publisher","award":["M.M\/TUBA-GEBIP\/2012-19"],"award-info":[{"award-number":["M.M\/TUBA-GEBIP\/2012-19"]}],"id":[{"id":"10.13039\/501100004412","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s00607-018-0621-x","type":"journal-article","created":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T03:40:49Z","timestamp":1525232449000},"page":"969-988","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A parallel bio-inspried shortest path algorithm"],"prefix":"10.1007","volume":"101","author":[{"given":"Hilal","family":"Arslan","sequence":"first","affiliation":[]},{"given":"Murat","family":"Manguoglu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,2]]},"reference":[{"key":"621_CR1","unstructured":"9th DIMACS implementation challenge\u2014shortest paths. http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml . Accessed Jan 2017"},{"key":"621_CR2","unstructured":"Boost C++ Libraries. http:\/\/www.boost.org\/ . Accessed Apr 2016"},{"key":"621_CR3","unstructured":"Erdos\u2013Renyi graphs. http:\/\/cneurocvs.rmki.kfki.hu\/igraph\/doc\/R\/erdos.renyi.game.html . Accessed Jan 2017"},{"key":"621_CR4","unstructured":"Portable, Extensible Toolkit for Scientific Computing, version 3.6.3. http:\/\/www.mcs.anl.gov\/petsc . Accessed Apr 2016"},{"key":"621_CR5","unstructured":"The Watts\u2013Strogatz small-world model. http:\/\/cneurocvs.rmki.kfki.hu\/igraph\/doc\/R\/watts.strogatz.game.html . Accessed Jan 2017"},{"issue":"1","key":"621_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s11047-009-9146-8","volume":"9","author":"A Adamatzky","year":"2010","unstructured":"Adamatzky A, Jones J (2010) Programmable reconfiguration of Physarum machines. Nat Comput 9(1):219\u2013237","journal-title":"Nat Comput"},{"issue":"1","key":"621_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1044731.1044733","volume":"52","author":"L Aleksandrov","year":"2005","unstructured":"Aleksandrov L, Maheshwari A, Sack JR (2005) Determining approximate shortest paths on weighted polyhedral surfaces. J ACM 52(1):25\u201353","journal-title":"J ACM"},{"issue":"1","key":"621_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1137\/S0097539794271898","volume":"28","author":"B Awerbuch","year":"2006","unstructured":"Awerbuch B, Berger B, Cowen L, Peleg D (2006) Near-linear time construction of sparse neighborhood covers. SIAM J Comput 28(1):263\u2013277","journal-title":"SIAM J Comput"},{"key":"621_CR9","doi-asserted-by":"crossref","unstructured":"Becchetti L, Bonifaci V, Dirnberger M, Karrenbauer A, Mehlhorn K (2013) Physarum can compute shortest paths: convergence proofs and complexity bounds. In: Fomin F, Freivalds R, Kwiatkowska M, Peleg D (eds) Automata languages and programming: 40th international colloquium and ICALP 2013 Riga and Latvia and July 8\u201312 and 2013 and proceedings and part II. Springer, Berlin, pp 472\u2013483","DOI":"10.1007\/978-3-642-39212-2_42"},{"issue":"23","key":"621_CR10","doi-asserted-by":"publisher","first-page":"3734","DOI":"10.1016\/j.jmb.2015.07.007","volume":"427","author":"M Beekman","year":"2015","unstructured":"Beekman M, Latty T (2015) Brainless but multi-headed: decision making by the acellular slime mould Physarum polycephalum. J Mol Biol 427(23):3734\u20133743. https:\/\/doi.org\/10.1016\/j.jmb.2015.07.007","journal-title":"J Mol Biol"},{"issue":"2","key":"621_CR11","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1006\/jcph.2002.7176","volume":"182","author":"M Benzi","year":"2002","unstructured":"Benzi M (2002) Preconditioning techniques for large linear systems: a survey. J Comput Phys 182(2):418\u2013477","journal-title":"J Comput Phys"},{"key":"621_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-092250-5.50002-3","volume-title":"Nonnegative matrices in the mathematical sciences","author":"A Berman","year":"1979","unstructured":"Berman A, Plemmons RJ (1979) Nonnegative matrices in the mathematical sciences. Academic Press, New York. https:\/\/doi.org\/10.1016\/B978-0-12-092250-5.50002-3"},{"issue":"1","key":"621_CR13","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.ipl.2012.09.005","volume":"113","author":"V Bonifaci","year":"2013","unstructured":"Bonifaci V (2013) Physarum can compute shortest paths: a short proof. Inf Process Lett 113(1):4\u20137. https:\/\/doi.org\/10.1016\/j.ipl.2012.09.005","journal-title":"Inf Process Lett"},{"key":"621_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.jtbi.2012.06.017","volume":"309","author":"V Bonifaci","year":"2012","unstructured":"Bonifaci V, Mehlhorn K, Varma G (2012) Physarum can compute shortest paths. J Theor Biol 309:121\u2013133","journal-title":"J Theor Biol"},{"key":"621_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.4236\/jcc.2015.38005","volume":"3","author":"A Chaibou","year":"2015","unstructured":"Chaibou A, Sie O (2015) Improving global performance on GPU for algorithms with main loop containing a reduction operation: case of Dijkstra\u2019s algorithm. J Comput Commun 3:41\u201354","journal-title":"J Comput Commun"},{"key":"621_CR16","doi-asserted-by":"crossref","unstructured":"Chakaravarthy VT, Checconi F, Petrini F, Sabharwal Y (2014) Scalable single source shortest path algorithms for massively parallel systems. In: 2014 IEEE 28th international parallel and distributed processing symposium, pp 889\u2013901","DOI":"10.1109\/IPDPS.2014.96"},{"key":"621_CR17","doi-asserted-by":"crossref","unstructured":"Chakrabarti D, Zhan Y, Faloutsos C (2004) R-MAT: a recursive model for graph mining. In: Proceedings of the 2004 SIAM international conference on data mining. SIAM, Philadelphia, pp 442\u2013446","DOI":"10.1137\/1.9781611972740.43"},{"issue":"9","key":"621_CR18","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1007\/s10483-006-0915-1","volume":"27","author":"Gh Cheng","year":"2006","unstructured":"Cheng Gh, Huang Tz, Cheng Xy (2006) Preconditioned Gauss\u2013Seidel type iterative method for solving linear systems. Appl Math Mech 27(9):1275\u20131279","journal-title":"Appl Math Mech"},{"issue":"2","key":"621_CR19","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"B Cherkassky","year":"1996","unstructured":"Cherkassky B, Goldberg A, Radzik T (1996) Shortest path algorithms: theory and experimental evaluation. Math Program 73(2):129\u2013174","journal-title":"Math Program"},{"issue":"1","key":"621_CR20","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jalgor.2003.08.001","volume":"50","author":"LJ Cowen","year":"2004","unstructured":"Cowen LJ, Wagner CG (2004) Compact roundtrip routing in directed networks. J Algorithms 50(1):79\u201395","journal-title":"J Algorithms"},{"key":"621_CR21","doi-asserted-by":"crossref","unstructured":"Crobak JR, Berry JW, Madduri K, Bader DA (2007) Advanced shortest paths algorithms on a massively-multithreaded architecture. In: 2007 IEEE international parallel and distributed processing symposium, pp 1\u20138","DOI":"10.1109\/IPDPS.2007.370687"},{"key":"621_CR22","doi-asserted-by":"publisher","DOI":"10.7249\/R366","volume-title":"Linear programming and extensions","author":"G Dantzig","year":"1963","unstructured":"Dantzig G (1963) Linear programming and extensions. Princeton University Press, Princeton"},{"issue":"7","key":"621_CR23","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.jpdc.2012.02.007","volume":"73","author":"D Delling","year":"2013","unstructured":"Delling D, Goldberg AV, Nowatzyk A, Werneck RF (2013) PHAST: hardware-accelerated shortest path trees. J Parallel Distrib Comput 73(7):940\u2013952","journal-title":"J Parallel Distrib Comput"},{"key":"621_CR24","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"issue":"1","key":"621_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) 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":"621_CR26","unstructured":"Edmonds N, Breuer A, Gregor D, Lumsdaine A (2006) Single-source shortest paths with the parallel boost graph library. In: The ninth DIMACS implementation challenge: the shortest path problem"},{"key":"621_CR27","doi-asserted-by":"crossref","unstructured":"Elkin M (2001) Computing almost shortest paths. In: Proceedings of the twentieth annual ACM symposium on principles of distributed computing. ACM, New York, pp 53\u201362","DOI":"10.1145\/383962.383983"},{"issue":"1","key":"621_CR28","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01545524","volume":"20","author":"G Ertl","year":"1998","unstructured":"Ertl G (1998) Shortest path calculation in large road networks. Oper Res Spektrum 20(1):15\u201320","journal-title":"Oper Res Spektrum"},{"key":"621_CR29","doi-asserted-by":"crossref","unstructured":"Goldberg A, Kaplan H, Werneck R (2006) Reach for A*: efficient point-to-point shortest path algorithms. Technical report, Miami, FL. https:\/\/www.microsoft.com\/en-us\/research\/publication\/reach-for-a-efficient-point-to-point-shortest-path-algorithms\/","DOI":"10.1137\/1.9781611972863.13"},{"issue":"1","key":"621_CR30","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.trit.2016.03.011","volume":"1","author":"M Gong","year":"2016","unstructured":"Gong M, Li G, Wang Z, Ma L, Tian D (2016) An efficient shortest path approach for social networks based on community structure. CAAI Trans Intell Technol 1(1):114\u2013123","journal-title":"CAAI Trans Intell Technol"},{"key":"621_CR31","unstructured":"Gregor D, Lumsdaine A (2005) The parallel BGL: a generic library for distributed graph computations. In: Parallel object-oriented scientific computing (POOSC)"},{"key":"621_CR32","doi-asserted-by":"crossref","unstructured":"Gubichev A, Bedathur S, Seufert S, Weikum G (2010) Fast and accurate estimation of shortest paths in large graphs. In: Proceedings of the 19th ACM international conference on information and knowledge management, CIKM \u201910. ACM, New York, pp 499\u2013508","DOI":"10.1145\/1871437.1871503"},{"key":"621_CR33","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0024-3795(02)00570-0","volume":"364","author":"A Hadjidimos","year":"2003","unstructured":"Hadjidimos A, Noutsos D, Tzoumas M (2003) More on modifications and improvements of classical iterative schemes for M-matrices. Linear Algebra Appl 364:253\u2013279","journal-title":"Linear Algebra Appl"},{"key":"621_CR34","doi-asserted-by":"crossref","unstructured":"Ikeda T, Hsu MY, Imai H, Nishimura S, Shimoura H, Hashimoto T, Tenmoku K, Mitoh K (1994) A fast algorithm for finding better routes by AI search techniques. In: Vehicle navigation and information systems conference, 1994. Proceedings, pp 291\u2013296","DOI":"10.1109\/VNIS.1994.396824"},{"key":"621_CR35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719918","volume-title":"Graph algorithms in the language of linear algebra","author":"J Kepner","year":"2011","unstructured":"Kepner J, Gilbert J (2011) Graph algorithms in the language of linear algebra. Society for Industrial and Applied Mathematics, Philadelphia. https:\/\/doi.org\/10.1137\/1.9780898719918"},{"key":"621_CR36","unstructured":"Khorasani F, Vora K, Gupta R (2015) PaRMAT: a parallel generator for large R-MAT graphs. https:\/\/github.com\/farkhor\/PaRMAT . Accessed Jan 2017"},{"key":"621_CR37","unstructured":"Klein P (2002) Preprocessing an undirected planar network to enable fast approximate distance queries. In: Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, SODA \u201902, pp 820\u2013827"},{"issue":"1","key":"621_CR38","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s11047-016-9545-6","volume":"16","author":"M Liang","year":"2017","unstructured":"Liang M, Gao C, Zhang Z (2017) A new genetic algorithm based on modified Physarum network model for bandwidth-delay constrained least-cost multicast routing. Nat Comput 16(1):85\u201398","journal-title":"Nat Comput"},{"key":"621_CR39","doi-asserted-by":"crossref","unstructured":"Liu L, Song Y, Ma H, Zhang X (2012) Physarum optimization: a biology-inspired algorithm for minimal exposure path problem in wireless sensor networks. In: 2012 proceedings IEEE INFOCOM, pp 1296\u20131304","DOI":"10.1109\/INFCOM.2012.6195492"},{"key":"621_CR40","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TC.2013.229","volume":"64","author":"L Liu","year":"2015","unstructured":"Liu L, Song Y, Zhang H, Ma H (2015) Physarum optimization: a biology-inspired algorithm for the steiner tree problem in networks. IEEE Trans Comput 64:818\u2013831","journal-title":"IEEE Trans Comput"},{"key":"621_CR41","doi-asserted-by":"crossref","unstructured":"Madduri K, Bader DA, Berry JW, Crobak J (2007) An experimental study of a parallel shortest path algorithm for solving large-scale graph instances. In: Proceedings of the meeting on algorithm engineering and experiments. Society for Industrial and Applied Mathematics, Philadelphia, pp 23\u201335","DOI":"10.1137\/1.9781611972870.3"},{"key":"621_CR42","doi-asserted-by":"publisher","unstructured":"Masi L, Vasile M (2014) A multidirectional Physarum solver for the automated design of space trajectories. In: Proceedings of the 2014 IEEE congress on evolutionary computation (CEC), pp 2992\u20132999. https:\/\/doi.org\/10.1109\/CEC.2014.6900287","DOI":"10.1109\/CEC.2014.6900287"},{"key":"621_CR43","unstructured":"McSherry F, Isard M, Murray DG (2015) Scalability! But at what cost? In: Proceedings of the 15th USENIX conference on hot topics in operating systems, HOTOS 15, pp 14\u201314"},{"key":"621_CR44","unstructured":"Meyer U, Sanders P (1998) $$\\Delta $$ \u0394 -stepping: a parallel single source shortest path algorithm. In: European symposium on algorithms, pp 393\u2013404"},{"key":"621_CR45","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0196-6774(03)00076-2","volume":"49","author":"U Meyer","year":"2003","unstructured":"Meyer U, Sanders P (2003) $$\\Delta $$ \u0394 -stepping: a parallelizable shortest path algorithm. J Algorithms 49:114\u2013152","journal-title":"J Algorithms"},{"key":"621_CR46","first-page":"353","volume":"47","author":"T Miyaji","year":"2008","unstructured":"Miyaji T, Ohnishi I (2008) Physarum can solve the shortest path problem on Riemann surface mathematically rigorously. Int J Pure Appl Math 47:353\u2013369","journal-title":"Int J Pure Appl Math"},{"key":"621_CR47","doi-asserted-by":"publisher","first-page":"068,104","DOI":"10.1103\/PhysRevLett.99.068104","volume":"99","author":"T Nakagaki","year":"2007","unstructured":"Nakagaki T, Iima M, Ueda T, Nishiura Y, Saigusa T, Tero A, Kobayashi R, Showalter K (2007) Minimum-risk path finding by an adaptive amoebal network. Phys Rev Lett 99:068,104. https:\/\/doi.org\/10.1103\/PhysRevLett.99.068104","journal-title":"Phys Rev Lett"},{"key":"621_CR48","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/0024-3795(87)90125-X","volume":"88","author":"M Neumann","year":"1987","unstructured":"Neumann M, Plemmons RJ (1987) Convergence of parallel multisplitting iterative methods for M-matrices. Linear Algebra Appl 88:559\u2013573","journal-title":"Linear Algebra Appl"},{"issue":"11","key":"621_CR49","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/MCOM.2007.4378324","volume":"45","author":"UT Nguyen","year":"2007","unstructured":"Nguyen UT, Xu J (2007) Multicast routing in wireless mesh networks: minimum cost trees or shortest path trees? IEEE Commun Mag 45(11):72\u201377","journal-title":"IEEE Commun Mag"},{"issue":"1","key":"621_CR50","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.cam.2007.07.002","volume":"219","author":"H Niki","year":"2008","unstructured":"Niki H, Kohno T, Morimoto M (2008) The preconditioned Gauss\u2013Seidel method faster than the SOR method. J Comput Appl Math 219(1):59\u201371","journal-title":"J Comput Appl Math"},{"key":"621_CR51","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"D Peleg","year":"1989","unstructured":"Peleg D, Ullman JD (1989) An optimal synchronizer for the hypercube. SIAM J Comput 18:740\u2013747","journal-title":"SIAM J Comput"},{"issue":"2","key":"621_CR52","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0024-3795(77)90073-8","volume":"18","author":"R Plemmons","year":"1977","unstructured":"Plemmons R (1977) M-matrix characterizations. I\u2014nonsingular M-matrices. Linear Algebra Appl 18(2):175\u2013188","journal-title":"Linear Algebra Appl"},{"key":"621_CR53","first-page":"124","volume":"6","author":"I Pohl","year":"1971","unstructured":"Pohl I (1971) Bi-directional search. Mach Intell 6:124\u2013140","journal-title":"Mach Intell"},{"key":"621_CR54","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-247X(70)90298-2","volume":"32","author":"WC Rheinboldt","year":"1970","unstructured":"Rheinboldt WC (1970) On M-functions and their application to nonlinear Gauss-Seidel iterations and to network flows. J Math Anal Appl 32:274\u2013307","journal-title":"J Math Anal Appl"},{"key":"621_CR55","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative methods for sparse linear systems","author":"Y Saad","year":"2003","unstructured":"Saad Y (2003) Iterative methods for sparse linear systems, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia","edition":"2"},{"key":"621_CR56","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01840435","volume":"1","author":"R Sedgewick","year":"1986","unstructured":"Sedgewick R, Vitter J (1986) Shortest paths in Euclidean graphs. Algorithmica 1:31\u201348","journal-title":"Algorithmica"},{"key":"621_CR57","doi-asserted-by":"crossref","unstructured":"Sen S (2009) Approximating shortest paths in graphs. In: 3rd international workshop on algorithms and computation (WALCOM), pp 32\u201343","DOI":"10.1007\/978-3-642-00202-1_3"},{"key":"621_CR58","doi-asserted-by":"crossref","unstructured":"Siriwardana J, Halgamuge SK (2012) Fast shortest path optimization inspired by shuttle streaming of Physarum polycephalum. In: 2012 IEEE congress on evolutionary computation, pp 1\u20138","DOI":"10.1109\/CEC.2012.6252956"},{"issue":"1","key":"621_CR59","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.physa.2006.01.053","volume":"363","author":"A Tero","year":"2006","unstructured":"Tero A, Kobayashi R, Nakagaki T (2006) Physarum solver: a biologically inspired method of road-network navigation. Phys A Stat Mech Appl 363(1):115\u2013119","journal-title":"Phys A Stat Mech Appl"},{"issue":"4","key":"621_CR60","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.jtbi.2006.07.015","volume":"244","author":"A Tero","year":"2007","unstructured":"Tero A, Kobayashi R, Nakagaki T (2007) A mathematical model for adaptive transport network in path finding by true slime mold. J Theor Biol 244(4):553\u2013564","journal-title":"J Theor Biol"},{"issue":"6","key":"621_CR61","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M Thorup","year":"2004","unstructured":"Thorup M (2004) Compact oracles for reachability and approximate distances in planar digraphs. J ACM 51(6):993\u20131024","journal-title":"J ACM"},{"issue":"1","key":"621_CR62","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.biosystems.2003.08.001","volume":"73","author":"S Tsuda","year":"2004","unstructured":"Tsuda S, Aono M, Gunji YP (2004) Robust and emergent Physarum logical-computing. Biosystems 73(1):45\u201355","journal-title":"Biosystems"},{"key":"621_CR63","volume-title":"Matrix iterative analysis","author":"RS Varga","year":"1962","unstructured":"Varga RS (1962) Matrix iterative analysis. Prentice-Hall, Upper Saddle River"},{"key":"621_CR64","volume-title":"Iterative solution of large linear systems","author":"DM Young","year":"1971","unstructured":"Young DM (1971) Iterative solution of large linear systems. Academic Press, New York"},{"key":"621_CR65","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1016\/j.jcss.2011.09.001","volume":"78","author":"R Yuster","year":"2012","unstructured":"Yuster R (2012) Approximate shortest paths in weighted graphs. J Comput Syst Sci 78:632\u2013637","journal-title":"J Comput Syst Sci"},{"key":"621_CR66","first-page":"1","volume":"4","author":"FB Zhan","year":"2000","unstructured":"Zhan FB, Noon CE (2000) A comparison between label-setting and label-correcting algorithms for computing one-to-one shortest paths. Nano communication networks 4. J Geogr Inf Decis Anal 4:1\u201311","journal-title":"J Geogr Inf Decis Anal"},{"key":"621_CR67","doi-asserted-by":"publisher","first-page":"10,794","DOI":"10.1038\/srep10794","volume":"5","author":"X Zhang","year":"2015","unstructured":"Zhang X, Adamatzky A, Chan FTS, Deng Y, Yang H, Yang XS, Tsompanas M, Sirakoulis G, Mahadevan S (2015) A biologically inspired network design model. Sci Rep 5:10,794","journal-title":"Sci Rep"},{"key":"621_CR68","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.amc.2014.09.055","volume":"248","author":"X Zhang","year":"2014","unstructured":"Zhang X, Adamatzky A, Yang H, Mahadaven S, Yang XS, Wang Q, Deng Y (2014) A bio-inspired algorithm for identification of critical components in the transportation networks. Appl Math Comput 248:18\u201327","journal-title":"Appl Math Comput"},{"key":"621_CR69","doi-asserted-by":"crossref","first-page":"9959","DOI":"10.1016\/j.amc.2013.04.023","volume":"219","author":"X Zhang","year":"2013","unstructured":"Zhang X, Huang S, Hu Y, Zhang Y, Mahadevan S, Deng Y (2013) Solving 0\u20131 knapsack problems based on amoeboid organism algorithm. Appl Math Comput 219:9959\u20139970","journal-title":"Appl Math Comput"},{"key":"621_CR70","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ssci.2012.12.003","volume":"54","author":"X Zhang","year":"2013","unstructured":"Zhang X, Zhang X, Zhang Y, Wei D, Deng Y (2013) Route selection for emergency logistics management: a bio-inspired algorithm. Saf Sci 54:87\u201391","journal-title":"Saf Sci"},{"issue":"3","key":"621_CR71","doi-asserted-by":"publisher","first-page":"036,006","DOI":"10.1088\/1748-3182\/9\/3\/036006","volume":"9","author":"Z Zhang","year":"2014","unstructured":"Zhang Z, Gao C, Liu Y, Qian T (2014) A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model. Bioinspiration Biomim 9(3):036,006","journal-title":"Bioinspiration Biomim"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0621-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-018-0621-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0621-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T12:18:37Z","timestamp":1604233117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-018-0621-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,2]]},"references-count":71,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["621"],"URL":"https:\/\/doi.org\/10.1007\/s00607-018-0621-x","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2018,5,2]]},"assertion":[{"value":"6 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}