Department of Management
Permanent URI for this collectionhttp://localhost:4000/handle/123456789/1930
Browse
6 results
Search Results
Item A Non-greedy Local Search Heuristic for Facility Layout Problem(Springer, 2011) Matai, RajeshThis 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.Item A new heuristic approach for solving facility layout problem(Inder Science, 2013-04) Matai, RajeshThis paper proposes a new heuristic approach for solving facility layout problem (FLP) which is traditionally formulated as quadratic assignment problem (QAP). In this paper, FLP is formulated as linear assignment problem (LAP) consisting of facility pair and location pair. Being linear in nature LAP can be solved efficiently. Solution of LAP provides lower bound on corresponding QAP formulation of FLP. Heuristic procedure is applied to solve FLP from sets of LAP solution. Proposed heuristic is tested on benchmark instances taken from literature and compared with other heuristics available in literature. Computational results show that proposed heuristic provides a good quality approximate solution. This solution can be taken as initial solution for any improvement heuristic to get optimal/near optimal solution for FLP.Item A non-greedy systematic neighbourhood search heuristic for solving facility layout problem(Springer, 2013-05) Matai, RajeshThis paper presents a new heuristic for solving a facility layout problem. The proposed heuristic works on the non-greedy systematic pairwise exchange of two facilities, that is 2-exchange neighbourhood search based on non-greedy strategy. The proposed heuristic is applied on a large number of test problems provided by different authors in the quadratic assignment problem (QAP) library (Burkard, Karisch, Rendl, J Glob Optim 10(1):391–403, 1997) with problem size ranging from 12 to 256. Out of the 135 test problems available in the QAP library, the proposed heuristic reached optimal solutions for 64 test problems and matched the best known available solution for the other 15 test problems. For the remaining 56 test problems, the proposed approach reports highly encouraging solutions for 44 test problems (within the 2 % of deviation from the optimal/best known solutions), and for the remaining 12 problems, the proposed approach provides fair solution in reasonable time. Comparison with other meta-heuristic approaches (Ro-TS, RE-TS, GEN and SA) shows the effectiveness of the proposed heuristic.Item Facility Layout Problem: A State-of-the-art Review(Vilakshan, 2010) Matai, RajeshThis paper presents a state-of-the-art review work on facility layout problem (FLP). In the past, various review works have been presented but those were mainly focussed on particular aspects of FLP. However, no comprehensive review work covering all issues of FLP has been undertaken so far. In this paper, authors investigate past and current research work that has been carried out in all areas of FLP. In addition, the paper also reviews all mathematical formulations of FLP available in literature and classifies these accordingly into appropriate categories, such as: single-objective FLP, multi-objective facility layout problem (MFLP), Static facility layout problem (SFLP), Dynamic facility layout problem (DFLP), and Stochastic layout problem (SLP). The paper also reports methodologies to solve various formulations of FLP. Finally, it presents literature gaps and directions for future research work in FLP. [ABSTRACT FROM AUTHOR] Copyright of Vilakshan: The XIMB Journal of Management is the property of Emerald Publishing Limited and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)Item Modified simulated annealing based approach for multi objective facility layout problem(Taylor & Francis, 2013-04) Matai, RajeshIn this paper a modified simulated annealing (SA) based approach is presented for solving multi objective facility layout problem (MOFLP). It can incorporate more than two objectives that may be qualitative or quantitative in nature. Computational results show superiority of the proposed modified SA based approach for MOFLP over past approaches available in literature. To validate the proposed SA based approach, it is tested on instances taken from the literature which shows that the proposed approach provides promising results.Item Solving multi objective facility layout problem by modified simulated annealing(Elsevier, 2015-06) Matai, RajeshThis 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.