Patent ID: 11941553
Assignee: ANHUI CONSTRUCTION ENGINEERING TRAFFIC & SHIPPING GROUP CO., LTD.
Field: IT methods for management (Electrical engineering)
Classification: CPC G | IPC G

Claim 5:
6. The method of claim 5, wherein the discoverer position calculation formula is as follows:, X
    ˙
   
   
    y
    ,
    j
   
   
    s
    +
    1
   
  
  =
  
   {
   
    
     
      
       
        
         X
         .
        
        
         y
         ,
         j
        
        s
       
       ,
       
        exp
        ⁡
        (
        
         -
         
          y
          
           δ
           ·
           
            iter
            max
           
          
         
        
        )
       
      
     
     
      
       
        R
        2
       
       <
       ST
      
     
    
    
     
      
       
        
         X
         .
        
        
         y
         ,
         j
        
        s
       
       +
       
        D
        *
        L
       
      
     
     
      
       
        R
        2
       
       ≥
       ST
      
     
    
   
  
 

where, s indicates a current number of iterations, s∈(1,itermax), itermax indicates a maximum number of iterations;
{dot over (X)}y,js indicates a position occupied by a yth discoverer in a jth dimension in a sth iteration;
{dot over (X)}y,js+1 indicates a position occupied by a yth discoverer in a jth dimension in a (s+1)th iteration;
y∈(1,n), j∈(1,d);
δ∈(0,1) is a random number;
R2 indicates a warning value;
ST indicates a safety threshold;
D is a normally distributed random number;
L is a one-row d-dimensional unit matrix;
the follower position calculation formula is as follows:, X
    ¨
   
   
    z
    ,
    j
   
   
    s
    +
    1
   
  
  =
  
   {
   
    
     
      
       Q
       *
       
        exp
        ⁡
        (
        
         -
         
          
           
            
             X
             ¨
            
            
             worst
             ,
             j
            
            s
           
           -
           
            
             X
             ¨
            
            
             z
             ,
             j
            
            s
           
          
          
           z
           2
          
         
        
        )
       
      
     
     
      
       z
       >
       
        h
        2
       
      
     
    
    
     
      
       
        
         X
         ¨
        
        
         best
         ,
         j
        
        s
       
       +
       
        
         
          ❘
          "\[LeftBracketingBar]"
         
         
          
           
            X
            ¨
           
           
            z
            ,
            j
           
           s
          
          -
          
           
            X
            ¨
           
           
            best
            ,
            j
           
           s
          
         
         
          ❘
          "\[RightBracketingBar]"
         
        
        *
        
         A
         +
        
        *
        L
       
      
     
     
      
       z
       ≤
       
        h
        2
       
      
     
    
   
  
 

where:
{umlaut over (X)}z,js+1 indicates a position occupied by a zth follower in a jth dimension in the (s+1)th iteration, z∈(1,h);
{umlaut over (X)}z,js indicates a position occupied by the zth follower in the jth dimension in the sth iteration;
{umlaut over (X)}best,js indicates optimal positions occupied by all followers in the jth dimension in the sth iteration;
{umlaut over (X)}best,js indicates worst positions occupied by all followers in the jth dimension in the sth iteration;
A+ indicates an one-row d-dimensional matrix with each element being 1 or −1;
the vigilante position calculation formula is as follows, X
    ...
   
   
    k
    ,
    j
   
   
    s
    +
    1
   
  
  =
  
   {
   
    
     
      
       
        
         
          X
          ...
         
         
          best
          ,
          j
         
         s
        
        +
        
         μ
         *
         
          
           ❘
           "\[LeftBracketingBar]"
          
          
           
            
             X
             ...
            
            
             k
             ,
             j
            
            s
           
           -
           
            
             X
             ...
            
            
             best
             ,
             j
            
            s
           
          
          
           ❘
           "\[RightBracketingBar]"
          
         
         ⁢
          
         
          f
          
           k
           ,
           j
          
          s
         
        
       
       >
       
        f
        
         best
         ,
         j
        
        s
       
      
     
    
    
     
      
       
        
         
          X
          ...
         
         
          k
          ,
          j
         
         s
        
        +
        
         K
         *
         
          (
          
           
            
             ❘
             "\[LeftBracketingBar]"
            
            
             
              
               X
               ...
              
              
               k
               ,
               j
              
              s
             
             -
             
              
               X
               ...
              
              
               worst
               ,
               j
              
              s
             
            
            
             ❘
             "\[RightBracketingBar]"
            
           
           
            
             f
             
              k
              ,
              j
             
             s
            
            -
            
             f
             
              worst
              ,
              j
             
             s
            
            +
            ε
           
          
          )
         
         ⁢
          
         
          f
          
           k
           ,
           j
          
          s
         
        
       
       ≤
       
        f
        
         best
         ,
         j
        
        s
       
      
     
    
   
  
 

where:
k,js+1 indicates a position occupied by a kth vigilante in the jth dimension in the (s+1) iteration, k∈(1,m);
k,js indicates a position occupied by the kth vigilante in the jth dimension in the sth iteration;
best,js indicates optimal positions occupied by all vigilantes in the jth dimension at the time of the sth iteration;
worst,js indicates worst positions occupied by all vigilantes in the jth dimension at the time of the sth iteration;
fk,js indicates a fitness value of the kth vigilante in the jth dimension in the sth iteration;
fbest,js indicates optimal fitness values of all vigilantes in the jth dimension in the sth iteration;
fworst,js indicates worst fitness values of all vigilantes in the jth dimension in the sth iteration;
μ is a step size control parameter;
K∈(0,1) is a random number;
ε is a constant.