A genetic algorithm for 1,5 dimensional assortment problems with multiple objectives

Sarac T., Ozdemir M.

DEVELOPMENTS IN APPLIED ARTIFICIAL INTELLIGENCE, cilt.2718, ss.41-51, 2003 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 2718
  • Basım Tarihi: 2003
  • Dergi Adı: DEVELOPMENTS IN APPLIED ARTIFICIAL INTELLIGENCE
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Compendex, EMBASE, MathSciNet, Philosopher's Index, zbMATH
  • Sayfa Sayıları: ss.41-51
  • Eskişehir Osmangazi Üniversitesi Adresli: Evet

Özet

In most studies on cutting stock problems, it is assumed that the sizes of stock materials are known and the problem is to find the best cutting pattern combinations. However, the solution efficiency of the problem depends strongly on the size of stock materials. In this study, a two-step approach is developed for a 1,5 dimensional assortment problem with multiple objectives. Cutting patterns are derived by implicit enumeration in the first step. The second step is used to determine the optimum sizes of stock materials by applying a genetic algorithm. The object is to find stock material sizes that minimize the total trim loss and also the variety of stock materials. Specialized crossover operator is developed to maintain the feasibility of the chromosomes. A real-life problem with 41 alternative stock materials, 289 order pieces and 1001 patterns is solved.