{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:15:44Z","timestamp":1758266144878,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T00:00:00Z","timestamp":1657324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Major Project of National Science Foundation of China","award":["U1811461"],"award-info":[{"award-number":["U1811461"]}]},{"name":"Project of National Science Foundation of China","award":["61721002"],"award-info":[{"award-number":["61721002"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11991023,62076197"],"award-info":[{"award-number":["11991023,62076197"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Project of National Science Foundation of China","award":["11690011"],"award-info":[{"award-number":["11690011"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,9]]},"DOI":"10.1145\/3520304.3528906","type":"proceedings-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T15:29:44Z","timestamp":1658244584000},"page":"383-386","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Learning to balance exploration and exploitation in pareto local search for multi-objective combinatorial optimization"],"prefix":"10.1145","author":[{"given":"Haotian","family":"Zhang","sequence":"first","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, ShaanXi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jialong","family":"Shi","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, ShaanXi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianyong","family":"Sun","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, ShaanXi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongben","family":"Xu","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, ShaanXi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Marcin Andrychowicz Misha Denil Sergio Gomez Matthew W Hoffman David Pfau Tom Schaul Brendan Shillingford and Nando De Freitas. 2016. Learning to learn by gradient descent by gradient descent. In Advances in Neural Information Processing Systems. 3981--3989."},{"key":"e_1_3_2_1_2_1","volume-title":"Anytime Pareto local search. European Journal of Operational Research 243 (06","author":"Dubois-Lacoste J\u00e9r\u00e9mie","year":"2015","unstructured":"J\u00e9r\u00e9mie Dubois-Lacoste, Manuel L\u00f3pez-Ib\u00e1\u00f1ez, and Thomas St\u00fctzle. 2015. Anytime Pareto local search. European Journal of Operational Research 243 (06 2015), 369--385."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1024022"},{"key":"e_1_3_2_1_4_1","volume-title":"Hoos and Thomas St\u00fctzle","author":"Holger","year":"2004","unstructured":"Holger H. Hoos and Thomas St\u00fctzle. 2004. Stochastic Local Search: Foundations and Applications. R\u00e9 f\u00e9rence Morgan Kaufmann Publishers, San Francisco, California, USA."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-011-9181-3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.11.008"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Luis Paquete Marco Chiarandini and Thomas St\u00fctzle. 2004. Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study. In Metaheuristics for Multiobjective Optimisation Xavier Gandibleux Marc Sevaux Kenneth S\u00f6rensen and Vincent T'kindt (Eds.). 177--199.","DOI":"10.1007\/978-3-642-17144-4_7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0230-0"},{"volume-title":"Simulated Evolution and Learning","author":"Shi Jialong","key":"e_1_3_2_1_9_1","unstructured":"Jialong Shi, Qingfu Zhang, Bilel Derbel, Arnaud Liefooghe, and S\u00e9bastien Verel. 2017. Using Parallel Strategies to Speed up Pareto Local Search. In Simulated Evolution and Learning. Springer International Publishing, Cham, 62--74."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2880256"},{"key":"e_1_3_2_1_11_1","volume-title":"Evolution Strategies as a Scalable Alternative to Reinforcement Learning. Arxiv","author":"Tim Salimans","year":"2017","unstructured":"Salimans Tim, Ho Jonathan, Chen Xi, Sidor Szymon, and Sutskever Ilya. 2017. Evolution Strategies as a Scalable Alternative to Reinforcement Learning. Arxiv (2017), 1703.03864v2."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.09.122"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"}],"event":{"name":"GECCO '22: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Boston Massachusetts","acronym":"GECCO '22"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3528906","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3520304.3528906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:22Z","timestamp":1750183822000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3528906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,9]]},"references-count":13,"alternative-id":["10.1145\/3520304.3528906","10.1145\/3520304"],"URL":"https:\/\/doi.org\/10.1145\/3520304.3528906","relation":{},"subject":[],"published":{"date-parts":[[2022,7,9]]},"assertion":[{"value":"2022-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}