A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles
The packing problem of unit equilateral triangles not only has the theoretical significance but also offers broad prospects in material processing and network resource optimization. Because this problem is nondeterministic polynomial (NP) hard and has the feature of continuity, it is necessary to li...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2014/308474 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832567234811133952 |
|---|---|
| author | Ruimin Wang Xiaozhuo Qi Yuqiang Luo Jianqiang Dong |
| author_facet | Ruimin Wang Xiaozhuo Qi Yuqiang Luo Jianqiang Dong |
| author_sort | Ruimin Wang |
| collection | DOAJ |
| description | The packing problem of unit equilateral triangles not only has the theoretical significance but also offers broad
prospects in material processing and network resource optimization. Because this problem is nondeterministic polynomial
(NP) hard and has the feature of continuity, it is necessary to limit the placements of unit equilateral triangles
before optimizing and obtaining approximate solution (e.g., the unit equilateral triangles are not allowed to be rotated).
This paper adopts a new quasi-human strategy to study the packing problem of unit equilateral triangles. Some new
concepts are put forward such as side-clinging action, and an approximation algorithm for solving the addressed problem
is designed. Time complexity analysis and the calculation results indicate that the proposed method is a polynomial
time algorithm, which provides the possibility to solve the packing problem of arbitrary triangles. |
| format | Article |
| id | doaj-art-71f6213cdf0945dbb393d4e8731f1059 |
| institution | Kabale University |
| issn | 1085-3375 1687-0409 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Abstract and Applied Analysis |
| spelling | doaj-art-71f6213cdf0945dbb393d4e8731f10592025-02-03T01:01:56ZengWileyAbstract and Applied Analysis1085-33751687-04092014-01-01201410.1155/2014/308474308474A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral TrianglesRuimin Wang0Xiaozhuo Qi1Yuqiang Luo2Jianqiang Dong3School of Information Engineering, Zhengzhou University, Zhengzhou 450001, ChinaOptical Instrument Workshop, 95107 Troops, Guangzhou 510500, ChinaInformatization Office, University of Shanghai for Science and Technology, Shanghai 200093, ChinaZhengzhou Xinda Jiean Information Technology Co., Ltd, Zhengzhou 450002, ChinaThe packing problem of unit equilateral triangles not only has the theoretical significance but also offers broad prospects in material processing and network resource optimization. Because this problem is nondeterministic polynomial (NP) hard and has the feature of continuity, it is necessary to limit the placements of unit equilateral triangles before optimizing and obtaining approximate solution (e.g., the unit equilateral triangles are not allowed to be rotated). This paper adopts a new quasi-human strategy to study the packing problem of unit equilateral triangles. Some new concepts are put forward such as side-clinging action, and an approximation algorithm for solving the addressed problem is designed. Time complexity analysis and the calculation results indicate that the proposed method is a polynomial time algorithm, which provides the possibility to solve the packing problem of arbitrary triangles.http://dx.doi.org/10.1155/2014/308474 |
| spellingShingle | Ruimin Wang Xiaozhuo Qi Yuqiang Luo Jianqiang Dong A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles Abstract and Applied Analysis |
| title | A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles |
| title_full | A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles |
| title_fullStr | A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles |
| title_full_unstemmed | A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles |
| title_short | A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles |
| title_sort | new quasi human algorithm for solving the packing problem of unit equilateral triangles |
| url | http://dx.doi.org/10.1155/2014/308474 |
| work_keys_str_mv | AT ruiminwang anewquasihumanalgorithmforsolvingthepackingproblemofunitequilateraltriangles AT xiaozhuoqi anewquasihumanalgorithmforsolvingthepackingproblemofunitequilateraltriangles AT yuqiangluo anewquasihumanalgorithmforsolvingthepackingproblemofunitequilateraltriangles AT jianqiangdong anewquasihumanalgorithmforsolvingthepackingproblemofunitequilateraltriangles AT ruiminwang newquasihumanalgorithmforsolvingthepackingproblemofunitequilateraltriangles AT xiaozhuoqi newquasihumanalgorithmforsolvingthepackingproblemofunitequilateraltriangles AT yuqiangluo newquasihumanalgorithmforsolvingthepackingproblemofunitequilateraltriangles AT jianqiangdong newquasihumanalgorithmforsolvingthepackingproblemofunitequilateraltriangles |