Comparative Analysis of Meta-Heuristic Algorithms for Solving Optimization Problems
Muhammad Kashif, Shang Bing Gao, Sohail Qaisar, MannanMasood Abdul, Muhammad Atif, Ashraf Usman, Aleena Akhtar, Ali Shahid · Proceedings of the 2018 8th International Conference on Management, Education and Information (MEICI 2018) · 2018
Combinatorial Problems (NP hard Problem) have always been a hard task to be solved to optimal level but for the efficiency and finding the best possible solution in a certain span of time it has been solved to suboptimal level.During the study for solving the combinatorial problems to suboptimal level different heuristic algorithms has been used for acquiring results from the TSPLIB Instances.Different Suboptimal level has been achieved through different heuristics like Ant Colony Algorithm, Genetic Algorithm and Simulated Annealing Algorithm.The perimeters were tuned to different levels of all heuristics to find suboptimal level of the instances of TSPLIB.The paper will also present the effects of perimeters tuning to achieve the suboptimal results.