Combination optimization model and method based on multi-modal transport

doi:10.3778/j.issn.1002-8331.2009.07.065

Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (7): 212-214.DOI: 10.3778/j.issn.1002-8331.2009.07.065

• 工程与应用 • Previous Articles Next Articles

Combination optimization model and method based on multi-modal transport

WANG Wei¹,ZHANG Xiao-dong¹,XIN Guo-dong²

1.College of Computer Science and Technology，Harbin Institute of Technology，Weihai，Shandong 264209，China
2.College of Shipping，Harbin Institute of Technology，Weihai，Shandong 264209，China

Received:2008-08-07 Revised:2008-10-27 Online:2009-03-01 Published:2009-03-01
Contact: WANG Wei

基于多式联运的组合优化模型及求解方法

王巍¹,张小东¹,辛国栋²

1.哈尔滨工业大学计算机科学与技术学院，山东威海 264209
2.哈尔滨工业大学船舶学院，山东威海 264209

通讯作者: 王巍

Abstract

Abstract: This paper proposes a combination optimization model aimed at preference of transportation route and mode of shipping in container multi-modal transport.It is a 0-1 integer programming model.In this paper，the original problem is converted to a specific shortest path problem with time and capability constraints by constructing an extensive virtual transportation network which is divided into several stages and added virtual city nodes to the path between non-adjacent stages.An efficient method to solve the specific shortest path is given.It is a more simple method，and It is not limited by multiple cities of random distribution.

Key words: multi-modal transport, combination optimization, virtual transportation networks, shortest path

摘要： 针对集装箱多式联运中运输路线优选和运输方式优选的问题，建立了组合优化模型，该模型是一个0-1规划模型。通过将运输网络划分成若干阶段，存在路径的不相邻阶段间增加虚拟城市节点，构建了扩展的虚拟运输网络，把原问题转化成一个带时间约束和能力约束的最短路径问题，给出了相应的求解方法。该方法的主要优点：它是一个更简单的方法；不受随机分布多城市的限制。

关键词: 多式联运, 组合优化, 虚拟运输网络, 最短路径

WANG Wei¹,ZHANG Xiao-dong¹,XIN Guo-dong². Combination optimization model and method based on multi-modal transport[J]. Computer Engineering and Applications, 2009, 45(7): 212-214.

王巍¹,张小东¹,辛国栋². 基于多式联运的组合优化模型及求解方法[J]. 计算机工程与应用, 2009, 45(7): 212-214.

[1]	LI Jun. Improved Social Force Crowd Evacuation Simulation Model Combined with Shortest Path [J]. Computer Engineering and Applications, 2021, 57(8): 264-270.
[2]	YE Yingshi, WEI Fuyi, CAI Xianzi. Research on Fast Dijkstra Algorithm Based on Parallel Computing [J]. Computer Engineering and Applications, 2020, 56(6): 58-65.
[3]	LI Yan, WANG Yangyang, ZHANG Hongyan, WU Youxi. Fast Pruning Algorithm for Unreachable Vertices and Its Application in Solving Shortest Path Problem [J]. Computer Engineering and Applications, 2020, 56(15): 51-57.
[4]	MA Xuan, LIU Dong, HU Jiaxin. Particle Swarm Optimization for Solving Problem of k-Shortest Paths via Designated Points [J]. Computer Engineering and Applications, 2019, 55(20): 89-94.
[5]	ZHANG Xin, YAN Pei, GUO Yang, WANG Huihui. K-Shell Shortest Path Approximation Algorithm for Complex Networks [J]. Computer Engineering and Applications, 2019, 55(14): 54-60.
[6]	ZHANG Linxia, HE Liwen, HUANG Jun. Route of security device research based on SDN Network [J]. Computer Engineering and Applications, 2018, 54(4): 103-109.
[7]	GAO Zunhai, GAO Ying, CHENG Guo. Weighted path matrix of graph and all pairs shortest path problem [J]. Computer Engineering and Applications, 2017, 53(9): 47-50.
[8]	YANG Xiaodong, KANG Yan, LIU Qing, Sun Jinwen. Tabu estimation of distribution algorithm for job-shop scheduling problem [J]. Computer Engineering and Applications, 2017, 53(7): 147-153.
[9]	YING Wenjie, XU Kai, XU Shaoping. Multi-objective trajectory planning of manipulator for badminton robot [J]. Computer Engineering and Applications, 2017, 53(3): 258-265.
[10]	DONG Yuehua, ZHOU Yongxin. Selective sorting algorithm over a set of necessary nodes [J]. Computer Engineering and Applications, 2017, 53(20): 43-49.
[11]	YAO Bo1, FENG Hongwei1, GAO Yuan2, MA Jiali1, FENG Jun1. Dynamic pruning search algorithm that must go through certain node set [J]. Computer Engineering and Applications, 2017, 53(15): 57-62.
[12]	YANG Nan1, CHEN Yuanbo2, WANG Yanjie2, LI Qing2. Multipath transmission protocol based on degree-constrained shortest path tree [J]. Computer Engineering and Applications, 2017, 53(11): 126-130.
[13]	YUAN Yabo, LIU Yi, WU Bin. Solving shortest path problem with modified ant colony algorithm [J]. Computer Engineering and Applications, 2016, 52(6): 8-12.
[14]	MENG Yingxiang1, GAO Donghuai2, XU Hao2, XU Weizhong2. Link layer topology discovery for multi-subnet networks based on shortest path [J]. Computer Engineering and Applications, 2016, 52(2): 131-134.
[15]	LIN Ruonan, LI Qiang. Template-based task scheduling strategy and algorithm in cloud computing environment [J]. Computer Engineering and Applications, 2016, 52(19): 48-52.

Combination optimization model and method based on multi-modal transport

基于多式联运的组合优化模型及求解方法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics