By Topic

A Cell Reconfiguration Method Based on Simulated Annealing Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xu Dong ; Sch. of Mech. Eng., Jiangxi Ganjiang Vocational Coll., Nanchang, China ; Hu Zhixin ; Liu Shiping ; Ma Ning

Agile manufacturing cells can be considered as the logic combination of physical resources in the shop floor. Compared with fixed cells, they are more competent to adapt rapidly to changes in production environment. To fulfill the idea of agile manufacturing cell in shop floor production management, the cell reconfiguration problem should be settled firstly. According to general principles on cell reconfiguration, two indexes are presented, and the object function is also built. Simulated annealing algorithm is used to solve this optimization problem. It assures certain solution while the matrix method may not and the solution is not confined greatly by initial conditions compared with other methods.

Published in:

Digital Manufacturing and Automation (ICDMA), 2010 International Conference on  (Volume:1 )

Date of Conference:

18-20 Dec. 2010