{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:49:07Z","timestamp":1774910947529,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032205360","type":"print"},{"value":"9783032205377","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-20537-7_3","type":"book-chapter","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:32:29Z","timestamp":1773757949000},"page":"35-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Gray-Box Enhanced Decomposition-Based Local Search for\u00a0Multi-objective NK-Landscapes"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Cecere","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bilel","family":"Derbel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Surendra","family":"Kurivella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,18]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Aguirre, H., Tanaka, K.: Insights on properties of multiobjective MNK-landscapes. In: Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), vol. 1, pp. 196\u2013203 (2004). https:\/\/doi.org\/10.1109\/CEC.2004.1330857","DOI":"10.1109\/CEC.2004.1330857"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Basseur, M., Liefooghe, A., Tari, S.: MOW-P: A Simple yet Efficient Partial Neighborhood Walk for Multiobjective Optimization. In: 2024 IEEE Congress on Evolutionary Computation (CEC). pp. 1\u20138 (2024). https:\/\/doi.org\/10.1109\/CEC60901.2024.10611767","DOI":"10.1109\/CEC60901.2024.10611767"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Buzdalov, M.: Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches. In: Proceedings of the Companion Conference on Genetic and Evolutionary Computation. pp. 1873\u20131881. GECCO \u201923 Companion, Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3583133.3596388, https:\/\/doi.org\/10.1145\/3583133.3596388","DOI":"10.1145\/3583133.3596388"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Chicano, F., Whitley, D., Ochoa, G., Tin\u00f3s, R.: Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In: Proceedings of the Genetic and Evolutionary Computation Conference. pp. 753\u2013760. GECCO \u201917, Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3071178.3071285, https:\/\/doi.org\/10.1145\/3071178.3071285","DOI":"10.1145\/3071178.3071285"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Chicano, F., Whitley, D., Sutton, A.M.: Efficient identification of improving moves in a ball for pseudo-boolean problems. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation. pp. 437\u2013444. GECCO \u201914, Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2576768.2598304, https:\/\/doi-org.ressources-electroniques.univ-lille.fr\/10.1145\/2576768.2598304","DOI":"10.1145\/2576768.2598304"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-30698-8_7","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"F Chicano","year":"2016","unstructured":"Chicano, F., Whitley, D., Tin\u00f3s, R.: Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization. In: Chicano, F., Hu, B., Garc\u00eda-S\u00e1nchez, P. (eds.) EvoCOP 2016. LNCS, vol. 9595, pp. 88\u2013103. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30698-8_7"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Derbel, B.: A simple combination of local search and MOEA\/D for combinatorial multi-objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. pp. 355\u2013358. GECCO \u201925 Companion, Association for Computing Machinery, New York, NY, USA (2025). https:\/\/doi.org\/10.1145\/3712255.3726688, https:\/\/doi-org.ressources-electroniques.univ-lille.fr\/10.1145\/3712255.3726688","DOI":"10.1145\/3712255.3726688"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-642-15844-5_49","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"MM Drugan","year":"2010","unstructured":"Drugan, M.M., Thierens, D.: Path-Guided Mutation for Stochastic Pareto Local Search Algorithms. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 485\u2013495. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_49"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Drugan, M.M., Thierens, D.: Stochastic pareto local search: pareto neighbourhood exploration and perturbation strategies. J. Heuristics 18(5), 727\u2013766 (2012). https:\/\/doi.org\/10.1007\/s10732-012-9205-7, https:\/\/doi.org\/10.1007\/s10732-012-9205-7","DOI":"10.1007\/s10732-012-9205-7"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Dubois-Lacoste, J., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Combining two search paradigms for multi-objective optimization: two-phase and pareto local search. In: Talbi, E.G. (eds.) Hybrid Metaheuristics, pp. 97\u2013117. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-30671-6_3, https:\/\/doi.org\/10.1007\/978-3-642-30671-6_3","DOI":"10.1007\/978-3-642-30671-6_3"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Dubois-Lacoste, J., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: anytime pareto local search. Eur. J. Oper. Res.243(2), 369\u2013385 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.10.062, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221714009011","DOI":"10.1016\/j.ejor.2014.10.062"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Fonseca, C.M., Fleming, P.J.: On the performance assessment and comparison of stochastic multiobjective optimizers. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds.) Parallel Problem Solving from Nature - PPSN IV. Lecture Notes in Computer Science, vol. 1141, pp. 584\u2013593. Springer, Cham (1996). https:\/\/doi.org\/10.1007\/3-540-61723-X_963","DOI":"10.1007\/3-540-61723-X_963"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Goldman, B.W., Punch, W.F.: Gray-box optimization using the parameter-less population pyramid. In: Laredo, J.L.J., Silva, S., Esparcia-Alc\u00e1zar, A.I. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2015, Madrid, Spain, July 11\u201315, 2015. pp. 855\u2013862. ACM (2015). https:\/\/doi.org\/10.1145\/2739480.2754775, http:\/\/doi.acm.org\/10.1145\/2739480.2754775","DOI":"10.1145\/2739480.2754775"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Josef Geiger, M.: Decision support for multi-objective flow shop scheduling by the pareto iterated local search methodology. Comput. & Ind. Eng. 61(3), 805\u2013812 (2011). https:\/\/doi.org\/10.1016\/j.cie.2011.05.013, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835211001380","DOI":"10.1016\/j.cie.2011.05.013"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Kauffman, S.A.: The Origins of Order. Oxford University Press (1993)","DOI":"10.1093\/oso\/9780195079517.001.0001"},{"key":"3_CR16","unstructured":"Knowles, J., Thiele, L., Zitzler, E.: A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers. Technical report 214, Computer Engineering and Networks Laboratory, ETH Zurich (2006)"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Li, M., Han, X., Chu, X., Liang, Z.: Empirical comparison between moeas and local search on multi-objective combinatorial optimisation problems. In: Proceedings of the Genetic and Evolutionary Computation Conference. pp. 547\u2013556. GECCO \u201924, Association for Computing Machinery, New York, NY, USA (2024). https:\/\/doi.org\/10.1145\/3638529.3654077","DOI":"10.1145\/3638529.3654077"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Paquete, L., St\u00fctzle, T.: Exploratory analysis of stochastic local search algorithms in biobjective optimization. In: Parallel Problem Solving from Nature - PPSN XI. Lecture Notes in Computer Science, vol. 6238, pp. 209\u2013218. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_21","DOI":"10.1007\/978-3-642-15844-5_21"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search. In: Handbook of Metaheuristics, International Series in Operations Research & Management Science, vol. 57, pp. 320\u2013353. Springer, Cham (2003). https:\/\/doi.org\/10.1007\/0-306-48056-5_11","DOI":"10.1007\/0-306-48056-5_11"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Lust, T., Teghem, J.: Two-phase pareto local search for the biobjective traveling salesman problem. J. Heuristics 16(3), 475\u2013510 (2010). https:\/\/doi.org\/10.1007\/s10732-009-9103-9","DOI":"10.1007\/s10732-009-9103-9"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-319-10762-2_63","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"G Marquet","year":"2014","unstructured":"Marquet, G., Derbel, B., Liefooghe, A., Talbi, E.-G.: Shake Them All! In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 641\u2013651. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_63"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Paquete, L., Chiarandini, M., St\u00fctzle, T.: Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study. In: Gandibleux, X., Sevaux, M., S\u00f6rensen, K., T\u2019kindt, V. (eds.) Metaheuristics for Multiobjective Optimisation. pp. 177\u2013199. Springer, Cham (2004). https:\/\/doi.org\/10.1007\/978-3-642-17144-4_7","DOI":"10.1007\/978-3-642-17144-4_7"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Pitzer, E., Affenzeller, M.: Cheating like the neighbors: logarithmic complexity for fitness evaluation in genetic algorithms. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 1431\u20131438 (2021). https:\/\/doi.org\/10.1109\/CEC45853.2021.9504849","DOI":"10.1109\/CEC45853.2021.9504849"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Rodr\u0131guez-Zbinden, S., Montero, E., Blazquez, C., Miranda, P.: A multi-objective iterated local search approach to solve the insular traveling salesman problem. IEEE Congress on Evolutionary Computation (CEC), pp. 2339\u20132346 (2021)","DOI":"10.1109\/CEC45853.2021.9504830"},{"key":"3_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.104826","volume":"112","author":"VLA Santos","year":"2022","unstructured":"Santos, V.L.A., Carvalho, T.F.M., de Assis, L.P., Weiss-Cohen, M., Guimara, F.G.: Multi-objective iterated local search based on decomposition for job scheduling problems with machine deterioration effect. Eng. Appl. Artif. Intell. 112, 104826 (2022)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"3_CR26","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1109\/TCYB.2018.2880256","volume":"50","author":"J Shi","year":"2020","unstructured":"Shi, J., Zhang, Q., Sun, J.: PPLS\/D: parallel pareto local search based on decomposition. IEEE Trans. Cybern. 50(3), 1060\u20131071 (2020). https:\/\/doi.org\/10.1109\/TCYB.2018.2880256","journal-title":"IEEE Trans. Cybern."},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Tagawa, Y., Aguirre, H.E., Tanaka, K.: Distributed bit climbing algorithm for binary multi-objective optimization. In: IEEE Congress on Evolutionary Computation, CEC 2024, Yokohama, Japan, June 30\u2013July 5, 2024. pp. 1\u20138. IEEE (2024). https:\/\/doi.org\/10.1109\/CEC60901.2024.10612034","DOI":"10.1109\/CEC60901.2024.10612034"},{"issue":"2","key":"3_CR28","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ejor.2012.12.019","volume":"227","author":"S Verel","year":"2013","unstructured":"Verel, S., Liefooghe, A., Jourdan, L., Dhaenens, C.: On the structure of multiobjective combinatorial search space: mnk-landscapes with correlated objectives. EJOR 227(2), 331\u2013342 (2013)","journal-title":"EJOR"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Whitley, D., Chen, W.: Constant Time Steepest Descent Local Search with Lookahead for NK-Landscapes and MAX-kSAT. GECCO\u201912, July 7\u201311, 2012, Philadelphia, Pennsylvania, USA (2012)","DOI":"10.1145\/2330163.2330351"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Whitley, L.D., Chicano, F., Goldman, B.W.: Gray box optimization for Mk landscapes Nk landscapes and Max-Ksat. Evol. Comput. 24(3), 491\u2013519 (2016). https:\/\/doi.org\/10.1162\/EVCO_a_00184","DOI":"10.1162\/EVCO_a_00184"},{"issue":"4","key":"3_CR31","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1109\/4235.887236","volume":"4","author":"A Wright","year":"2000","unstructured":"Wright, A., Thompson, R., Zhang, J.: The Computational Complexity of N-K Fitness Functions. IEEE Trans. Evol. Comput. 4(4), 373\u2013379 (2000). https:\/\/doi.org\/10.1109\/4235.887236","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6) (2007)","DOI":"10.1109\/TEVC.2007.892759"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE TEVC 7(2), 117\u2013132 (2003)","DOI":"10.1109\/TEVC.2003.810758"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-20537-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:02:54Z","timestamp":1774908174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20537-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032205360","9783032205377"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20537-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"18 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare no competing interests relevant to this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}