{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:49:47Z","timestamp":1738216187940,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540786030"},{"type":"electronic","value":"9783540786047"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78604-7_3","type":"book-chapter","created":{"date-parts":[[2008,4,2]],"date-time":"2008-04-02T12:48:06Z","timestamp":1207140486000},"page":"25-35","source":"Crossref","is-referenced-by-count":2,"title":["Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem"],"prefix":"10.1007","author":[{"given":"Ammar W.","family":"Mohemmed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nirod Chandra","family":"Sahoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","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, vol.\u00a01. W.H. Freeman, New York (1979)"},{"key":"3_CR2","unstructured":"R., W.: The design and evaluation of routing algorithms for real time channels. Technical Report TR-94-024, Tenet Group, Dept. EECS, Univ. California, Berkeley, CA (1994)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/65.397043","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 Network\u00a09, 14\u2013162 (1995)","journal-title":"IEEE Network"},{"key":"3_CR4","unstructured":"Pornavalai, C., Chakraborty, V., Shiratori, N.: Routing with multiple qos requirements for supporting multimedia applications. J. High Speed Networks (1998)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/net.3230140109","volume":"14","author":"J. Jaffe","year":"1984","unstructured":"Jaffe, J.: Algorithms for finding path with multiple constraints. Networks\u00a014, 95\u2013116 (1984)","journal-title":"Networks"},{"key":"3_CR6","unstructured":"Blokh, D., Gutin, G.: An approximation algorithm for combinatorial optimization problems with two parameters (1995)"},{"key":"3_CR7","unstructured":"Neve, H.D., Mieghem, P.V.: A multiple quality of service routing algorithm for pnni. In: IEEE ATM 1998 Workshop, pp. 306\u2013314 (1998)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S1389-1286(02)00344-4","volume":"41","author":"L. Guoe","year":"2003","unstructured":"Guoe, L., Matta, I.: Search space reduction in qos routing. Computer Networks\u00a041, 73\u201388 (2003)","journal-title":"Computer Networks"},{"key":"3_CR9","doi-asserted-by":"publisher","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\u00a010, 293\u2013310 (1980)","journal-title":"Networks"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Juttner, A., Szviatovski, B., Mecs, I., Rajko, Z.: Lagrange relaxation based method for the qos routing problem. In: INFOCOM 2001, vol.\u00a02, pp. 859\u2013868 (2001)","DOI":"10.1109\/INFCOM.2001.916277"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"J.. Beasley","year":"1989","unstructured":"Beasley, J., Christofides, N.: An algorithm for the resource constrained shortest path. Networks\u00a019, 379\u2013394 (1989)","journal-title":"Networks"},{"key":"3_CR12","doi-asserted-by":"publisher","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. Operations Research Letters\u00a014, 133\u2013137 (1993)","journal-title":"Operations Research Letters"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Neural Networks, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"3_CR14","unstructured":"C.M.: The swarm and queen: Towards a deterministic and adaptive particle swarm optimization. In: IEEE Congress on Evolutionary Computation, vol.\u00a02, pp. 1951\u20131957 (1999)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Mohemmed, A.W., Sahoo, N.: Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics. Discrete Dynamics in Nature and Society (2007)","DOI":"10.1155\/2007\/27383"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Mohemmed, A.W., Sahoo, N.C., Geok, T.K.: A new particle swarm optimization based algorithm for solving shortest-paths tree problems. In: IEEE Congress on Evolutionary Computation, pp. 3221\u20133225 (2007)","DOI":"10.1109\/CEC.2007.4424884"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B. Waxman","year":"1988","unstructured":"Waxman, B.: Routing of multipoint connections. IEEE Journal of Selected Areas in Communications\u00a06, 1617\u20131622 (1988)","journal-title":"IEEE Journal of Selected Areas in Communications"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78604-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T11:30:50Z","timestamp":1738150250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78604-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540786030","9783540786047"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78604-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}