Optimal Plant Layout Design based on MASS Algorithm
Author(s)
Khoshnevisan, Mohammad
Bhattacharya, Sukanto
Griffith University Author(s)
Year published
2003
Metadata
Show full item recordAbstract
In this paper we have proposed a semiheuristic optimization algorithm for designing optimal plant layouts in process-focused manufacturing/sem'ce facilities. OUT proposed algorithm marries the wellknown CRAFT (Computerized Relative Allocation of Facilities Technique) with the Hungarian assignment algorithm. Being a semi-heuristic search, OUT alyolithm is likely to be more eficient in tems of computer CPU engagement time as it tends to converge on the global optimum faster than the traditional CRAFT algorithm - a pure heuristic. We also present a numerical illustration of OUT algorithm. We also suggest an eztension to the ...
View more >In this paper we have proposed a semiheuristic optimization algorithm for designing optimal plant layouts in process-focused manufacturing/sem'ce facilities. OUT proposed algorithm marries the wellknown CRAFT (Computerized Relative Allocation of Facilities Technique) with the Hungarian assignment algorithm. Being a semi-heuristic search, OUT alyolithm is likely to be more eficient in tems of computer CPU engagement time as it tends to converge on the global optimum faster than the traditional CRAFT algorithm - a pure heuristic. We also present a numerical illustration of OUT algorithm. We also suggest an eztension to the problem under study through the incorporation of principles of neutrasophic statistics.
View less >
View more >In this paper we have proposed a semiheuristic optimization algorithm for designing optimal plant layouts in process-focused manufacturing/sem'ce facilities. OUT proposed algorithm marries the wellknown CRAFT (Computerized Relative Allocation of Facilities Technique) with the Hungarian assignment algorithm. Being a semi-heuristic search, OUT alyolithm is likely to be more eficient in tems of computer CPU engagement time as it tends to converge on the global optimum faster than the traditional CRAFT algorithm - a pure heuristic. We also present a numerical illustration of OUT algorithm. We also suggest an eztension to the problem under study through the incorporation of principles of neutrasophic statistics.
View less >
Conference Title
Proceedings of the Sixth International Conference of Information Fusion, 2003.Volume 2
Publisher URI
Copyright Statement
© 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Subject
Multi-Disciplinary