Abstract

In the aforesaid paper, some pages are omitted reluctantly and are corrected thus. In this paper, the two-floor facility layout problem with unequal departmental areas in multi-bay environments is addressed. A mixed integer programming formulation is developed to find the optimal solution to the problem. This model determines position and number of elevators with consideration of conflicting objectives simultaneously. Objectives include to minimize material handling cost and to maximize closeness rating. A memetic algorithm (MA) is designed to solve the problem and it is compared with the corresponding genetic algorithm for large-sized test instances and with a commercial linear programming solver solution to small-sized test instances. Computational results proved the efficiency of solution procedure to the problem.   Key words: Mixed integer programming, multi floor layout, multi objective, memetic algorithm.

Highlights

  • One of the oldest activities done by industrial engineers is facilities planning

  • A mixed integer programming formulation is developed to find the optimal solution to the problem

  • A memetic algorithm (MA) is designed to solve the problem and it is compared with the corresponding genetic algorithm for large-sized test instances and with a commercial linear programming solver solution to small-sized test instances

Read more

Summary

INTRODUCTION

One of the oldest activities done by industrial engineers is facilities planning. The term facilities planning can be divided into two parts: facility location and facility layout. Minimizing the total cost of material transportation and maximizing the total closeness rating between the two departments. In some cases, they are combined as (Meller and Gau, 1996):. Genetic Algorithm (GA) was used to find Pareto-optimal in the first stage and the selection of an optimal solution was carried out by Electre method in the second stage These objectives considered minimization of the material handling cost, maximization. Şahin and Türkbey (2008) proposed simulated annealing algorithm to find Pareto solutions for multi-objective facility layout problems including total material handling cost and closeness rating. Objectives are commonused in previous works and include to minimize material handling cost and to maximize closeness rating. MATHEMATICAL MODEL Sets and indices Set of cells in block layout graph

If departmenti is located in the first floor
Parameters n
Problem formulation
L z ik a i i
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call