Application of Optimized Particle Swarm Algorithm on Apparel Intelligent Layout

Can Yi Huang

doi:10.4028/www.scientific.net/AMM.380-384.1668

Paper Titles

Test and Analysis GPU-Accelerated in Molecular Dynamics Simulation
p.1652

A New Method of Optimization Design of Hydraulic Fracture Parameters in Low Porosity and Fractured Gas Reservoir
p.1656

A Potential Field Model Avoiding Local Minimum in Pedestrian Simulation
p.1660

A Improvement for GNC Method of Nonconvex Nonsmooth Image Restoration
p.1664

Application of Optimized Particle Swarm Algorithm on Apparel Intelligent Layout
p.1668

A New Prediction Method for Chaotic Time Series
p.1673

Maintenance and Update of Load-Balancing Clustering Algorithm of WSN for Data Gathering
p.1677

Application of a Improved C4.5 Algorithm in Performance Analysis
p.1681

A Multi-Point Source Thermal Radiation Model of Pool Fire
p.1685

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 380-384Application of Optimized Particle Swarm Algorithm...

Application of Optimized Particle Swarm Algorithm on Apparel Intelligent Layout

Abstract:

The core technology of apparel layout is the intelligent algorithm of apparel marker software, this paper puts forward an optimized particle swarm algorithm under the condition of comparing and analyzing the merits and drawbacks of genetic algorithm, simulated annealing algorithm and particle swarm optimization algorithm, in addition, a demonstration test is done by C++ under the environment of VS2007. The result concluded in this paper shows that the optimized particle swarm algorithm can achieve ideal material utilization.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 380-384)

Pages:

1668-1672

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.380-384.1668

Citation:

Cite this paper

Online since:

August 2013

Authors:

Can Yi Huang

Keywords:

Apparel, Genetic Algorithm (GA), Intelligent Layout, Optimized Particle Swarm Algorithm, Simulated Annealing Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Den-feng Zhang, Yan Kang, Ao Deng. A new heuristic recursive algorithm for the strip rectangular packing problem[J]. Computer&Operations Research 2006(3)2209-2217.

DOI: 10.1016/j.cor.2005.01.009

Google Scholar

[2] Hopper E, Turton B. A genetic algorithm for a 2D industrial packing problem. Computer and Industrial Engineering, 1999(6)375-378.

DOI: 10.1016/s0360-8352(99)00097-2

Google Scholar

[3] Zi-xia Jia, GI-fang Yin. Two-dimensional irregular parts packing with genetic algorithm[J]. Journal of computer-aided design & Computer Graphics, 2002(9)467-470.

Google Scholar

[4] XUE Wang，Li-mi Cao, Genetic algorithm theory and Application[M]. Xi'an Jiao Tong University press，2001, 4-9.

Google Scholar

[5] Ming Li, Ci-feng Song,. The two-dimensional irregular parts packing problem by particle swarm algorithm[J]. Journal of Jiangnan University (NATURAL SCIENCE EDITION), 2005(6)266-269.

Google Scholar

[6] Xu Liu，Cai-yi Xu. Irregular graphics prototype design for automatic layout[J]. Journal of Huazhong University of Science and Technology (NATURAL SCIENCE EDITION)，2002(4)19-20.

Google Scholar