Notice of RetractionMaintenance disassembly optimization based on Petri net and A∗ algorithm

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

In the equipment design stage, the disassembling operation regulations have not been established. The optimization of disassembly process with the determination of disassembly time is a difficulty. This article gives a method to solve the problem. The first step is to analyze the constraint relationships between parts and express the relationships as a disassembly precedence constraint matrix. The second step is to set up the disassembly Petri net model based on Timed Transition Petri Net, including sub-nets which reflect the disassembly priorities. The third step is using A* heuristic search algorithm to select the best disassembly path by evaluation function from the paths represented by reachability graph of disassembly Petri net and get the disassembly time. At last, an example of optimizing disassembly sequence and getting disassembly time about some ship equipment device is presented, which shows the rationality of the method.