一种有效求解厌恶设施选址问题的混合启发式算法

An effective hybrid heuristic algorithm for solving undesirable facility location problems

由于1-maximin模型的目标函数在每条边上是分段线性的凹函数,基于1-maximin模型的这一特点,将粒子群算法和黄金分割法有机结合起来,提出了一种求解1-maximin模型的混合粒子群-黄金分割(PSO-GS)算法。数值实验表明,PSO-GS算法求解1-maximin模型和1-maxisum模型较Un Center和Newalgorithm算法效率高。

The objective function of the 1-maximin model is piecewise linear and concave. Based on the characteristics of the 1-maximin model,this paper proposes a hybrid particle swarm optimization-golden section（PSO-GS）algorithm to solve the 1-maximin model effectively. Numerical experiments show that the PSO-GS algorithm solves the 1-maximin model and the 1-maxisum model more efficiently than either the Un Center or Newalgorithm algorithms.