摘要
分析了铁路行包运输物流化发展背景及行包运输物流配送的特点,给出了铁路行包基地及配送点选址的数学模型,应用改进的扫描法构造问题尽可能好的初始解,并通过巧妙地设计罚函数、合理构造邻域及随机选取禁忌长度的一种禁忌搜索算法对初始解优化.计算结果表明,扫描法和禁忌搜索算法结合的两阶段法,不仅可以得到良好的计算结果,而且具有搜索空间小、求解速度快的优点,该方法是有效、可行的.
Based on the developments of modern logistics and features of logistics distribution of railway baggage and parcel, a mathematical model of planning railway baggage and parcel base and distribution sites is presented. An improved sweep algorithm is applied to gain the initial solution. The initial solution is optimized by a tabu search algorithm which consists of designing punishment function,constructing reasonable neighborhood and selecting tabu length randomly. The computational result demonstrates that the two-phase approach of combing sweep algorithm and tabu search algorithm can give not only high quality solution but also small searching space and fast speed.
出处
《控制与决策》
EI
CSCD
北大核心
2006年第11期1316-1320,共5页
Control and Decision
关键词
铁路行包
选址
禁忌搜索
扫描法
配送点
Railway baggage and parcel
Location
Tabu search algorithm
Sweep algorithm
Distribution sites
