K. Dinesh
Ibrahim Dweib
ABSTRACT
Genetic Algorithm (GA) is well-known optimization algorithm for solving various kinds of the optimization problem. GA is based on evolutionary principles and effectively solves the large-scale problem. In addition, it incorporates the variety of hybrid techniques to achieve the best performance in complex problems. However, self-organization is one of the popular model, which acquire global order from the local interaction among the individuals. The combined version of self-organization and genetic algorithm are adopted to improve the performance in attaining the convergence. This paper proposes a bi-directional self-organization process for improving the genetic algorithm which achieves the convergence and well-balanced diversity in the population. The experimentation is conducted on the standard test-bed of travelling salesman problem and instances are obtained from TSPLIB. Thus, the proposed algorithm has shown its dominance with the existing classical GA in terms of various parameter metrics.
- M. Z. Ali, N. H. Awad, P. N. Suganthan, A. M. Shatnawi, and R. G. Reynolds. An improved class of real-coded genetic algorithms for numerical optimizationâIJř. Neurocomputing, 275:155--166, 2018. Google Scholar
Digital Library
- K. Deep et al. A self-organizing migrating genetic algorithm for constrained optimization. Applied Mathematics and Computation, 198(1):237--250, 2008.Google ScholarCross Ref
- K. Dinesh, J. Amudhavel, and R. Subramanian. A novel self-organization model for improving the performance of permutation coded genetic algorithm. ADVANCES AND APPLICATIONS IN MATHEMATICAL SCIENCES, 17(1):1--29, 2017.Google Scholar
- F. Gu and Y.-M. Cheung. Self-organizing map-based weight design for decomposition-based many-objective evolutionary algorithm. IEEE Transactions on Evolutionary Computation, 22(2):211--225, 2018.Google ScholarCross Ref
- Q. Jiang, L. Wang, X. Hei, J. Cheng, X. Lu, Y. Lin, and G. Yu. Arae-som+ bco: An enhanced artificial raindrop algorithm using self-organizing map and binomial crossover operator. Neurocomputing, 275:2716--2739, 2018. Google ScholarDigital Library
- D. Karunanidy, J. Amudhavel, T. S. Datchinamurthy, and S. Ramalingam. A novel java macaque algorihtm for travelling salesman prolem. IIOAB JOURNAL, 8(2):252--261, 2017.Google Scholar
- K. Katayama, H. Sakamoto, and H. Narihisa. The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem. Mathematical and Computer Modelling, 31(10-12):197--203, 2000. Google ScholarDigital Library
- E. Kita, S. Kan, and Z. Fei. Investigation of self-organizing map for genetic algorithm. Advances in Engineering Software, 41(2):148--153, 2010. Google ScholarDigital Library
- K.-S. Leung, H.-D. Jin, and Z.-B. Xu. An expanding self-organizing neural network for the traveling salesman problem. Neurocomputing, 62:267--292, 2004. Google ScholarDigital Library
- J. Manicassamy, D. Karunanidhi, S. Pothula, V. Thirumal, D. Ponnurangam, and S. Ramalingam. Gps: a constraint-based gene position procurement in chromosome for solving large-scale multiobjective multiple knapsack problems. Frontiers of Computer Science, pages 1--21, 2018. Google ScholarDigital Library
- P. V. Paul, A. Ramalingam, R. Baskaran, P. Dhavachelvan, K. Vivekanandan, and R. Subramanian. A new population seeding technique for permutation-coded genetic algorithm: Service transfer approach. Journal of Computational Science, 5(2):277--297, 2014.Google ScholarCross Ref
- D. Popovic, C. Moschopoulos, R. Sakai, A. Sifrim, J. Aerts, Y. Moreau, and B. De Moor. A self-tuning genetic algorithm with applications in biomarker discovery. In Computer-Based Medical Systems (CBMS), 2014 IEEE 27th International Symposium on, pages 233--238. IEEE, 2014. Google ScholarDigital Library
- G. Reinelt. Tsplib95, 1995. URL http://comopt. ifi. uni-heidelberg. de/software/TSPLIB95, 2012.Google Scholar
- A. Sombat, T. Saleewong, and P. Kumam. Perspectives and experiments of hybrid particle swarm optimization and genetic algorithms to solve optimization problems. In International Econometric Conference of Vietnam, pages 290--297. Springer, 2018.Google ScholarCross Ref
- C. Tajani, O. Abdoun, and J. Abouchabaka. Optimization approach based on immigration strategies for symmetric traveling salesman problem. Int. J. Open Problems Compt. Math, 10(2), 2017.Google Scholar
- C. Tajani, O. Abdoun, and A. Lahjouji. Genetic algorithm adopting immigration operator to solve the asymmetric traveling salesman problem. International Journal of Pure and Applied Mathematics, 115(4):801--812, 2017.Google ScholarCross Ref
- R. Tinós and S. Yang. Genetic algorithms with self-organizing behaviour in dynamic environments. Evolutionary Computation in Dynamic and Uncertain Environments, pages 105--127, 2007.Google ScholarCross Ref
- V. Toğan and A. T. Daloğlu. An improved genetic algorithm with initial population strategy and self-adaptive member grouping. Computers & Structures, 86(11):1204--1218, 2008. Google ScholarDigital Library
- M. M. Van Hulle. Self-organizing maps. In Handbook of Natural Computing, pages 585--622. Springer, 2012.Google ScholarCross Ref
- H. Wang, W. Wang, Z. Cui, X. Zhou, J. Zhao, and Y. Li. A new dynamic firefly algorithm for demand estimation of water resources. Information Sciences, 438:95--106, 2018.Google ScholarCross Ref
- D. Whitley, D. Hains, and A. Howe. Tunneling between optima: partition crossover for the traveling salesman problem. In Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pages 915--922. ACM, 2009. Google ScholarDigital Library
- D. Whitley, D. Hains, and A. Howe. A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. Parallel Problem Solving from Nature, PPSN XI, pages 566--575, 2010. Google ScholarDigital Library
- X.-S. Yang. Nature-inspired metaheuristic algorithms. Luniver press, 2010.Google Scholar
- O. Yugay, I. Kim, B. Kim, and F. I. Ko. Hybrid genetic algorithm for solving traveling salesman problem with sorted population. In Convergence and Hybrid Information Technology, 2008. ICCIT'08. Third International Conference on, volume 2, pages 1024--1028. IEEE, 2008. Google ScholarDigital Library
- X. Zhou, F. Miao, and H. Ma. Genetic algorithm with an improved initial population technique for automatic clustering of low-dimensional data. Information, 9(4):101, 2018.Google ScholarCross Ref
Recommendations
Application of a Genetic Algorithm with Random Crossover and Dynamic Mutation on the Travelling Salesman Problem
Travelling salesman problem is a combinatorial optimization problem with wide application background and important theoretical value. The traditional method is only suitable for solving small scale travelling salesman problems, thus limiting the ...
A novel self-organisation model for improving the performance of permutation coded genetic algorithm
Genetic algorithms (GA) are extremely powerful among evolutionary principles and being used in variety of fields for solving more complex problems. Varieties of assistive techniques have been proposed to improve the performance of genetic algorithms ...
Performance Evaluation of Parallel Genetic Algorithm Using Single Program Multiple Data Technique
TSA '15: Proceedings of the 2015 Second International Conference on Trustworthy Systems and Their ApplicationsIn this paper, we mainly investigate performance of genetic algorithms for the travelling salesman problem based on Grefenstette coding, and modified single program, multiple data (SPMD) parallel computing. In addition, solutions for potential problems ...
Comments