MOCHC is a multi-objective version of CHC, an evolutionary algorithm proposed by Eshelman in 1991. It is intended to solve binary-coded problems and its main feature is the use of a crossover mechanism called HUX.
- Ordering criterion: randking and crowding distance
- Parent selection: random with incest threshold
- Crossover: HUX
- Cataclismic mutation: bit flip (pm = 35%)
MOCHC was designed to solve the antennae placement, a problem from the telecommunications domain
- A.J. Nebro, E. Alba, G. Molina, F. Chicano, F. Luna, J.J. Durillo Optimal antenna placement using a new multi-objective chc algorithm. GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation. London, England. July 2007 . BIBTEX