A Novel Method for Equal and Unequal Circle Packing Problem

Ying Shang

doi:10.4028/www.scientific.net/AMM.513-517.3942

Paper Titles

Fasteners State Detection System Based on Wireless Data Transfer Module
p.3924

A Fast and High Efficiency Carrier Offset Estimator for OFDM
p.3928

Analysis on the Host System for HZS150 Type Mixing Station
p.3934

Cophase Power Supply Control Technology in the Application of the Electric Traction Locomotive
p.3938

A Novel Method for Equal and Unequal Circle Packing Problem
p.3942

GPS Precision Orbit Determination from Combined Ground and Space-Borne Data
p.3946

Optimization Approach for Evacuation Route of Railway Freight Transportation Based on MMAS
p.3950

An Application of RFID Technology in Traffic Congestion Management
p.3954

Safety Assessment Method for Equipment of Urban Rail Transit Network Operation
p.3958

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517A Novel Method for Equal and Unequal Circle...

A Novel Method for Equal and Unequal Circle Packing Problem

Abstract:

We propose a novel method for circle packing problem. With our method, as for unequal circle packing the optimal layout is irrelevant with the position of the biggest circle, for equal circle packing we produce good solutions. In this article the algorithm is described in detail. Appropriate software has been devised and computational results are also provided and discussed.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

3942-3945

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.3942

Citation:

Cite this paper

Online since:

February 2014

Authors:

Ying Shang*

Keywords:

Bow Shift Area, Equal Circle Packing, Stable State, Unequal Circle Packing

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] J.A. George, J.M. George. B.W. Lamar. Packing different-sized circles into a rectangular container. European Journal of Operational Research, 1995, vol. 84: 693–712.

DOI: 10.1016/0377-2217(95)00032-l

Google Scholar

[2] Stoyan YG, Yaskov GN. Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account specialconstraints. InternationalTransactions in OperationalResearch 1998; 5(1): 45–57.

DOI: 10.1016/s0969-6016(98)00003-3

Google Scholar

[3] Yu.G. Stoyan, G. Yas'kov. A mathematical model and a solution method for the problem of placing various-sized circles into a strip. European Journal of Operational Research, 2004, vol. 156: 590–600.

DOI: 10.1016/s0377-2217(03)00137-1

Google Scholar

[4] Hifi M, Hallah R. A best-local position procedure-based heuristic for the two-dimensional layout problem, Studia Informatica Universalis International Journal on Informatics (SpecialIssue on Cutting, Packing and Knapsacking) 2002, 2(1): 33–56.

Google Scholar

[5] M. Hifi and R. M'Hallah. Approximate algorithms for constrained circular cutting problems. Computers & Operations Research, 2004, vol. 31: 675–694.

DOI: 10.1016/s0305-0548(03)00020-0

Google Scholar

[6] W.Q. Huang,Y. Li,H. Akeb, and C.M. Li. Greedy algorithms for packing unequal circles into a rectangular container. Journal of the Operational Research Society, 2005, vol. 56: 539–548.

DOI: 10.1057/palgrave.jors.2601836

Google Scholar

[7] M. Hifi, V. Th. Paschos, and V. Zissimopoulos. A simulated annealing approach for the circular cutting problem. European Journal of Operational Research, 2004, vol. 159: 430–448.

DOI: 10.1016/s0377-2217(03)00417-x

Google Scholar

[8] M. Hifi., M'Hallah, R.: A literature review on circle and sphere packing problems: Models and methodologies. Advances in Operations Research 2009 (2009).

DOI: 10.1155/2009/150624

Google Scholar