{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:34Z","timestamp":1740099154615,"version":"3.37.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811328251"},{"type":"electronic","value":"9789811328268"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-13-2826-8_33","type":"book-chapter","created":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T05:36:02Z","timestamp":1538804162000},"page":"380-388","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Dual-Population-Based Local Search for Solving Multiobjective Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Mi","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinye","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhun","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,7]]},"reference":[{"issue":"5","key":"33_CR1","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/TSMCC.2012.2188285","volume":"42","author":"VA Shim","year":"2012","unstructured":"Shim, V.A., Tan, K.C., Cheong, C.Y.: A hybrid estimation of distribution algorithm with decomposition for solving the multiobjective multiple traveling salesman problem. IEEE Trans. Syst. Man Cybern. Part C 42(5), 682\u2013691 (2012)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C"},{"key":"33_CR2","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-11218-8_6","volume-title":"Advances in Multi-Objective Nature Inspired Computing","author":"T Lust","year":"2010","unstructured":"Lust, T., Teghem, J.: The multiobjective traveling salesman problem: a survey and a new approach. In: Coello Coello, C.A., Dhaenens, C., Jourdan, L. (eds.) Advances in Multi-Objective Nature Inspired Computing. SCI, vol. 272, pp. 119\u2013141. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11218-8_6"},{"key":"33_CR3","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-88051-6_14","volume-title":"Multi-Objective Memetic Algorithms","author":"W Peng","year":"2009","unstructured":"Peng, W., Zhang, Q., Li, H.: Comparison between MOEA\/D and NSGA-II on the multi-objective travelling salesman problem. In: Goh, C.K., Ong, Y.S., Tan, K.C. (eds.) Multi-Objective Memetic Algorithms. SCI, vol. 171, pp. 309\u2013324. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88051-6_14"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-211-27389-1_45","volume-title":"Adaptive and Natural Computing Algorithms (Coimbra, Portugal)","author":"A Gaspar-Cunha","year":"2005","unstructured":"Gaspar-Cunha, A.: A multi-objective evolutionary algorithm for solving traveling salesman problems: application to the design of polymer extruders. In: Ribeiro, B., Albrecht, R.F., Dobnikar, A., Pearson, D.W., Steele, N.C. (eds.) Adaptive and Natural Computing Algorithms (Coimbra, Portugal), pp. 189\u2013193. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/3-211-27389-1_45"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11, 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"10","key":"33_CR6","doi-asserted-by":"publisher","first-page":"1808","DOI":"10.1109\/TCYB.2013.2295886","volume":"44","author":"L Ke","year":"2014","unstructured":"Ke, L., Zhang, Q., Battiti, R.: Hybridization of decomposition and local search for multiobjective optimization. IEEE Trans. Cybern. 44(10), 1808\u20131820 (2014)","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"33_CR7","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/TEVC.2017.2744674","volume":"22","author":"X Cai","year":"2017","unstructured":"Cai, X., Mei, Z., Fan, Z., Zhang, Q.: A constrained decomposition approach with grids for evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 22(4), 564\u2013577 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"33_CR8","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1109\/TEVC.2015.2457616","volume":"20","author":"L Wang","year":"2016","unstructured":"Wang, L., Zhang, Q., Zhou, A., Gong, M., Jiao, L.: Constrained subproblems in a decomposition-based multiobjective evolutionary algorithm. IEEE Trans. Evol. Comput. 20(3), 475\u2013480 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"33_CR9","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s10732-015-9301-6","volume":"21","author":"H Sato","year":"2015","unstructured":"Sato, H.: Analysis of inverted PBI and comparison with other scalarizing functions in decomposition based moeas. J. Heuristics 21(6), 819\u2013849 (2015)","journal-title":"J. Heuristics"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.swevo.2017.01.002","volume":"34","author":"Z Wang","year":"2017","unstructured":"Wang, Z., Zhang, Q., Li, H., Ishibuchi, H., Jiao, L.: On the use of two reference points in decomposition based multiobjective evolutionary algorithms. Swarm Evol. Comput. 34, 89\u2013102 (2017)","journal-title":"Swarm Evol. Comput."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization. International Series in Operations Research and Management Science, vol. 12. Kluwer Academic Publishers, Dordrecht (1999)","DOI":"10.1007\/978-1-4615-5563-6"},{"key":"33_CR12","volume-title":"Algorithms","author":"R Sedgewick","year":"2011","unstructured":"Sedgewick, R., Wayne, K.: Algorithms. Addison-Wesley Professional, Boston (2011)"},{"key":"33_CR13","unstructured":"Borges, P.C., Hansen, M.P.: A basis for future successes in multiobjective combinatorial optimization. Technical report IMM-REP-1998-8, Institute of Mathematical Modelling, Technical University of Denmark (1998)"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3, 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-2826-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T12:30:54Z","timestamp":1572006654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-2826-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811328251","9789811328268"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-2826-8_33","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.bicta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}