Open AccessMeta-Heuristic Development in Combinatorial Optimization
Author(s) -
Muhammad Iqbal,
Muhammad Zarlis,
. Tulus,
Herman Mawengkang
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1255/1/012091
Subject(s) - mathematical optimization , convexity , heuristic , meta heuristic , computer science , quadratic assignment problem , neighbourhood (mathematics) , point (geometry) , optimization problem , combinatorial optimization , mathematics , mathematical analysis , geometry , financial economics , economics
The quadratic assigment problem is a combinatorial problem of deciding the placement of facilities in specified locations in such a way as to minimize a nonconvex objective function expressed in terms of distance between location and flows between facilities. Due to the non-convexity nature of the problem, therefore to get a ‘good’ starting point is necessary in order to obtain a better optimal solution. In this paper we propose a meta heuristic strategy combined with feasible neighbourhood search to get ‘optimal’ solution. From computational experience in solving some backboard wiring problems, it turns out that the approach proposed is promising.