{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:09:50Z","timestamp":1743062990649,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819635054"},{"type":"electronic","value":"9789819635061"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-3506-1_5","type":"book-chapter","created":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T12:50:20Z","timestamp":1740747020000},"page":"60-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PAES-25: Local Search, Archiving, and\u00a0Multi\/Many-Objective Pseudo-Boolean Functions"],"prefix":"10.1007","author":[{"given":"Joshua","family":"Knowles","sequence":"first","affiliation":[]},{"given":"Arnaud","family":"Liefooghe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,28]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105857","volume":"145","author":"R Allmendinger","year":"2022","unstructured":"Allmendinger, R., Jaszkiewicz, A., Liefooghe, A., Tammer, C.: What if we increase the number of objectives? theoretical and empirical implications for many-objective combinatorial optimization. Comput. Oper. Res. 145, 105857 (2022). https:\/\/doi.org\/10.1016\/j.cor.2022.105857","journal-title":"Comput. Oper. Res."},{"key":"5_CR2","unstructured":"Bader,\u00a0J.M.: Hypervolume-based search for multiobjective optimization: theory and methods. Ph.D. thesis, ETH Zurich (2010)"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.1597059","volume":"1","author":"CA Coello Coello","year":"2006","unstructured":"Coello Coello, C.A.: Evolutionary multi-objective optimization: a historical view of the field. IEEE Comput. Intell. Mag. 1(1), 28\u201336 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Doerr,\u00a0B., Le,\u00a0H.P., Makhmara,\u00a0R., Nguyen,\u00a0T.D.: Fast genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 777\u2013784 (2017)","DOI":"10.1145\/3071178.3071301"},{"key":"5_CR5","unstructured":"Garey,\u00a0M., Johnson,\u00a0D.: Computers and intractability: a guide to the theory of NP-Completeness. WH Freeman and Co. (1979)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Knowles,\u00a0J., Corne,\u00a0D.: The Pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimisation. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol.\u00a01, pp. 98\u2013105. IEEE (1999)","DOI":"10.1109\/CEC.1999.781913"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TEVC.2003.810755","volume":"7","author":"J Knowles","year":"2003","unstructured":"Knowles, J., Corne, D.: Properties of an adaptive archiving algorithm for storing nondominated vectors. IEEE Trans. Evol. Comput. 7(2), 100\u2013116 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Knowles,\u00a0J., Corne,\u00a0D.: Bounded pareto archiving: Theory and practice. In: Metaheuristics for multiobjective optimisation, pp. 39\u201364, Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-642-17144-4_2"},{"key":"5_CR9","unstructured":"Knowles,\u00a0J.D.: Local Search and Hybrid Evolutionary Algorithms for Pareto Optimization. Ph.D. thesis, Department of Computer Science, University of Reading, UK (2002)"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"Knowles, J.D., Corne, D.: Approximating the nondominated front using the Pareto archived evolution strategy. Evol. Comput. 8(2), 149\u2013172 (2000). https:\/\/doi.org\/10.1162\/106365600568167","journal-title":"Evol. Comput."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Knowles,\u00a0J.D., Corne,\u00a0D.: M-PAES: a memetic algorithm for multiobjective optimization. In: Proceedings of the 2000 Congress on Evolutionary Computation (CEC\u201900), pp. 325\u2013332. IEEE Press, Piscataway (2000)","DOI":"10.1109\/CEC.2000.870313"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1109\/TEVC.2004.823470","volume":"8","author":"M Laumanns","year":"2004","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: Running time analysis of multiobjective evolutionary algorithms on pseudo-boolean functions. IEEE Trans. Evol. Comput. 8(2), 170\u2013182 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-45712-7_5","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN VII","author":"M Laumanns","year":"2002","unstructured":"Laumanns, M., Thiele, L., Zitzler, E., Welzl, E., Deb, K.: Running time analysis of multi-objective evolutionary algorithms on a simple discrete optimization problem. In: Guerv\u00f3s, J.J.M., Adamidis, P., Beyer, H.-G., Schwefel, H.-P., Fern\u00e1ndez-Villaca\u00f1as, J.-L. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 44\u201353. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45712-7_5"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.ejor.2011.03.039","volume":"213","author":"M Laumanns","year":"2011","unstructured":"Laumanns, M., Zenklusen, R.: Stochastic convergence of random search methods to fixed size pareto front approximations. Eur. J. Oper. Res. 213(2), 414\u2013421 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/TEVC.2023.3314152","volume":"28","author":"M Li","year":"2024","unstructured":"Li, M., L\u00f3pez-Ib\u00e1\u00f1ez, M., Yao, X.: Multi-objective archiving. IEEE Trans. Evol. Comput. 28, 696\u2013717 (2024)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10732-011-9181-3","volume":"18","author":"A Liefooghe","year":"2012","unstructured":"Liefooghe, A., Humeau, J., Mesmoudi, S., Jourdan, L., Talbi, E.G.: On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems. J. Heurist. 18(2), 317\u2013352 (2012). https:\/\/doi.org\/10.1007\/s10732-011-9181-3","journal-title":"J. Heurist."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-19893-9_4","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2011","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Knowles, J., Laumanns, M.: On sequential online archiving of objective vectors. In: Takahashi, R.H.C., Deb, K., Wanner, E.F., Greco, S. (eds.) EMO 2011. LNCS, vol. 6576, pp. 46\u201360. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19893-9_4"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-319-10762-2_61","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2014","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Liefooghe, A., Verel, S.: Local optimal sets and bounded archiving on multi-objective NK-landscapes with correlated objectives. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 621\u2013630. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_61"},{"key":"5_CR19","unstructured":"Mitchell,\u00a0M., Holland,\u00a0J., Forrest,\u00a0S.: When will a genetic algorithm outperform hill climbing? Adv. Neural Inf. Process. Syst. 6 (1993)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Murata,\u00a0T., Ishibuchi,\u00a0H., et\u00a0al.: MOGA: multi-objective genetic algorithms. In: IEEE International Conference on Evolutionary Computation, vol.\u00a01, pp. 289\u2013294. IEEE, Piscataway (1995)","DOI":"10.1109\/ICEC.1995.489161"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Nebro,\u00a0A.J., Durillo,\u00a0J.J., Vergne,\u00a0M.: Redesigning the jMetal multi-objective optimization framework. In: Jim\u00e9nez\u00a0Laredo,\u00a0J.L., Silva,\u00a0S., Esparcia-Alc\u00e1zar,\u00a0A.I. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO Companion 2015, pp. 1093\u20131100. ACM Press, New York (2015). https:\/\/doi.org\/10.1145\/2739482.2768462","DOI":"10.1145\/2739482.2768462"},{"key":"5_CR22","unstructured":"Schaffer,\u00a0J.D.: Some experiments in machine learning using vector evaluated genetic algorithms. Technical report. Vanderbilt Univ., Nashville, TN (USA) (1985)"},{"issue":"4","key":"5_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian, Y., Cheng, R., Zhang, X., Jin, Y.: PlatEMO: a MATLAB platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput. Intell. Mag. 12(4), 73\u201387 (2017). https:\/\/doi.org\/10.1109\/MCI.2017.2742868","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"2","key":"5_CR24","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. Eur. J. Oper. Res. 227(2), 331\u2013342 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Zheng,\u00a0W., Doerr,\u00a0B.: Runtime analysis for the NSGA-II: proving, quantifying, and explaining the inefficiency for many objectives. IEEE Trans. Evol. Comput., (2023). https:\/\/doi.org\/10.1109\/TEVC.2023.3320278","DOI":"10.1109\/TEVC.2023.3320278"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-3506-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T12:50:23Z","timestamp":1740747023000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-3506-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819635054","9789819635061"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-3506-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"EMO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Evolutionary Multi-Criterion Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canberra, ACT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"emo2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.emo2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}