Meta Heuristic Approaches for Circular Open Dimension Problem

摘要

This paper discusses the circular open dimension problem (CODP), where set of circles of different radii has to be packed into a rectangular strip of predetermined width and variable length. The circle packing problem is one of the variant of cutting and packing problems. We propose four different nature inspired Meta heuristic algorithms for solving this problem. These algorithms are proved to be the best in finding local solutions. The algorithms are based on food foraging process and breeding behavior of some biological species such as bat, bee, firefly and cuckoo. Circle packing problem is one of the NP hard problems. It is very difficult to solve NP hard problems exactly, so the proposed approaches tries to give approximate solution within the stipulated time. The standard benchmark instances are used for comparison, and it is proved that firefly is giving the best solution.