摘要
铁路行包运输向现代物流方向发展,行包物流基地选址及配送点规划是十分重要的环节。同时,铁路行包运输存在着客户复杂,受车站位置及列车运行情况约束等特点。文章结合物流配送中心选址问题的方法,给出铁路行包基地及配送点规划的数学模型,应用扫描法构造问题尽可能好的初始解,通过基于局部搜索的启发式算法对初始解优化,得到优化解。用一个实例验证模型及算法的可行性。
Location of baggage and parcel logistics base and distribution sites is an important part of railway baggage and parcel transportation to develop modern logistics. At the rome time, railway baggage and parcel transportation has the traits of complex clients, position of railway station and status of train running. Combining the ways of logistics center location, mathematical model on planning railway baggage and parcel logistics base and distribution sites is stated. Improved sweep algorithm and iteration arithmetic were applied to gain primary solution. Authors optimize the solution by heuristics subsequently. At last, Authors validate the feasibility of the model and its algorithm with a practical example.
出处
《系统工程》
CSCD
北大核心
2006年第1期53-57,共5页
Systems Engineering
关键词
铁路行包
选址
扫描法
启发式算法
Railway Baggage and Parcel
Location t Sweep Algorithm
Heuristic Algorithm