{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T08:28:16Z","timestamp":1767860896608,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,9,8]],"date-time":"2018-09-08T00:00:00Z","timestamp":1536364800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003069","name":"Instituto Polit\u00e9cnico Nacional","doi-asserted-by":"publisher","award":["SIP20181450"],"award-info":[{"award-number":["SIP20181450"]}],"id":[{"id":"10.13039\/501100003069","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s12293-018-0273-6","type":"journal-article","created":{"date-parts":[[2018,9,8]],"date-time":"2018-09-08T03:59:27Z","timestamp":1536379167000},"page":"155-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On the choice of neighborhood sampling to build effective search operators for constrained MOPs"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2498-4441","authenticated-orcid":false,"given":"Adriana","family":"Lara","sequence":"first","affiliation":[]},{"given":"Lourdes","family":"Uribe","sequence":"additional","affiliation":[]},{"given":"Sergio","family":"Alvarado","sequence":"additional","affiliation":[]},{"given":"V\u00edctor Adri\u00e1n","family":"Sosa","sequence":"additional","affiliation":[]},{"given":"Honggang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Oliver","family":"Sch\u00fctze","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,8]]},"reference":[{"key":"273_CR1","doi-asserted-by":"crossref","unstructured":"Alvarado S, Lara A, Sosa V, Sch\u00fctze O (2016) An effective mutation operator to deal with multi-objective constrained problems: Spm. In: 2016 13th international conference on electrical engineering, computing science and automatic control (CCE), IEEE, pp 1\u20136","DOI":"10.1109\/ICEEE.2016.7751258"},{"issue":"3","key":"273_CR2","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume N, Naujoks B, Emmerich M (2007) SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur J Oper Res 181(3):1653\u20131669. https:\/\/doi.org\/10.1016\/j.ejor.2006.08.008","journal-title":"Eur J Oper Res"},{"issue":"1","key":"273_CR3","first-page":"3","volume":"6","author":"M Brown","year":"2005","unstructured":"Brown M, Smith RE (2005) Directed multi-objective optimization. Int J Comput Syst Signals 6(1):3\u201317","journal-title":"Int J Comput Syst Signals"},{"key":"273_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary algorithms for solving multi-objective problems","author":"CAC Coello","year":"2002","unstructured":"Coello CAC, Van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems, vol 242. Springer, Berlin"},{"key":"273_CR5","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"},{"issue":"1","key":"273_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJAISC.2014.059280","volume":"4","author":"K Deb","year":"2014","unstructured":"Deb K, Deb D (2014) Analysing mutation schemes for real-parameter genetic algorithms. Int J Artif Intell Soft Comput 4(1):1\u201328","journal-title":"Int J Artif Intell Soft Comput"},{"issue":"2","key":"273_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"273_CR8","doi-asserted-by":"crossref","unstructured":"Deb K, Thiele L, Laumanns M, Zitzler E (2002) Scalable multi-objective optimization test problems. In: Proceedings of the congress on evolutionary computation (CEC-2002), (Honolulu, USA), pp 825\u2013830","DOI":"10.1109\/CEC.2002.1007032"},{"key":"273_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8280-4","volume-title":"Nonlinear multiobjective optimization: a generalized homotopy approach","author":"C Hillermeier","year":"2001","unstructured":"Hillermeier C (2001) Nonlinear multiobjective optimization: a generalized homotopy approach, vol 135. Springer, Berlin"},{"key":"273_CR10","unstructured":"Karush W (1939) Minima of functions of several variables with inequalities as side constraints. Ph.D. thesis, Masters thesis, Department of Mathematics, University of Chicago"},{"key":"273_CR11","doi-asserted-by":"crossref","unstructured":"Kuhn HW, Tucker AW (1951) Nonlinear programming. In: Proceedings of the second Berkeley symposium on mathematical statistics and probability, pp 481\u2013492. University of California Press, Berkeley, California","DOI":"10.1525\/9780520411586-036"},{"key":"273_CR12","doi-asserted-by":"crossref","unstructured":"Kukkonen S, Lampinen J (2005) Gde3: The third evolution step of generalized differential evolution. In: The 2005 IEEE congress on evolutionary computation, 2005, vol 1. IEEE, pp 443\u2013450","DOI":"10.1109\/CEC.2005.1554717"},{"key":"273_CR13","doi-asserted-by":"crossref","unstructured":"Li J, Tan Y (2015) Orienting mutation based fireworks algorithm. In: IEEE Congress on evolutionary computation (CEC) 2015, IEEE, pp 1265\u20131271","DOI":"10.1109\/CEC.2015.7257034"},{"issue":"6","key":"273_CR14","doi-asserted-by":"publisher","first-page":"3373","DOI":"10.1137\/130906544","volume":"51","author":"B Martin","year":"2013","unstructured":"Martin B, Goldsztejn A, Granvilliers L, Jermann C (2013) Certified parallelotope continuation for one-manifolds. SIAM J Numer Anal 51(6):3373\u20133401","journal-title":"SIAM J Numer Anal"},{"issue":"1","key":"273_CR15","first-page":"1","volume":"64","author":"B Martin","year":"2014","unstructured":"Martin B, Goldsztejn A, Granvilliers L, Jermann C (2014) On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach. J Glob Optim 64(1):1\u201314","journal-title":"J Glob Optim"},{"issue":"1","key":"273_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z, Schoenauer M (1996) Evolutionary algorithms for constrained parameter optimization problems. Evol Comput 4(1):1\u201332","journal-title":"Evol Comput"},{"key":"273_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical optimization 2nd","author":"J Nocedal","year":"1999","unstructured":"Nocedal J, Wright SJ (1999) Numerical optimization 2nd. Springer Series in Operations Research, Springer, New York"},{"key":"273_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s001860300281","volume":"58","author":"MC Recchioni","year":"2003","unstructured":"Recchioni MC (2003) A path following method for box-constrained multiobjective optimization with applications to goal programming problems. Math Methods Oper Res 58:69\u201385","journal-title":"Math Methods Oper Res"},{"key":"273_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92910-9","volume-title":"Handbook of natural computing","year":"2012","unstructured":"Rozenberg G, B\u00e4ck T, Kok JN (eds) (2012) Handbook of natural computing. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-540-92910-9"},{"issue":"2","key":"273_CR20","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s10589-015-9815-8","volume":"64","author":"G Rudolph","year":"2016","unstructured":"Rudolph G, Sch\u00fctze O, Grimme C, Dom\u00ednguez-Medina C, Trautmann H (2016) Optimal averaged hausdorff archives for bi-objective problems: theoretical and numerical results. Comput Optim Appl 64(2):589\u2013618","journal-title":"Comput Optim Appl"},{"issue":"4","key":"273_CR21","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TEVC.2011.2161872","volume":"16","author":"O Sch\u00fctze","year":"2012","unstructured":"Sch\u00fctze O, Esquivel X, Lara A, Coello Coello CA (2012) Using the averaged Hausdorff distance as a performance measure in evolutionary multiobjective optimization. IEEE Trans Evol Comput 16(4):504\u2013522. https:\/\/doi.org\/10.1109\/TEVC.2011.2161872","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"273_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1162\/evco.2010.18.1.18103","volume":"18","author":"O Sch\u00fctze","year":"2010","unstructured":"Sch\u00fctze O, Laumanns M, Tantar E, Coello CAC, Talbi EG (2010) Computing gap free Pareto front approximations with stochastic search algorithms. Evol Comput 18(1):65\u201396","journal-title":"Evol Comput"},{"key":"273_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-015-9774-0","volume":"63","author":"O Sch\u00fctze","year":"2015","unstructured":"Sch\u00fctze O, Mart\u00edn A, Lara A, Alvarado S, Salinas E, Coello Coello CA (2015) The directed search method for multi-objective memetic algorithms. Comput Optim Appl 63:1\u201328. https:\/\/doi.org\/10.1007\/s10589-015-9774-0","journal-title":"Comput Optim Appl"},{"key":"273_CR24","doi-asserted-by":"crossref","unstructured":"Shalamov V, Filchenkov A, Chivilikhin D (2016) Small-moves based mutation for pick-up and delivery problem. In: Proceedings of the 2016 on genetic and evolutionary computation conference companion, ACM, pp 1027\u20131030","DOI":"10.1145\/2908961.2931666"},{"key":"273_CR25","doi-asserted-by":"crossref","unstructured":"Teytaud F, Teytaud O (2016) Qr mutations improve many evolution strategies: A lot on highly multimodal problems. In: Proceedings of the 2016 on genetic and evolutionary computation conference companion, ACM, pp 35\u201336","DOI":"10.1145\/2908961.2909060"},{"key":"273_CR26","unstructured":"Tian Y, Cheng R, Zhang X, Jin Y (2017) Platemo: a matlab platform for evolutionary multi-objective optimization. arXiv preprint arXiv:1701.00879"},{"issue":"6","key":"273_CR27","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 (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"273_CR28","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173\u2013195","journal-title":"Evol Comput"},{"issue":"2","key":"273_CR29","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 CM, Da Fonseca VG (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117\u2013132","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-018-0273-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-018-0273-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-018-0273-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T03:18:06Z","timestamp":1720581486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-018-0273-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,8]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["273"],"URL":"https:\/\/doi.org\/10.1007\/s12293-018-0273-6","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,8]]},"assertion":[{"value":"29 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}