用列队竞争算法求解布局-分配问题

Solving Location-allocation Problem with Line-up Competition Algorithm

布局-分配问题可以归结为一个混合整数非线性规划问题,为应用列队竞争算法来求解这个问题,提出了一个将整数变量和连续变量并行处理的策略,这一策略能使局部搜索与全局搜索达到较好的统一。用列队竞争算法对一个大规模的布局-分配问题进行了求解,得到的最好解优于文献报道的结果。统计计算结果表明,列队竞争算法对求解大规模的全局优化问题具有较好的稳健性和搜索效率。

Location-allocation problems are attributed to mixed integer nonlinear program problenls, In order to use line-up competition algorithm（LCA） to solve these problems, a strategy was proposed for handing parallel integer and continuous variables, which could reach the balance between global search and local search. LCA was applied to solve a larger scale location-allocation problem, and the solutions obtained were superior to those obtained by a hybrid algorithm of coupling genetic algorithm and grid search method in the literature. The result indicates that the LCA is efficient and robust for solving difficult global optimization problems.