{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T02:55:00Z","timestamp":1771210500837,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T00:00:00Z","timestamp":1528761600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["458598\/2014-3"],"award-info":[{"award-number":["458598\/2014-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s00500-018-3269-8","type":"journal-article","created":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T08:08:08Z","timestamp":1528790888000},"page":"6157-6168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["A novel multi-objective evolutionary algorithm based on subpopulations for the bi-objective traveling salesman problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Deyvid Heric","family":"Moraes","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8972-5221","authenticated-orcid":false,"given":"Danilo Sipoli","family":"Sanches","sequence":"additional","affiliation":[]},{"given":"Josimar","family":"da Silva\u00a0Rocha","sequence":"additional","affiliation":[]},{"given":"Jader Maikol Caldonazzo","family":"Garbelini","sequence":"additional","affiliation":[]},{"given":"Marcelo Favoretto","family":"Castoldi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"3269_CR1","doi-asserted-by":"crossref","unstructured":"Andersson J (2003) Applications of a multi-objective genetic algorithm to engineering design problems. In: Fonseca C, Fleming P, Zitzler E, Thiele L, Deb K (eds) Evolutionary multi-criterion optimization, vol 2632. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, pp 737\u2013751","DOI":"10.1007\/3-540-36970-8_52"},{"key":"3269_CR2","doi-asserted-by":"crossref","unstructured":"Angus D (2007) Crowding population-based ant colony optimisation for the multi-objective travelling salesman problem. In: MCDM, pp 333\u2013340","DOI":"10.1109\/MCDM.2007.369110"},{"key":"3269_CR3","doi-asserted-by":"publisher","unstructured":"Coelho G, Von Zuben F, da\u00a0Silva A (2007) A multiobjective approach to phylogenetic trees: selecting the most promising solutions from the Pareto front. In: Intelligent systems design and applications, 2007. Seventh international conference on ISDA 2007, pp 837\u2013842, \n                    https:\/\/doi.org\/10.1109\/ISDA.2007.87","DOI":"10.1109\/ISDA.2007.87"},{"key":"3269_CR4","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.cor.2016.04.025","volume":"79","author":"M Cornu","year":"2017","unstructured":"Cornu M, Cazenave T, Vanderpooten D (2017) Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem. Comput Oper Res 79:314\u2013330. \n                    https:\/\/doi.org\/10.1016\/j.cor.2016.04.025","journal-title":"Comput Oper Res"},{"key":"3269_CR5","first-page":"162","volume":"85","author":"L Davis","year":"1985","unstructured":"Davis L (1985) Applying adaptive algorithms to epistatic domains. IJCAI 85:162\u2013164","journal-title":"IJCAI"},{"key":"3269_CR6","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York"},{"key":"3269_CR7","doi-asserted-by":"publisher","unstructured":"Deb K, Sundar J (2006) Reference point based multi-objective optimization using evolutionary algorithms. In: GECCO \u201906: Proceedings of the 8th annual conference on Genetic and evolutionary computation, ACM, New York, NY, USA, pp 635\u2013642. \n                    https:\/\/doi.org\/10.1145\/1143997.1144112","DOI":"10.1145\/1143997.1144112"},{"issue":"8","key":"3269_CR8","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/j.cor.2010.10.008","volume":"38","author":"J Dubois-Lacoste","year":"2011","unstructured":"Dubois-Lacoste J, Lpez-Ibez M, Sttzle T (2011) A hybrid tp+pls algorithm for bi-objective flow-shop scheduling problems. Comput Oper Res 38(8):1219\u20131236","journal-title":"Comput Oper Res"},{"issue":"10","key":"3269_CR9","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.advengsoft.2011.05.014","volume":"42","author":"JJ Durillo","year":"2011","unstructured":"Durillo JJ, Nebro AJ (2011) jmetal: A java framework for multi-objective optimization. Adv Eng Softw 42(10):760\u2013771","journal-title":"Adv Eng Softw"},{"key":"3269_CR10","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1016\/j.endm.2010.05.119","volume":"36","author":"S Elaoud","year":"2010","unstructured":"Elaoud S, Teghem J, Loukil T (2010) Multiple crossover genetic algorithm for the multiobjective traveling salesman problem. Electron Notes Discrete Math 36:939\u2013946","journal-title":"Electron Notes Discrete Math"},{"key":"3269_CR11","doi-asserted-by":"crossref","unstructured":"Grunert da Fonseca V, Fonseca C, Hall A (2001) Inferential performance assessment of stochastic optimisers and the attainment function. Evolutionary multi-criterion optimization, vol 1993. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, pp 213\u2013225","DOI":"10.1007\/3-540-44719-9_15"},{"issue":"1","key":"3269_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ejor.2006.03.041","volume":"180","author":"C Garc\u00eda-Mart\u00ednez","year":"2007","unstructured":"Garc\u00eda-Mart\u00ednez C, Cord\u00f3n O, Herrera F (2007) A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria tsp. Eur J Oper Res 180(1):116\u2013148","journal-title":"Eur J Oper Res"},{"key":"3269_CR13","doi-asserted-by":"crossref","unstructured":"Gois MM, Sanches DS, Martins J, Junior JBAL, Delbem ACB (2013) Multi-objective evolutionary algorithm with node-depth encoding and strength pareto for service restoration in large-scale distribution systems. In: Evolutionary multi-criterion optimization, Springer, pp 771\u2013786","DOI":"10.1007\/978-3-642-37140-0_57"},{"issue":"3","key":"3269_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1023\/A:1009690717521","volume":"6","author":"MP Hansen","year":"2000","unstructured":"Hansen MP (2000) Use of substitute scalarizing functions to guide a local search based heuristic: the case of motsp. J Heuristics 6(3):419\u2013431","journal-title":"J Heuristics"},{"issue":"1","key":"3269_CR15","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"137","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz A (2002) Genetic local search for multi-objective combinatorial optimization. Eur J Oper Res 137(1):50\u201371","journal-title":"Eur J Oper Res"},{"issue":"3","key":"3269_CR16","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1016\/j.ejor.2007.10.054","volume":"193","author":"A Jaszkiewicz","year":"2009","unstructured":"Jaszkiewicz A, Zielniewicz P (2009) Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem. Eur J Oper Res 193(3):885\u2013890","journal-title":"Eur J Oper Res"},{"key":"3269_CR17","unstructured":"Knowles J, Thiele L, Zitzler E (2006) A tutorial on the performance assessment of stochastic multiobjective optimizers. TIK Report 214, Computer Engineering and Networks Laboratory (TIK), ETH Zurich"},{"key":"3269_CR18","doi-asserted-by":"crossref","unstructured":"K\u00f6ksalan M, \u00d6zt\u00fcrk DT (2016) An evolutionary approach to generalized biobjective traveling salesperson problem. Comput Oper Res","DOI":"10.1016\/j.cor.2016.04.027"},{"key":"3269_CR19","unstructured":"Krasnogor N, Smith J (2000) A memetic algorithm with self-adaptive local search: Tsp as a case study. In: Proceedings of the 2nd annual conference on genetic and evolutionary computation, Morgan Kaufmann Publishers Inc., pp 987\u2013994"},{"key":"3269_CR20","doi-asserted-by":"crossref","unstructured":"Kumar R, Singh P (2007) Pareto evolutionary algorithm hybridized with local search for biobjective tsp. In: Hybrid evolutionary algorithms. Springer, pp 361\u2013398","DOI":"10.1007\/978-3-540-73297-6_14"},{"key":"3269_CR21","doi-asserted-by":"crossref","unstructured":"Kuncheva LI, Rodr\u00edguez JJ (2007) An experimental study on rotation forest ensembles. In: Proceedings of the 7th international conference on multiple classifier systems. Springer, Berlin, Heidelberg, MCS\u201907, pp 459\u2013468","DOI":"10.1007\/978-3-540-72523-7_46"},{"key":"3269_CR22","unstructured":"Lust T, Teghem J (2007) Two phase stochastic local search algorithms for the biobjective traveling salesman problem. In: Proceedings of SLS-DS, pp 21\u201325"},{"key":"3269_CR23","doi-asserted-by":"crossref","unstructured":"Lust T, Teghem J (2010a) The multiobjective traveling salesman problem: a survey and a new approach. In: Advances in multi-objective nature inspired computing. Springer, pp 119\u2013141","DOI":"10.1007\/978-3-642-11218-8_6"},{"issue":"3","key":"3269_CR24","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10732-009-9103-9","volume":"16","author":"T Lust","year":"2010","unstructured":"Lust T, Teghem J (2010b) Two-phase pareto local search for the biobjective traveling salesman problem. J Heuristics 16(3):475\u2013510","journal-title":"J Heuristics"},{"key":"3269_CR25","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-02538-9_9","volume-title":"Experimental methods for the analysis of optimization algorithms","author":"M Lpez-Ibez","year":"2010","unstructured":"Lpez-Ibez M, Paquete L, Sttzle T (2010) Exploratory analysis of stochastic local search algorithms in biobjective optimization. In: Bartz-Beielstein T, Chiarandini M, Paquete L, Preuss M (eds) Experimental methods for the analysis of optimization algorithms. Springer, Berlin, Heidelberg, pp 209\u2013222"},{"key":"3269_CR26","doi-asserted-by":"crossref","unstructured":"Paquete L, St\u00fctzle T (2003) A two-phase local search for the biobjective traveling salesman problem. In: International conference on evolutionary multi-criterion optimization. Springer, Berlin, pp 479\u2013493","DOI":"10.1007\/3-540-36970-8_34"},{"issue":"9","key":"3269_CR27","doi-asserted-by":"publisher","first-page":"2619","DOI":"10.1016\/j.cor.2008.11.013","volume":"36","author":"L Paquete","year":"2009","unstructured":"Paquete L, St\u00fctzle T (2009) Design and analysis of stochastic local search for the multiobjective traveling salesman problem. Comput Oper Res 36(9):2619\u20132631","journal-title":"Comput Oper Res"},{"key":"3269_CR28","doi-asserted-by":"crossref","unstructured":"Peng W, Zhang Q, Li H (2009) Comparison between moea\/d and nsga-ii on the multi-objective travelling salesman problem. In: Multi-objective memetic algorithms. Springer, pp 309\u2013324","DOI":"10.1007\/978-3-540-88051-6_14"},{"issue":"22","key":"3269_CR29","doi-asserted-by":"publisher","first-page":"8956","DOI":"10.1016\/j.eswa.2015.07.051","volume":"42","author":"ID Psychas","year":"2015","unstructured":"Psychas ID, Delimpasi E, Marinakis Y (2015) Hybrid evolutionary algorithms for the multiobjective traveling salesman problem. Expert Syst Appl 42(22):8956\u20138970","journal-title":"Expert Syst Appl"},{"issue":"2","key":"3269_CR30","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.cie.2008.01.005","volume":"55","author":"F Samanlioglu","year":"2008","unstructured":"Samanlioglu F, Ferrell WG, Kurz ME (2008) A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem. Comput Ind Eng 55(2):439\u2013449","journal-title":"Comput Ind Eng"},{"issue":"3","key":"3269_CR31","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1109\/TPWRS.2010.2041475","volume":"25","author":"A Santos","year":"2010","unstructured":"Santos A, Delbem A, London J, Bretas N (2010) Node-depth encoding and multiobjective evolutionary algorithm applied to large-scale distribution system reconfiguration. IEEE Trans Power Syst 25(3):1254\u20131265. \n                    https:\/\/doi.org\/10.1109\/TPWRS.2010.2041475","journal-title":"IEEE Trans Power Syst"},{"key":"3269_CR32","unstructured":"Zhang Q, Li H (2007) Moea\/d: A multi-objective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput (Accepted)"},{"key":"3269_CR33","unstructured":"Zitzler E, Laumanns M, Thiele L, Zitzler E, Zitzler E, Thiele L, Thiele L (2001) Spea2: Improving the strength pareto evolutionary algorithm"},{"issue":"2","key":"3269_CR34","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler E, Thiele L, Laumanns M, Fonseca C, da Fonseca V (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117\u2013132. \n                    https:\/\/doi.org\/10.1109\/TEVC.2003.810758","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3269-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3269-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3269-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T08:41:16Z","timestamp":1569055276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3269-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,12]]},"references-count":34,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["3269"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3269-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,12]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}