[Retracted] The Network Global Optimal Mapping Approach Utilizing a Discrete Firefly Optimization Algorithm

Algorithm 1

Steps of the algorithm.

	Input: train the data in the form of P = {P^(1), P^(2)… P^(K)}
	Step 1: DFOA←X
Step 2: Q = {Q^(1), Q ^(2)… Q ^(K)}
Step 3: for i l to K, do
Step 4: P ^(i) ← Q ^(i)
Step 5: when the product (i) = 0;
Step 6: when x is aspired as a criterion
Step 7: substitute P by Pj, Pu, Pi and revise the productivity list.
Step 8: else if x is found as the best solution in a set of {Q1, Q2… Qn}
Step 9: terminate the process.
Step 10: go back to Q in Step 2.