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


APPLIED SOFT COMPUTING, vol.94, 2020 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 94
  • Publication Date: 2020
  • Doi Number: 10.1016/j.asoc.2020.106469
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Applied Science & Technology Source, Compendex, Computer & Applied Sciences, INSPEC
  • Keywords: Distributed machine layout, Capability-based machine layout, Integer programming, Metaheuristics, Weighted superposition attraction algorithm, SWARM INTELLIGENCE ALGORITHM, SUPERPOSITION ATTRACTION WSA, DESIGN, OPTIMIZATION
  • Dokuz Eylül University Affiliated: Yes


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.