A Parameter Model of Genetic Algorithm Regulating Ant Colony Algorithm

It is difficult to determine optimal combination parameter which can make the solving performance of ant colony algorithm work better, owing to the bulkiness of parameter space and relevance among parameters. Until now, it has not owned perfect theoretical basis and been obtained mostly by repeated tests. Based on these problems, the paper finds a better combination parameter by balancing exploration and exploitation abilities of ant colony algorithm, building algorithm performance to evaluate the objective function and applying genetic algorithm to solve ant colony parameters. The experimental simulation of classical TSP problem can verify the scheme feasibility. Simulation results indicate that the model has a positive effect on determining ant colony algorithm parameters and offers a feasible scheme for selecting ant colony algorithm combination parameter.

[1]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[2]  Zhao Chang-an.  Ant colony genetic algorithm using pheromone remaining , 2004 .

[3]  Wang Ru-chuan.  Research of using an improved ant colony algorithm to solve TSP , 2004 .

[4]  Lawrence Davis,et al.  Using a genetic algorithm to optimize problems with feasibility constraints , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[5]  Christian Bierwirth,et al.  An efficient genetic algorithm for job shop scheduling with tardiness objectives , 2004, Eur. J. Oper. Res..

[6]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[7]  Massimo Morbidelli,et al.  Multiobjective optimization of simulated moving bed and Varicol processes using a genetic algorithm. , 2003, Journal of chromatography. A.

[8]  Martin Middendorf,et al.  Modeling the Dynamics of Ant Colony Optimization , 2002, Evolutionary Computation.

[9]  Kaveh Amouzgar,et al.  Multi-objective optimization using Genetic Algorithms , 2012 .

[10]  Daniel Merkle,et al.  Ant Colony Optimization with Global Pheromone Evaluation for Scheduling a Single Machine , 2004, Applied Intelligence.

[11]  Thomas Stützle,et al.  A short convergence proof for a class of ant colony optimization algorithms , 2002, IEEE Trans. Evol. Comput..

[12]  M A Nada,et al.  Ant Colony Optimization Algorithm , 2009 .

[13]  Paul H. Calamai,et al.  Exchange strategies for multiple Ant Colony System , 2007, Inf. Sci..

[14]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[15]  F. Ratnieks,et al.  Trail geometry gives polarity to ant foraging networks , 2004, Nature.

[16]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[17]  Roberto Schirru,et al.  The Ant-Q algorithm applied to the nuclear reload problem , 2002 .

[18]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[19]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.