Continuous optimization problem solving method based on pigeoninspired optimization
Continuous optimization problem solving method based on pigeoninspired optimization
 CN 103,971,180 A
 Filed: 05/09/2014
 Published: 08/06/2014
 Est. Priority Date: 05/09/2014
 Status: Active Application
First Claim
1. the continuous optimization problems method for solving based on dove group heuristic optimization, is characterized in that:
 the method concrete steps are as follows;
Step 1;
set up corresponding evaluation function according to given problem, and corresponding parameter is set;
Step 2;
initialization dove colony optimization algorithm parameter arranges;
Parameter has in arranging;
population scale N _{p}, optimize dimension D, map compass factor R, the maximum iteration time NC of two operators _{1}and NC _{2};
Excessive or too small R can cause bad result;
Step 3;
initial position and the speed of a random initializtion N pigeon, according to the mathematical model of the practical problems of setting up, calculate the cost of each pigeon in step 1, draw the fitness value f () of each pigeon, and find current optimal path;
Step 4;
carry out map compass operator, by the speed update rule of having introduced dove colony optimization algorithm community information, pigeon speed and position are upgraded, formula V is pressed in new speed and position _{i}(t)=V _{i}(t1) e ^{Rt}+ rand (X _{g}X _{i}(t1)) (3) and X _{i}(t)=X _{i}(t1)+V _{i}(t) (4) are upgraded;
Wherein, R is the map compass factor, and rand is random number, X _{g}be current optimal location, obtain by the position of more all pigeons;
Step 5;
if iterations is greater than the maximum iteration time NC of map compass operator _{1}, stop map compass operator and carry out terrestrial reference operator, perform step six, carry out next iteration otherwise return to step 4;
Step 6;
carry out terrestrial reference operator, give all pigeon sequences according to evaluation function, the half pigeon that evaluation function is low will be followed the pigeon flight that evaluation function is high, then finds the weighting center of all pigeons, and this position is exactly destination;
Finally, all pigeons will directly be flown to destination;
New position more new formula is as follows
Chinese PRB Reexamination
Abstract
A continuous optimization problem solving method based on pigeoninspired optimization comprises the following steps that firstly, a corresponding evaluation function is built according to a given problem, and corresponding parameters are set; secondly, pigeoninspired optimization algorithm parameter setting is initialized; thirdly, initial positions and speeds of N pigeons are initialized at random; fourthly, a map compass operator is executed; fifthly, if the number of iterations is larger than the maximum number of iterations NC1 of the map compass operator, the map compass operator is stopped, a landmark operator is executed, that is the sixth step is executed, and otherwise the fourth step is executed to conduct a next iteration; sixthly, the landmark operator is executed; seventhly, if the number of the iterations is larger than the maximum number of the iterations NC2 of the landmark operator, the landmark operator is stopped, and otherwise the sixth step is executed to conduct a next iteration; a mathematic model result corresponding to a problem is output.

9 Citations
Multiunmanned aerial vehicle tight formation control method based on pigeon swarm optimization  
Patent #
CN 111,158,395 A
Filed 01/13/2020

Current Assignee

A kind of unmanned plane cluster coordinated investigation method based on cross and variation dove group's optimization  
Patent #
CN 109,254,588 A
Filed 10/17/2018

Current Assignee

Nonlinear trajectory planning based on mixing dove group's algorithm  
Patent #
CN 106,979,784 A
Filed 03/16/2017

Current Assignee

A kind of hypersonic vehicle Iterative Design method  
Patent #
CN 107,480,335 A
Filed 07/12/2017

Current Assignee

Coordination control method for multiunmanned aerial vehicle team based on predation escape pigeon optimization  
Patent #
CN 104,850,009 A
Filed 03/17/2015

Current Assignee

Quantumbehaved pigeon inspired optimizationbased unmanned aerial vehicle autonomous aerial refueling target detection method  
Patent #
CN 105,066,998 A
Filed 08/03/2015

Current Assignee

Independent shipboard aircraft deck landing guidance law design method based on pigeon inspired optimization  
Patent #
CN 105,022,881 A
Filed 07/22/2015

Current Assignee

A kind of aircraft's flight track method and device for planning based on dove group's algorithm  
Patent #
CN 107,504,972 A
Filed 07/27/2017

Current Assignee

Based on the attitude of satellite dynamic programming method for improving PIO algorithms  
Patent #
CN 106,950,833 A
Filed 03/28/2017

Current Assignee

No References
1 Claim

1. the continuous optimization problems method for solving based on dove group heuristic optimization, is characterized in that:
 the method concrete steps are as follows;
Step 1;
set up corresponding evaluation function according to given problem, and corresponding parameter is set;Step 2;
initialization dove colony optimization algorithm parameter arranges;Parameter has in arranging;
population scale N _{p}, optimize dimension D, map compass factor R, the maximum iteration time NC of two operators _{1}and NC _{2};
Excessive or too small R can cause bad result;
Step 3;
initial position and the speed of a random initializtion N pigeon, according to the mathematical model of the practical problems of setting up, calculate the cost of each pigeon in step 1, draw the fitness value f () of each pigeon, and find current optimal path;Step 4;
carry out map compass operator, by the speed update rule of having introduced dove colony optimization algorithm community information, pigeon speed and position are upgraded, formula V is pressed in new speed and position _{i}(t)=V _{i}(t1) e ^{Rt}+ rand (X _{g}X _{i}(t1)) (3) and X _{i}(t)=X _{i}(t1)+V _{i}(t) (4) are upgraded;
Wherein, R is the map compass factor, and rand is random number, X _{g}be current optimal location, obtain by the position of more all pigeons;
Step 5;
if iterations is greater than the maximum iteration time NC of map compass operator _{1}, stop map compass operator and carry out terrestrial reference operator, perform step six, carry out next iteration otherwise return to step 4;
Step 6;
carry out terrestrial reference operator, give all pigeon sequences according to evaluation function, the half pigeon that evaluation function is low will be followed the pigeon flight that evaluation function is high, then finds the weighting center of all pigeons, and this position is exactly destination;
Finally, all pigeons will directly be flown to destination;
New position more new formula is as follows
 the method concrete steps are as follows;
Specification(s)