arrow
Return

Capability-based distributed layout formation with or without demand and process flow information

delete2020-09-01
delete8
PRE
AI
A
Adil Baykasoğlu *
K
Kemal Subulan
DOI:10.1016/j.asoc.2020.106469delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, a binary integer programming model of an unbiased capability-based distributed layout (UBCB-DL) problem without demand and process flow information is first developed. Then, it is extended to a mixed-integer program for a biased capability-based distributed layout (BCB-DL) problem where the demand information and processing requirements of several parts are taken into account. Since the complex nature of the problems, a recently proposed new generation metaheuristic optimizer namely, weighted superposition attraction (WSA) algorithm is also applied. In order to show validity and practicality of the proposed WSA algorithm and compare its performance with the proposed mathematical programs, a real-life case study is presented. The computational experiments have shown that both of the proposed binary integer program and WSA algorithm are able to find alternative optimal solutions for the UBCB-DL problem under reasonable computation times. However, just a feasible solution with 5.93% optimality gap is found by the proposed mixed-integer program for the BCB-DL problem under 24-hour running time limit. Fortunately, its optimal solution is achieved by the proposed WSA algorithm. Consequently, the proposed WSA algorithm provided the most effective solutions for both UBCB-DL and BCB-DL problems under shortest computation times. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Distributed machine layout
Capability-based machine layout
Integer programming
Metaheuristics
Weighted superposition attraction algorithm
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

D
dokuz eylul university
Scholars:
5.9K
Papers: 4.6K
Citations: 52
Cited Papers

Cited Papers

Solving the design of distributed layout problem using forecast windows: A hybrid algorithm approach
err2013-02-01
err14
PREAI
errNageshwaraniyer, Sai Srinivas; Khilwani, Nitesh; Tiwari, M. K.; Shankar, Ravi; Ben-Arieh, David
errShare
errSave
researcher View more