Developing A Combined Strategy For Solving Quadratic Assignment Problem
Faiz Ahyaningsih, Opim Salim Sitompul
Abstract
Open-access reader
Faiz Ahyaningsih, Opim Salim Sitompul
Abstract
Open-access reader
The quadratic assigment problem (QAP) is one of the most interesting and most challenging combinatorial optimization problems in existence. In this paper we propose a random point strategy to get a starting point, and then we use a combination methods to get ‗optimal‘ solution. As a computational experience we‘ve solved QAP 30 x 30 adopted from Nugent and backboard wiring problem 42 42, adopted from Skorin-Kapov.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The quadratic assigment problem (QAP) is one of the most interesting and most challenging combinatorial optimization problems in existence. In this paper we propose a random point strategy to get a starting point, and then we use a combination methods to get ‗optimal‘ solution. As a computational experience we‘ve solved QAP 30 x 30 adopted from Nugent and backboard wiring problem 42 42, adopted from Skorin-Kapov.
Key concepts: Quadratic assignment problem, Point (geometry), Mathematical optimization, Quadratic equation, Computer science, Optimization problem, Interior point method, Mathematics