A New Metaheuristic Method on Solving in Combinatorial Optimization problems

Muhammad Iqbal , Muhammad Zarlis , Tulus , Herman Mawengkang

The metaheuristic approach is a progressively developing area of research to address the problems of combinatorial optimization. This is because many issues related to combinatorial optimization are NP-completeness and the problems of combinatorial optimization in the industrial world are increasingly relevant. This paper provides an improved metaheuristic method to address large-scale problems in combinatorial optimization. A quadratic assignment problem (QAP) is one of the most significant combinatorial optimization problems because of its shape and model which is quite real in everyday life such as travel routes, scheduling, communication, and other fields, when the size of the problem increases, QAP is an NP-hard problem that cannot be solved in polynomial time, therefore a metaheuristic approach is used to solve the problem rather than an exact approach, this approach can achieve optimal quality and can be solved in a short computation. A quadratic assignment problem of 36×36 dimensions is addressed as a computational experience.

Volume 12 | Issue 6

Pages: 2967-2971

DOI: 10.5373/JARDCS/V12I6/S20201260