A modified contract mapping genetic algorithm

摘要

A novel closed crossing avoidance strategy is put forth considering the relation between diversity of evolution population and evolution times. Based on it, a modified contract mapping genetic algorithm (MCMGA) is presented. Not only can the algorithm converge to globally optimal solution but also it improves the speed of convergence. It is shown from simulation that the algorithm presented in this paper is efficient contrast with simple genetic algorithm and former contract mapping genetic algorithm.