STRATEGY KOMBINASI UNTUK MENYELESAIKAN QUADRATIC ASSIGNMENT PROBLEM
| Main Author: | Ahyaningsih, Faiz |
|---|---|
| Format: | Proceeding PeerReviewed Book |
| Bahasa: | ind |
| Terbitan: |
, 2016
|
| Subjects: | |
| Online Access: |
http://digilib.unimed.ac.id/41468/1/Fulltext.pdf http://digilib.unimed.ac.id/41468/2/Reviewer.pdf http://digilib.unimed.ac.id/41468/ http://seminar.uny.ac.id/semnasmatematika/sites/seminar.uny.ac.id.semnasmatematika/files/T-1.pdf |
| ctrlnum |
41468 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><relation>http://digilib.unimed.ac.id/41468/</relation><title>STRATEGY KOMBINASI UNTUK MENYELESAIKAN QUADRATIC ASSIGNMENT PROBLEM</title><creator>Ahyaningsih, Faiz</creator><subject>QA Mathematics</subject><description>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 random point strategy to get initial starting point and then use forward exchange strategy and backward exchange strategy to get ‘optimal’ solution. We also create a comparative program to test the solution. As a computational experience we solve the problem of Had12 from QAPLIB, with the
optimal solution = 1652, permutation = 3 10 11 2 12 5 6 7 8 1 4 9 , running time = 122.512347 second = 2.04 minute. The optimal solution reached in 1050 iterations.</description><date>2016</date><type>Journal:Proceeding</type><type>PeerReview:PeerReviewed</type><type>Book:Book</type><language>ind</language><identifier>http://digilib.unimed.ac.id/41468/1/Fulltext.pdf</identifier><type>Book:Book</type><language>ind</language><identifier>http://digilib.unimed.ac.id/41468/2/Reviewer.pdf</identifier><identifier> Ahyaningsih, Faiz (2016) STRATEGY KOMBINASI UNTUK MENYELESAIKAN QUADRATIC ASSIGNMENT PROBLEM. In: Seminar Nasional Matematika dan Pendidikan Matematika 2016. </identifier><relation>http://seminar.uny.ac.id/semnasmatematika/sites/seminar.uny.ac.id.semnasmatematika/files/T-1.pdf</relation><recordID>41468</recordID></dc>
|
| language |
ind |
| format |
Journal:Proceeding Journal PeerReview:PeerReviewed PeerReview Book:Book Book |
| author |
Ahyaningsih, Faiz |
| title |
STRATEGY KOMBINASI UNTUK MENYELESAIKAN QUADRATIC ASSIGNMENT PROBLEM |
| publishDate |
2016 |
| topic |
QA Mathematics |
| url |
http://digilib.unimed.ac.id/41468/1/Fulltext.pdf http://digilib.unimed.ac.id/41468/2/Reviewer.pdf http://digilib.unimed.ac.id/41468/ http://seminar.uny.ac.id/semnasmatematika/sites/seminar.uny.ac.id.semnasmatematika/files/T-1.pdf |
| contents |
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 random point strategy to get initial starting point and then use forward exchange strategy and backward exchange strategy to get ‘optimal’ solution. We also create a comparative program to test the solution. As a computational experience we solve the problem of Had12 from QAPLIB, with the
optimal solution = 1652, permutation = 3 10 11 2 12 5 6 7 8 1 4 9 , running time = 122.512347 second = 2.04 minute. The optimal solution reached in 1050 iterations. |
| id |
IOS3150.41468 |
| institution |
Universitas Negeri Medan |
| institution_id |
60 |
| institution_type |
library:university library |
| library |
Perpustakaan Universitas Negeri Medan |
| library_id |
564 |
| collection |
Digital Repository Universitas Negeri Medan |
| repository_id |
3150 |
| subject_area |
Adat Istiadat Agama Akuntansi |
| city |
KOTA MEDAN |
| province |
SUMATERA UTARA |
| repoId |
IOS3150 |
| first_indexed |
2023-02-26T13:58:21Z |
| last_indexed |
2023-02-26T13:58:21Z |
| recordtype |
dc |
| _version_ |
1766033593430179840 |
| score |
17.538404 |