Non‐greedy systematic neighbourhood search heuristic for multi‐objective facility layout problem

Non‐greedy systematic neighbourhood search heuristic for multi‐objective facility layout problem

0.00 Avg rating0 Votes
Article ID: iaor20123892
Volume: 12
Issue: 1
Start Page Number: 118
End Page Number: 138
Publication Date: May 2012
Journal: International Journal of Services and Operations Management
Authors: , ,
Keywords: heuristics: local search, programming: multiple criteria
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.

Reviews

Required fields are marked *. Your email address will not be published.