Methodology for an orderly quadratic assignment problem
An assignment arrangement problem (AAP), in which an arrangement represents a geometric straight line joining two pre-defined points (for facility and location), is introduced. This problem is a special class of QAP, and is different from all existing QAP's, as it requires a pre-established ord...
Gespeichert in:
| Veröffentlicht in: | Computers & industrial engineering 1987, Vol.13 (1), p.281-284 |
|---|---|
| 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 | 284 |
|---|---|
| container_issue | 1 |
| container_start_page | 281 |
| container_title | Computers & industrial engineering |
| container_volume | 13 |
| creator | Sylla, Cheickna Babu, A.J.G. |
| description | An assignment arrangement problem (AAP), in which an arrangement represents a geometric straight line joining two pre-defined points (for facility and location), is introduced. This problem is a special class of QAP, and is different from all existing QAP's, as it requires a pre-established order between all assignments included in addition to a multi-objective function involved. It is shown that this un-conventional problem cannot be solved using current conventional exchange heuristic procedures. A new pairwise exchange is developed and programmed for solution and evaluation. The AAP and the solution procedure introduced are flexible and may be applicable to other problems which fit the general QAP formulation. |
| doi_str_mv | 10.1016/0360-8352(87)90097-0 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_213754296</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0360835287900970</els_id><sourcerecordid>1017614</sourcerecordid><originalsourceid>FETCH-LOGICAL-c331t-b03d566d0ae23ed23af0ddee3e47b07456a8292ca69105cec4d22a2be7ed07b33</originalsourceid><addsrcrecordid>eNp9kE9LAzEUxIMoWKvfwMPiSQ-rL8km2VwEEf9BxYueQzZ5W1O2mzbZCv32bq149PTg8ZsZZgg5p3BNgcob4BLKmgt2WasrDaBVCQdkQmulSxACDsnkDzkmJzkvAKASmk6IesXhM_rYxfm2aGMqbF_E5DF122K9sT7ZIbjC5hzm_RL7oVil2HS4PCVHre0ynv3eKfl4fHi_fy5nb08v93ez0nFOh7IB7oWUHiwyjp5x24L3iBwr1YCqhLQ108xZqSkIh67yjFnWoEIPquF8Si72vmPueoN5MIu4Sf0YaRjlSlRMyxGq9pBLMeeErVmlsLRpayiY3UJmV9_s6ptamZ-FxteU3O5lOBb4CphMdgF7hz4kdIPxMfxv8A2pEmz4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>213754296</pqid></control><display><type>article</type><title>Methodology for an orderly quadratic assignment problem</title><source>Elsevier ScienceDirect Journals Complete</source><creator>Sylla, Cheickna ; Babu, A.J.G.</creator><creatorcontrib>Sylla, Cheickna ; Babu, A.J.G.</creatorcontrib><description>An assignment arrangement problem (AAP), in which an arrangement represents a geometric straight line joining two pre-defined points (for facility and location), is introduced. This problem is a special class of QAP, and is different from all existing QAP's, as it requires a pre-established order between all assignments included in addition to a multi-objective function involved. It is shown that this un-conventional problem cannot be solved using current conventional exchange heuristic procedures. A new pairwise exchange is developed and programmed for solution and evaluation. The AAP and the solution procedure introduced are flexible and may be applicable to other problems which fit the general QAP formulation.</description><identifier>ISSN: 0360-8352</identifier><identifier>EISSN: 1879-0550</identifier><identifier>DOI: 10.1016/0360-8352(87)90097-0</identifier><identifier>CODEN: CINDDL</identifier><language>eng</language><publisher>New York: Elsevier Ltd</publisher><subject>Algorithms ; Assignment problem ; Facilities planning ; Location analysis ; Operations research ; Studies</subject><ispartof>Computers & industrial engineering, 1987, Vol.13 (1), p.281-284</ispartof><rights>1987</rights><rights>Copyright Pergamon Press Inc. 1987</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c331t-b03d566d0ae23ed23af0ddee3e47b07456a8292ca69105cec4d22a2be7ed07b33</citedby><cites>FETCH-LOGICAL-c331t-b03d566d0ae23ed23af0ddee3e47b07456a8292ca69105cec4d22a2be7ed07b33</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/0360-8352(87)90097-0$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3548,4022,27922,27923,27924,45994</link.rule.ids></links><search><creatorcontrib>Sylla, Cheickna</creatorcontrib><creatorcontrib>Babu, A.J.G.</creatorcontrib><title>Methodology for an orderly quadratic assignment problem</title><title>Computers & industrial engineering</title><description>An assignment arrangement problem (AAP), in which an arrangement represents a geometric straight line joining two pre-defined points (for facility and location), is introduced. This problem is a special class of QAP, and is different from all existing QAP's, as it requires a pre-established order between all assignments included in addition to a multi-objective function involved. It is shown that this un-conventional problem cannot be solved using current conventional exchange heuristic procedures. A new pairwise exchange is developed and programmed for solution and evaluation. The AAP and the solution procedure introduced are flexible and may be applicable to other problems which fit the general QAP formulation.</description><subject>Algorithms</subject><subject>Assignment problem</subject><subject>Facilities planning</subject><subject>Location analysis</subject><subject>Operations research</subject><subject>Studies</subject><issn>0360-8352</issn><issn>1879-0550</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1987</creationdate><recordtype>article</recordtype><recordid>eNp9kE9LAzEUxIMoWKvfwMPiSQ-rL8km2VwEEf9BxYueQzZ5W1O2mzbZCv32bq149PTg8ZsZZgg5p3BNgcob4BLKmgt2WasrDaBVCQdkQmulSxACDsnkDzkmJzkvAKASmk6IesXhM_rYxfm2aGMqbF_E5DF122K9sT7ZIbjC5hzm_RL7oVil2HS4PCVHre0ynv3eKfl4fHi_fy5nb08v93ez0nFOh7IB7oWUHiwyjp5x24L3iBwr1YCqhLQ108xZqSkIh67yjFnWoEIPquF8Si72vmPueoN5MIu4Sf0YaRjlSlRMyxGq9pBLMeeErVmlsLRpayiY3UJmV9_s6ptamZ-FxteU3O5lOBb4CphMdgF7hz4kdIPxMfxv8A2pEmz4</recordid><startdate>1987</startdate><enddate>1987</enddate><creator>Sylla, Cheickna</creator><creator>Babu, A.J.G.</creator><general>Elsevier Ltd</general><general>Pergamon Press Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>1987</creationdate><title>Methodology for an orderly quadratic assignment problem</title><author>Sylla, Cheickna ; Babu, A.J.G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c331t-b03d566d0ae23ed23af0ddee3e47b07456a8292ca69105cec4d22a2be7ed07b33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1987</creationdate><topic>Algorithms</topic><topic>Assignment problem</topic><topic>Facilities planning</topic><topic>Location analysis</topic><topic>Operations research</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sylla, Cheickna</creatorcontrib><creatorcontrib>Babu, A.J.G.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computers & industrial engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sylla, Cheickna</au><au>Babu, A.J.G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Methodology for an orderly quadratic assignment problem</atitle><jtitle>Computers & industrial engineering</jtitle><date>1987</date><risdate>1987</risdate><volume>13</volume><issue>1</issue><spage>281</spage><epage>284</epage><pages>281-284</pages><issn>0360-8352</issn><eissn>1879-0550</eissn><coden>CINDDL</coden><abstract>An assignment arrangement problem (AAP), in which an arrangement represents a geometric straight line joining two pre-defined points (for facility and location), is introduced. This problem is a special class of QAP, and is different from all existing QAP's, as it requires a pre-established order between all assignments included in addition to a multi-objective function involved. It is shown that this un-conventional problem cannot be solved using current conventional exchange heuristic procedures. A new pairwise exchange is developed and programmed for solution and evaluation. The AAP and the solution procedure introduced are flexible and may be applicable to other problems which fit the general QAP formulation.</abstract><cop>New York</cop><pub>Elsevier Ltd</pub><doi>10.1016/0360-8352(87)90097-0</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0360-8352 |
| ispartof | Computers & industrial engineering, 1987, Vol.13 (1), p.281-284 |
| issn | 0360-8352 1879-0550 |
| language | eng |
| recordid | cdi_proquest_journals_213754296 |
| source | Elsevier ScienceDirect Journals Complete |
| subjects | Algorithms Assignment problem Facilities planning Location analysis Operations research Studies |
| title | Methodology for an orderly quadratic assignment problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T18%3A56%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Methodology%20for%20an%20orderly%20quadratic%20assignment%20problem&rft.jtitle=Computers%20&%20industrial%20engineering&rft.au=Sylla,%20Cheickna&rft.date=1987&rft.volume=13&rft.issue=1&rft.spage=281&rft.epage=284&rft.pages=281-284&rft.issn=0360-8352&rft.eissn=1879-0550&rft.coden=CINDDL&rft_id=info:doi/10.1016/0360-8352(87)90097-0&rft_dat=%3Cproquest_cross%3E1017614%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=213754296&rft_id=info:pmid/&rft_els_id=0360835287900970&rfr_iscdi=true |