Tabu search based algorithms are among the widely used heuristic algorithms for combinatorial optimization problems. In this project, we propose an improved enhanced tabu search algorithm for the well-known combinatorial optimization problem, the quadratic assignment problem (QAP). The new algorithm was tested on a number of instances from the library of the QAP instances QAPLIB. The results obtained from the experiments show that the proposed algorithm appears to be superior to the earlier "pure" tabu search algorithms on many instances of the QAP.
| Identifer | oai:union.ndltd.org:LABT_ETD/oai:elaba.lt:LT-eLABa-0001:E.02~2004~D_20040527_141211-40277 |
| Date | 27 May 2004 |
| Creators | Gedgaudas, Audrius |
| Contributors | Kazanavičius, Egidijus, Jusas, Vacius, Šeinauskas, Rimantas, Štuikys, Vytautas, Lenkevičius, Antanas, Misevičius, Alfonsas, Rubliauskas, Dalius, Targamadzė, Aleksandras, Bareiša, Eduardas, Stulpinas, Raimundas, Butleris, Rimantas, Kaunas University of Technology |
| Publisher | Lithuanian Academic Libraries Network (LABT), Kaunas University of Technology |
| Source Sets | Lithuanian ETD submission system |
| Language | Lithuanian |
| Detected Language | English |
| Type | Master thesis |
| Format | application/pdf |
| Source | http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2004~D_20040527_141211-40277 |
| Rights | Unrestricted |
Page generated in 0.0022 seconds