Loading…
A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem
In today's market conditions of increasing global competition, rapid changes in technology and shorter life cycle of product, it is required to evaluate the facility layout as the dynamic facility layout problem (DFLP). The objective of the DFLP is to determine layouts for each period in the pl...
Saved in:
Published in: | International journal of production research 2009-12, Vol.47 (24), p.6855-6873 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c403t-7da8fcbfc392bf8b4fcf855269433d83ed2ee5a276059da4341d801304c8b3483 |
---|---|
cites | cdi_FETCH-LOGICAL-c403t-7da8fcbfc392bf8b4fcf855269433d83ed2ee5a276059da4341d801304c8b3483 |
container_end_page | 6873 |
container_issue | 24 |
container_start_page | 6855 |
container_title | International journal of production research |
container_volume | 47 |
creator | SAHIN, Ramazan TÜRKBEY, Orhan |
description | In today's market conditions of increasing global competition, rapid changes in technology and shorter life cycle of product, it is required to evaluate the facility layout as the dynamic facility layout problem (DFLP). The objective of the DFLP is to determine layouts for each period in the planning horizon such that the sum of material handling and rearrangement costs are minimised. In the literature several researchers proposed new algorithms and models to solve the problem. The purpose of this research is to present a new hybrid heuristic based on the simulated annealing (SA) approach supplemented with a tabu list for the DFLP. We call this heuristic TABUSA. The efficiency of the TABUSA algorithm is analysed by solving the problems in a well known data set from the literature. We have also solved the same problems by using a pure SA algorithm, and a pure tabu search (TS) algorithm for comparison purposes. The results show the effectiveness of the TABUSA algorithm. |
doi_str_mv | 10.1080/00207540802376323 |
format | article |
fullrecord | <record><control><sourceid>proquest_infor</sourceid><recordid>TN_cdi_informaworld_taylorfrancis_310_1080_00207540802376323</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1889752661</sourcerecordid><originalsourceid>FETCH-LOGICAL-c403t-7da8fcbfc392bf8b4fcf855269433d83ed2ee5a276059da4341d801304c8b3483</originalsourceid><addsrcrecordid>eNqFkMtKxDAUhoMoOF4ewF0QXFZza5sBNyLeYMCNortymouTIW01SdG-vRlG3QiaTXLI950ffoSOKDmlRJIzQhipS5GfjNcVZ3wLzSivqqKU8nkbzdb_RQb4LtqLcUXyKaWYoacL3Jt3vJza4DRO0I5FdN3oIRmNoe8NeNe_4KUZg4vJKWyHgNPSYD310K1nUM67NGEP0zAm_BqG1pvuAO1Y8NEcft376PH66uHytljc39xdXiwKJQhPRa1BWtVaxeestbIVVllZlqyaC8615EYzY0pgdUXKuQbBBdWSUE6Eki0Xku-j483enPs2mpia1TCGPkc2jMqqrCmtMkQ3kApDjMHY5jW4DsLUUNKs62t-1Zedk6_FEBV4G6BXLv6IjFFGxLzO3PmGc32upoP3IXjdJJj8EL4l_ldM_a_-y2rSR-KfJsqUmg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>218657116</pqid></control><display><type>article</type><title>A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem</title><source>Taylor and Francis Science and Technology Collection</source><source>BSC - Ebsco (Business Source Ultimate)</source><creator>SAHIN, Ramazan ; TÜRKBEY, Orhan</creator><creatorcontrib>SAHIN, Ramazan ; TÜRKBEY, Orhan</creatorcontrib><description>In today's market conditions of increasing global competition, rapid changes in technology and shorter life cycle of product, it is required to evaluate the facility layout as the dynamic facility layout problem (DFLP). The objective of the DFLP is to determine layouts for each period in the planning horizon such that the sum of material handling and rearrangement costs are minimised. In the literature several researchers proposed new algorithms and models to solve the problem. The purpose of this research is to present a new hybrid heuristic based on the simulated annealing (SA) approach supplemented with a tabu list for the DFLP. We call this heuristic TABUSA. The efficiency of the TABUSA algorithm is analysed by solving the problems in a well known data set from the literature. We have also solved the same problems by using a pure SA algorithm, and a pure tabu search (TS) algorithm for comparison purposes. The results show the effectiveness of the TABUSA algorithm.</description><identifier>ISSN: 0020-7543</identifier><identifier>EISSN: 1366-588X</identifier><identifier>DOI: 10.1080/00207540802376323</identifier><identifier>CODEN: IJPRB8</identifier><language>eng</language><publisher>Abingdon: Taylor & Francis Group</publisher><subject>Algorithms ; Applied sciences ; dynamic facility layout problem ; Efficiency ; Exact sciences and technology ; Facilities planning ; Heuristic ; hybrid meta-heuristics ; Inventory control, production control. Distribution ; Operational research and scientific management ; Operational research. Management science ; Optimization algorithms ; simulated annealing ; Studies ; tabu list</subject><ispartof>International journal of production research, 2009-12, Vol.47 (24), p.6855-6873</ispartof><rights>Copyright Taylor & Francis Group, LLC 2009</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Taylor & Francis Group 2009</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c403t-7da8fcbfc392bf8b4fcf855269433d83ed2ee5a276059da4341d801304c8b3483</citedby><cites>FETCH-LOGICAL-c403t-7da8fcbfc392bf8b4fcf855269433d83ed2ee5a276059da4341d801304c8b3483</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22120497$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>SAHIN, Ramazan</creatorcontrib><creatorcontrib>TÜRKBEY, Orhan</creatorcontrib><title>A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem</title><title>International journal of production research</title><description>In today's market conditions of increasing global competition, rapid changes in technology and shorter life cycle of product, it is required to evaluate the facility layout as the dynamic facility layout problem (DFLP). The objective of the DFLP is to determine layouts for each period in the planning horizon such that the sum of material handling and rearrangement costs are minimised. In the literature several researchers proposed new algorithms and models to solve the problem. The purpose of this research is to present a new hybrid heuristic based on the simulated annealing (SA) approach supplemented with a tabu list for the DFLP. We call this heuristic TABUSA. The efficiency of the TABUSA algorithm is analysed by solving the problems in a well known data set from the literature. We have also solved the same problems by using a pure SA algorithm, and a pure tabu search (TS) algorithm for comparison purposes. The results show the effectiveness of the TABUSA algorithm.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>dynamic facility layout problem</subject><subject>Efficiency</subject><subject>Exact sciences and technology</subject><subject>Facilities planning</subject><subject>Heuristic</subject><subject>hybrid meta-heuristics</subject><subject>Inventory control, production control. Distribution</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimization algorithms</subject><subject>simulated annealing</subject><subject>Studies</subject><subject>tabu list</subject><issn>0020-7543</issn><issn>1366-588X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><recordid>eNqFkMtKxDAUhoMoOF4ewF0QXFZza5sBNyLeYMCNortymouTIW01SdG-vRlG3QiaTXLI950ffoSOKDmlRJIzQhipS5GfjNcVZ3wLzSivqqKU8nkbzdb_RQb4LtqLcUXyKaWYoacL3Jt3vJza4DRO0I5FdN3oIRmNoe8NeNe_4KUZg4vJKWyHgNPSYD310K1nUM67NGEP0zAm_BqG1pvuAO1Y8NEcft376PH66uHytljc39xdXiwKJQhPRa1BWtVaxeestbIVVllZlqyaC8615EYzY0pgdUXKuQbBBdWSUE6Eki0Xku-j483enPs2mpia1TCGPkc2jMqqrCmtMkQ3kApDjMHY5jW4DsLUUNKs62t-1Zedk6_FEBV4G6BXLv6IjFFGxLzO3PmGc32upoP3IXjdJJj8EL4l_ldM_a_-y2rSR-KfJsqUmg</recordid><startdate>20091215</startdate><enddate>20091215</enddate><creator>SAHIN, Ramazan</creator><creator>TÜRKBEY, Orhan</creator><general>Taylor & Francis Group</general><general>Taylor & Francis</general><general>Taylor & Francis LLC</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20091215</creationdate><title>A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem</title><author>SAHIN, Ramazan ; TÜRKBEY, Orhan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c403t-7da8fcbfc392bf8b4fcf855269433d83ed2ee5a276059da4341d801304c8b3483</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>dynamic facility layout problem</topic><topic>Efficiency</topic><topic>Exact sciences and technology</topic><topic>Facilities planning</topic><topic>Heuristic</topic><topic>hybrid meta-heuristics</topic><topic>Inventory control, production control. Distribution</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimization algorithms</topic><topic>simulated annealing</topic><topic>Studies</topic><topic>tabu list</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>SAHIN, Ramazan</creatorcontrib><creatorcontrib>TÜRKBEY, Orhan</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering 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>International journal of production research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>SAHIN, Ramazan</au><au>TÜRKBEY, Orhan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem</atitle><jtitle>International journal of production research</jtitle><date>2009-12-15</date><risdate>2009</risdate><volume>47</volume><issue>24</issue><spage>6855</spage><epage>6873</epage><pages>6855-6873</pages><issn>0020-7543</issn><eissn>1366-588X</eissn><coden>IJPRB8</coden><abstract>In today's market conditions of increasing global competition, rapid changes in technology and shorter life cycle of product, it is required to evaluate the facility layout as the dynamic facility layout problem (DFLP). The objective of the DFLP is to determine layouts for each period in the planning horizon such that the sum of material handling and rearrangement costs are minimised. In the literature several researchers proposed new algorithms and models to solve the problem. The purpose of this research is to present a new hybrid heuristic based on the simulated annealing (SA) approach supplemented with a tabu list for the DFLP. We call this heuristic TABUSA. The efficiency of the TABUSA algorithm is analysed by solving the problems in a well known data set from the literature. We have also solved the same problems by using a pure SA algorithm, and a pure tabu search (TS) algorithm for comparison purposes. The results show the effectiveness of the TABUSA algorithm.</abstract><cop>Abingdon</cop><pub>Taylor & Francis Group</pub><doi>10.1080/00207540802376323</doi><tpages>19</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0020-7543 |
ispartof | International journal of production research, 2009-12, Vol.47 (24), p.6855-6873 |
issn | 0020-7543 1366-588X |
language | eng |
recordid | cdi_informaworld_taylorfrancis_310_1080_00207540802376323 |
source | Taylor and Francis Science and Technology Collection; BSC - Ebsco (Business Source Ultimate) |
subjects | Algorithms Applied sciences dynamic facility layout problem Efficiency Exact sciences and technology Facilities planning Heuristic hybrid meta-heuristics Inventory control, production control. Distribution Operational research and scientific management Operational research. Management science Optimization algorithms simulated annealing Studies tabu list |
title | A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-21T18%3A47%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_infor&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20new%20hybrid%20tabu-simulated%20annealing%20heuristic%20for%20the%20dynamic%20facility%20layout%20problem&rft.jtitle=International%20journal%20of%20production%20research&rft.au=SAHIN,%20Ramazan&rft.date=2009-12-15&rft.volume=47&rft.issue=24&rft.spage=6855&rft.epage=6873&rft.pages=6855-6873&rft.issn=0020-7543&rft.eissn=1366-588X&rft.coden=IJPRB8&rft_id=info:doi/10.1080/00207540802376323&rft_dat=%3Cproquest_infor%3E1889752661%3C/proquest_infor%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c403t-7da8fcbfc392bf8b4fcf855269433d83ed2ee5a276059da4341d801304c8b3483%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=218657116&rft_id=info:pmid/&rfr_iscdi=true |