Harmony Search-Dij kstra混合算法在铁路物流中心分层选址中的应用

为了满足铁路集中化运输的要求,基于铁路物流中心的层级特点,结合分层选址的理论和方法,以铁路物流中心覆盖的总需求最大化为目标,提出了铁路物流中心分层选址分配模型.针对铁路物流中心选址分配模型的特点,提出采用求解效率较高的和声搜索算法(Harmony Search,HS)和Dijkstra算法相结合的混合算法进行求解,并通过算例验证了模型的可行性和算法的有效性.为了验证算法的性能,对不同规模下的算法进行多次测试,结果表明当规模较大时,HS-Dijkstra混合算法仍可以在可接受的时间范围内收敛.为了体现算法的计算效率,对大规模下的Harmony Search-Dijkstra混合算法与遗传算法(Genetic Algorithm,GA)进行比较,结果显示Harmony Search-Dijkstra混合算法收敛速度明显优于遗传算法.因此,Harmony Search-Dijkstra混合算法可以有效解决铁路物流中心选址分配问题.

Application of Harmony Search-Dij kstra hybrid algorithm in railway logistics center location

To meet the requirement of railway centralized transportation,this paper develops an alternative approach that takes the hierarchical location-allocation into account.A mathematical programming model is developed which maximizes the demands covered.An algorithm is presen-ted which could solve the problem of different scales in a reasonable time.The algorithm is based upon harmony search (HS)and Dijkstra algorithm.Compared with genetic algorithm(GA)under a large scale case,the proposed algorithm is more efficient.Therefore,the algorithm can be ap-plied to the problem.Further application and extension seem promising.