Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/10813Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Matai, Rajesh | - |
| dc.date.accessioned | 2023-05-12T09:59:07Z | - |
| dc.date.available | 2023-05-12T09:59:07Z | - |
| dc.date.issued | 2012-05 | - |
| dc.identifier.uri | https://www.inderscienceonline.com/doi/abs/10.1504/IJSOM.2012.046677 | - |
| dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10813 | - |
| dc.description.abstract | In this paper a non-greedy systematic neighbourhood search heuristic is presented for solving multi-objective facility layout problem. It can incorporate more than two objectives that may be qualitative or quantitative in nature. Computational results show superiority of our proposed heuristic algorithm than other algorithms 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 and this comparison also shows efficiency and effectiveness of proposed heuristic algorithm. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Inder Science | en_US |
| dc.subject | Management | en_US |
| dc.subject | Neighbourhood search | en_US |
| dc.subject | Quadratic assignment problem | en_US |
| dc.subject | QAP | en_US |
| dc.subject | Heuristic | en_US |
| dc.subject | Multi-objective facility layout problem | en_US |
| dc.title | Non-greedy systematic neighbourhood search heuristic for multi-objective facility layout problem | 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.