北京交通大学学报2016，Vol.40Issue(4)：45-52,8.DOI:10.11860/j.issn.1673-0291.2016.04.007
Harmony Search-Dij kstra混合算法在铁路物流中心分层选址中的应用
Application of Harmony Search-Dij kstra hybrid algorithm in railway logistics center location
摘要
Abstract
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.关键词
铁路运输/选址分配/和声搜索算法/Dij kstra算法/铁路物流中心/分层覆盖Key words
railway transportation/location-allocation/Harmony Search algorithm/Dijkstra algo-rithm/railway logistics center/hierarchical covering分类
管理科学引用本文复制引用
靳国伟,何世伟,黎浩东,何必胜,殷玮川..Harmony Search-Dij kstra混合算法在铁路物流中心分层选址中的应用[J].北京交通大学学报,2016,40(4):45-52,8.基金项目
国家自然科学基金资助项目(61374202) （61374202）
中国铁路总公司科技研究开发计划项目资助(2013X005-A,2014F007) （2013X005-A,2014F007）
