{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:23:43Z","timestamp":1757312623881},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,1,7]],"date-time":"2015-01-07T00:00:00Z","timestamp":1420588800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evolving Systems"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s12530-014-9126-9","type":"journal-article","created":{"date-parts":[[2015,1,5]],"date-time":"2015-01-05T21:02:58Z","timestamp":1420491778000},"page":"293-302","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A novel hybrid PSO-ACO approach with its application to SPP"],"prefix":"10.1007","volume":"6","author":[{"given":"A. H.","family":"Mazinan","sequence":"first","affiliation":[]},{"given":"F.","family":"Sagharichiha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,7]]},"reference":[{"key":"9126_CR1","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/TEVC.2002.804323","volume":"6","author":"CW Ahn","year":"2002","unstructured":"Ahn CW, Ramakrishna RS (2002) A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans Evol Comput 6:566\u2013579","journal-title":"IEEE Trans Evol Comput"},{"key":"9126_CR2","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1109\/72.950136","volume":"12","author":"F Araujo","year":"2001","unstructured":"Araujo F, Ribeiro B, Rodrigues L (2001) A neural network for shortest path computation. IEEE Trans Neural Netw 12:1067\u20131073","journal-title":"IEEE Trans Neural Netw"},{"key":"9126_CR3","doi-asserted-by":"crossref","unstructured":"Cagnina L, Esquivel S, Gallard R (2004) Particle swarm optimization for sequencing problems: a case study. In: Congress on Evolutionary computation. CEC 2004. vol 1, pp 536\u2013541","DOI":"10.1109\/CEC.2004.1330903"},{"key":"9126_CR4","author":"J Cheng","year":"2014","unstructured":"Cheng J, Lisser A (2014) Maximum probability shortest path problem. Discret Appl Math. doi: 10.1016\/j.dam.2014.05.009","journal-title":"Discret Appl Math"},{"key":"9126_CR5","doi-asserted-by":"crossref","unstructured":"Clerc M (1999) The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation, CEC 99, vol 3, p 1957","DOI":"10.1109\/CEC.1999.785513"},{"key":"9126_CR6","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc M, Kennedy J (2002) The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6:58\u201373","journal-title":"IEEE Trans Evol Comput"},{"key":"9126_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF01417909","volume":"3","author":"JL Deneubourg","year":"1990","unstructured":"Deneubourg JL, Aron S, Goss S, Pasteels JM (1990) The self-organizing exploratory pattern of the argentine ant. J Insect Behav 3:159\u2013168","journal-title":"J Insect Behav"},{"key":"9126_CR8","first-page":"184","volume-title":"Parallel problem solving from nature, PPSN XI","author":"B Doerr","year":"2010","unstructured":"Doerr B, Johannsen D, K\u00f6tzing T, Neumann F, Theile M (2010) More Effective crossover operators for the all-pairs SPP. In: Schaefer R, Cotta C, Ko\u0142odziej J, Rudolph G (eds) Parallel problem solving from nature, PPSN XI, vol 6238. Springer, Berlin, Heidelberg, pp 184\u2013193"},{"key":"9126_CR9","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1162\/EVCO_a_00047","volume":"19","author":"B Doerr","year":"2011","unstructured":"Doerr B, Happ E, Klein C (2011) Tight analysis of the (1\u00a0+\u00a01)-EA for the single source SPP. Evol Comput 19:673\u2013691","journal-title":"Evol Comput"},{"key":"9126_CR10","doi-asserted-by":"crossref","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:53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"9126_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. MIT Press, Cambridge"},{"key":"9126_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. Syst Man Cybern Part B 26:29\u201341","journal-title":"Syst Man Cybern Part B"},{"key":"9126_CR13","doi-asserted-by":"crossref","unstructured":"Eberhart RC, Shi Y (2000) Comparing inertia weights and constriction factors in particle swarm optimization. In: Proceedings of the 2000 Congress on Evolutionary Computation. pp 84\u201388, vol 1","DOI":"10.1109\/CEC.2000.870279"},{"key":"9126_CR14","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/S0191-2615(98)00016-2","volume":"32","author":"L Fu","year":"1998","unstructured":"Fu L, Rilett LR (1998) Expected shortest paths in dynamic and stochastic traffic networks. Transp Res B 32:499\u2013516","journal-title":"Transp Res B"},{"key":"9126_CR15","unstructured":"Gen M, Cheng R, Qing W (1997) Genetic algorithms for solving SPPs, In: IEEE International Conference on Evolutionary Computation, 1997, pp 401\u2013406"},{"key":"9126_CR16","doi-asserted-by":"crossref","unstructured":"Kuri J, Puech N, Gagnaire M, Dotaro E (2002) Routing foreseeable lightpath demands using a tabu search meta-heuristic, In: Global Telecommunications Conference, 2002. GLOBECOM \u201802. IEEE, 2002, vol 3, pp 2803\u20132807","DOI":"10.1109\/GLOCOM.2002.1189140"},{"key":"9126_CR17","first-page":"59","volume-title":"Combinatorial optimization: networks and matroids","author":"EL Lawler","year":"1976","unstructured":"Lawler EL (1976) Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York, pp 59\u2013108"},{"key":"9126_CR18","author":"W Liang","year":"2013","unstructured":"Liang W, Hu Y, Kasabov N (2013) Evolving personalized modeling system for integrated feature, neighborhood and parameter optimization utilizing gravitational search algorithm. Evol syst. doi: 10.1007\/s12530-013-9081-x","journal-title":"Evol syst"},{"key":"9126_CR19","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.asoc.2008.01.002","volume":"8","author":"AW Mohemmed","year":"2008","unstructured":"Mohemmed AW, Sahoo NC, Geok TK (2008) Solving SPP using particle swarm optimization. Appl Soft Comput 8:1643\u20131653","journal-title":"Appl Soft Comput"},{"key":"9126_CR20","doi-asserted-by":"crossref","unstructured":"Munetomo M, Takai Y, Sato Y (1998) A migration scheme for the genetic adaptive routing algorithm, In: IEEE International Conference on Systems, Man, and Cybernetics, 1998. vol 3, pp 2774\u20132779","DOI":"10.1109\/ICSMC.1998.725081"},{"key":"9126_CR21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-1-4615-5757-9_11","volume-title":"Equilibrium and advanced transportation modelling","author":"S Pallottino","year":"1998","unstructured":"Pallottino S, Scutell\u00e0 M (1998) Shortest path algorithms in transportation models: classical and innovative aspects. In: Marcotte P, Nguyen S (eds) Equilibrium and advanced transportation modelling. Springer, New York, pp 245\u2013281"},{"key":"9126_CR22","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.jda.2007.08.003","volume":"7","author":"S Peyer","year":"2009","unstructured":"Peyer S, Rautenbach D, Vygen J (2009) A generalization of Dijkstra\u2019s shortest path algorithm with applications to VLSI routing. J Discret Algorithms 7:377\u2013390","journal-title":"J Discret Algorithms"},{"issue":"1","key":"9126_CR23","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.ejor.2014.05.008","volume":"239","author":"F Pulido","year":"2014","unstructured":"Pulido F, Mandow L, de la Cruz JLP (2014) Multiobjective SPPs with lexicographic goal-based preferences. Eur J Oper Res 239(1):89\u2013101","journal-title":"Eur J Oper Res"},{"key":"9126_CR24","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0141-9331(02)00053-4","volume":"26","author":"A Salman","year":"2002","unstructured":"Salman A, Ahmad I, Al-Madani S (2002) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26:363\u2013371","journal-title":"Microprocess Microsyst"},{"issue":"6","key":"9126_CR25","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.tcs.2013.09.006","volume":"520","author":"T Takaoka","year":"2014","unstructured":"Takaoka T (2014) Sharing information for the all pairs SPP. Theoret Comput Sci 520(6):43\u201350","journal-title":"Theoret Comput Sci"},{"key":"9126_CR26","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.artint.2014.07.001","volume":"216","author":"FW Trevizan","year":"2014","unstructured":"Trevizan FW, Veloso MM (2014) Depth-based short-sighted stochastic SPPs. Artif Intell 216:179\u2013205","journal-title":"Artif Intell"},{"key":"9126_CR27","doi-asserted-by":"crossref","unstructured":"Xiaohui H, Eberhart RC, Yuhui S (2003), Swarm intelligence for permutation optimization: a case study of n-queens problem, In: IEEE Proceedings of the Swarm Intelligence Symposium 2003. SIS \u201803. pp 243\u2013246","DOI":"10.1109\/SIS.2003.1202275"},{"key":"9126_CR28","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY (1971) Finding the K shortest loopless paths in a network. Manag Sci 17:712\u2013716","journal-title":"Manag Sci"},{"key":"9126_CR30","author":"Z Zhang","year":"2013","unstructured":"Zhang Z, Wang L, Long F (2013) Immune optimization approach solving multi-objective chance-constrained programming. Evol Syst. doi: 10.1007\/s12530-013-9101-x","journal-title":"Evol Syst"}],"container-title":["Evolving Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12530-014-9126-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12530-014-9126-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12530-014-9126-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T08:15:55Z","timestamp":1559463355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12530-014-9126-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,7]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["9126"],"URL":"https:\/\/doi.org\/10.1007\/s12530-014-9126-9","relation":{},"ISSN":["1868-6478","1868-6486"],"issn-type":[{"value":"1868-6478","type":"print"},{"value":"1868-6486","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,7]]}}}