An efficient algorithm for unequal area facilities layout planning with input and output points
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Park, Hyungjune | - |
dc.contributor.author | Seo, Yoonho | - |
dc.date.accessioned | 2021-09-01T22:44:50Z | - |
dc.date.available | 2021-09-01T22:44:50Z | - |
dc.date.created | 2021-06-19 | - |
dc.date.issued | 2019 | - |
dc.identifier.issn | 0315-5986 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/68919 | - |
dc.description.abstract | The facility layout problem is to determine a layout design of facilities so as to minimize a total material handling cost (TMHC). In this paper, unequal area rectangular facilities with fixed dimensions are considered. Each of them has an input and output (I/O) points which can be located within or on the boundaries of facility. On the continual plane, facilities must be placed without overlaps. A two-heuristic algorithm is proposed to deal with this kind of problem. The first step is based on a construction method which places facilities sequentially. A median method is modified to set the position of facility. The second step improves a result of the first step. A facility group which can be moved horizontally or vertically without incurring an overlap is constituted and a group movement is done when it reduces a TMHC. Computational experiments show the proposed algorithm produces comparable quality of layouts to previous research within much shorter time. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | TAYLOR & FRANCIS INC | - |
dc.subject | SIMULATED ANNEALING ALGORITHM | - |
dc.subject | SEQUENCE-PAIR REPRESENTATION | - |
dc.subject | GENETIC ALGORITHM | - |
dc.subject | HEURISTIC ALGORITHM | - |
dc.subject | DESIGN | - |
dc.subject | LOCATION | - |
dc.subject | SEARCH | - |
dc.subject | SINGLE | - |
dc.title | An efficient algorithm for unequal area facilities layout planning with input and output points | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Seo, Yoonho | - |
dc.identifier.doi | 10.1080/03155986.2017.1396709 | - |
dc.identifier.scopusid | 2-s2.0-85065201760 | - |
dc.identifier.wosid | 000469844300003 | - |
dc.identifier.bibliographicCitation | INFOR, v.57, no.1, pp.56 - 75 | - |
dc.relation.isPartOf | INFOR | - |
dc.citation.title | INFOR | - |
dc.citation.volume | 57 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 56 | - |
dc.citation.endPage | 75 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | SIMULATED ANNEALING ALGORITHM | - |
dc.subject.keywordPlus | SEQUENCE-PAIR REPRESENTATION | - |
dc.subject.keywordPlus | GENETIC ALGORITHM | - |
dc.subject.keywordPlus | HEURISTIC ALGORITHM | - |
dc.subject.keywordPlus | DESIGN | - |
dc.subject.keywordPlus | LOCATION | - |
dc.subject.keywordPlus | SEARCH | - |
dc.subject.keywordPlus | SINGLE | - |
dc.subject.keywordAuthor | Facility layout problem | - |
dc.subject.keywordAuthor | unequal area facility | - |
dc.subject.keywordAuthor | input and output points | - |
dc.subject.keywordAuthor | modified median method | - |
dc.subject.keywordAuthor | group movement | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.