Flower Pollination Algorithm for Solving Single-Row Facility Layout Problems

You are here: Homepage > Search

Flower Pollination Algorithm for Solving Single-Row Facility Layout Problems

Kumar, R. Sanjeev / Kumar, K. Vetrivel / King, M. Francis Luther

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.

Access

Check access

Check availability in my library

Order at Subito €

Export, share and cite

Document information

Title :

Flower Pollination Algorithm for Solving Single-Row Facility Layout Problems

Additional title:

Lect.Notes Mechanical Engineering

Contributors:

Narasimham, G. S. V. L. (editor) / Babu, A. Veeresh (editor) / Reddy, S. Sreenatha (editor) / Dhanasekaran, Rajagopal (editor) / Kumar, R. Sanjeev (author) / Kumar, K. Vetrivel (author) / King, M. Francis Luther (author)

Published in:

Innovations in Mechanical Engineering ; Chapter : 57 ; 761-770

Lecture Notes in Mechanical Engineering

Publication date :

2022-03-02

Size :

10 pages

ISBN :

978-981-16-7282-8 , 978-981-16-7281-1

ISSN :

2195-4364 , 2195-4356

DOI :