Skip to main content
SpringerLink
Log in

Using multi-chromosomes to solve a simple mixed integer problem

  • Evolutionary Computation
  • Conference paper
  • First Online:
Advanced Topics in Artificial Intelligence (AI 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1342))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Davidor, Y.: Genetic Algorithms And Robotics — A Heuristic Strategy For Optimization. Singapore: World Scientific Publishing, 1991.

    Google Scholar 

  • Hinterding, R.: Self-adaptation using Multi-chromosomes. In: Proceedings of the 4th IEEE International Conference on Evolutionary Computation. IEEE Press. 1997, pp 87–91.

    Google Scholar 

  • Hinterding, R., & Juliff, K.: A Genetic Algorithm for Stock Cutting: An exploration of Mapping Schemes. Technical Report 24COMP3. Department of Computer and Mathematical Sciences, Victoria University of Technology, Victoria Australia, 1993.

    Google Scholar 

  • Homaifar, A., Lai, S. H. Y., & Qi, X.: Constrained Optimization via Genetic Algorithms. Simulations, Vol. 62, 1994, pp. 242–254.

    Google Scholar 

  • Juliff, K.: A multi-chromosome genetic algorithm for pallet loading. In: Proceedings of the Fifth International Conference on Genetic Algorithms. 1993, pp. 476–73.

    Google Scholar 

  • Pierrot, H. J.: An investigation of Multi-chromosome Genetic Algorithms. Masters Thesis, Victoria University of Technology, Melbourne, Australia, 1997.

    Google Scholar 

  • Ronald, S., Kirkby, S., & Eklund, P.: Multi-chromosome Mixed Encodings for Heterogeneous Problems. In: Proceedings of the 4th IEEE International Conference on Evolutionary Computation. IEEE Press. 1997, pp 37–42.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Mathematical Sciences, Victoria University of Technology, PO Box 14428 MCMC, 8001, Melbourne, Australia

    Hans J. Pierrot & Robert Hinterding

Authors
  1. Hans J. Pierrot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert Hinterding
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Abdul Sattar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pierrot, H.J., Hinterding, R. (1997). Using multi-chromosomes to solve a simple mixed integer problem. In: Sattar, A. (eds) Advanced Topics in Artificial Intelligence. AI 1997. Lecture Notes in Computer Science, vol 1342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63797-4_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-63797-4_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63797-4

  • Online ISBN: 978-3-540-69649-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation