The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Traditionally, the problem of assembly sequence planning is often converted to an equivalent problem of finding how the same assembly can be disassembled. Therefore, in our research, disassembly feasibility information graph is proposed firstly, to represent disassembly (sequence/operation) relevant information. And based on this graph, we transform disassembly sequence planning problem into a problem...
Traditionally, the problem of assembly sequence planning is often converted to an equivalent problem of finding how the same assembly can be disassembled. Therefore, in our research, disassembly feasibility information graph is proposed firstly, to represent disassembly (sequence/operation) relevant information. And based on this graph, we transform disassembly sequence planning problem into a problem...
This paper's concern is on product's disassembly sequence planning which is a complex NP-hard problem. Disassembly feasibility information graph (DFIG) is presented for describing product's disassembly operations (sequences) information. Based on the DFIG, the problem of disassembly sequence planning is transformed into a problem of searching optimum path. A genetic algorithm is introduced to search...
Disassembly sequence planning problem is a NP-hard combinatorial optimization problem. Generally, with the increasing of components number, the computational complexity of searching for good disassembly solution(s) in a large search space of disassembly solutions will be increased more. Therefore, to avoid the exploded combination, heuristic methods are often used for the goal of finding optimum solution(s)...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.