Table of Contents

• Digging into Semantics: Where Do Search-Based Software Repair Methods Search?Hammad Ahmad, Padraic Cashin, Stephanie Forrest, Westley Weimer. 3-18 [doi]
• Gene-pool Optimal Mixing in Cartesian Genetic ProgrammingJoe Harrison, Tanja Alderliesten, Peter A. N. Bosman. 19-32 [doi]
• Genetic Programming for Combining Directional Changes Indicators in International Stock MarketsXinpeng Long, Michael Kampouridis, Panagiotis Kanellopoulos. 33-47 [doi]
• Importance-Aware Genetic Programming for Automated Scheduling Heuristics Learning in Dynamic Flexible Job Shop SchedulingFangfang Zhang 0003, Yi Mei 0001, Su Nguyen, Mengjie Zhang 0001. 48-62 [doi]
• Towards Discrete Phenotypic Recombination in Cartesian Genetic ProgrammingRoman Kalkreuth. 63-77 [doi]
• A General Architecture for Generating Interactive Decomposition-Based MOEAsGiomara Lárraga, Kaisa Miettinen. 81-95 [doi]
• An Exact Inverted Generational Distance for Continuous Pareto FrontZihan Wang, Chunyun Xiao, Aimin Zhou. 96-109 [doi]
• Direction Vector Selection for R2-Based Hypervolume Contribution ApproximationTianye Shu, Ke Shang, Yang Nan, Hisao Ishibuchi. 110-123 [doi]
• Do We Really Need to Use Constraint Violation in Constrained Evolutionary Multi-objective Optimization?Shuang Li, Ke Li 0001, Wei Li. 124-137 [doi]
• Dynamic Multi-modal Multi-objective Optimization: A Preliminary StudyYiming Peng, Hisao Ishibuchi. 138-150 [doi]
• Fair Feature Selection with a Lexicographic Multi-objective Genetic AlgorithmJames Brookhouse, Alex Alves Freitas. 151-163 [doi]
• Greedy Decremental Quick Hypervolume Subset Selection AlgorithmsAndrzej Jaszkiewicz, Piotr Zielniewicz. 164-178 [doi]
• Hybridizing Hypervolume-Based Evolutionary Algorithms and Gradient Descent by Dynamic Resource AllocationDamy M. F. Ha, Timo M. Deist, Peter A. N. Bosman. 179-192 [doi]
• Identifying Stochastically Non-dominated Solutions Using Evolutionary ComputationHemant Kumar Singh, Jürgen Branke. 193-206 [doi]
• Large-Scale Multi-objective Influence Maximisation with Network DownscalingElia Cunegatti, Giovanni Iacca, Doina Bucur. 207-220 [doi]
• Multi-Objective Evolutionary Algorithm Based on the Linear Assignment Problem and the Hypervolume Approximation Using Polar Coordinates (MOEA-LAPCO)Diana Cristina Valencia-Rodríguez, Carlos Artemio Coello Coello. 221-233 [doi]
• New Solution Creation Operator in MOEA/D for Faster ConvergenceLongcan Chen, Lie Meng Pang, Hisao Ishibuchi. 234-246 [doi]
• Obtaining Smoothly Navigable Approximation Sets in Bi-objective Multi-modal OptimizationRenzo J. Scholman, Anton Bouter, Leah R. M. Dickhoff, Tanja Alderliesten, Peter A. N. Bosman. 247-262 [doi]
• T-DominO - Exploring Multiple Criteria with Quality-Diversity and the Tournament Dominance ObjectiveAdam Gaier, James Stoddart, Lorenzo Villaggi, Peter J. Bentley. 263-277 [doi]
• Collective Learning of Low-Memory Matrix Adaptation for Large-Scale Black-Box OptimizationQiqi Duan, Guochen Zhou, Chang Shao, Yijun Yang, Yuhui Shi. 281-294 [doi]
• Recombination Weight Based Selection in the DTS-CMA-ESOswin Krause. 295-308 [doi]
• The (1+1)-ES Reliably Overcomes Saddle PointsTobias Glasmachers. 309-319 [doi]
• Evolutionary Time-Use Optimization for Improving Children's Health OutcomesYue Xie, Aneta Neumann, Ty Stanford, Charlotte Lund Rasmussen, Dorothea Dumuid, Frank Neumann 0001. 323-337 [doi]
• Iterated Local Search for the eBuses Charging Location ProblemCésar Loaiza Quintana, Laura Climent, Alejandro Arbelaez. 338-351 [doi]
• Multi-view Clustering of Heterogeneous Health Data: Application to Systemic SclerosisAdán José García, Julie Jacques, Alexandre Filiot, Julia Handl, David Launay, Vincent Sobanski, Clarisse Dhaenens. 352-367 [doi]
• Specification-Driven Evolution of Floor Plan DesignKatarzyna Grzesiak-Kopec, Barbara Strug, Grazyna Slusarczyk. 368-381 [doi]
• Surrogate-Assisted Multi-objective Optimization for Compiler Optimization Sequence SelectionGuojun Gao, Lei Qiao, Dong Liu, Shifei Chen, He Jiang 0001. 382-395 [doi]
• A First Runtime Analysis of the NSGA-II on a Multimodal ProblemBenjamin Doerr, Zhongdi Qu. 399-412 [doi]
• Analysis of Quality Diversity Algorithms for the Knapsack ProblemAdel Nikfarjam, Anh Viet Do, Frank Neumann 0001. 413-427 [doi]
• Better Running Time of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) by Using Stochastic Tournament SelectionChao Bian 0002, Chao Qian 0001. 428-441 [doi]
• Escaping Local Optima with Local Search: A Theory-Driven DiscussionTobias Friedrich 0001, Timo Kötzing, Martin S. Krejca, Amirhossein Rajabi. 442-455 [doi]
• Evolutionary Algorithms for Cardinality-Constrained Ising ModelsVijay Dhanjibhai Bhuva, Duc-Cuong Dang, Liam Huber, Dirk Sudholt. 456-469 [doi]
• General Univariate Estimation-of-Distribution AlgorithmsBenjamin Doerr, Marc Dufay. 470-484 [doi]
• Population Diversity Leads to Short Running Times of Lexicase SelectionThomas Helmuth, Johannes Lengler, William G. La Cava. 485-498 [doi]
• Progress Rate Analysis of Evolution Strategies on the Rastrigin Function: First ResultsAmir Omeradzic, Hans-Georg Beyer. 499-511 [doi]
• Running Time Analysis of the (1+1)-EA Using Surrogate Models on OneMax and LeadingOnesZi-An Zhang, Chao Bian 0002, Chao Qian 0001. 512-525 [doi]
• Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling ProblemFeng Shi 0003, Xiankun Yan, Frank Neumann 0001. 526-541 [doi]
• Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear FunctionsFrank Neumann 0001, Carsten Witt. 542-554 [doi]
• Runtime Analysis of Unbalanced Block-Parallel Evolutionary AlgorithmsBrahim Aboutaib, Andrew M. Sutton. 555-568 [doi]
• Self-adjusting Population Sizes for the (1, λ )-EA on Monotone FunctionsMarc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou. 569-585 [doi]
• Theoretical Study of Optimizing Rugged Landscapes with the cGATobias Friedrich 0001, Timo Kötzing, Frank Neumann 0001, Aishwarya Radhakrishnan. 586-599 [doi]
• Towards Fixed-Target Black-Box Complexity AnalysisDmitry Vinokurov, Maxim Buzdalov 0001. 600-611 [doi]
• Two-Dimensional Drift Analysis: - Optimizing Two Functions Simultaneously Can Be HardDuri Janett, Johannes Lengler. 612-625 [doi]