Table 2 Local search algorithm

Step 1: Calculate the set of jump sequence points surrounding W, which can be denoted by W’ = {w ₁', w ₂', …,w _j '}, with w _i  ' ∈ (w _i  − α, w _i  + α). Calculate \( {\overline{D}}_{center}=f\left(m,W\right) \)

Step 2: Calculate all \( {\overline{D}}_{neigh}=f\left(m,W\hbox{'}\;\right) \), and determine the W’ _{neigh_min} that corresponds to the minimum \( {\overline{D}}_{neigh} \) within the neighborhood. The minimum \( {\overline{D}}_{neigh} \) is denoted by \( {\overline{D}}_{neigh\_ \min } \).

Step 3: If \( {\overline{D}}_{neigh\_ \min }<{\overline{D}}_{center} \), set W = W’ _{neigh_min} , \( {\overline{D}}_{center}={\overline{D}}_{neigh\_ \min } \), and goto Step 1. Otherwise, output W’ _{neigh_min} .