物流配送问题的混沌优化算法研究

Research on Location Routing Problem(LRP) of Optimization Based On Chaotic Search Algorithm(CSA)

探讨了定位——运输路线安排问题的解决方法,提出一种首先用启发式规则将客户集聚类,从而划分出若干客户子类;然后,用混沌搜索算法求解LRP的优化方法.提出将用于聚类分析的启发式规则和混沌搜索算法结合的混合算法求解物流配送路径优化问题是有效的.由于混沌序列具有随机性与遍历性,容易寻找全局最优解,从而避免了传统优化方法中的"局部最优现象"的发生.计算机仿真实例证明了该算法简洁、实用、性能良好,有利于解决带有约束的非线性物流配送路径LRP优化问题.

The hybrid algorithm is emphatically presented for the solution of location routing problem （LRP）. First, the candidate facilities and their customers are determined by clustering analysis with preference-fitting rules. Second, chaotic searching algorithm（CSA）is used to search optimal routes. The suggested method of mixture algorithm is proved efficiently for routes of logistics distribution optimization. For the ergodicity and randomness of chaotic sequence, this CSA architecture makes it possible to search the solution space easily and effectively overpass computation. A computer simulation shows that the CSA system achieves improvement over a recent LRP with nonlinear constrained optimization problem.