摘要
针对多式联运运输路径上运输方式选择问题,考虑运输网络中多个节点存在服务时间窗的限制,建立了多个中间节点带软时间窗的多式联运运输方案优化模型,设计了一种基于字符编码方式的和声搜索算法,该算法采用新的和声生成方式及微调方式。仿真实例表明,所提算法与贪婪算法相比能获得具有更优运输总成本及不准点时间的运输方案。
To solve the selection of multimodal transportation scheme, a multimodal transportation scheme selection model with several software time windows, which considered several time windows in the transportation network, was put forward. And then a Harmony Search （HS） algorithm based on character-encoding was developed. The proposed algorithm adopted a new harmony generation method and a new fine-tuning mode. Finally, numerical examples demonstrate that, compared with greedy algorithm, the HS algorithm can find best transportation scheme with less total cost and less delay time.
出处
《计算机应用》
CSCD
北大核心
2013年第9期2640-2642,2693,共4页
journal of Computer Applications
基金
贵州省科学技术基金资助项目(2012GZ10526)
贵州省毕节地区科技计划项目([2011]02)
毕节学院科学研究基金资助项目(20112016)
关键词
多式联运
运输方案
时间窗
和声搜索算法
贪婪算法
multimedal transportation
transportation scheme
time window
Harmony Search （HS） algorithm
greedy algorithm
