Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean Functions

DOI10.1145/3594805.3607129MaRDI QIDQ6120983zbMATH OpenOpenAlexFDO

Authors Darrell Whitley, Gabriela Ochoa, Francisco Chicano

Publication date 23 February 2024

Published in Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3594805.3607129

zbMATH Keywords

iterated local searchNK landscapespartition crossoverbig valley hypothesis

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)

Cites work

• A new adaptive multi-start technique for combinatorial global optimizations
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Decomposing SAT Instances with Pseudo Backbones
• Introduction to algorithms
• Partition Crossover for Pseudo-Boolean Optimization
• Pseudo-Boolean optimization

Cited in

(1)

• Reduction-based MAX-3SAT with low nonlinearity and lattices under recombination

This page was built for publication: Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120983)