摘要
针对多式联运运输距离长、中转环节多,易受机械故障、交通堵塞、天气状况等随机因素影响的特点,建立了更加符合实际的带软时间窗约束的多式联运路径优化数学规划模型。考虑到模型求解的复杂度,设计了一种遗传算法,并根据模型最优解的特点减少了搜索空间。最后通过算例对方法进行了验证。
Multimodal transport has long distance and many nodes,and is susceptible to stochastic factors,such as mechanical problems,traffic congestion and poor weather.Considering these characteristics,a more practical mathematical model is presented for multimodal transport routing problem with soft time windows.Because of its difficulty,a genetic algorithm is developed with a reduced solution set on its property.A numerical example is carried out to verify the validity of the model and approach developed in this paper.
出处
《工业工程与管理》
北大核心
2011年第5期68-72,共5页
Industrial Engineering and Management
基金
上海市自然科学基金创新行动计划项目(10190502500)
河南省软科学研究项目(112400450285)
上海海事大学博士生创新基金项目(yc2011055)
关键词
多式联运
软时间窗
随机规划
遗传算法
multimodal transport
soft time windows
stochastic programming
genetic algorithm