Linear machine sequence is the arrangement of machines for processing a variety of products in a single-row layout. The objective of this paper is to design a best linear machine sequence with the objective of minimizing the total flow distance of the products and the total length of the flow line in a single-row facility layout problem. It is a non-polynomial hard problem. A heuristic method is complicated to solve the problem when the products and machines are increased. Hence, the flower pollination metaheuristic algorithm is proposed to solve benchmark single-row facility problem. Computational result shows that the proposed flower pollination algorithm produced an improved solution. The performance of the proposed algorithm is compared with other methods in the literature.
Flower Pollination Algorithm for Solving Single-Row Facility Layout Problems
Lect.Notes Mechanical Engineering
2022-03-02
10 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Solving systems of nonlinear equations via conjugate direction flower pollination algorithm
British Library Online Contents | 2017
|A modified squirrel search algorithm for solving facility layout problems
BASE | 2022
|Enhanced flower pollination algorithm on data clustering
British Library Online Contents | 2016
|Flower Pollination Algorithm for Vehicle Routing Problem with Time Windows (VRPTW)
BASE | 2021
|