An efficient GRASP algorithm for disassembly sequence planning.
Belarmino Adenso-DíazSantiago García CarbajalSebastián LozanoPublished in: OR Spectr. (2007)
Keyphrases
- preprocessing
- learning algorithm
- times faster
- detection algorithm
- forward backward
- experimental evaluation
- computational complexity
- cost function
- np hard
- tree structure
- objective function
- optimization algorithm
- computationally efficient
- long sequences
- dynamic programming
- computational cost
- simulated annealing
- data sets
- input data
- high accuracy
- worst case
- segmentation algorithm
- search space
- similarity measure
- recognition algorithm
- significant improvement
- k means