Research Article

Weapon Selection and Planning Problems Using MOEA/D with Distance-Based Divided Neighborhoods

Algorithm 1

Decoding procedure.
(1): original budget share index at each time unit
(2): actual available budget each year
(3): actual spent capital in each year
(4): available budget at each time unit
(5): spent budget at each time unit
(6): accumulated budget,
(7)for do
(8)
(9)for do
(10)  
(11)  if then
(12)   
(13)  end if
(14)  
(15)  U is the total number of unselected and unplanned weapon units;
(16)  index = 1;
(17)  listing the unselected weapon units with ascending order by ;
(18)  while and do
(19)    is the indexth lowest value;
(20)   ;
(21)   if then
(22)    bool  = false
(23)    
(24)    
(25)    for do
(26)     if then
(27)       = true
(28)      break;
(29)     end if
(30)    end for
(31)    if  = false then
(32)     weapon unit with is selected and planned;
(33)     
(34)    end if
(35)   else
(36)    
(37)    break;
(38)   end if
(39)  end while
(40)end for
(41)end for