Shortest-Path Optimization of Ship Diesel Engine Disassembly and Assembly Based on AND/OR Network

Algorithm 3

Node cut-off search based on the precursor.

	Input  : origin node.  : destination node.  : a set of nodes in the network ;  : a set of arcs in the network ;  : cost of arc , .
	Sets  : set of branches of OR node , ;  : set of precursor nodes of node ,   : the shortest path, represented by the nodes in the shortest path.
	Output  : the shortest path ;  : cost of path
	Process Step 1: initialize . Step 2: select the precursor nodes of the nodes in , denoted as , . Step 3: while  Step 3.1: add to ,  Step 3.2: update , . Step 4: select all the OR nodes in , denoted as . Step 5: for in  Step 5.1: select the branch with minimal cost in . Step 5.2: select the nodes of other branches, denoted by  Step 5.3: remove the nodes in from path ,  Step 6: calculate the cost of the arcs in ,  Step 7: output the path and the cost