Optimization Online


Test problems of circles in circle packing with behavior constraint and known the optimal solutions

Teng Hong-fei (tenghf***at***dlut.edu.cn)
Che Chao (chechao101***at***163.com)
Chen Yu (traor***at***tom.com)
Wang Yi-shou (yishou_dut***at***163.com)

Abstract: Test problems are generally used to effectively evaluate the algorithms for packing problem. Based on the engineering background of the layout optimization for a retrievable satellite module, this paper describes the test problems for circles packing problem with known optimization solution first. There are N(≦217) circular objects, different in size, packed in a circular container batch recursively, fulfilling the requirements of both inner and outer tangency. This test problem involves the packing optimization with or without behavioral constraints (such as equilibrium constraints). But the above test problems are not the problem with all the optimal solutions known. On the basis of above work, we construct 7 groups of test problems with all the optimal solutions containing N=4,9,17,25,41,49 circles. The test problems can be extended to 3-D packing optimization for spherical or cylindrical objects with dynamic equilibrium constraints, more similar to the case of layout optimization model for a satellite module.

Keywords: test problem, circle packing, constraint, layout, satellite module

Category 1: Combinatorial Optimization (Other )


Download: [PDF]

Entry Submitted: 10/13/2004
Entry Accepted: 10/15/2004
Entry Last Modified: 09/11/2006

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society