By Topic

Extremal Optimization with Local Search for the Circular Packing Problem

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
$31 $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)
WenQi Huang ; Huazhong Univ. of Sci. & Technol., Wuhan ; Liu, Jian

optimization (EO) is a heuristic nature-inspired algorithm and has been applied to solve some discrete combinatorial optimization problems. In this paper, a continuous version of EO, called EO with local search (EOLS), is presented to solve the problem of packing unequal circles into a larger circular container. First, an equivalent physical model of the problem is adopted to handle the constraints. In order to optimize the continuous energy function of the model, EOLS performs an additional local search procedure after every update step of the original EO. The approach combines the power of conventional gradient method to find local minima and that of EO method in global optimization. The computational results on some problem instances taken from the previous literatures show that the proposed approach produces high-quality solutions within reasonable runtime. It should be noted that for all but two instances we found new lower bounds missed in previous papers.

Published in:

Natural Computation, 2007. ICNC 2007. Third International Conference on  (Volume:5 )

Date of Conference:

24-27 Aug. 2007