Comparative Analysis of Meta-Heuristic Algorithms for Solving Optimization Problems

Abstract

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. distance between two nodes remains constant from i to j and j to i presented d ij  d ji while in asymmetric the i to j and j to i is never same which can be interpreted as

Optimization of Biolubricant from Terminalia catappa (Almond) Seed Oil Using CaO Derived from Limestone as Catalyst

“…The hard-shell nut was sun dried and the seeds were removed from the dried shell by manual breaking with a hammer. The oil-bearing seeds were cleaned, sun dried and further grinded into powdered form using cleaned mortar and pestle to ease extraction of the oil (Muhammad et al, 2018).…”

“…Also, contour plots were developed using the fitted quadratic polynomial equation. Optimizer on the MINITAB 17 was used to optimize the factors and the optimal level obtained was experimentally validated (Muhammad et al, 2018).…”

Two Classic Chess Problems Solved by Answer Set Programming

“…Nevertheless, ASP can be applied to several areas of science and technology, for example: automated product configuration, decision support for space shuttle and automatic route search [17]. The classical problems involving chess are a constant subject of heuristic and optimization studies [10,12,13]. The n-Queen Problem consists of finding the position of n-queens on a chessboard n x n. The Knight's Tour Problem aims to construct a sequence of admissible moves made by a chess knight from one square to another so that they land on each square of a board exactly once.…”