Exact methods in disassembly sequencing as a benchmark for heuristic algorithms

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    5 Citations (Scopus)

    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.
    Original languageEnglish
    Title of host publicationEnvironmentally Conscious Manufacturing IV, Philadelphia
    EditorsS.M. Gupta
    Place of PublicationBellingham
    PublisherSPIE
    Pages1-11
    DOIs
    Publication statusPublished - 2004
    Eventconference; Environmentally Conscious Manufacturing IV : Conference; 2004-10-01; 2004-10-01 -
    Duration: 1 Oct 20041 Oct 2004

    Publication series

    NameProceedings of SPIE
    Volume5583
    ISSN (Print)0277-786X

    Conference

    Conferenceconference; Environmentally Conscious Manufacturing IV : Conference; 2004-10-01; 2004-10-01
    Period1/10/041/10/04
    OtherEnvironmentally Conscious Manufacturing IV : Conference

    Fingerprint

    Dive into the research topics of 'Exact methods in disassembly sequencing as a benchmark for heuristic algorithms'. Together they form a unique fingerprint.

    Cite this