A GRASP algorithm for solving large-scale single row facility layout problems
•We address large-scale instances of the single row facility layout problem (SRFLP).•A GRASP algorithm with a diversification phase based on frequency memory, called GRASP-f, is proposed.•GRASP-f uses techniques to accelerate the evaluation of the gain of the objective function.•Computational experi...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research 2019-06, Vol.106, p.49-61 |
|---|---|
| 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 | 61 |
|---|---|
| container_issue | |
| container_start_page | 49 |
| container_title | Computers & operations research |
| container_volume | 106 |
| creator | Cravo, G.L. Amaral, A.R.S. |
| description | •We address large-scale instances of the single row facility layout problem (SRFLP).•A GRASP algorithm with a diversification phase based on frequency memory, called GRASP-f, is proposed.•GRASP-f uses techniques to accelerate the evaluation of the gain of the objective function.•Computational experiments for SRFLP instances with up to 1,000 facilities are reported.•GRASP-f improved the best-known values for 29 out of 93 instances.
The single-row facility layout problem (SRFLP) is an NP-hard problem, which consists of arranging facilities along a straight line in order to minimize the weighted sum of distances between all pairs of facilities. In this paper, an implementation of the Greedy Randomized Adaptive Search Procedure (GRASP) meta-heuristic is presented to solve large-scale instances of the problem. The novelty of the proposed implementation is that it is endowed with a diversification phase based on frequency memory. The algorithm was tested on 93 instances with sizes up to one thousand facilities. To date, in the literature, there is only one work, which has considered instances of such magnitude. Computational experiments demonstrate the efficiency of the proposed algorithm, which improved the best-known values for 29 out of 93 instances. |
| doi_str_mv | 10.1016/j.cor.2019.02.009 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2225804197</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054819300486</els_id><sourcerecordid>2225804197</sourcerecordid><originalsourceid>FETCH-LOGICAL-c400t-7e12238819f1543a37f8ec99307d173a98113b01c76f812dea739a81042397683</originalsourceid><addsrcrecordid>eNp9kE9LAzEQxYMoWKsfwNuC511nkt1NgqciWoWK4h_wFtJstmbZNjXZVvrtTaln5_Jg5r2Z4UfIJUKBgPV1VxgfCgooC6AFgDwiIxSc5byuPo_JCBhUOVSlOCVnMXaQilMckadJNn2dvL1kul_44IavZdb6kEXfb91qkfU6LGweje5tFlMjSfA_WauN692wS_Od3wzZOvh5b5fxnJy0uo_24k_H5OP-7v32IZ89Tx9vJ7PclABDzi1SyoRA2WJVMs14K6yRkgFvkDMtBSKbAxpetwJpYzVnUguEkjLJa8HG5OqwNx3-3tg4qM5vwiqdVJTSSkCJkicXHlwm-BiDbdU6uKUOO4Wg9tRUpxI1taemgKpELWVuDhmb3t86G1Q0zq6MbVywZlCNd_-kfwH8jnLq</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2225804197</pqid></control><display><type>article</type><title>A GRASP algorithm for solving large-scale single row facility layout problems</title><source>Elsevier ScienceDirect Journals</source><creator>Cravo, G.L. ; Amaral, A.R.S.</creator><creatorcontrib>Cravo, G.L. ; Amaral, A.R.S.</creatorcontrib><description>•We address large-scale instances of the single row facility layout problem (SRFLP).•A GRASP algorithm with a diversification phase based on frequency memory, called GRASP-f, is proposed.•GRASP-f uses techniques to accelerate the evaluation of the gain of the objective function.•Computational experiments for SRFLP instances with up to 1,000 facilities are reported.•GRASP-f improved the best-known values for 29 out of 93 instances.
The single-row facility layout problem (SRFLP) is an NP-hard problem, which consists of arranging facilities along a straight line in order to minimize the weighted sum of distances between all pairs of facilities. In this paper, an implementation of the Greedy Randomized Adaptive Search Procedure (GRASP) meta-heuristic is presented to solve large-scale instances of the problem. The novelty of the proposed implementation is that it is endowed with a diversification phase based on frequency memory. The algorithm was tested on 93 instances with sizes up to one thousand facilities. To date, in the literature, there is only one work, which has considered instances of such magnitude. Computational experiments demonstrate the efficiency of the proposed algorithm, which improved the best-known values for 29 out of 93 instances.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2019.02.009</identifier><language>eng</language><publisher>New York: Elsevier Ltd</publisher><subject>Adaptive search techniques ; Algorithms ; Facilities management ; Facility layout ; GRASP ; Heuristic methods ; Layouts ; Manufacturing optimization ; Operations research ; Production scheduling</subject><ispartof>Computers & operations research, 2019-06, Vol.106, p.49-61</ispartof><rights>2019 Elsevier Ltd</rights><rights>Copyright Pergamon Press Inc. Jun 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c400t-7e12238819f1543a37f8ec99307d173a98113b01c76f812dea739a81042397683</citedby><cites>FETCH-LOGICAL-c400t-7e12238819f1543a37f8ec99307d173a98113b01c76f812dea739a81042397683</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0305054819300486$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids></links><search><creatorcontrib>Cravo, G.L.</creatorcontrib><creatorcontrib>Amaral, A.R.S.</creatorcontrib><title>A GRASP algorithm for solving large-scale single row facility layout problems</title><title>Computers & operations research</title><description>•We address large-scale instances of the single row facility layout problem (SRFLP).•A GRASP algorithm with a diversification phase based on frequency memory, called GRASP-f, is proposed.•GRASP-f uses techniques to accelerate the evaluation of the gain of the objective function.•Computational experiments for SRFLP instances with up to 1,000 facilities are reported.•GRASP-f improved the best-known values for 29 out of 93 instances.
The single-row facility layout problem (SRFLP) is an NP-hard problem, which consists of arranging facilities along a straight line in order to minimize the weighted sum of distances between all pairs of facilities. In this paper, an implementation of the Greedy Randomized Adaptive Search Procedure (GRASP) meta-heuristic is presented to solve large-scale instances of the problem. The novelty of the proposed implementation is that it is endowed with a diversification phase based on frequency memory. The algorithm was tested on 93 instances with sizes up to one thousand facilities. To date, in the literature, there is only one work, which has considered instances of such magnitude. Computational experiments demonstrate the efficiency of the proposed algorithm, which improved the best-known values for 29 out of 93 instances.</description><subject>Adaptive search techniques</subject><subject>Algorithms</subject><subject>Facilities management</subject><subject>Facility layout</subject><subject>GRASP</subject><subject>Heuristic methods</subject><subject>Layouts</subject><subject>Manufacturing optimization</subject><subject>Operations research</subject><subject>Production scheduling</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp9kE9LAzEQxYMoWKsfwNuC511nkt1NgqciWoWK4h_wFtJstmbZNjXZVvrtTaln5_Jg5r2Z4UfIJUKBgPV1VxgfCgooC6AFgDwiIxSc5byuPo_JCBhUOVSlOCVnMXaQilMckadJNn2dvL1kul_44IavZdb6kEXfb91qkfU6LGweje5tFlMjSfA_WauN692wS_Od3wzZOvh5b5fxnJy0uo_24k_H5OP-7v32IZ89Tx9vJ7PclABDzi1SyoRA2WJVMs14K6yRkgFvkDMtBSKbAxpetwJpYzVnUguEkjLJa8HG5OqwNx3-3tg4qM5vwiqdVJTSSkCJkicXHlwm-BiDbdU6uKUOO4Wg9tRUpxI1taemgKpELWVuDhmb3t86G1Q0zq6MbVywZlCNd_-kfwH8jnLq</recordid><startdate>20190601</startdate><enddate>20190601</enddate><creator>Cravo, G.L.</creator><creator>Amaral, A.R.S.</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>20190601</creationdate><title>A GRASP algorithm for solving large-scale single row facility layout problems</title><author>Cravo, G.L. ; Amaral, A.R.S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c400t-7e12238819f1543a37f8ec99307d173a98113b01c76f812dea739a81042397683</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Adaptive search techniques</topic><topic>Algorithms</topic><topic>Facilities management</topic><topic>Facility layout</topic><topic>GRASP</topic><topic>Heuristic methods</topic><topic>Layouts</topic><topic>Manufacturing optimization</topic><topic>Operations research</topic><topic>Production scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cravo, G.L.</creatorcontrib><creatorcontrib>Amaral, A.R.S.</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 & operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cravo, G.L.</au><au>Amaral, A.R.S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A GRASP algorithm for solving large-scale single row facility layout problems</atitle><jtitle>Computers & operations research</jtitle><date>2019-06-01</date><risdate>2019</risdate><volume>106</volume><spage>49</spage><epage>61</epage><pages>49-61</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><abstract>•We address large-scale instances of the single row facility layout problem (SRFLP).•A GRASP algorithm with a diversification phase based on frequency memory, called GRASP-f, is proposed.•GRASP-f uses techniques to accelerate the evaluation of the gain of the objective function.•Computational experiments for SRFLP instances with up to 1,000 facilities are reported.•GRASP-f improved the best-known values for 29 out of 93 instances.
The single-row facility layout problem (SRFLP) is an NP-hard problem, which consists of arranging facilities along a straight line in order to minimize the weighted sum of distances between all pairs of facilities. In this paper, an implementation of the Greedy Randomized Adaptive Search Procedure (GRASP) meta-heuristic is presented to solve large-scale instances of the problem. The novelty of the proposed implementation is that it is endowed with a diversification phase based on frequency memory. The algorithm was tested on 93 instances with sizes up to one thousand facilities. To date, in the literature, there is only one work, which has considered instances of such magnitude. Computational experiments demonstrate the efficiency of the proposed algorithm, which improved the best-known values for 29 out of 93 instances.</abstract><cop>New York</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2019.02.009</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0305-0548 |
| ispartof | Computers & operations research, 2019-06, Vol.106, p.49-61 |
| issn | 0305-0548 1873-765X 0305-0548 |
| language | eng |
| recordid | cdi_proquest_journals_2225804197 |
| source | Elsevier ScienceDirect Journals |
| subjects | Adaptive search techniques Algorithms Facilities management Facility layout GRASP Heuristic methods Layouts Manufacturing optimization Operations research Production scheduling |
| title | A GRASP algorithm for solving large-scale single row facility layout problems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T18%3A30%3A01IST&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=A%20GRASP%20algorithm%20for%20solving%20large-scale%20single%20row%20facility%20layout%20problems&rft.jtitle=Computers%20&%20operations%20research&rft.au=Cravo,%20G.L.&rft.date=2019-06-01&rft.volume=106&rft.spage=49&rft.epage=61&rft.pages=49-61&rft.issn=0305-0548&rft.eissn=1873-765X&rft_id=info:doi/10.1016/j.cor.2019.02.009&rft_dat=%3Cproquest_cross%3E2225804197%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=2225804197&rft_id=info:pmid/&rft_els_id=S0305054819300486&rfr_iscdi=true |