Department of Management

Permanent URI for this collectionhttp://localhost:4000/handle/123456789/1930

Browse

Filters

2012 - 201942020 - 20222

Settings

Author: search.filters.author.Matai, RajeshSubject: search.filters.subject.QAP

Search Results

Now showing 1 - 6 of 6
  • No Thumbnail Available
    Item
    Solving multi objective facility layout problem using robust tabu search
    (IABE, 2014) Matai, Rajesh
    In this paper a robust tabu search based approach has been 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 proposed tabu search for solving multi objective facility layout problem, than other algorithms available in literature.
  • No Thumbnail Available
    Item
    A New Mixed Integer Linear Programming Formulation for Dynamic Facility Layout Problem
    (IEEE, 2021) Matai, Rajesh
    The literature has established that the Dynamic facility layout problem (DFLP) is an NP-hard problem and very complex to solve optimally. Therefore, heuristics and metaheuristics are widely used in literature to solve DFLP. However, heuristics and metaheuristics do not give optimal solutions most of the time. Currently, the dynamic programming (DP) approach is used in literature to solve DFLP optimally. No other technique than DP is available in the literature to solve DFLP optimally. Therefore, this paper presents a linearized formulation of DFLP, a mixed-integer linear programming (MILP) model, to solve it optimally. From the author's knowledge, no such prior attempt has been made in the literature so far—two test problems of size five and periods three generated and solved in Lingo 10 software using the proposed model. The comparison of Lingo solutions with lower bounds of both problems shows that deviation is minimal (around 0.09%), suggesting MILP solutions are optimal solutions.
  • No Thumbnail Available
    Item
    A New Discrete Bi-objective Formulation of Unequal Area Facility Layout Problem
    (IEEE, 2022-01) Matai, Rajesh
    This paper presents a new discrete Bi-objective formulation of the Unequal Area Facility Layout Problem (UA-FLP) by extending the Quadratic Assignment Problem (QAP) formulation available in the literature. As far as authors know, in literature, only continuous formulations for UA-FLP exist. In the proposed formulation, along with the conventional objective of material handling cost, weighted fitness cost is also included in the objective function, making it a Bi-Objective formulation. The proposed model is tested for problem sizes of n=8, 12, 15,20, 25 and 30 using Lingo 19, and optimum results are reported. These results provide a range of solutions to decision-makers to enhance their decision capabilities.
  • No Thumbnail Available
    Item
    Non-greedy systematic neighbourhood search heuristic for multi-objective facility layout problem
    (Inder Science, 2012-05) Matai, Rajesh
    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.
  • No Thumbnail Available
    Item
    A new heuristic approach for solving facility layout problem
    (Inder Science, 2013-04) Matai, Rajesh
    This 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.
  • No Thumbnail Available
    Item
    Solving multi objective facility layout problem by modified simulated annealing
    (Elsevier, 2015-06) Matai, Rajesh
    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.