{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:30:43Z","timestamp":1738387843033,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540858621"},{"type":"electronic","value":"9783540858638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85863-8_27","type":"book-chapter","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T14:33:54Z","timestamp":1221230034000},"page":"225-234","source":"Crossref","is-referenced-by-count":2,"title":["Solving the Terminal Assignment Problem Using a Local Search Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Eug\u00e9nia M.","family":"Bernardino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anabela M.","family":"Bernardino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan M.","family":"S\u00e1nchez-P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"G\u00f3mez-Pulido","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel A.","family":"Vega-Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"2343","DOI":"10.1109\/TSMCB.2004.836471","volume":"34","author":"S. Salcedo-Sanz","year":"2004","unstructured":"Salcedo-Sanz, S., Yao, X.: A Hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem. IEEE Transaction On Systems, Man and Cybernetics\u00a034, 2343\u20132353 (2004)","journal-title":"IEEE Transaction On Systems, Man and Cybernetics"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Yao, X., Wang, F., Padmanabhan, K., Salcedo-Sanz, S.: Hybrid evolutionary approaches to terminal assignment in communications networks. In: Hart, W.E., Krasnogor, N., Smith, J.E. (eds.) Recent Advances in Memetic Algorithms and related search technologies, pp. 129\u2013159 (2004)","DOI":"10.1007\/3-540-32363-5_7"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Abuali, F., Schoenefeld, D., Wainwright, R.: Terminal assignment in a Communications Network Using Genetic Algorithms. In: 22nd Annual ACM Computer Science Conference, pp. 74\u201381 (2004)","DOI":"10.1145\/197530.197559"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Khuri, S., Chiu, T.: Heuristic Algorithms for the Terminal Assignment Problem. In: ACM Symposium on Applied Computing, pp. 247\u2013251 (1997)","DOI":"10.1145\/331697.331748"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1016\/0026-2714(93)90132-I","volume":"33","author":"M. Atiqullah","year":"1993","unstructured":"Atiqullah, M., Rao, S.: Reliability optimization of communication networks using simulated annealing. Microelectronics and Reliability\u00a033, 1303\u20131319 (1993)","journal-title":"Microelectronics and Reliability"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0952-1976(94)00041-K","volume":"8","author":"S. Pierre","year":"1995","unstructured":"Pierre, S., Hyppolite, M.A., Bourjolly, J.M., Dioume, O.: Topological design of computer communication networks using simulated annealing. Engineering Applications of Artificial Intelligence\u00a08, 61\u201369 (1995)","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF02073940","volume":"33","author":"F. Glover","year":"1991","unstructured":"Glover, F., Lee, M., Ryan, J.: Least-cost network topology design for a new service: and application of a tabu search. Annals of Operations Research\u00a033, 351\u2013362 (1991)","journal-title":"Annals of Operations Research"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/0360-8352(95)00036-Z","volume":"28","author":"S.J. Koh","year":"1995","unstructured":"Koh, S.J., Lee, C.Y.: A tabu search for the survivable fiber optic communication network design. Computers and Industrial Engineering\u00a028, 689\u2013700 (1995)","journal-title":"Computers and Industrial Engineering"},{"key":"27_CR9","unstructured":"Xu, Y., Salcedo-Sanz, S., Yao, X.: Non-standard cost terminal assignment problems using tabu search approach. In: IEEE Conference in Evolutionary Computation, vol.\u00a02, pp. 2302\u20132306 (2004)"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.engappai.2005.10.003","volume":"19","author":"S. Salcedo-Sanz","year":"2006","unstructured":"Salcedo-Sanz, S., Portilla-Figueras, J.A., Garc\u00eda-V\u00e1zquez, F., Jim\u00e9nez-Fern\u00e1ndez, S.: Solving terminal assignment problems with groups encoding: the wedding banquet problem. Engineering Applications of Artificial Intelligence\u00a019, 569\u2013578 (2006)","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"27_CR11","unstructured":"Bernardino, E.M., Bernardino, A.M., S\u00e1nchez-P\u00e9rez, J.M., Vega-Rodr\u00edguez, M.A., G\u00f3mez-Pulido, J.A.: Tabu Search vs Hybrid Genetic Algorithm to solve the terminal assignment problem. In: IADIS International Conference Applied Computing (2008)"},{"key":"27_CR12","unstructured":"Bernardino, E.M., Bernardino, A.M., S\u00e1nchez-P\u00e9rez, J.M., Vega-Rodr\u00edguez, M.A., G\u00f3mez-Pulido, J.A.: A Genetic Algorithm with Multiple Operators for Solving the Terminal Assignment Problem. New Challenges in Applied Intelligence Technologies\u00a0134 (2008)"},{"key":"27_CR13","unstructured":"MA HomePage, http:\/\/www.ing.unlp.edu.ar\/cetad\/mos\/memetic_home.html"},{"key":"27_CR14","unstructured":"Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Toward Memetic Algorithms. Caltech Concurrent Computation Program, C3P Report 826 (1989)"}],"container-title":["Advances in Soft Computing","International Symposium on Distributed Computing and Artificial Intelligence 2008 (DCAI 2008)"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85863-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:38:59Z","timestamp":1738363139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85863-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540858621","9783540858638"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85863-8_27","relation":{},"ISSN":["1615-3871","1860-0794"],"issn-type":[{"type":"print","value":"1615-3871"},{"type":"electronic","value":"1860-0794"}],"subject":[]}}