In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,...In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,we convert the problem(MLFP)to a problem(EP2)that is equivalent to it.Secondly,by applying the convex relaxation technique to problem(EP2),a convex quadratic relaxation problem(CQRP)is obtained.Then,the overall framework of the algorithm is given and its convergence is proved,the worst-case iteration number is also estimated.Finally,experimental data are listed to illustrate the effectiveness of the algorithm.展开更多
In this paper,a new algorithm relaxation-strategy-based modification branchand-bound algorithm is developed for a type of solving the minimum cost transportationproduction problem with concave production costs.The maj...In this paper,a new algorithm relaxation-strategy-based modification branchand-bound algorithm is developed for a type of solving the minimum cost transportationproduction problem with concave production costs.The major improvement of the proposed new method is that modification algorithm reinforces the bounding operation using a Lagrangian relaxation,which is a concave minimization but obtains a tighter bound than the usual linear programming relaxation.Some computational results are included.Computation results indicate that the algorithm can solve fairly large scale problems.展开更多
Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used....Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used. In this paper a set of approximation algorithms is presented for cases in which the ability to preview at most k（〉=2） arriving bins is given. With the essential assumption that all bin sizes are not less than the largest item size, analytical results show the asymptotic worst case ratios of all k-bounded space and offiine algorithms are 2. Based on experiments by applying algorithms to instances in which item sizes and bin sizes are drawn independently from the continuous uniform distribution respectively in the interval [0,u] and [u,l ], averagecase experimental results show that, with fixed k, algorithms with the Best Fit packing（closing） rule are statistically better than those with the First Fit packing（closing） rule.展开更多
现有无源定位闭式算法均考虑视距(Line of Sight,LOS)环境,无法直接应用于存在遮挡的城市环境低空无人机目标定位等场景,同时,非视距(Non-Line of Sight,NLOS)优化定位算法计算效率较低。针对这些问题,本文开展中继辅助下的单站目标定...现有无源定位闭式算法均考虑视距(Line of Sight,LOS)环境,无法直接应用于存在遮挡的城市环境低空无人机目标定位等场景,同时,非视距(Non-Line of Sight,NLOS)优化定位算法计算效率较低。针对这些问题,本文开展中继辅助下的单站目标定位研究,通过引入中继收发器对目标信号进行转发,构造两条路径从而规避遮挡问题,同时考虑中继和观测站位置存在随机误差,提出了一种闭式算法来确定未知目标位置。该算法分为3个步骤:首先利用校准目标-中继收发器-观测站这一路径的额外信息,修正中继和观测站位置;随后基于未知目标-中继收发器-观测站获取的观测信息,通过引入额外变量的方式构建伪线性方程,利用加权最小二乘技术给出目标位置粗略估计;最后进一步挖掘目标位置与额外变量的非线性关系,再次构建矩阵方程并给出目标位置最终估计解。经过理论剖析与仿真验证,所提出的算法在可接受的测量误差和观测站点位置误差范围内,能够逼近克拉美罗下界(Cramer-Rao Lower Bound,CRLB)。展开更多
A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet...A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity, and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a real- wofld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was ￥ 1 591276 one week and the running time was no more than 4 rain, which shows that the model and algorithm are fairly good for domestic airline.展开更多
The goal of linkage learning, or building block identification, is the creation of a more effective Genetic Algorithm （GA）. This paper proposes a new Linkage Learning Genetic Algorithms, named m-LLGA. With the linka...The goal of linkage learning, or building block identification, is the creation of a more effective Genetic Algorithm （GA）. This paper proposes a new Linkage Learning Genetic Algorithms, named m-LLGA. With the linkage learning module and the linkage-based genetic operation, m-LLGA is not only able to learn and record the linkage information among genes without any prior knowledge of the function being optimized. It also can use the linkage information stored in the linkage matrix to guide the selection of crossover point. The preliminary experiments on two kinds of bounded difficulty problems and a TSP problem validated the performance of m-LLGA. The m-LLGA learns the linkage of different building blocks parallel and therefore solves these problems effectively; it can also reasonably reduce the probability of building blocks being disrupted by crossover at the same time give attention to getting away from local minimum.展开更多
A multiphase microscopic interference system is designed to measure the height of cell which is important to the research of collective cell migration in physiology and medicine. This sys- tem can quantitatively measu...A multiphase microscopic interference system is designed to measure the height of cell which is important to the research of collective cell migration in physiology and medicine. This sys- tem can quantitatively measure cell height across a living monolayer without knowing the refractive index of cells. For the interference pattern, because the phases are all wrapped between - π to π, it is necessary to get the real phase through phase unwrapping,a method to restore the wrapped phase data of the object by using numerical calculations. Three representative algorithms are selected to unwrap the interference pattern of ceils： branch-cut method, quality-guided method and network method. Although each of them can restore the phase, their performances are obviously different. We compare these methods and find that branch-cut method needs the smallest execution time and can obtain good unwrapped patterns when noises are not serious.展开更多
基金Supported by the National Natural Science Foundation of China(Grant Nos.12071133 and 11871196).
文摘In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,we convert the problem(MLFP)to a problem(EP2)that is equivalent to it.Secondly,by applying the convex relaxation technique to problem(EP2),a convex quadratic relaxation problem(CQRP)is obtained.Then,the overall framework of the algorithm is given and its convergence is proved,the worst-case iteration number is also estimated.Finally,experimental data are listed to illustrate the effectiveness of the algorithm.
基金Foundation item： Supported by the National Natural Science Foundation of China（10726016） Supported by the Hubei Province Natural Science Foundation Project（T200809 D200613002）
文摘In this paper,a new algorithm relaxation-strategy-based modification branchand-bound algorithm is developed for a type of solving the minimum cost transportationproduction problem with concave production costs.The major improvement of the proposed new method is that modification algorithm reinforces the bounding operation using a Lagrangian relaxation,which is a concave minimization but obtains a tighter bound than the usual linear programming relaxation.Some computational results are included.Computation results indicate that the algorithm can solve fairly large scale problems.
文摘Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used. In this paper a set of approximation algorithms is presented for cases in which the ability to preview at most k（〉=2） arriving bins is given. With the essential assumption that all bin sizes are not less than the largest item size, analytical results show the asymptotic worst case ratios of all k-bounded space and offiine algorithms are 2. Based on experiments by applying algorithms to instances in which item sizes and bin sizes are drawn independently from the continuous uniform distribution respectively in the interval [0,u] and [u,l ], averagecase experimental results show that, with fixed k, algorithms with the Best Fit packing（closing） rule are statistically better than those with the First Fit packing（closing） rule.
文摘现有无源定位闭式算法均考虑视距(Line of Sight,LOS)环境,无法直接应用于存在遮挡的城市环境低空无人机目标定位等场景,同时,非视距(Non-Line of Sight,NLOS)优化定位算法计算效率较低。针对这些问题,本文开展中继辅助下的单站目标定位研究,通过引入中继收发器对目标信号进行转发,构造两条路径从而规避遮挡问题,同时考虑中继和观测站位置存在随机误差,提出了一种闭式算法来确定未知目标位置。该算法分为3个步骤:首先利用校准目标-中继收发器-观测站这一路径的额外信息,修正中继和观测站位置;随后基于未知目标-中继收发器-观测站获取的观测信息,通过引入额外变量的方式构建伪线性方程,利用加权最小二乘技术给出目标位置粗略估计;最后进一步挖掘目标位置与额外变量的非线性关系,再次构建矩阵方程并给出目标位置最终估计解。经过理论剖析与仿真验证,所提出的算法在可接受的测量误差和观测站点位置误差范围内,能够逼近克拉美罗下界(Cramer-Rao Lower Bound,CRLB)。
基金The National Natural Science Foundationof China (70473037)
文摘A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity, and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a real- wofld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was ￥ 1 591276 one week and the running time was no more than 4 rain, which shows that the model and algorithm are fairly good for domestic airline.
基金Supported by the National Natural Science Foundation of China (No. 60234020)
文摘The goal of linkage learning, or building block identification, is the creation of a more effective Genetic Algorithm （GA）. This paper proposes a new Linkage Learning Genetic Algorithms, named m-LLGA. With the linkage learning module and the linkage-based genetic operation, m-LLGA is not only able to learn and record the linkage information among genes without any prior knowledge of the function being optimized. It also can use the linkage information stored in the linkage matrix to guide the selection of crossover point. The preliminary experiments on two kinds of bounded difficulty problems and a TSP problem validated the performance of m-LLGA. The m-LLGA learns the linkage of different building blocks parallel and therefore solves these problems effectively; it can also reasonably reduce the probability of building blocks being disrupted by crossover at the same time give attention to getting away from local minimum.
基金Supported by the International Technology Cooperation Projects of BIT(GZ 20110451)
文摘A multiphase microscopic interference system is designed to measure the height of cell which is important to the research of collective cell migration in physiology and medicine. This sys- tem can quantitatively measure cell height across a living monolayer without knowing the refractive index of cells. For the interference pattern, because the phases are all wrapped between - π to π, it is necessary to get the real phase through phase unwrapping,a method to restore the wrapped phase data of the object by using numerical calculations. Three representative algorithms are selected to unwrap the interference pattern of ceils： branch-cut method, quality-guided method and network method. Although each of them can restore the phase, their performances are obviously different. We compare these methods and find that branch-cut method needs the smallest execution time and can obtain good unwrapped patterns when noises are not serious.
