RGBCA-genetic bee colony algorithm for travelling salesman problem

Proceedings of the 2011 World Congress on Information and Communication Technologies, WICT 2011

Volumn , Issue , 2011, Pages 1002-1008

  Singh, Vikas ^a   Tiwari, Ritu ^a   Singh, Deepak ^b   Shukla, Anupam ^a  

^a ABV INDIAN INSTITUTE OF INFORMATION TECHNOLOGY AND MANAGEMENT   (India)

^b Raipur Institute of Technology   (India)

Author keywords

ABC; Artificial Bee Colony; GA; Genetic Algorithm; TSP

Indexed keywords

ABC; ARTIFICIAL BEE COLONIES; COLONY ALGORITHMS; COMPUTATIONAL TIME; HONEY BEE; HYBRID PROCEDURE; INTELLIGENT BEHAVIOR; LOCAL SEARCH STRATEGY; NATURAL EVOLUTION; NP-HARD PROBLEM; OPTIMIZATION ALGORITHMS; OPTIMIZATION PROBLEMS; SEARCH SPACES; SHORTEST ROUTE; SOLUTION SPACE; SPECIFIC PROBLEMS; TRAVELLING SALESMAN PROBLEM; TSP; TSP PROBLEMS;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; GALLIUM; INFORMATION TECHNOLOGY; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

GENETIC ALGORITHMS;

EID: 84857162813     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WICT.2011.6141385     Document Type: Conference Paper

References (27)

1. Applegate, D. L.; Bixby, R. M.; Chvátal, V.; Cook, W. J. (2006), "The Traveling Salesman Problem", ISBN 0691129932.
2. Eiben, A. E. et al (1994). "Genetic algorithms with multi-parent recombination". PPSN III: Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: 78-87. ISBN 3-540-58484-6.
3. T.P. Bagchi, IN.D. Gupta, C. Sriskandarajah, "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research., pp. 816-854,2006. (Pubitemid 41492018)
4. C.A. Silvaa, lM.C. Sousaa, T.A. Runkler, "Rescheduling and optimization of logistic processes using GA and ACO," Engineering Applications of Artificial Intelligence., vol. 21, pp. 343-352, 2008.
5. M. Griltschel, M. Padberg, "Ulysses 2000: In Search of Optimal Solutions to Hard Combinatorial Problems," Technical Report, New York University Stern School of Business, 1993.
6. G. Zhao, W. Luo, H. Nie, C. Li, "A Genetic Algorithm Balancing Exploration and Exploitation for the Travelling Salesman Problem," in Proceedings of the 2008 Fourth International Conference on Natural Computation, 2008, pp. 505-509.
7. Dervis Karaboga Bahriye Basturk, "A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm" J Glob Optim (2007), pp 459-471
8. W.-L. Zhong, l Zhang, W.-N. Chen, "A Novel Discrete Particle Swarm Optimization to Solve Traveling Salesman Problem," in Proc. IEEE Int. Conf. Evol. Comput. (CEC), 2007, pp. 3283-3287.
9. L.-P. Wong, M.Y. Hean Low, C.S. Chong, "A Bee Colony Optimization Algorithm for Traveling Salesman Problem," Second Asia International Conference on Modelling & Simulation, 2008, pp. 818-823.
10. S. Nonsiri, S. Supratid, "ModifYing Ant Colony Optimization," IEEE Conference on Soft Computing in Industrial Applications, 2008, pp. 95-100.
11. Marco Dorigo. "Ant Colonies for the Traveling Salesman Problem". IRIDIA, Université Libre de Bruxelles. IEEE Transactions on Evolutionary Computation, 1(1):53-66. 1997.
12. D. Karaboga, "An idea based on honey bee swarm for numerical optimization," Erciyes University, Engineering Faculty, Computer Engineering Department, Turkey, Technical Report-TR06, 2005.
13. D. Karaboga, B. Akay, "A Survey: Algorithms Simulating Bee Swarm Intelligence," Artificial Intelligence Review., vol. 31, pp. 68-85, 2009.
14. D. E. Goldberg, "Genetic Algorithm in Search. Optimization and Machine Lerning", Addison Wesley, 1989.
15. G-. G. Jin, S-. R. Joo, "A Study on a Real-Coded Genetic Algorithm," Journal of Control, Automation, and Systems Engineering, vol. 6, no. 4, pp. 268-274, April 2000.
16. Z. Michalewicz, "Genetic algorithm + data structure = evolution pmgram",Springer-Verlag, Inc., Heidelberg, Berlin, 1996.
17. L. J. Eshelman, R. A. Caruana, and J. D. Schaffer, "Bases in the crossover landscape," Pmc. 3rd Int. Con$ on Genetic Algorithms, J. Schaffer(Ed.), Morgan Kaufmann Publishers, LA, pp.10-19, 1989.
18. le. Biesmeijer, T.D. Seeley, "The use of waggle dance information by honey bees throughout their foraging careers," Behav. Ecol. Sociobiol., vol. 59, pp. 133-142, 2005.
19. H. Sengoku and I. Yoshihara, "A Fast TSP Solver using GA on JAVA," in Proc. of 3rd International Symposium on Artificial Life and Robotics, vol. I, 1998, pp. 283-288.
20. G.A. Croes, "A method for solving traveling salesman problems," Operations Research. vol. 6, pp. 791-812, 1958.
21. G. Reineit, "TSPLIB-A traveling salesman problem library," ORSA Journal on Computing., vol. 3, no. 4, pp. 376-384, 1991.
22. XH. Shi, Y.e. Liang, H.P. Lee, C. Lu, Q.x. Wang, "Particle swarm optimization-based algorithms for TSP and generalized TSP," Information Processing Letters., vol 103, pp. 169-176,2007. (Pubitemid 46898376)
23. Wright, A. "Genetic Algorithms for Real Parameter Optimization, Foundations of Genetic Algorithms", G. Rswlins(Ed.), Morgen Kaufmann publishers, CA, pp.205-218, 1991.
24. Tatsuya Nomura, "An Analysis on Linear Crossover for Real Number Chromosomes in an Infinite Population Size", In Proc. ICEC'97, Indianapolis, pp. 111-114, 1997.
25. L. Davis, "Handbook of Genetic Algorithms", Von Nostrand Reinhold, N.Y., 1991
26. C. 2. Janikow and Z. Michalewicz, "A Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms,"Pmc. 4th Int. Con$ on Genetic Algorithm, Morgan Kaufiann F'ublishers, CA, 1991
27. H. Miihlenbein and D. Schlierkamp-Voosen, "Predictive Models of the Breeder Genetic Algorithm: I. Continuous Parameter Optimization", Evolutionary Computation, vol. 1, pp. 25-49, 1993