Please use this identifier to cite or link to this item: https://doi.org/10.1243/09544054JEM1252
Title: A multi-objective disassembly planning approach with ant colony optimization algorithm
Authors: Lu, C.
Huang, H.Z.
Full, J.Y.H.
Wong, Y.S. 
Keywords: Ant colony optimization
Disassembly planning
Multi-objective
Uniform design
Issue Date: 2008
Citation: Lu, C., Huang, H.Z., Full, J.Y.H., Wong, Y.S. (2008). A multi-objective disassembly planning approach with ant colony optimization algorithm. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 222 (11) : 1465-1474. ScholarBank@NUS Repository. https://doi.org/10.1243/09544054JEM1252
Abstract: This paper proposes a multi-objective disassembly planning approach with an ant colony optimization algorithm. The mechanism of ant colony optimization in disassembly planning is discussed, and the objectives to be optimized in disassembly planning are analysed. In order to allow a more effective search for feasible non-dominated solutions, a multi-objective searching algorithm with uniform design is investigated to guide the ants searching the routes along the uniformly scattered directions towards the Pareto frontier; based on the above searching algorithm, an ant colony optimization algorithm for disassembly planning is developed. The results of a case study are given to verify the proposed approach. © IMechE 2008.
Source Title: Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture
URI: http://scholarbank.nus.edu.sg/handle/10635/54452
ISSN: 09544054
DOI: 10.1243/09544054JEM1252
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

19
checked on Jul 17, 2018

WEB OF SCIENCETM
Citations

13
checked on Jul 17, 2018

Page view(s)

49
checked on Jun 30, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.