{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:05:43Z","timestamp":1758845143814,"version":"3.37.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T00:00:00Z","timestamp":1246406400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s10732-009-9109-3","type":"journal-article","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T16:38:42Z","timestamp":1246379922000},"page":"593-616","source":"Crossref","is-referenced-by-count":7,"title":["Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Ammar W.","family":"Mohemmed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nirod Chandra","family":"Sahoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tan Kim","family":"Geok","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,7,1]]},"reference":[{"issue":"6","key":"9109_CR1","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/TEVC.2002.804323","volume":"6","author":"C.W. Ahn","year":"2002","unstructured":"Ahn, C.W., Ramakrishna, R.S.: A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans. Evol. Comput. 6(6), 566\u2013579 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9109_CR2","unstructured":"Barbosa, H.J.C.: A genetic algorithm for min-max problems. In: Proceedings of the First International Conference on Evolutionary Computation and its Applications, Moscow, pp. 99\u2013109 (1996)"},{"issue":"3","key":"9109_CR3","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"J.E. Beasley","year":"1989","unstructured":"Beasley, J.E., Christofides, N.: An algorithm for the resource constrained shortest path. Networks 19(3), 379\u2013394 (1989)","journal-title":"Networks"},{"key":"9109_CR4","first-page":"157","volume":"14","author":"D. Blokh","year":"1995","unstructured":"Blokh, D., Gutin, G.: An approximation algorithm for combinatorial optimization problems with two parameters. Australas. J. Comb. 14, 157\u2013164 (1995)","journal-title":"Australas. J. Comb."},{"issue":"3","key":"9109_CR5","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1109\/TAP.2004.825102","volume":"52","author":"D.W. Boeringer","year":"2004","unstructured":"Boeringer, D.W., Werner, D.H.: Particle swarm optimization versus genetic algorithms for phased array synthesis. IEEE Trans. Antennas Propag. 52(3), 771\u2013779 (2004)","journal-title":"IEEE Trans. Antennas Propag."},{"key":"9109_CR6","doi-asserted-by":"crossref","unstructured":"Cagnina, L., Esquivel, S., Gallard, R.: Particle swarm optimization for sequencing problem: a case study. In: Proceedings of the IEEE Conference on Evolutionary Computation, pp. 536\u2013541 (2004)","DOI":"10.1109\/CEC.2004.1330903"},{"issue":"3","key":"9109_CR7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","volume":"14","author":"I. Charon","year":"1993","unstructured":"Charon, I., Hurdy, O.: The noising method: a new method for combinatorial optimization. Oper. Res. Lett. 14(3), 133\u2013137 (1993)","journal-title":"Oper. Res. Lett."},{"key":"9109_CR8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0377-2217(00)00305-2","volume":"135","author":"I. Charon","year":"2001","unstructured":"Charon, I., Hurdy, O.: The noising methods: a generalization of some metaheuristics. Eur. J. Oper. Res. 135, 86\u2013101 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9109_CR9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/TNET.2007.897965","volume":"18","author":"S. Chen","year":"2008","unstructured":"Chen, S., Song, M., Sahni, S.: Two techniques for fast computation of constrained shortest paths. IEEE\/ACM Trans. Netw. 18, 105\u2013115 (2008)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9109_CR10","doi-asserted-by":"crossref","unstructured":"Clerc, M.: The swarm and queen: Towards a deterministic and adaptive particle swarm optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1951\u20131957 (1999)","DOI":"10.1109\/CEC.1999.785513"},{"key":"9109_CR11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-39930-8_8","volume-title":"New Optimization Techniques in Engineering","author":"M. Clerc","year":"2004","unstructured":"Clerc, M.: Discrete particle swarm optimization illustrated by the traveling salesman problem. In: New Optimization Techniques in Engineering, pp. 219\u2013239. Springer, Berlin (2004)"},{"key":"9109_CR12","doi-asserted-by":"crossref","unstructured":"DeNeve, H., Mieghem, P.V.: A multiple quality of service routing algorithm for PNNI. In: Proceedings of the IEEE ATM Workshop, Virginia, USA, pp. 324\u2013328 (1998)","DOI":"10.1109\/ATM.1998.675192"},{"key":"9109_CR13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"9109_CR14","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/BFb0040812","volume-title":"Proceedings of the Seventh Annual Conference on Evolutionary Programming","author":"R.C. Eberhart","year":"1998","unstructured":"Eberhart, R.C., Shi, Y.: Comparison between genetic algorithms and particle swarm optimization. In: Proceedings of the Seventh Annual Conference on Evolutionary Programming, pp. 611\u2013616. Springer, Berlin (1998)"},{"issue":"1","key":"9109_CR15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.aei.2005.01.004","volume":"19","author":"E. Elbeltagi","year":"2005","unstructured":"Elbeltagi, E., Hegazy, T., Grierson, D.: Comparison among five evolutionary-based optimization algorithms. Adv. Eng. Inf. 19(1), 43\u201353 (2005)","journal-title":"Adv. Eng. Inf."},{"key":"9109_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York (1979)"},{"key":"9109_CR17","doi-asserted-by":"crossref","unstructured":"Gen, M., Cheng, R., Wang, D.: Genetic algorithms for solving shortest path problems. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 401\u2013 406 (1997)","DOI":"10.1109\/ICEC.1997.592343"},{"key":"9109_CR18","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G. Handler","year":"1980","unstructured":"Handler, G., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks 10, 293\u2013310 (1980)","journal-title":"Networks"},{"key":"9109_CR19","doi-asserted-by":"crossref","unstructured":"Hassan, R., Cohanim, B., DeWeck, O.L., Venter, G.: A comparison of particle swarm optimization and the genetic algorithm. In: Proceedings of the First AIAA Multidisciplinary Design Optimization Specialist Conference, pp. 18\u201321 (2005)","DOI":"10.2514\/6.2005-1897"},{"key":"9109_CR20","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0167-2789(90)90076-2","volume":"42","author":"W.D. Hillis","year":"1990","unstructured":"Hillis, W.D.: Coevolving parasites improve simulated evolution as an optimization procedure. Physica D 42, 228\u2013234 (1990)","journal-title":"Physica D"},{"key":"9109_CR21","unstructured":"Hu, X., Eberhart, R.C.: Swarm intelligence for permutation optimization: a case study of n-queens problem. In: Proceedings of the IEEE Swarm Intelligence Symposium, pp. 243\u2013246 (2003)"},{"key":"9109_CR22","doi-asserted-by":"crossref","unstructured":"Inagaki, J., Haseyama, M., Kitajima, H.: A genetic algorithm for determining multiple routes and its applications. In: Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 137\u2013140 (1999)","DOI":"10.1109\/ISCAS.1999.780114"},{"key":"9109_CR23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.3230140109","volume":"14","author":"J. Jeffrey","year":"1984","unstructured":"Jeffrey, J.: Algorithms for finding path with multiple constraints. Networks 14, 95\u2013116 (1984)","journal-title":"Networks"},{"key":"9109_CR24","unstructured":"JongDe, K.A., Potter, M.A.: Evolving complex structures via cooperative co-evolution. In: Proceedings of the Fourth Annual Conference on Evolutionary Computation, San Diego, CA, pp. 1\u20133 (1995)"},{"key":"9109_CR25","doi-asserted-by":"crossref","unstructured":"J\u00fcttner, A., Szviatovszki, B., M\u00e9cs, I., Rajk\u00f3, Z.: Lagrange relaxation based method for the QoS routing problem. In: Proceedings of IEEE INFOCOM, pp. 859\u2013868 (2001)","DOI":"10.1109\/INFCOM.2001.916277"},{"key":"9109_CR26","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"9109_CR27","doi-asserted-by":"crossref","unstructured":"Kennedy, J.: Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance. In: Proceedings of the Congress of Evolutionary Computation, vol. 3, pp. 1931\u20131938 (1999)","DOI":"10.1109\/CEC.1999.785509"},{"key":"9109_CR28","doi-asserted-by":"crossref","unstructured":"Krohling, R.A., Hoffmann, F., Coelho, L.S.: Co-evolutionary particle swarm optimization for min-max problems using Gaussian distribution. In: Proceedings of the Congress on Evolutionary Computation, vol. 1, pp. 959\u2013964 (2004)","DOI":"10.1109\/CEC.2004.1330965"},{"issue":"4","key":"9109_CR29","first-page":"14","volume":"9","author":"W.C. Lee","year":"1995","unstructured":"Lee, W.C., Hluchyj, M.G., Humblet, P.A.: Routing subject to quality of service constraints in integrated communication networks. IEEE Netw. 9(4), 14\u201316 (1995)","journal-title":"IEEE Netw."},{"key":"9109_CR30","doi-asserted-by":"crossref","unstructured":"Liang, G., Matta, I.: Search space reduction in QoS routing. In: Proceedings of the 19th International Conference on Distributed Computing Systems, pp. 142\u2013149 (1999)","DOI":"10.1109\/ICDCS.1999.776515"},{"key":"9109_CR31","unstructured":"Michalewicz, Z.: Genetic algorithms numerical optimization and constraints. In: Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 151\u2013158 (1995)"},{"key":"9109_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York (1996)"},{"key":"9109_CR33","author":"A.W. Mohemmed","year":"2007","unstructured":"Mohemmed, A.W., Sahoo, N.C.: Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics. Discrete Dyn. Nat. Soc. (2007a). doi: 10.1155\/2007\/27383","journal-title":"Discrete Dyn. Nat. Soc."},{"key":"9109_CR34","doi-asserted-by":"crossref","unstructured":"Mohemmed, A.W., Sahoo, N.C.: Particle swarm optimization combined with local search and velocity re-initialization for shortest path computation in network. In: Proceedings of the IEEE Swarm Intelligence Symposium, USA, pp. 266\u2013272 (2007b)","DOI":"10.1109\/SIS.2007.367947"},{"issue":"4","key":"9109_CR35","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.asoc.2008.01.002","volume":"8","author":"A.W. Mohemmed","year":"2008","unstructured":"Mohemmed, A.W., Sahoo, N.C., Tan, K.G.: Solving shortest path problem using particle swarm optimization. Appl. Soft Comput. 8(4), 1643\u20131653 (2008)","journal-title":"Appl. Soft Comput."},{"issue":"E","key":"9109_CR36","first-page":"C89","volume":"46","author":"C.R. Mouser","year":"2005","unstructured":"Mouser, C.R., Dunn, S.A.: Comparing genetic algorithms and particle swarm optimization for an inverse problem exercise. Aust. N.Z. Ind. Appl. Math. (ANZIAM) J. 46(E), C89\u2013C101 (2005)","journal-title":"Aust. N.Z. Ind. Appl. Math. (ANZIAM) J."},{"key":"9109_CR37","doi-asserted-by":"crossref","unstructured":"Munemoto, M., Takai, Y., Sato, Y.: A migration scheme for the genetic adaptive routing algorithm. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, pp. 2774\u20132779 (1998)","DOI":"10.1109\/ICSMC.1998.725081"},{"key":"9109_CR38","first-page":"357","volume":"9","author":"C. Pornavalai","year":"1998","unstructured":"Pornavalai, C., Chakraborty, G., Shiratori, N.: Routing with multiple QoS requirements for supporting multimedia applications. J. High Speed Netw. 9, 357\u2013373 (1998)","journal-title":"J. High Speed Netw."},{"key":"9109_CR39","doi-asserted-by":"crossref","unstructured":"Potter, M.A., JongDe, K.A.: A cooperative co-evolutionary approach to function optimization. In: Proceedings of the Third Parallel Problem Solving from Nature, Israel, pp. 249\u2013257 (1994)","DOI":"10.1007\/3-540-58484-6_269"},{"key":"9109_CR40","unstructured":"Potter, M.A., JongDe, K.A.: Evolving neural networks with collaborative species. In: Proceedings of the Summer Computer Simulation Conference, Canada, pp. 340\u2013345, July 1995"},{"issue":"8","key":"9109_CR41","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., Imtiaz, A., Al-Madani, S.: Particle swarm optimization for task assignment problem. Microprocess. Microsyst. 26(8), 363\u2013371 (2002)","journal-title":"Microprocess. Microsyst."},{"key":"9109_CR42","unstructured":"Shi, Y., Krohling, R.A.: Co-evolutionary panicle swarm optimization to solving min-max problems. In: Proceedings of the IEEE Conference on Evolutionary Computation, Hawaii, pp. 1682\u20131687 (2002)"},{"key":"9109_CR43","unstructured":"Wang, K.-P., Huang, L., Zhou, C.-G., Pang, W.: Particle swarm optimization for traveling salesman problem. In: Proceedings of International Conference on Machine Learning and Cybernetics, pp. 1583\u20131585 (2003)"},{"issue":"9","key":"9109_CR44","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B. Waxman","year":"1988","unstructured":"Waxman, B.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617\u20131622 (1988)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9109_CR45","unstructured":"Widyono, R.: The design and evaluation of routing algorithms for real time channels. Tenet Group, Dept. EECS, Univ. California, Berkeley, CA, Tech. Rep. TR-94-024 (1994)"},{"issue":"4","key":"9109_CR46","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/TAC.2006.872827","volume":"51","author":"J. Zhanfeng","year":"2006","unstructured":"Zhanfeng, J., Varaiya, P.: Heuristic methods for delay constrained least cost routing using K-shortest-paths. IEEE Trans. Automat. Control 51(4), 707\u2013712 (2006)","journal-title":"IEEE Trans. Automat. Control"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-009-9109-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-009-9109-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-009-9109-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T14:37:03Z","timestamp":1739198223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-009-9109-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,1]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["9109"],"URL":"https:\/\/doi.org\/10.1007\/s10732-009-9109-3","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2009,7,1]]}}}