Abstract
Genetic Algorithms (GA) Using ordinal strings for combinatorial optimization must use special crossover operators such as PMX, OX and CX, instead of general crossover operators. Considering the above deficiency of GA using ordinal strings, a Partheno-Genetic Algorithm (PGA) is proposed that uses ordinal strings and repeals crossover operators, while introduces some particular genetic operators such as gene exchange operators, which have the same function as crossover operators. The genetic operation of PGA is simpler and its initial population need not be varied and there is no “immature convergence” in PGA. The schema theorem of PGA was analyzed. Similarly with TGA, by genetic operators processing schemas, the individuals in the population continually move towards optimal individual in PGA, finally the optimal solution can be gained. The global convergence of PGA was studied. It was also proved that optimal maintaining operation is the key operation to make the algorithm global convergent.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lin, W., Delgadofiras, Y.G., Gause, D.C., et al.: Hybrid Newton Raphson Genetic Algorithm for the Traveling Salesman Problem. Cybernetics and Systems 26(4), 387–412 (1995)
Xiaoyuan, H., Sihan, X., Shulin, W.: Application of Genetic Algorithm in Train Line Holding. Information and Control 25(1), 58–63 (1996) (in Chinese)
Bo, W., Qun, Z., Fei, W., et al.: Quantitative Analysis of Infeasible Solution to Job Shop Scheduling Problem. Control and Decision 16(1), 33–36 (2001) (in Chinese)
Kacem, I., Hammadi, S., Borne, P.: Approach by Localization and Multi-objective Evolutionary Optimization for Flexible Job-Shop Scheduling Problems. IEEE trans on Systems, Man and Cybernetics-Part C: Applications and Reviews 32(1), 1–13 (2002)
Larranga, P., Kuijipers, C.M.H., Murga, R.H., et al.: Learning Bayesian Network Structures for the Best ordering with Genetic Algorithms. IEEE trans on Systems Man and Cybernetics-Part A: Systems and Humans 26(4), 487–493 (1996)
Maojun, L., Tiaosheng, T.: A Partheno-genetic Algorithm and Its Applications. Journal of Hunan University 25(6), 56–59 (1998)
Maojun, L., Taoye, Z., Tiaosheng, T.: Comparison Between Partheno-genetic Algorithm and Traditional Genetic Algorithm. System Engineering 19(1), 61–65 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, M., Fan, S., Luo, A. (2004). A Partheno-genetic Algorithm for Combinatorial Optimization. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds) Neural Information Processing. ICONIP 2004. Lecture Notes in Computer Science, vol 3316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30499-9_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-30499-9_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23931-4
Online ISBN: 978-3-540-30499-9
eBook Packages: Springer Book Archive