Using Multi-chromosomes to Solve a Simple Mixed Integer Problem

Multi-chromosomes representations have been used in Genetic Algorithms to decompose complex solution representations into simpler components each of which is represented onto a single chromosome. This paper investigates the effects of distributing similar structures over a number of chromosomes. The solution representation of a simple mixed integer problem is encoded onto one, two, or three chromosomes to measure the effects. Initial results showed large differences, but further investigation showed that most of the differences were due to increased mutation, but multi-chromosome representation can give superior results.

[1]  Peter W. Eklund,et al.  Multi-chromosome mixed encodings for heterogeneous problems , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[2]  R. Hinterding Self-adaptation using multi-chromosomes , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[3]  Robert Hinterding,et al.  A genetic algorithm for stock cutting: an exploration of mapping schemes1 , 1993 .

[4]  Kate Juliff,et al.  A Multi-chromosome Genetic Algorithm for Pallet Loading , 1993, International Conference on Genetic Algorithms.

[5]  Yuval Davidor,et al.  Genetic Algorithms and Robotics - A Heuristic Strategy for Optimization , 1991, World Scientific Series in Robotics and Intelligent Systems.

[6]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..