Skip to main content

Advertisement

Log in

Exploration/Exploitation Tradeoff with cell-shift and Heuristic Crossover for Evolutionary Algorithms

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

In order to tradeoff exploration/exploitation and inspired by cell genetic algorithm a cell-shift crossover operator for evolutionary algorithm (EA) is proposed in this paper. The definition domain is divided into n-dimension cubic sub-domains (cell) and each individual locates at an n-dimensional cube. Cell-shift crossover first exchanges the cell numbers of the crossover pair if they are in the different cells (exploration) and subsequently shift the first individual from its initial place to the other individual’s cell place. If they are already in the same cell heuristic crossover (exploitation) is used. Cell-shift/heuristic crossover adaptively executes exploration/exploitation search with the vary of genetic diversity. The cell-shift EA has excellent performance in terms of efficiency and efficacy on ten usually used optimization benchmarks when comparing with the recent well-known FEP evolutionary algorithm.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • D. E. Goldberg (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Reading Addison-Wesley MA

    Google Scholar 

  • T. Back D. Fogel Z. Michalewicz (1997) Handbook of Evolutionary Computation Oxford Univ. Press London

    Google Scholar 

  • E. Alba B. Dorronsoro (2005) ArticleTitleThe exploration/exploitation tradeoff in dynamic cellular genetic algorithms IEEE Trans. Evol. Comput 9 IssueID2 126–142 Occurrence Handle10.1109/TEVC.2005.843751

    Article  Google Scholar 

  • T. Kuo S. Y. Huwang (1996) ArticleTitleA genetic algorithm with disruptive selection IEEE Trans. Syst., Man and Cybern. 126 IssueID2 299–307

    Google Scholar 

  • J. C. Potts T. D. Giddens S. B. Yadav (1994) ArticleTitleThe development and evaluation of an improved genetic algorithm based on migration and artificial selection IEEE Trans. Syst., Man and Cybern. 124 IssueID1 73–85 Occurrence Handle10.1109/21.259687

    Article  Google Scholar 

  • L. Davis, Adapting operator probabilities in genetic algorithms, in Proc. 3rd Int. Conf. Genetic Algorithms(ed. by J. Schaffer), Morgan Kaufmann Publishers Inc., 1989, 61–69.

  • X. C. Zhao (2005) ArticleTitleA greedy genetic algorithm for unconstrained global optimization Journal of Systems Science and Complexity 18 IssueID1 102–110

    Google Scholar 

  • X. C. Zhao , H. L. Long, Multiple bit encoding-based search algorithms, in Proc. 2005 IEEE Congress on Evolutionary Computation, IEEE Press, 2005, 1996–2001.

  • Y. Jin (2005) ArticleTitleA comprehensive survey of fitness approximation in evolutionary computation Soft Computing 9 IssueID1 3–12 Occurrence Handle10.1007/s00500-003-0328-5

    Article  Google Scholar 

  • F. Herrera M. Lozano (2000) ArticleTitleDistributed Real-Coded Genetic Algorithms IEEE Trans. Evol. Comput 4 IssueID1 43–63 Occurrence Handle10.1109/4235.843494

    Article  Google Scholar 

  • B. Manderick, P. Spiessens, Fine-grained parallel genetic algorithm, in Proc. 3rd Int. Conf. Genetic Algorithms (ed. by J. Schaffer), Morgan Kaufmann Publishers Inc., 1989, 428–433.

  • H. Mühlenbein M. Schomish J. Born (1991) ArticleTitleThe parallel genetic algorithm as a function optimizer Parallel Comput 17 619–632 Occurrence Handle10.1016/S0167-8191(05)80052-3

    Article  Google Scholar 

  • S. Baluja, Structure and performance of fine-grain parallelism in genetic search, in Proc. 5th Int. Conf. Genetic Algorithms (ed. by S. Forrest), Morgan Kaufmann Publishers Inc., 1993, 155–162.

  • D. Whitley, Cellular genetic algorithms, in Proc. 5th Int. Conf. Genetic Algorithms (ed. by S. Forrest), 1993, 658.

  • X. Yao Y. Liu G. M. Lin (1999) ArticleTitleEvolutionary programming made faster IEEE Trans. Evol. Comput 3 IssueID2 82–102 Occurrence Handle10.1109/4235.771163

    Article  Google Scholar 

  • J. He J. Y. Xu X. Yao (2000) ArticleTitleSolving equations by Hybrid evolutionary computation techniques IEEE Transactions on Evolutionary Computation 4 IssueID3 295–304 Occurrence Handle10.1109/4235.873239

    Article  Google Scholar 

  • Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, (3rd Edition), Springer, 1996.

  • D. H. Wolpert W. G. Macready (1997) ArticleTitleNo free lunch theorems for optimization IEEE Trans. Evol. Comput. 1 IssueID1 67–82 Occurrence Handle10.1109/4235.585893

    Article  Google Scholar 

  • E. Cantu-Paz, Efficient and Accurate Parallel Genetic Algorithms (2nd ed), Book Series on Genetic Algorithms and Evolutionary Computation, Vol. I, Norwell, MA: Kluwer, 2000.

  • S. Tsutsui and Y. Fujimoto, Forking genetic algorithm with blocking and shrinking modes, in Proc. 5th Int. Conf. Genetic Algorithms (ed. by S. Forrest), Morgan Kaufmann Publishers Inc., 1993, 206–213.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xinchao Zhao.

Additional information

The research is partially supported by Key Laboratory of Mathematics Mechanization, Chinese Academy of Science (No. KLMM0613).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhao, X., Hao, J. Exploration/Exploitation Tradeoff with cell-shift and Heuristic Crossover for Evolutionary Algorithms. Jrl Syst Sci & Complex 20, 66–74 (2007). https://doi.org/10.1007/s11424-007-9005-6

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-007-9005-6

Keywords

Navigation