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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call