Chaotic Genetic Algorithm for Mixed Integer Programming Problem

Article Preview

Abstract:

This paper proposed a chaotic genetic algorithm (CGA) to solve the mixed integer programming problem (MIPP). The basic idea of this algorithm is to overcome the deficiency of genetic algorithm (GA) by introducing chaotic disturbances into the genetic search process. Two typical MIPP problems are used to evaluate the performances of the proposed CGA. Experimental results show that performances of the algorithm have been improved by the chaotic disturbances, such as, search ability, precision, stability and convergence speed or calculation efficiency. The proposed CGA algorithm is suitable for solving complicated practical MIPP problem.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2273-2277

Citation:

Online since:

September 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Zhang Mingjia. Research on the Application of Mixed Integer Programming in Engineering[D]. Huazhong University of Science and Technology. April (2005).

Google Scholar

[2] C Choi, JJ Lee. Chaotic local search algorithm[J]. Artificial Life and Robotics, 2(1). 41-47 (1998).

Google Scholar

[3] JouniLampinen, Ivan Zelinka. Mixed Integer-Discrete-Continuous Optimization By Differential Evolution-Part 1: the optimization method[J]. Bron University of Technology (1999).

Google Scholar

[4] Riccardo Poli, James Kennedy, Tim Blackwell. Particle swarm optimization[J]. Swarm Intelligence, 1(1), 33-57 (2007).

DOI: 10.1007/s11721-007-0002-0

Google Scholar

[5] Mu-Song Chen, Tze-Yee Ho, Chipan Hwang. Genetic Evolution of Control Systems[J]. Lecture Notes in Computer Science Volume 7929, 284-292 (2013).

Google Scholar

[6] I. Jerin Leno, S. SaravanaSankar, M. Victor Raj, S. G. Ponnambalam. An elitist strategy genetic algorithm for integrated layout design[J]. The International Journal of Advanced Manufacturing Technology . 66(9-12), 1573-1589 (2013).

DOI: 10.1007/s00170-012-4441-4

Google Scholar

[7] OI Rong-bin, FENG Ru-peng. New method for solving a king of 0-1 integer programming problem-Chaotic searching algorithm[J]. Control and Decision (2003), 18(6).

Google Scholar

[8] JiGenlin. Survey on Genetic Algorithm[J]. Computer Applications and Software, 21(2), 69-73 (2004).

Google Scholar

[9] Xiaoya Cheng, Mingyan Jiang. An Improved Artificial Bee Colony Algorithm Based on Gaussian Mutation and Chaos Disturbance[J]. Advances in Swarm Intelligence, Lecture Notes in Computer Science Volume 7331, 326-333 (2012).

DOI: 10.1007/978-3-642-30976-2_39

Google Scholar