{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T15:49:27Z","timestamp":1740152967742,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,11,20]],"date-time":"2017-11-20T00:00:00Z","timestamp":1511136000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Rev Socionetwork Strat"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s12626-017-0016-z","type":"journal-article","created":{"date-parts":[[2017,11,19]],"date-time":"2017-11-19T21:31:56Z","timestamp":1511127116000},"page":"185-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Consultant-Guided Search with Crossover"],"prefix":"10.1007","volume":"11","author":[{"given":"Yota","family":"Ueda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0725-3495","authenticated-orcid":false,"given":"Hiroyuki","family":"Ebara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koki","family":"Nakayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Syuhei","family":"Iida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,20]]},"reference":[{"key":"16_CR1","volume-title":"Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems","author":"Sadiq M Sait","year":"1999","unstructured":"Sait, Sadiq M., & Youssef, Habib. (1999). Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems (1st ed.). Los Alamitos: IEEE Computer Society Press.","edition":"1"},{"volume-title":"Modern Heuristic Techniques for Combinatorial Problems","year":"1993","key":"16_CR2","unstructured":"Reeves, Colin R. (Ed.). (1993). Modern Heuristic Techniques for Combinatorial Problems. New York: Wiley."},{"key":"16_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"E-G Talbi","year":"2009","unstructured":"Talbi, E.-G. (2009). Metaheuristics: From Design to Implementation. Hoboken, New Jersey: Wiley."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Abraham, A., Grosan, C., & Ramos, V. (Eds.) (2006). Swarm intelligence in data mining. Studies in Computational Intelligence, Vol. 34. New York: Springer.","DOI":"10.1007\/978-3-540-34956-3"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Iordache, S. (2010). Consultant-guided search: A new metaheuristic for combinatorial optimization problems. Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO \u201910 (pp. 225\u2013232). New York: ACM.","DOI":"10.1145\/1830483.1830526"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Pop, P.C., & Iordache, S. (2011). A hybrid heuristic approach for solving the generalized traveling salesman problem. In Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO \u201911 (pp. 481\u2013488). New York: ACM.","DOI":"10.1145\/2001576.2001643"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Iordache, S. (2010). Consultant-guided search algorithms for the quadratic assignment problem. In Proceedings of the Hybrid Metaheuristics\u20147th International Workshop, HM 2010, Vienna, October 1\u20132, 2010 (pp. 148\u2013159).","DOI":"10.1145\/1830761.1830876"},{"key":"16_CR8","unstructured":"Deepanandhini, D., & Amudha, T. (2013). Solving Job Shop Scheduling Problems with Consultant Guided Search Metaheuristics, Vol. 3 (pp. 01\u201306). Citeseer."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Ruciski, M., Izzo, D., & Biscani, F. (2010). On the impact of the migration topology on the island model. Parallel Computing. Parallel Architectures and Bioinspired Algorithms, Vol. 36(1011) (pp. 555\u2013571).","DOI":"10.1016\/j.parco.2010.04.002"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Iordache, S. (2010). Consultant-guided search algorithms with local search for the traveling salesman problem. In Schaefer, R., Cotta, C., Kodziej, J., & Rudolph, G. (Eds.) Parallel Problem Solving from Nature, PPSN XI. Lecture Notes in Computer Science, Vol. 6239 (pp. 81\u201390). Berlin: Springer.","DOI":"10.1007\/978-3-642-15871-1_9"},{"issue":"1","key":"16_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., & Gambardella, L. M. (1997). Ant colony system: A cooperative learning approach to the traveling salesman problem. Transactions on Evolutionary Computation, 1(1), 53\u201366.","journal-title":"Transactions on Evolutionary Computation"},{"issue":"9","key":"16_CR12","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"Thomas St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, Thomas, & Hoos, Holger H. (2000). Max\u2013min ant system. Future Generation Computer Systems, 16(9), 889\u2013914.","journal-title":"Future Generation Computer Systems"},{"issue":"8","key":"16_CR13","doi-asserted-by":"crossref","first-page":"1728","DOI":"10.1587\/transfun.E97.A.1728","volume":"E97\u2013A","author":"H Ebara","year":"2014","unstructured":"Ebara, H., Hiranuma, Y., & Nakayama, K. (2014). Hybrid consultant-guided search for the traveling salesperson problem. IEICE Transactions, E97\u2013A(8), 1728\u20131738.","journal-title":"IEICE Transactions"},{"issue":"1","key":"16_CR14","first-page":"1","volume":"9","author":"R Nagatsuji","year":"2016","unstructured":"Nagatsuji, R., Iida, S., & Ebara, H. (2016). Effects of adaptive parameter tuning by particle swarm optimization (in Japanese). IPSJ Transactions on Mathematical Modeling and its Applications (TOM), 9(1), 1\u201312.","journal-title":"IPSJ Transactions on Mathematical Modeling and its Applications (TOM)"},{"issue":"10","key":"16_CR15","first-page":"1724","volume":"58","author":"R Nagatsuji","year":"2017","unstructured":"Nagatsuji, R., Hazama, K., & Ebara, H. (2017). Fast hybrid method with particle swarm optimization parameter tuning (in japanese). IPSJ Journal, 58(10), 1724\u20131734.","journal-title":"IPSJ Journal"},{"issue":"5","key":"16_CR16","doi-asserted-by":"crossref","first-page":"598","DOI":"10.9746\/sicetr1965.31.598","volume":"31","author":"K Maekawa","year":"1995","unstructured":"Maekawa, K., Tamaki, H., Kita, H., & Nishikawa, Y. (1995). A method for the traveling salesman problem based on the genetic algorithm (in Japanese). Transactions of the Society of Instrument and Control Engineers, 31(5), 598\u2013605.","journal-title":"Transactions of the Society of Instrument and Control Engineers"},{"key":"16_CR17","unstructured":"TSPLIB. \n                        http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/\n                        \n                    . Accessed 13 Nov 2017"},{"key":"16_CR18","unstructured":"Open MPI. \n                        https:\/\/www.open-mpi.org\/\n                        \n                    . Accessed 13 Nov 2017"}],"container-title":["The Review of Socionetwork Strategies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12626-017-0016-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12626-017-0016-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12626-017-0016-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,11]],"date-time":"2017-12-11T18:51:37Z","timestamp":1513018297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12626-017-0016-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,20]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["16"],"URL":"https:\/\/doi.org\/10.1007\/s12626-017-0016-z","relation":{},"ISSN":["1867-3236"],"issn-type":[{"type":"electronic","value":"1867-3236"}],"subject":[],"published":{"date-parts":[[2017,11,20]]}}}