{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:49:11Z","timestamp":1774910951095,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"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_7","type":"book-chapter","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:28:36Z","timestamp":1773757716000},"page":"101-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Gray-Box Bi-objective Boolean Optimization Using Deterministic Recombination with\u00a0Iterated Local Search"],"prefix":"10.1007","author":[{"given":"Surendra","family":"Kurivella","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Cecere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bilel","family":"Derbel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,18]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Aguirre, H.: Random bit climbers on multiobjective MNK-landscapes: effects of memory and population climbing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E88-A(1), 334\u2013345 (2005). https:\/\/doi.org\/10.1093\/ietfec\/E88-A.1.334","DOI":"10.1093\/ietfec\/E88-A.1.334"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros, E., Hammer, P.: Pseudo-Boolean optimization. Discret. Appl. Math. 123(1), 155\u2013225 (2002)","journal-title":"Discret. Appl. Math."},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Canonne, L., Derbel, B.: DRILS revisited: designing perturbation in graybox optimization techniques. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2022, pp. 204\u2013212. Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3512290.3528774","DOI":"10.1145\/3512290.3528774"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Chicano, F., Whitley, D., Ochoa, G., Tin\u00f3s, R.: Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 753\u2013760. ACM (2017)","DOI":"10.1145\/3071178.3071285"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Chicano, F., Whitley, D., Sutton, A.: Efficient identification of improving moves in a ball for pseudo-boolean problems. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 437\u2013444. ACM (2014)","DOI":"10.1145\/2576768.2598304"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Derbel, B.: A simple combination of local search and MOEAD for combinatorial multi-objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025 Companion, pp. 355\u2013358. Association for Computing Machinery, New York, NY, USA (2025)","DOI":"10.1145\/3712255.3726688"},{"issue":"5","key":"7_CR8","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s10732-012-9205-7","volume":"18","author":"MM Drugan","year":"2012","unstructured":"Drugan, M.M., Thierens, D.: Stochastic pareto local search: pareto neighbourhood exploration and perturbation strategies. J. Heurist. 18(5), 727\u2013766 (2012)","journal-title":"J. Heurist."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Dunton, P., Whitley, D.: Reducing the cost of partition crossover on large maxsat problems: the PX-preprocessor. In: Genetic and Evolutionary Computation Conference (GECCO 2022) (2022)","DOI":"10.1145\/3512290.3528748"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Gamarnik, D., Jagannath, A., Kizildag, E.: Shattering in the ising p-spin glass model. Probability Theory and Related Fields (Springer Nature) (2025). https:\/\/doi.org\/10.1007\/s00440-025-01414-4","DOI":"10.1007\/s00440-025-01414-4"},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.cie.2011.05.013","volume":"61","author":"MJ Geiger","year":"2011","unstructured":"Geiger, M.J.: Decision support for multi-objective flow shop scheduling by the pareto iterated local search methodology. Comput. Ind. Eng. 61(3), 805\u2013812 (2011)","journal-title":"Comput. Ind. Eng."},{"key":"7_CR12","unstructured":"Helsgaun, K.: DIMACS TSP Challenge Results: Current Best Tours Found by LKH (2013). http:\/\/www.akira.ruc.dk\/keld\/research\/LKH\/DIMACSresults.html. Accessed 24 Nov 2013"},{"key":"7_CR13","unstructured":"Hoos, H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufman (2004)"},{"key":"7_CR14","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 L\u00f3pez-Ib\u00e1\u00f1ez","year":"2010","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Paquete, L., St\u00fctzle, T.: 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, pp. 209\u2013222. Springer, Heidelberg (2010)"},{"key":"7_CR15","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"HR Louren\u00e7o","year":"2002","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321\u2013353. Kluwer Academic Publishers, Norwell (2002)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Paquete, L., Chiarandini, M., St\u00fctzle, T.: Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study. In: Metaheuristics for Multiobjective Optimisation, vol.\u00a0535, pp. 177\u2013199. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-642-17144-4_7"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Zbinden, S., Montero, E., Bl\u00e1zquez, C., Miranda, P.: A multi-objective iterated local search approach to solve the insular traveling salesman problem. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 2339\u20132346 (2021)","DOI":"10.1109\/CEC45853.2021.9504830"},{"key":"7_CR18","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., Guimar\u00e3es, 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."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Tino, R., Whitley, D., Helsgaun, K.: Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. In: Parallel Problem Solving from Nature (PPSN), pp. 95\u2013107. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-99253-2_8"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Tin\u00f3s, R., Whitley, D., Ochoa, G.: Partition crossover for pseudo-boolean optimization. In: Foundations of Genetic Algorithms (FOGA), pp. 137\u2013149. ACM (2015)","DOI":"10.1145\/2725494.2725497"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1007\/s11590-019-01460-7","volume":"14","author":"A Verma","year":"2020","unstructured":"Verma, A., Lewis, M.: Optimal quadratic reformulations of fourth degree Pseudo-Boolean Functions. Optim. Lett. 14, 1557\u20131569 (2020)","journal-title":"Optim. Lett."},{"key":"7_CR22","unstructured":"Verma, A., Lewis, M., Kochenberger, G.: Efficient qubo transformation for higher degree pseudo boolean functions (2021). https:\/\/arxiv.org\/abs\/2107.11695"},{"key":"7_CR23","unstructured":"Weinberger, E.: NP-completeness of Kauffman\u2019s N-k model: a tunably rugged energy landscape. Technical Report. 96-02-003, Santa Fe Institute, Santa Fe, NM (1996)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Whitley, D., Chen, W.: Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1357\u20131364. ACM (2012)","DOI":"10.1145\/2330163.2330351"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Whitley, D., Chicano, F., Goldman, B.: Gray box optimization for Mk landscapes (NK landscapes and MAX-kSAT). Evol. Comput. (2016)","DOI":"10.1162\/EVCO_a_00184"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Whitley, D., Howe, A., Hains, D.: Greedy or not? Best improving versus first improving stochastic local search for MAXSAT. In: The National Conference on Artificial Intelligence (AAAI), pp. 940\u2013946 (2013)","DOI":"10.1609\/aaai.v27i1.8668"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Whitley, D., Ochoa, G., Chicano, F.: Partition crossover can linearize optima lattices of k-bounded pseudo-boolean functions. In: Foundations of Genetic Algorithms (FOGA). ACM (2023)","DOI":"10.1145\/3594805.3607129"},{"issue":"6","key":"7_CR28","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(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:03:12Z","timestamp":1774908192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20537-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032205360","9783032205377"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20537-7_7","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":"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"}}]}}