Solving the Quadratic Assignment Problem on heterogeneous environment (CPUs and GPUs) with the application of Level 2 Reformulation and Linearization Technique
The Quadratic Assignment Problem, QAP, is a classic combinatorial optimization problem, classified as NP-hard and widely studied. This problem consists in assigning N facilities to N locations obeying the relation of 1 to 1, aiming to minimize costs of the displacement between the facilities. The ap...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2015-10 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Alexandre Domingues Gonçalves Artur Alves Pessoa Lúcia Maria de Assumpção Drummond Bentes, Cristiana Farias, Ricardo |
| description | The Quadratic Assignment Problem, QAP, is a classic combinatorial optimization problem, classified as NP-hard and widely studied. This problem consists in assigning N facilities to N locations obeying the relation of 1 to 1, aiming to minimize costs of the displacement between the facilities. The application of Reformulation and Linearization Technique, RLT, to the QAP leads to a tight linear relaxation but large and difficult to solve. Previous works based on level 3 RLT needed about 700GB of working memory to process one large instances (N = 30 facilities). We present a modified version of the algorithm proposed by Adams et al. which executes on heterogeneous systems (CPUs and GPUs), based on level 2 RLT. For some instances, our algorithm is up to 140 times faster and occupy 97% less memory than the level 3 RLT version. The proposed algorithm was able to solve by first time two instances: tai35b and tai40b. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2083402997</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2083402997</sourcerecordid><originalsourceid>FETCH-proquest_journals_20834029973</originalsourceid><addsrcrecordid>eNqNjM1OAkEQhCckJhLlHTrxogeScQYEjoT4c-AAiGcyLr27Q2a71_lZE1_GV3V0eQBPVamvqgZiqLS-H88nSl2KUQgnKaV6mKnpVA_F9yu7zlIFsUbYJnP0JtoCliHYihqkCBvP7w4bYIIaI3qukJBTAKTOeu5Lt6vNWwBDR3jO5g4-baz_Lk3bOlvkzzznEtbYoQMFOyzZN8n14He3toTG268-2WNRk_1IeC0uSuMCjs56JW6eHverl3HrOeMQDydOnjI6KDnXE6kWi5n-X-sHYqJcHQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2083402997</pqid></control><display><type>article</type><title>Solving the Quadratic Assignment Problem on heterogeneous environment (CPUs and GPUs) with the application of Level 2 Reformulation and Linearization Technique</title><source>Free E- Journals</source><creator>Alexandre Domingues Gonçalves ; Artur Alves Pessoa ; Lúcia Maria de Assumpção Drummond ; Bentes, Cristiana ; Farias, Ricardo</creator><creatorcontrib>Alexandre Domingues Gonçalves ; Artur Alves Pessoa ; Lúcia Maria de Assumpção Drummond ; Bentes, Cristiana ; Farias, Ricardo</creatorcontrib><description>The Quadratic Assignment Problem, QAP, is a classic combinatorial optimization problem, classified as NP-hard and widely studied. This problem consists in assigning N facilities to N locations obeying the relation of 1 to 1, aiming to minimize costs of the displacement between the facilities. The application of Reformulation and Linearization Technique, RLT, to the QAP leads to a tight linear relaxation but large and difficult to solve. Previous works based on level 3 RLT needed about 700GB of working memory to process one large instances (N = 30 facilities). We present a modified version of the algorithm proposed by Adams et al. which executes on heterogeneous systems (CPUs and GPUs), based on level 2 RLT. For some instances, our algorithm is up to 140 times faster and occupy 97% less memory than the level 3 RLT version. The proposed algorithm was able to solve by first time two instances: tai35b and tai40b.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Combinatorial analysis ; Linearization ; Operations research ; Optimization</subject><ispartof>arXiv.org, 2015-10</ispartof><rights>2015. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Alexandre Domingues Gonçalves</creatorcontrib><creatorcontrib>Artur Alves Pessoa</creatorcontrib><creatorcontrib>Lúcia Maria de Assumpção Drummond</creatorcontrib><creatorcontrib>Bentes, Cristiana</creatorcontrib><creatorcontrib>Farias, Ricardo</creatorcontrib><title>Solving the Quadratic Assignment Problem on heterogeneous environment (CPUs and GPUs) with the application of Level 2 Reformulation and Linearization Technique</title><title>arXiv.org</title><description>The Quadratic Assignment Problem, QAP, is a classic combinatorial optimization problem, classified as NP-hard and widely studied. This problem consists in assigning N facilities to N locations obeying the relation of 1 to 1, aiming to minimize costs of the displacement between the facilities. The application of Reformulation and Linearization Technique, RLT, to the QAP leads to a tight linear relaxation but large and difficult to solve. Previous works based on level 3 RLT needed about 700GB of working memory to process one large instances (N = 30 facilities). We present a modified version of the algorithm proposed by Adams et al. which executes on heterogeneous systems (CPUs and GPUs), based on level 2 RLT. For some instances, our algorithm is up to 140 times faster and occupy 97% less memory than the level 3 RLT version. The proposed algorithm was able to solve by first time two instances: tai35b and tai40b.</description><subject>Algorithms</subject><subject>Combinatorial analysis</subject><subject>Linearization</subject><subject>Operations research</subject><subject>Optimization</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNjM1OAkEQhCckJhLlHTrxogeScQYEjoT4c-AAiGcyLr27Q2a71_lZE1_GV3V0eQBPVamvqgZiqLS-H88nSl2KUQgnKaV6mKnpVA_F9yu7zlIFsUbYJnP0JtoCliHYihqkCBvP7w4bYIIaI3qukJBTAKTOeu5Lt6vNWwBDR3jO5g4-baz_Lk3bOlvkzzznEtbYoQMFOyzZN8n14He3toTG268-2WNRk_1IeC0uSuMCjs56JW6eHverl3HrOeMQDydOnjI6KDnXE6kWi5n-X-sHYqJcHQ</recordid><startdate>20151007</startdate><enddate>20151007</enddate><creator>Alexandre Domingues Gonçalves</creator><creator>Artur Alves Pessoa</creator><creator>Lúcia Maria de Assumpção Drummond</creator><creator>Bentes, Cristiana</creator><creator>Farias, Ricardo</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20151007</creationdate><title>Solving the Quadratic Assignment Problem on heterogeneous environment (CPUs and GPUs) with the application of Level 2 Reformulation and Linearization Technique</title><author>Alexandre Domingues Gonçalves ; Artur Alves Pessoa ; Lúcia Maria de Assumpção Drummond ; Bentes, Cristiana ; Farias, Ricardo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20834029973</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Combinatorial analysis</topic><topic>Linearization</topic><topic>Operations research</topic><topic>Optimization</topic><toplevel>online_resources</toplevel><creatorcontrib>Alexandre Domingues Gonçalves</creatorcontrib><creatorcontrib>Artur Alves Pessoa</creatorcontrib><creatorcontrib>Lúcia Maria de Assumpção Drummond</creatorcontrib><creatorcontrib>Bentes, Cristiana</creatorcontrib><creatorcontrib>Farias, Ricardo</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Alexandre Domingues Gonçalves</au><au>Artur Alves Pessoa</au><au>Lúcia Maria de Assumpção Drummond</au><au>Bentes, Cristiana</au><au>Farias, Ricardo</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Solving the Quadratic Assignment Problem on heterogeneous environment (CPUs and GPUs) with the application of Level 2 Reformulation and Linearization Technique</atitle><jtitle>arXiv.org</jtitle><date>2015-10-07</date><risdate>2015</risdate><eissn>2331-8422</eissn><abstract>The Quadratic Assignment Problem, QAP, is a classic combinatorial optimization problem, classified as NP-hard and widely studied. This problem consists in assigning N facilities to N locations obeying the relation of 1 to 1, aiming to minimize costs of the displacement between the facilities. The application of Reformulation and Linearization Technique, RLT, to the QAP leads to a tight linear relaxation but large and difficult to solve. Previous works based on level 3 RLT needed about 700GB of working memory to process one large instances (N = 30 facilities). We present a modified version of the algorithm proposed by Adams et al. which executes on heterogeneous systems (CPUs and GPUs), based on level 2 RLT. For some instances, our algorithm is up to 140 times faster and occupy 97% less memory than the level 3 RLT version. The proposed algorithm was able to solve by first time two instances: tai35b and tai40b.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2015-10 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_proquest_journals_2083402997 |
| source | Free E- Journals |
| subjects | Algorithms Combinatorial analysis Linearization Operations research Optimization |
| title | Solving the Quadratic Assignment Problem on heterogeneous environment (CPUs and GPUs) with the application of Level 2 Reformulation and Linearization Technique |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T16%3A56%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Solving%20the%20Quadratic%20Assignment%20Problem%20on%20heterogeneous%20environment%20(CPUs%20and%20GPUs)%20with%20the%20application%20of%20Level%202%20Reformulation%20and%20Linearization%20Technique&rft.jtitle=arXiv.org&rft.au=Alexandre%20Domingues%20Gon%C3%A7alves&rft.date=2015-10-07&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2083402997%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2083402997&rft_id=info:pmid/&rfr_iscdi=true |