Share Email Print

Proceedings Paper

A multi-start greedy heuristic for the disassembly sequence problem
Author(s): Belarmino Adenso-Díaz; Beatriz González; Santiago García; Yolanda Barba
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Finding an efficient way for determining a near-optimum disassembly sequence for complex products is becoming an important challenge for many industries, given the increasing environmental awareness of both governments and society. As a first approach, mathematically exact methods can be used to deal with this problem. But when disassembly costs that are dependent on the sequence and the number of components inside the product structure are prohibitive, heuristics or artificial intelligence-based methods are normally much more suitable to fulfill industry requirements. Nevertheless, when the size of the instance is very large, sequential algorithms are too slow. In this paper, a multi-start, greedy heuristic is defined and tested on a sample of products previously developed to measure the performance of a Scatter Search metaheuristic dealing with the same problem. The performance of the new algorithm was demonstrated to be competitive when compared with the one done under Scatter Search. It is also notably faster especially as the number of components inside the product structure increases.

Paper Details

Date Published: 4 November 2005
PDF: 9 pages
Proc. SPIE 5997, Environmentally Conscious Manufacturing V, 599701 (4 November 2005); doi: 10.1117/12.630034
Show Author Affiliations
Belarmino Adenso-Díaz, Univ. de Oviedo (Spain)
Beatriz González, Univ. de Oviedo (Spain)
Santiago García, Univ. de Oviedo (Spain)
Yolanda Barba, Univ. de Oviedo (Spain)

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

© SPIE. Terms of Use
Back to Top