Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/10807
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Matai, Rajesh | - |
dc.date.accessioned | 2023-05-12T09:18:04Z | - |
dc.date.available | 2023-05-12T09:18:04Z | - |
dc.date.issued | 2015-06 | - |
dc.identifier.uri | https://www.sciencedirect.com/science/article/pii/S009630031500421X | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10807 | - |
dc.description.abstract | This paper proposes a modified simulated annealing approach for solving multi objective facility layout problem. Multi objective facility layout problem is solved by using different objective weights which are generated by decision maker. Thus layout design process is decision maker dependent. However proposed approach in this paper makes layout design process independent of decision maker. Proposed approach can also incorporate any number of objectives that may be qualitative or quantitative in nature. Computational results show superiority of proposed heuristic approach than other approaches available in literature. Finally, comparison was also made with best solution qualities for the 15 single objective test problems of Nugxx series taken from QAPLIB. Comparisons were made in terms of the quality of the solutions obtained and the computational time required and this comparison shows efficiency and effectiveness of proposed modified simulated annealing algorithm. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.subject | Management | en_US |
dc.subject | Simulated annealing | en_US |
dc.subject | QAP | en_US |
dc.subject | Heuristic | en_US |
dc.subject | Facility layout problem | en_US |
dc.title | Solving multi objective facility layout problem by modified simulated annealing | en_US |
dc.type | Article | en_US |
Appears in Collections: | Department of Management |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.