Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorÖzçetin, Erdener
dc.contributor.authorÖztürk, Gürkan
dc.date.accessioned2018-12-12T07:28:17Z
dc.date.available2018-12-12T07:28:17Z
dc.date.issued2018-06-27
dc.identifier.issn2149-0104
dc.identifier.issn2149-5262
dc.identifier.urihttps://hdl.handle.net/11363/583
dc.description.abstractIn this study, quadratic assignment problem, which is a hard combinatorial optimization problem, is examined to solve by a new approach. To reach the optimal results by using mathematical programming approaches cannot be possible even for some sorts of small and middle scaled problems in a reasonable time interval. Huge amounts of data are being progressed simultaneously by graphics processing units located on computers’ graphics card. Therefore, a parallel iterated local search algorithm has been proposed to solve the quadratic assignment problem by using graphics processing units’ simultaneously progressing property. This parallel algorithm and the sequential one on central processing units are tested and compared for test problems in literature. Indeed, it is observed that the parallel algorithm works averagely 6.31 times faster for Skorin problems and 11.93 times faster for Taillard problems faster than sequentially one.en_US
dc.language.isoengen_US
dc.publisherİstanbul Gelişim Üniversitesi Yayınları / Istanbul Gelisim University Pressen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectResearch Subject Categories::TECHNOLOGYen_US
dc.titleA Parallel Iterated Local Search Algorithm on GPUs for Quadratic Assignment Problemen_US
dc.typearticleen_US
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Yayınıen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster