A parallel algorithm of polygons packing based on ant colony

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by null Wen Peng Articles by null Ruofeng Tong Articles by null Min Tang Articles by null Jinxiang Dong

Proceedings of the Ninth International Conference on Computer Supported Cooperative Work in Design, 2005. Vol. 2

May 24-May 26

ISBN: 1-84600-002-5

	ASCII Text	x
	null Wen Peng, null Ruofeng Tong, null Min Tang, null Jinxiang Dong, "A parallel algorithm of polygons packing based on ant colony," International Conference on Computer Supported Cooperative Work in Design, vol. 2, pp. 846-851 Vol. 2, Proceedings of the Ninth International Conference on Computer Supported Cooperative Work in Design, 2005. Vol. 2, 2005.

	BibTex	x
	@article{ 10.1109/CSCWD.2005.194296, author = {null Wen Peng and null Ruofeng Tong and null Min Tang and null Jinxiang Dong}, title = {A parallel algorithm of polygons packing based on ant colony}, journal ={International Conference on Computer Supported Cooperative Work in Design}, volume = {2}, year = {2005}, isbn = {1-84600-002-5}, pages = {846-851 Vol. 2}, doi = {http://doi.ieeecomputersociety.org/10.1109/CSCWD.2005.194296}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - International Conference on Computer Supported Cooperative Work in Design TI - A parallel algorithm of polygons packing based on ant colony SN - 1-84600-002-5 SP846 EP851 Vol. 2 A1 - null Wen Peng, A1 - null Ruofeng Tong, A1 - null Min Tang, A1 - null Jinxiang Dong, PY - 2005 KW - optimal solution KW - parallel algorithm KW - polygon packing KW - optimal packing problem KW - ant colony algorithm KW - BLF heuristic approach KW - bottom-left-fill KW - polygon optimum rotation KW - BLF heuristic algorithm KW - parallel computation VL - 2 JA - International Conference on Computer Supported Cooperative Work in Design ER -

null Wen Peng, Inst. of Artificial Intelligence, Zhejiang Univ., China

null Ruofeng Tong, Inst. of Artificial Intelligence, Zhejiang Univ., China

null Min Tang, Inst. of Artificial Intelligence, Zhejiang Univ., China

null Jinxiang Dong, Inst. of Artificial Intelligence, Zhejiang Univ., China

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSCWD.2005.194296

This paper presents a novel algorithm for optimal packing problem by combining ant colony algorithm with BLF (bottom-left-fill) heuristic approach. The proposed algorithm not only automatically looks for the best sequence of the polygons and each polygon's optimum rotation by ant colony algorithm but also implements the exact layout with the BLF heuristic algorithm. Moreover, the algorithm supports the parallel computation and facilitates quick convergence to the optimal solution. The experimental results show the effectiveness of our algorithm comparing with the other methods.

Index Terms:

optimal solution, parallel algorithm, polygon packing, optimal packing problem, ant colony algorithm, BLF heuristic approach, bottom-left-fill, polygon optimum rotation, BLF heuristic algorithm, parallel computation

Citation:

null Wen Peng, null Ruofeng Tong, null Min Tang, null Jinxiang Dong, "A parallel algorithm of polygons packing based on ant colony," cscwd, vol. 2, pp.846-851 Vol. 2, Proceedings of the Ninth International Conference on Computer Supported Cooperative Work in Design, 2005. Vol. 2, 2005

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.