全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

班轮船舶调度多目标优化模型与蚁群算法

, PP. 84-88

Keywords: 船舶调度,班轮船运,时空网络,蚁群算法,整数规划,多目标优化

Full-Text   Cite this paper   Add to My Lib

Abstract:

针对班轮船舶调度问题,在将班轮合理配置到各往返航班上和不存在时间冲突的基础上,以最小班轮变动成本、最小航线运载量缺口和最小班轮航次总绝对偏差为目标函数,构造了基于港口时段与往返航班的时空网络,建立了班轮调度的0-1整数规划数学模型。基于某船务公司实际运载数据,利用蚁群算法求解模型,并用邻域搜索技术提高求解效率。计算结果表明在运载量满足运营要求的前提下,班轮运营的日均总变动成本从198086.3元降低到170472.2元,下降了约13.9%;班轮航次数总绝对偏差从4.4次降低到2.4次,下降了约45.5%,班轮利用率更加均衡;运载量缺口仍旧为0。可见,模型可行,算法有效。

References

[1]  杨秋平,谢新连,赵家保.船队规划研究现状与动态[J]. 交通运输工程学报,2010,10(4):85-90. YANG Qiu-ping, XIE Xin-lian, ZHAO Jia-bao. Research status and prospect of fleet planning[J]. Journal of Traffic and Transportation Engineering, 2010, 10(4): 85-90.(in Chinese)
[2]  TING S C, TZENG G H. Ship scheduling and cost analysis for route planning in liner shipping[J]. Maritime Economics and Logistics, 2003, 5(4): 378-392.
[3]  AGARWAL R, ERGUN ?. Ship scheduling and network design for cargo routing in liner shipping[J]. Transportation Science, 2008, 42(2): 175-196.
[4]  YAN Shang-yao, CHEN C Y, LIN S C. Ship scheduling and container shipment planning for liners in short-term operations[J]. Journal of Marine Science and Technology, 2009, 14(4): 417-435.
[5]  DORIGO M, DI CARO G, GAMBARDELLA L M. Ant algorithms for discrete optimization[J]. Artificial Life, 1999, 5(2): 137-172.
[6]  CHIRA C, PINTEA C M, DUMITRESCU D. An agent-based approach to combinatorial optimization[J]. International Journal of Computers, Communications and Control, 2008, 3(S): 212-217.
[7]  DORIGO M, BLUM C. Ant colony optimization theory: a survey[J]. Theoretical Computer Science, 2005, 344(2/3): 243-278.
[8]  崔小燕,李旭宏,毛海军,等.受限单分配枢纽选址问题的并行蚁群算法[J].交通运输工程学报,2011,11(3):74-81. CUI Xiao-yan, LI Xu-hong, MAO Hai-jun, et al. Parallel ant colony optimization of location problem for limited single allocation hub[J]. Journal of Traffic and Transportation Engineering, 2011, 11(3): 74-81.(in Chinese)
[9]  KOLISCH R, DREXL A. Local search for nonpreemptive multi-mode resource-constrained project scheduling[J]. IIE Transactions, 1997, 29(11): 987-999.
[10]  ANGUS D, WOODWARD C. Multiple objective ant colony optimization[J]. Swarm Intelligence, 2009, 3(1): 69-85.
[11]  李 琳,刘士新,唐加福.改进的蚁群算法求解带时间窗的车辆路径问题[J].控制与决策,2010,25(9):1379-1383. LI Lin, LIU Shi-xin, TANG Jia-fu. Improved ant colony algorithm for solving vehicle routing problem with time windows[J]. Control and Decision, 2010, 25(9): 1379-1383.(in Chinese)
[12]  李志威,张旭梅.基于动态扫描和蚂蚁算法的物流配送网络优化研究[J].管理工程学报,2006,20(4):9-12. LI Zhi-wei, ZHANG Xu-mei. Study on the optimization of logistics distribution network based on dynamic sweep and ant algorithm[J]. Journal of Industrial Engineering and Engineering Management, 2006, 20(4): 9-12.(in Chinese)
[13]  CHRISTIANSEN M, FAGERHOLT K, RONEN D. Ship routing and scheduling: status and perspectives[J]. Transportation Science, 2004, 38(1): 1-18.
[14]  DANIEL A. Routing andscheduling with time windows: models and algorithms for tramp sea cargos and rail car-blocks[D]. Atlanta: Georgia Institute of Technology, 2006.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133