Multi-Depot Pickup and Delivery Problem with Resource Sharing
Algorithm 3
Procedure of the fast nondominated sorting operator.
Input: Initial population P
Output: The nondominated sorting results of population P
(1)
Step 1: Setting PP=P, rank=1, F=1
(2)
Step 2: for F=1:n
(3)
Step 3: for i=1:n
(4)
Step 4: for j=1:n && j≠i
(5)
Step 5: Compare the solution quality of xi and xj, and determine the dominant and nondominant relationships of i and j.
End
(6)
Step 6: If xi is superior to all xj, then the individual i is considered to be a nondominant individual, and the nondominant ranking value of i is rank
End
(7)
Step 7: The nondominant individuals found in the above steps constitute set SF, which is regarded as the F-level nondominant layer of the population P
(8)
Step 8: PP=PP\SF, ir=ir+1
(9)
Step 9: If PP is an empty set, then enter Step 10, otherwise continuous this cycle
