Strategy space reduction for feasible implementation of Walrasian performance

1991 ◽  
Vol 8 (3) ◽  
Author(s):  
B. Chakravorti
2012 ◽  
Vol 54 (1) ◽  
pp. 131-151 ◽  
Author(s):  
Michele Lombardi ◽  
Naoki Yoshihara

Author(s):  
Louisa Issaoui ◽  
Nizar Aifaoui ◽  
Abdelmajid Benamara

To develop a simulation tool for automatic disassembly in computer aid design (CAD) environment two difficulties are found: the huge space of generated sequences and their feasibility especially in combinatory generation. This article deals with automatic sequence generation for selective disassembly of mechanical product. Starting from a CAD model a new appropriate connection tree of a target component is constructed. This tree aims at reducing space solution by eliminatory rules. The generation of sequence is based on reading of connection tree branches and eliminatory tests of feasibility. The feasibility is checked by updating the disassembly mobility of each sequence’s element. A case study is presented to prove the effectiveness of the proposed approach.


Sign in / Sign up

Export Citation Format

Share Document