不同固定建设费用轴——辐中心问题的一个有效算法

轴——辐网络中心问题是选址领域中已被广泛研究的问题之一，其中包括对中心选址和设计中心网络结构两方面。本文提出了一种基于遗传算法的混合启发式算法来解决具有不同建设费用的无约束中心选址问题。该方法依据中心点数与全部点数的比例上限确定中心点个数。本文提出了以流量、平均距离和建设费用为参数的确定各个点被选为中心点的指标因子i作为选址指标，并首次使用单亲遗传算法求解该问题。该算法的计算结果表明它可以有效的得到小规模不同建设费用轴—辐网络问题的最优解，并且表明当折扣系数a较小时，本文提出的混合启发式算法优于文献【13】提出的遗传算法。

An Effective Hybrid Heuristics for Hub-and-Spoke Problem with Different Fixed Fee

Hub-and-spoke network is widely studied in the area of location theory, where it involves locating the hub facilities and designing the hub networks. This paper introduces a hybrid heuristics based on genetic algorithm （GA） to resolve the USAHLPFC with different fixed fee according to the upper bound ratio of the number of hubs to that of nodes. And the factor Ii is introduced which is related to flow, average distance and fixed fee. The single-parent way is used in this paper firstly to solve hub-and-spoke network. Computational experiences indicate that the proposed heuristics is capable of obtaining optimal solutions for all small-scaled problems very efficiently. Computational results also demonstrate that the proposed hybrid heuristics outperforms a genetic algorithm introduced by literature 13], when the discount factor is fewer.