A Parallel Bioinspired Algorithm for Chinese Postman Problem Based on Molecular Computing

Algorithm 3

Generate weight chain of edges.

	The feasible solution chains contain the information of the chain length passing through the vertex. The optimal solution based on the total chain length will be affected by the number of vertices the route passes through. Therefore, it is necessary to exclude the vertex chain information contained in the original feasible chain.
	For to
	(3-1) ;
	(3-2) ;
	(3-3) ;
	(3-4) ;
	(3-5) ;
	(3-6) ;
	(3-7) ;
	(3-8) ;
	(3-9) ;
	(3-10) .
	End for
	In Figure 1, the edge route can be coded as .