基于改进遗传算法的物流中心选址优化  

Optimization of locations of logistics centers based on improved Genetic Algorithm

作　　者：陶羿[1] 朱建青[1] 李明 

机构地区：[1]解放军信息工程大学理学院,郑州450002 [2]信号盲处理国防科技重点实验室,成都610041

出　　处：《计算机工程与应用》2007年第25期221-223,共3页Computer Engineering and Applications

基　　金：郑州市科技计划项目(No.04DA61ABRD13);国家部委科技基金。

摘　　要：根据物流中心选址问题的特点和要求,在运输成本和运输时间最优的基础上,构造了选址问题的数学模型。给出了一种改进遗传算法的求解方法,其中由于适应度函数与各物流中心对应的需求分配情况密切相关,用拉格朗日松弛法来解决对于特定位置的物流中心服务需求分配的子问题。遗传算子采用线性凸组合的杂交方式、强弱两种变异方式以及进化(!+λ)选择方式,从而有效地避免算法的早熟现象,可防止其很快收敛到局部最优解。实例求解表明,该算法可以有效、快速地求得物流中心选址问题的全局最优解。With the characteristics and demands of locations of logistics centers,a mathematics model has been made on logistics locations problems on the basis of the optimization of the total transport costs and time among customers and their serving centers.An improved Genetic Algorithm of global optimization solution has been given.In view of the tight relation between the fitness function and each service demands of locations of logistics centers,the subproblem of allocations of service demands has been sovled by Lagrangian relaxation method.The linear convex combination,subtle mutation and violent mutation,and ES-（μ＋λ） selection have been adopted to avoid premature convergence and prevent fast local optimal solution.The instance demonstrates that the improved algorithm can effectively get the global optimal solution.

关 键 词：物流中心选址 遗传算法 需求分配 拉格朗日松弛法 

分 类 号：O224[理学—运筹学与控制论]