A COMBINED STRATEGY FOR SOLVING QUADRATIC ASSIGNMENT PROBLEM

Ahyaningsih, Faiz (2017) A COMBINED STRATEGY FOR SOLVING QUADRATIC ASSIGNMENT PROBLEM. In: International Conference on Mathematics: Pure, Applied and Computation: Empowering Engineering using Mathematics, 23 Nov 2016, Surabaya.

[thumbnail of Fulltext.pdf]
Preview
Text
Fulltext.pdf - Published Version

Download (242kB) | Preview
[thumbnail of Reviewer.pdf]
Preview
Text
Reviewer.pdf - Published Version

Download (374kB) | Preview
[thumbnail of Turnitin.pdf]
Preview
Text
Turnitin.pdf - Published Version

Download (541kB) | Preview

Abstract

The quadratic assignment 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 flow between facilities, and distance between location. 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 combined strategy (random point strategy to get initial starting point and then use forward exchange strategy and backward exchange strategy to get ‘optimal’ solution). As a computational experience we’ve solved the problem of Esc 16b, Esc 16c and Esc 16h from QAPLIB. Finally, we present a comparative study between Combined Strategy and Data –Guided Lexisearch Algorithm. The computational study shows the effectiveness of our proposed combined strategy.

Item Type: Conference or Workshop Item (Paper)
Keywords: Combined strategy; Quadratic assigment problem; Random point strategy
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75.5 Electronic computers. Computer science
Divisions: Fakultas Matematika dan Ilmu Pengetahuan Alam > Matematika
Depositing User: Mrs Harly Christy Siagian
Date Deposited: 15 Mar 2021 06:48
Last Modified: 15 Mar 2021 07:14
URI: https://digilib.unimed.ac.id/id/eprint/41469

Actions (login required)

View Item
View Item