Share Email Print

Proceedings Paper

Exact methods in disassembly sequencing as a benchmark for heuristic algorithms
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper deals with the application of exact methods in disassembly sequencing subjected to sequence dependent costs to the development of heuristics. Application of exact methods is restricted to fairly simple products, because CPU time tends to increase exponentially with product complexity, which makes these methods inappropriate for complex products. One has to rely on heuristic methods that typically require a CPU time that polynomially increases with product complexity. As these methods typically return suboptimal solutions, a reliable benchmark is required that can be found in exact solutions. This application is demonstrated on a complex product with an extensive search space. It is demonstrated that a heuristic can be developed that generates a set of extremely good suboptimal solutions.

Paper Details

Date Published: 8 December 2004
PDF: 11 pages
Proc. SPIE 5583, Environmentally Conscious Manufacturing IV, (8 December 2004); doi: 10.1117/12.570232
Show Author Affiliations
Alfred J. D. Lambert, Technische Univ. Eindhoven (Netherlands)

Published in SPIE Proceedings Vol. 5583:
Environmentally Conscious Manufacturing IV
Surendra M. Gupta, Editor(s)

© SPIE. Terms of Use
Back to Top