By Topic

A hybrid heuristic for packing unequal circles into a circular container

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hakim Akeb ; Lab. de Recherche en Informatique d''Amiens, Amiens ; Yu Li

Recently, we have developed two heuristics for the circle packing problem. The first one is called maximum hole degree (MHD) and was used for packing unequal circles into a rectangular and a circular container. The second heuristic is called minimum damage (MinD) and is particularly adapted for packing equal circles into a circular container. MHD obtains good results when the instances contain very varied circles (different radii) but its performances decrease when there are more and more equal circles in the instances. In this paper, we propose a hybrid heuristic named null-damage-MHD (NDMHD) used for packing unequal circles into a circular container. NDMHD combines MinD and MHD heuristics and we show that the obtained heuristic is adapted for every kind of circle instances

Published in:

2006 International Conference on Service Systems and Service Management  (Volume:2 )

Date of Conference:

Oct. 2006