• Title/Summary/Keyword: 분지한계법

Search Result 31, Processing Time 0.016 seconds

A Heuristic Algorithm for the Two-Dimensional Bin Packing Problem Using a Fitness Function (적합성 함수를 이용한 2차원 저장소 적재 문제의 휴리스틱 알고리즘)

  • Yon, Yong-Ho;Lee, Sun-Young;Lee, Jong-Yun
    • The KIPS Transactions:PartB
    • /
    • v.16B no.5
    • /
    • pp.403-410
    • /
    • 2009
  • The two-dimensional bin packing problem(2D-BPP) has been known to be NP-hard, and it is difficult to solve the problem exactly. Many approximation methods, such as genetic algorithm, simulated annealing and tabu search etc, have been also proposed to gain better solutions. However, the existing approximation algorithms, such as branch-and-bound and tabu search, have shown the low efficiency and the long execution time due to a large of iterations. To solve these problems, we first define the fitness function to simplify and increase the utility of algorithm. The function decides whether an item is packed into a given area, and as an important information for a packing strategy, the number of subarea that can accommodate a given item is obtained from the variant of the fitness function. Then we present a heuristic algorithm BF for 2D bin packing, constructed by the fitness function and subarea. Finally, the effectiveness of the proposed algorithm will be expressed by the comparison experiments with the heuristic and the metaheuristic of the literatures. As comparing with existing heuristic algorithms and metaheuristic algorithms, it has been found that the packing rate of algorithm BP is the same as 97% as existing heuristic algorithms, FFF and FBS, or better than them. Also, it has been shown the same as 86% as tabu search algorithm or better.