用人工蜂群算法求解双目标单行设施布局问题

IF 16.4 1区化学 Q1 CHEMISTRY, MULTIDISCIPLINARY

Accounts of Chemical Research Pub Date : 2018-03-26 DOI:10.1504/EJIE.2018.090619

L. Nagarajan, S. Mahalingam, Selvakumar Gurusamy, V. Dharmaraj

{"title":"用人工蜂群算法求解双目标单行设施布局问题","authors":"L. Nagarajan, S. Mahalingam, Selvakumar Gurusamy, V. Dharmaraj","doi":"10.1504/EJIE.2018.090619","DOIUrl":null,"url":null,"abstract":"The single row facility layout problem (SRFLP) is concerned with the arrangements of machineries in a single line for processing multiple products. This arrangement is termed as linear machine sequence (lms). The aim of the proposed work is to design a best lms that simultaneously minimises the objectives: the total flow distance of the products (D); and the total length of the flow line (L) needed for accommodating the machineries in the shop floor. Consideration of more than one objective in a multi-product environment in bi-objective single row facility layout problem (BOSRFLP) is an NP-hard problem. Hence, artificial bee colony (ABC) algorithm is applied to identify the best lms. The effectiveness of the proposed algorithm is verified by solving the problems discussed in the literature. Maximum of 37.54% reduction in total flow distance and 9.31% reduction in total length of the flow line are achieved by the proposed method. [Revise 21 September 2017; Received 27 November 2016; Accepted on 29 December 2017]","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2018-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/EJIE.2018.090619","citationCount":"8","resultStr":"{\"title\":\"Solution for bi-objective single row facility layout problem using artificial bee colony algorithm\",\"authors\":\"L. Nagarajan, S. Mahalingam, Selvakumar Gurusamy, V. Dharmaraj\",\"doi\":\"10.1504/EJIE.2018.090619\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The single row facility layout problem (SRFLP) is concerned with the arrangements of machineries in a single line for processing multiple products. This arrangement is termed as linear machine sequence (lms). The aim of the proposed work is to design a best lms that simultaneously minimises the objectives: the total flow distance of the products (D); and the total length of the flow line (L) needed for accommodating the machineries in the shop floor. Consideration of more than one objective in a multi-product environment in bi-objective single row facility layout problem (BOSRFLP) is an NP-hard problem. Hence, artificial bee colony (ABC) algorithm is applied to identify the best lms. The effectiveness of the proposed algorithm is verified by solving the problems discussed in the literature. Maximum of 37.54% reduction in total flow distance and 9.31% reduction in total length of the flow line are achieved by the proposed method. [Revise 21 September 2017; Received 27 November 2016; Accepted on 29 December 2017]\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2018-03-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1504/EJIE.2018.090619\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1504/EJIE.2018.090619\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1504/EJIE.2018.090619","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 8

摘要

单排设备布置问题(SRFLP)是指在一条生产线上处理多种产品的设备布置问题。这种排列称为线性机器序列(lms)。拟议工作的目的是设计一个同时最小化目标的最佳lms:产品的总流动距离(D);以及容纳车间机器所需的流水线的总长度(L)。考虑多产品环境下多个目标的双目标单排设施布局问题(BOSRFLP)是一个np难题。因此，采用人工蜂群(ABC)算法来识别最佳lms。通过解决文献中讨论的问题，验证了所提算法的有效性。该方法最大可使总流距减少37.54%，总流线长度减少9.31%。[2017年9月21日修订;收到2016年11月27日;于2017年12月29日接受]

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Solution for bi-objective single row facility layout problem using artificial bee colony algorithm

The single row facility layout problem (SRFLP) is concerned with the arrangements of machineries in a single line for processing multiple products. This arrangement is termed as linear machine sequence (lms). The aim of the proposed work is to design a best lms that simultaneously minimises the objectives: the total flow distance of the products (D); and the total length of the flow line (L) needed for accommodating the machineries in the shop floor. Consideration of more than one objective in a multi-product environment in bi-objective single row facility layout problem (BOSRFLP) is an NP-hard problem. Hence, artificial bee colony (ABC) algorithm is applied to identify the best lms. The effectiveness of the proposed algorithm is verified by solving the problems discussed in the literature. Maximum of 37.54% reduction in total flow distance and 9.31% reduction in total length of the flow line are achieved by the proposed method. [Revise 21 September 2017; Received 27 November 2016; Accepted on 29 December 2017]

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Accounts of Chemical Research 化学-化学综合

CiteScore

31.40

自引率

1.10%

发文量

312

审稿时长

2 months

期刊介绍： Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.