| dc.contributor.author |
Matai, Rajesh |
|
| dc.date.accessioned |
2023-05-13T06:13:26Z |
|
| dc.date.available |
2023-05-13T06:13:26Z |
|
| dc.date.issued |
2011 |
|
| dc.identifier.uri |
https://link.springer.com/chapter/10.1007/978-3-642-32573-1_28 |
|
| dc.identifier.uri |
http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10829 |
|
| dc.description.abstract |
This paper proposes a non-greedy local search heuristic for solving facility layout problem. The proposed heuristic works on non-greedy systematic pair wise exchange of two facilities, that is 2-exchange local search based on non-greedy strategy. Pair wise exchanges are accepted if the objective function value after the exchange is lowered or smaller than the average objective function increment divided by an intensity factor. Proposed heuristic is tested on commonly used Nugxx series problems and computational results show efficiency and effectiveness of proposed heuristic. |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
Springer |
en_US |
| dc.subject |
Management |
en_US |
| dc.subject |
Local search |
en_US |
| dc.subject |
Facility layout problem |
en_US |
| dc.subject |
Quadratic assignment problem |
en_US |
| dc.title |
A Non-greedy Local Search Heuristic for Facility Layout Problem |
en_US |
| dc.type |
Article |
en_US |