Solving the Double Row Layout Problem via Barnacles Mating Optimizer

نوع مقاله : مقاله پژوهشی

نویسندگان

1 دانشکده فنی مهندسی، دانشگاه ایلام، ایلام، ایلام، ایران

2 دانشگاه ایلام

چکیده

One of the most important problems in facility planning is designing the layout of facilities, which has a lot of variety. Most of the facility layout problems are of the NP-hard type, so the method of solving them has a great impact on the quality of the solutions. The meta-heuristic methods of solving the layout problem were investigated in the literature. The most widely used solution method is the Genetic Algorithm. In this research, Barnacles Mating Optimizer (BMO) algorithm was used for the first time to solve a double row layout problem. A practical computer program was designed in which two BMO and GA were used to solve the problem. After solving a common problem by both algorithms, the results showed the superiority of BMO algorithm. The improvement value of the objective function in the DRLP, using BMO, is equal to 48%. As the initial population and the number of iterations increase in BMO, the improvement of the objective function increases. The designed computer program has the ability to solve problems of different sizes.

کلیدواژه‌ها


عنوان مقاله [English]

Solving the Double Row Layout Problem via Barnacles Mating Optimizer

نویسندگان [English]

  • Masoud Seidi 1
  • Mohammad Zandieh 2
1 Ilam university
2 دانشگاه ایلام
چکیده [English]

One of the most important problems in facility planning is designing the layout of facilities, which has a lot of variety. Most of the facility layout problems are of the NP-hard type, so the method of solving them has a great impact on the quality of the solutions. The meta-heuristic methods of solving the layout problem were investigated in the literature. The most widely used solution method is the Genetic Algorithm. In this research, Barnacles Mating Optimizer (BMO) algorithm was used for the first time to solve a double row layout problem. A practical computer program was designed in which two BMO and GA were used to solve the problem. After solving a common problem by both algorithms, the results showed the superiority of BMO algorithm. The improvement value of the objective function in the DRLP, using BMO, is equal to 48%. As the initial population and the number of iterations increase in BMO, the improvement of the objective function increases. The designed computer program has the ability to solve problems of different sizes.

کلیدواژه‌ها [English]

  • Facility layout
  • Meta heuristic
  • BMO
  • Double row