摘要
以带时间窗的多式联运模型为基础,考虑节点间的运输时间、节点处的运输方式转换时间以及可能发生的货运延迟,以包括运输成本、转运成本和时间偏离惩罚成本在内的总成本最小为目标函数,建立基于满意时间路径的多式联运模型。在算法上,构造了基于K最短路的改进遗传算法,通过3个算例说明多式联运的运输路径与运输方式搭配可以不是唯一的,为多式联运的相关研究工作提供了理论基础。
Based on muhimodal transportation with time windows, taking into consideration the transport time between nodes, time needed for mode change, and possible transport delay in muhimodal transporta- tion networks, a model for muhimodal transportation was constructed to minimize the total cost that includ- ed transportation costs and transfer costs. A betterment Genetic Algorithm was constructed based on K- shortest-paths. Three examples were used to show that there are more than one combination between path of transport and way of transport. This provides a theoretical foundation for relevant research on muhimodal transportation.
出处
《工业工程》
北大核心
2009年第2期24-28,共5页
Industrial Engineering Journal
基金
国家自然科学基金资助项目(70572028)
国家自然科学基金资助项目(70872123)
关键词
第四方物流
多式联运
K最短路
满意时间路径
运输费用
4PL
muhimodal transportation
K-shortest-paths
satisfactory time path
transport cost
