集装箱班轮支线网络鲁棒优化模型研究
发布时间：2018-11-24 08:31
【摘要】：为了有效降低成本,满足日益复杂的运输需求,班轮公司开始通过枢纽港进行货物中转,建立轴辐式航线网络。轴辐式这一网络形式已成为班轮航线的主要形态。集装箱班轮运输网络设计是重要的物流问题,牵扯大量的资产和运营成本,作为班轮公司经营战略层面的关键问题,轴辐式网络优化设计可以有效降低运营成本,提高班轮公司的市场竞争力。而支线作为轴辐式网络的重要组成部分,是干线的支撑和补充,对支线网络进行优化是干线能够顺畅运转的关键。所以本文研究支线网络优化问题,并在该问题中考虑时间窗约束以及需求不确定性。集装箱班轮支线网络优化问题是带时间窗的车辆路径问题在海运领域的应用,船舶从枢纽港出发挂靠客户所在的支线港,服务完成后返回枢纽港,其中要求每个客户都能够得到服务,但只能由一艘船提供一次服务,且该服务应尽量在指定的服务时间窗内进行,该问题的优化目标是确定合适的路径,使得在满足约束条件的情况下完成全部服务的成本最小。本文围绕集装箱班轮运输中由枢纽港向各支线港进行疏港运输的支线网络优化问题。要求船舶到港时间满足时间约束,在枢纽港船舶载重量限制和各支线港时间窗限制基础上分析轴辐式支线网络优化问题。首先以总成本最小为目标函数建立了确定性带时间窗的班轮支线网络优化模型；由于支线港多为区域性小港口,所以在实践中支线港的货运需求通常是无法事先确定的,运输需求的不确定性会影响确定条件下的解的可行性,所以本文又提出集装箱班轮支线网络鲁棒优化模型对不确定条件下船舶的运输航线进行优化选择,其中需求不确定性通过情景集进行描述,最终验证得到鲁棒优化方法能很好地处理运输需求的不确定性。
[Abstract]:In order to reduce the cost effectively and meet the increasingly complex transportation demand, the liner company began to carry on the freight transit through the hub port and set up the axle-spoke route network. This network form has become the main form of liner routes. Container liner transportation network design is an important logistics problem, which involves a large number of assets and operating costs. As a key issue of the liner company's management strategy, the axle-spoke network optimization design can effectively reduce the operating costs. Improve the market competitiveness of liner companies. As an important part of the axis-spoke network, the branch line is the support and supplement of the trunk line, and the optimization of the branch line network is the key to the smooth operation of the trunk line. In this paper, the optimization problem of branch network is studied, and time window constraints and demand uncertainties are considered in this problem. The optimization problem of container liner feeder network is the application of vehicle routing problem with time window in the field of marine transportation. The ship starts from the hub port and links to the branch port where the customer is located, and returns to the hub port after the service is completed. It requires that each customer be served, but only once by one ship, and that the service should be carried out as far as possible within the specified service time window. The optimization objective of the problem is to determine the appropriate path. It minimizes the cost of completing the entire service under the condition of satisfying the constraints. This paper focuses on the optimization of the branch network of container liner transportation from hub port to branch port. The ship arrival time is required to meet the time constraint. The optimization problem of axis-radial branch network is analyzed on the basis of the ship load limit and the time window limitation of each branch port. Firstly, a deterministic optimization model of liner feeder network with time window is established by taking the minimum total cost as the objective function. Because regional ports are mostly small regional ports, the freight demand of branch ports is usually not determined in advance in practice, and the uncertainty of transport demand will affect the feasibility of the solution under certain conditions. In this paper, the robust optimization model of container liner feeder network is proposed to optimize the shipping route under uncertain conditions, in which the uncertainty of demand is described by scenario set. Finally, it is proved that the robust optimization method can deal with the uncertainty of transportation demand well.
【学位授予单位】：大连海事大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：U692.3
本文编号：2352984
[Abstract]:In order to reduce the cost effectively and meet the increasingly complex transportation demand, the liner company began to carry on the freight transit through the hub port and set up the axle-spoke route network. This network form has become the main form of liner routes. Container liner transportation network design is an important logistics problem, which involves a large number of assets and operating costs. As a key issue of the liner company's management strategy, the axle-spoke network optimization design can effectively reduce the operating costs. Improve the market competitiveness of liner companies. As an important part of the axis-spoke network, the branch line is the support and supplement of the trunk line, and the optimization of the branch line network is the key to the smooth operation of the trunk line. In this paper, the optimization problem of branch network is studied, and time window constraints and demand uncertainties are considered in this problem. The optimization problem of container liner feeder network is the application of vehicle routing problem with time window in the field of marine transportation. The ship starts from the hub port and links to the branch port where the customer is located, and returns to the hub port after the service is completed. It requires that each customer be served, but only once by one ship, and that the service should be carried out as far as possible within the specified service time window. The optimization objective of the problem is to determine the appropriate path. It minimizes the cost of completing the entire service under the condition of satisfying the constraints. This paper focuses on the optimization of the branch network of container liner transportation from hub port to branch port. The ship arrival time is required to meet the time constraint. The optimization problem of axis-radial branch network is analyzed on the basis of the ship load limit and the time window limitation of each branch port. Firstly, a deterministic optimization model of liner feeder network with time window is established by taking the minimum total cost as the objective function. Because regional ports are mostly small regional ports, the freight demand of branch ports is usually not determined in advance in practice, and the uncertainty of transport demand will affect the feasibility of the solution under certain conditions. In this paper, the robust optimization model of container liner feeder network is proposed to optimize the shipping route under uncertain conditions, in which the uncertainty of demand is described by scenario set. Finally, it is proved that the robust optimization method can deal with the uncertainty of transportation demand well.
【学位授予单位】：大连海事大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：U692.3
【参考文献】
相关期刊论文 前1条
1 柏明国;姜涛;朱金福;;基于禁忌算法的中枢辐射航线网络鲁棒优化方法[J];数学的实践与认识;2008年13期
，本文编号：2352984
本文链接：https://www.wllwen.com/kejilunwen/daoluqiaoliang/2352984.html
