Orgy in the Computer: Multi-Parent Reproduction in Genetic Algorithms
Proceedings of the Third European Conference on Advances in Artificial Life
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Genetic algorithms with multi-parent recombination
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
Multiparent recombination in evolutionary computing
Advances in evolutionary computing
Using memetic algorithms with guided local search to solve assembly sequence planning
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
A hybrid genetic algorithm for no-wait job shop scheduling problems
Expert Systems with Applications: An International Journal
Applications of artificial intelligence in bioinformatics: A review
Expert Systems with Applications: An International Journal
ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
Mathematical and Computer Modelling: An International Journal
Hi-index | 12.05 |
This paper proposes the multi-parent partially mapped crossover (MPPMX), which generalizes the partially mapped crossover (PMX) to a multi-parent crossover. The mapping list and legalization of PMX are modified to deal with the issues that arise from the increase of parents in PMX. Experimental results on five traveling salesman problems show that MPPMX significantly improves PMX by up to 13.95% in mean tour length. These preferable results not only demonstrate the advantage of the proposed MPPMX over PMX, but also confirm the merit of using more than two parents in crossover.