The Facility Layout Problem (FLP) is a well researched problem. Locating facilities in a given space is a common problem encountered in the manufacturing industries. FLP is formulated as the Quadratic Assignment Problem (QAP) which is proved to be NP-hard. If the layout is fixed over the period of time it is referred as a Static Facility Layout Problem (SFLP) else a Dynamic facility Layout Problem (DFLP). Nowadays, the results achieved by applying the best existing exact algorithms are modest: generally instances of sizes larger than 20 can not be solved optimally in a reasonable time. Thus, the interest lies in the application of heuristic and meta-heuristic methods to solve large instances of SFLP and DFLP. This book, therefore, provides new heuristic and meta-heuristic approaches to solve SFLP and DFLP in a reasonably less computational time. Heuristics and Meta-heuristics given in the book are tested on various instances taken from literature and it is found that these heuristics provides better solution. This book should help those who are working in the layout/location problems or anyone who are working on combinatorial optimization problems.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
The Facility Layout Problem (FLP) is a well researched problem. Locating facilities in a given space is a common problem encountered in the manufacturing industries. FLP is formulated as the Quadratic Assignment Problem (QAP) which is proved to be NP-hard. If the layout is fixed over the period of time it is referred as a Static Facility Layout Problem (SFLP) else a Dynamic facility Layout Problem (DFLP). Nowadays, the results achieved by applying the best existing exact algorithms are modest: generally instances of sizes larger than 20 can not be solved optimally in a reasonable time. Thus, the interest lies in the application of heuristic and meta-heuristic methods to solve large instances of SFLP and DFLP. This book, therefore, provides new heuristic and meta-heuristic approaches to solve SFLP and DFLP in a reasonably less computational time. Heuristics and Meta-heuristics given in the book are tested on various instances taken from literature and it is found that these heuristics provides better solution. This book should help those who are working in the layout/location problems or anyone who are working on combinatorial optimization problems.
Dr. S.P. Singh is Assistant Professor in the Department of Management Studies, I.I.T. Delhi, INDIA. He is Mechanical Engineer and is Ph.D. from IIT Kanpur, India. He is fellow from Singapore-MIT Alliance, NUS, Singapore.His area of research interest is Optimization. He has many research papers in leading Journals/conference to his credit.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The Facility Layout Problem (FLP) is a well researched problem. Locating facilities in a given space is a common problem encountered in the manufacturing industries. FLP is formulated as the Quadratic Assignment Problem (QAP) which is proved to be NP-hard. If the layout is fixed over the period of time it is referred as a Static Facility Layout Problem (SFLP) else a Dynamic facility Layout Problem (DFLP). Nowadays, the results achieved by applying the best existing exact algorithms are modest: generally instances of sizes larger than 20 can not be solved optimally in a reasonable time. Thus, the interest lies in the application of heuristic and meta-heuristic methods to solve large instances of SFLP and DFLP. This book, therefore, provides new heuristic and meta-heuristic approaches to solve SFLP and DFLP in a reasonably less computational time. Heuristics and Meta-heuristics given in the book are tested on various instances taken from literature and it is found that these heuristics provides better solution. This book should help those who are working in the layout/location problems or anyone who are working on combinatorial optimization problems. 252 pp. Englisch. N° de réf. du vendeur 9783838389493
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: SINGH SURYA PRAKASHDr. S.P. Singh is Assistant Professor in the Department of Management Studies, I.I.T. Delhi, INDIA. He is Mechanical Engineer and is Ph.D. from IIT Kanpur, India. He is fellow from Singapore-MIT Alliance, NUS, S. N° de réf. du vendeur 5419190
Quantité disponible : Plus de 20 disponibles
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Facility Layout Planning and Design | Heuristic and Meta-heuristic Approaches For Static and Dynamic Layout | Surya Prakash Singh | Taschenbuch | 252 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783838389493 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. N° de réf. du vendeur 107432613
Quantité disponible : 5 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -The Facility Layout Problem (FLP) is a well researched problem. Locating facilities in a given space is a common problem encountered in the manufacturing industries. FLP is formulated as the Quadratic Assignment Problem (QAP) which is proved to be NP-hard. If the layout is fixed over the period of time it is referred as a Static Facility Layout Problem (SFLP) else a Dynamic facility Layout Problem (DFLP). Nowadays, the results achieved by applying the best existing exact algorithms are modest: generally instances of sizes larger than 20 can not be solved optimally in a reasonable time. Thus, the interest lies in the application of heuristic and meta-heuristic methods to solve large instances of SFLP and DFLP. This book, therefore, provides new heuristic and meta-heuristic approaches to solve SFLP and DFLP in a reasonably less computational time. Heuristics and Meta-heuristics given in the book are tested on various instances taken from literature and it is found that these heuristics provides better solution. This book should help those who are working in the layout/location problems or anyone who are working on combinatorial optimization problems.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 252 pp. Englisch. N° de réf. du vendeur 9783838389493
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The Facility Layout Problem (FLP) is a well researched problem. Locating facilities in a given space is a common problem encountered in the manufacturing industries. FLP is formulated as the Quadratic Assignment Problem (QAP) which is proved to be NP-hard. If the layout is fixed over the period of time it is referred as a Static Facility Layout Problem (SFLP) else a Dynamic facility Layout Problem (DFLP). Nowadays, the results achieved by applying the best existing exact algorithms are modest: generally instances of sizes larger than 20 can not be solved optimally in a reasonable time. Thus, the interest lies in the application of heuristic and meta-heuristic methods to solve large instances of SFLP and DFLP. This book, therefore, provides new heuristic and meta-heuristic approaches to solve SFLP and DFLP in a reasonably less computational time. Heuristics and Meta-heuristics given in the book are tested on various instances taken from literature and it is found that these heuristics provides better solution. This book should help those who are working in the layout/location problems or anyone who are working on combinatorial optimization problems. N° de réf. du vendeur 9783838389493
Quantité disponible : 1 disponible(s)