求解P中位问题的混合蝙蝠算法

根据P中位问题的数学模型及其具体特征,重新定义了蝙蝠位置与位置之间的减法操作算子、速度与位置之间的加法操作算子和可行化函数,引入了遗传算法中交叉的思想对当前解进行局部搜索,提出了求解该问题的混合蝙蝠算法。通过对多个P中位算例进行测试,并将测试结果与其他算法进行比较,验证了该混合蝙蝠算法求解P中位问题的可行性与有效性。

Hybrid Bat Algorithm for Solving a P-Median Problem

Based on the mathematical model and specific features of a P-median problem, the subtraction operator between the location and the location of bats, the addition operator between the velocity and location as well as the feasible function were redefined. The idea of crossover in genetic algorithm was introduced in order to perform a local search on the current solution and a hybrid bat algorithm (HBA) was proposed for the problem. By some tests on the P-median problem and comparisons with other algorithms, the computational results show that the hybrid bat algorithm is feasible and efficient for solving P-median problems.