CN114662884A - A method of international multimodal transport based on risk assessment model - Google Patents
A method of international multimodal transport based on risk assessment model Download PDFInfo
- Publication number
- CN114662884A CN114662884A CN202210251863.0A CN202210251863A CN114662884A CN 114662884 A CN114662884 A CN 114662884A CN 202210251863 A CN202210251863 A CN 202210251863A CN 114662884 A CN114662884 A CN 114662884A
- Authority
- CN
- China
- Prior art keywords
- risk
- transportation
- cost
- algorithm
- transport
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 62
- 238000012502 risk assessment Methods 0.000 title claims abstract description 36
- 230000008569 process Effects 0.000 claims abstract description 27
- 238000012954 risk control Methods 0.000 claims abstract description 19
- 229910052799 carbon Inorganic materials 0.000 claims abstract description 18
- OKTJSMMVPCPJKN-UHFFFAOYSA-N Carbon Chemical compound [C] OKTJSMMVPCPJKN-UHFFFAOYSA-N 0.000 claims abstract description 16
- 241000145313 Gymnocorymbus ternetzi Species 0.000 claims description 26
- 239000003016 pheromone Substances 0.000 claims description 25
- 241000239290 Araneae Species 0.000 claims description 18
- 241000238866 Latrodectus mactans Species 0.000 claims description 11
- 238000011156 evaluation Methods 0.000 claims description 10
- 230000000739 chaotic effect Effects 0.000 claims description 8
- 230000007246 mechanism Effects 0.000 claims description 4
- 241000238867 Latrodectus Species 0.000 claims description 2
- 238000013461 design Methods 0.000 claims description 2
- 230000008685 targeting Effects 0.000 claims description 2
- 238000011161 development Methods 0.000 abstract description 3
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 230000000694 effects Effects 0.000 abstract 1
- 238000004364 calculation method Methods 0.000 description 4
- 238000005457 optimization Methods 0.000 description 4
- 238000007726 management method Methods 0.000 description 3
- 206010063659 Aversion Diseases 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000007758 mating behavior Effects 0.000 description 2
- 230000001737 promoting effect Effects 0.000 description 2
- 239000000877 Sex Attractant Substances 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 1
- 235000003642 hunger Nutrition 0.000 description 1
- 230000013011 mating Effects 0.000 description 1
- 208000015380 nutritional deficiency disease Diseases 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0635—Risk analysis of enterprise or organisation activities
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
本发明公开了一种基于风险评估模型的国际多式联运方法,包括如下步骤:根据已知的运输网络信息,设置合适的参数,建立风险评估模型。根据风险评估模型计算风险控制成本,结合运输成本和碳值成本,得出总惩罚成本模型作为约束条件。针对原有黑寡妇算法,混合混沌优化种群开局、添加迭代速度控制因子,形成了一种新的H‑BWO算法对国际多式联运的路径规划做出优化。最终提出一种多式联运的风险规避方式。本发明可以实现对国际多式联运过程中总成本,尤其是对不同路径、不同运输方式带来的风险成本的控制,并且能够更好地保证国际多式联运的低碳性,对我国发展绿色物流有着一定的推动作用。
The invention discloses an international multimodal transport method based on a risk assessment model, comprising the following steps: setting appropriate parameters according to known transport network information, and establishing a risk assessment model. Calculate the risk control cost according to the risk assessment model, combine the transportation cost and the carbon value cost, and obtain the total penalty cost model as the constraint condition. Aiming at the original Black Widow algorithm, a new H-BWO algorithm was formed to optimize the path planning of international multimodal transport by mixing chaos to optimize the population opening and adding an iterative speed control factor. Finally, a risk avoidance method of multimodal transport is proposed. The invention can realize the control of the total cost in the process of international multimodal transport, especially the risk cost brought by different routes and different transportation modes, and can better ensure the low-carbon nature of international multimodal transport, which is beneficial to the development of green in my country. Logistics has a certain driving effect.
Description
技术领域technical field
本发明涉及一种联运方法,特别是一种基于风险评估模型的国际多式联运方法,属于运输路径规划技术领域。The invention relates to an intermodal transport method, in particular to an international multimodal transport method based on a risk assessment model, and belongs to the technical field of transport path planning.
背景技术Background technique
多式联运作为一种由两种或两种以上交通工具相互衔接转运而共同完成运输过程的运输方式,可以充分发挥不同运输方式的优势,避免传统运输方式的不可达、不经济、可靠性差的缺陷。但是,与此相对的多式联运的路径规划也更为复杂,由于涉及到两种或两种以上的运输方式,通常需要更长的运输时间和更大的运输风险,也要考虑到运输方式衔接过程中的物流中转。同时,本发明针对已经出现拥堵或者其他高风险原因的路径关键节点,提出了利用定位技术计算运输载具到出现拥堵或者其他高风险原因的路径关键节点的距离,并根据距离的大小采取不同的风险规避方式。Multimodal operation is a transportation method in which two or more vehicles are connected to each other to complete the transportation process. It can give full play to the advantages of different transportation methods and avoid the inaccessibility, uneconomical and poor reliability of traditional transportation methods. defect. However, the path planning of multimodal transport is also more complicated. Since two or more transport modes are involved, it usually requires longer transport time and greater transport risks. The transport mode should also be considered. Logistics transfer during the connection process. At the same time, the present invention proposes to use positioning technology to calculate the distance from the transport vehicle to the key node of the path where congestion or other high-risk reasons have occurred, and to take different measures according to the size of the distance. risk aversion approach.
目前,已有的多式联运规划方法有蚁群算法、粒子群算法,差分算法等,这类方法往往存在收敛速度慢、达不到全局最优,对环境的先验知识要求较高,需要占用较大的存储空间等问题,一旦遇到复杂的动态的环境,这类规划方法的效率会大幅下降。与之相比,黑寡妇算法是受黑寡妇蜘蛛独特的交配行为启发而提出的,具有控制参数少、收敛速度快和计算简单、容易实现等优点。At present, the existing multimodal transportation planning methods include ant colony algorithm, particle swarm algorithm, difference algorithm, etc. These methods often have slow convergence speed, cannot reach the global optimum, and require high prior knowledge of the environment. Occupying a large storage space and other problems, once a complex and dynamic environment is encountered, the efficiency of this type of planning method will drop significantly. In contrast, the black widow algorithm is inspired by the unique mating behavior of black widow spiders, and has the advantages of few control parameters, fast convergence speed, simple calculation and easy implementation.
黑寡妇算法模拟了黑寡妇蜘蛛的生命周期,雄性通过性信息素来辨别雌性的交配状态,因为雌性会表现出同类相食的行为,所以雄性对处于饥饿状态或是营养不良的雌性不感兴趣。黑寡妇算法的机制是通过黑寡妇蜘蛛的独特的运动和交配行为来做出决策和优化,简单高效,适合应用于路径规划等问题中,这使得黑寡妇算法很适合应用在多式联运的方案规划中。然而原生的黑寡妇算法,会随着迭代次数的增多,变化的波动会逐渐减少,进而会导致局部最优。。The black widow algorithm simulates the life cycle of black widow spiders. Males use sex pheromones to identify female mating status. Because females display cannibalistic behavior, males are not interested in starving or malnourished females. The mechanism of the black widow algorithm is to make decisions and optimize through the unique movement and mating behavior of black widow spiders. It is simple and efficient, and is suitable for application in path planning and other problems, which makes the black widow algorithm very suitable for multimodal transportation. planning. However, in the original black widow algorithm, as the number of iterations increases, the fluctuation of the change will gradually decrease, which will lead to a local optimum. .
发明内容SUMMARY OF THE INVENTION
针对现有技术存在的问题,本发明提出了一种基于风险评估模型的国际多式联运方法,提升了全局搜索能力,并且提高了收敛速度,不仅优化了多式联运的规划方案,更能与实际情况紧密结合,增强实用性。Aiming at the problems existing in the prior art, the present invention proposes an international multimodal transport method based on a risk assessment model, which improves the global search capability and the convergence speed, not only optimizes the planning scheme of the multimodal transport, but also can be more compatible with the The actual situation is closely integrated to enhance the practicality.
本发明提出了一种基于风险评估模型的国际多式联运方法,包括如下步骤:The present invention proposes an international multimodal transport method based on a risk assessment model, comprising the following steps:
步骤1、建立风险评估模型;根据实际运输情况建立风险指数表与运输网络信息,设置合适的参数,建立风险评估指数模型;Step 1. Establish a risk assessment model; establish a risk index table and transportation network information according to the actual transportation situation, set appropriate parameters, and establish a risk assessment index model;
步骤2、根据步骤1中建立的风险评估指数模型计算风险控制成本,结合综合运输成本和碳值成本,得出总惩罚成本模型作为约束条件;Step 2. Calculate the risk control cost according to the risk assessment index model established in step 1, and combine the comprehensive transportation cost and carbon value cost to obtain the total penalty cost model as a constraint condition;
步骤3、扩充和改进黑寡妇算法BWO;通过混合混沌优化种群开局、添加迭代速度控制因子,设计出一种新的H-BWO算法;Step 3. Expand and improve the black widow algorithm BWO; design a new H-BWO algorithm by optimizing the population opening by mixing chaos and adding an iterative speed control factor;
步骤4、根据步骤3中的H-BWO算法生成一条全局最优路径,设置H-BWO 算法的基本参数:结合最小惩罚成本函数模型,生成一条全局最优路径,作为当前多式联运的全局路径规划方案;Step 4. Generate a global optimal path according to the H-BWO algorithm in step 3, and set the basic parameters of the H-BWO algorithm: combine the minimum penalty cost function model to generate a global optimal path as the current global path for multimodal transport Proposal;
步骤5、提出一种多式联运的风险规避方式;针对已经出现拥堵或者其他高风险原因的路径关键节点,结合运输载具到关键节点的距离采取不同的风险规避方式。Step 5. Propose a risk avoidance method for multimodal transport; for the key nodes of the path where congestion or other high-risk reasons have occurred, different risk avoidance methods are adopted in combination with the distance from the transport vehicle to the key node.
本发明通过分别对多式联运过程中的风险控制成本、综合运输成本和碳值成本构建相应的惩罚成本函数,形成统一的最小惩罚成本模型作为约束,做到对以上三个方面进行有效的控制,以达到综合最优。而且,考虑到国际多式联运过程中的过高且不确定性,建立了相应的风险指数表来应对不同路径、不同运输方式带来的风险性,做到用更符合实际、更有针对性的建模来解决问题。The present invention effectively controls the above three aspects by constructing corresponding penalty cost functions for the risk control cost, comprehensive transportation cost and carbon value cost in the process of multimodal transportation, and forming a unified minimum penalty cost model as a constraint , in order to achieve the comprehensive optimal. Moreover, considering the high and uncertainty in the process of international multimodal transport, a corresponding risk index table has been established to deal with the risks brought by different routes and different modes of transport, so as to achieve a more realistic and targeted application. modeling to solve the problem.
进一步的,所述步骤1中,风险指数表包括运输方式的风险指数、运输路径的风险指数及运输物品的风险指数;Further, in the step 1, the risk index table includes the risk index of the transport mode, the risk index of the transport route and the risk index of the transported items;
所述运输方式至少包括航空运输、铁路运输、公路运输、管道运输、内河航运及海路运输;The transportation means at least include air transportation, railway transportation, road transportation, pipeline transportation, inland shipping and sea transportation;
所述运输路径包括省界、国界及洲界等不同级别的重点路段;The transportation route includes key road sections at different levels such as provincial boundaries, national boundaries and continental boundaries;
所述运输物品包括矿石、能源、农产品、高新技术产品、工业用品及医疗物资。The transported items include ores, energy, agricultural products, high-tech products, industrial supplies and medical supplies.
进一步的,根据国际物流运输网络数据建立各运输方式下运输网络中各节点的连通模型,考虑了从节点i能否到达节点j的情况,得出以下模型:Further, according to the international logistics and transportation network data, the connection model of each node in the transportation network under each transportation mode is established, and the following model is obtained by considering whether the node i can reach the node j:
i,j∈N;i<j;i,j∈N; i<j;
其中,表示从i点到j点用w类运输方式;N表示为所有节点的集合。in, Indicates the w-type transportation mode from point i to point j; N represents the set of all nodes.
进一步的,结合风险指数表建立多式联运的风险评估指数模型,多式联运的风险评估指数在运输过程中与运输物品种类、运输路径、运输方式相关。因此建立如下风险评估指数模型:利用实际路径数据结合风险评估表的参数,建立基于风险评估表的风险评估模型:Further, a risk assessment index model of multimodal transport is established in combination with the risk index table, and the risk assessment index of multimodal transport is related to the types of transported items, transport routes, and transport modes during the transportation process. Therefore, the following risk assessment index model is established: using the actual path data combined with the parameters of the risk assessment table, a risk assessment model based on the risk assessment table is established:
其中,K表示运输过程的总风险指数;表示第i点到第j点用w类运输方式的风险指数;Dij表示第i点到第j点运输路径的风险指数;θq表示运输q类物品的风险指数。Among them, K represents the total risk index of the transportation process; Represents the risk index of the w-type transportation method from point i to point j; D ij represents the risk index of the transportation route from point i to point j; θ q represents the risk index of transporting q-type items.
进一步的,针对建立的风险评估指数模型,通过保险、风险管理等手段将风险控制在可以接受的范围,由此产生的是风险控制成本。由此产生风险控制成本;将风险控制成本进行分类讨论,设置T1和T2两个风险控制阈值,以及Φ、δ两个风险成本控制指数,用以针对不同情况下不同运输风险的分类和判断,所述风险控制成本如下:Further, for the established risk assessment index model, the risk is controlled within an acceptable range by means of insurance, risk management, etc., resulting in the cost of risk control. The risk control cost is generated from this; the risk control cost is classified and discussed, and two risk control thresholds T 1 and T 2 are set, as well as two risk cost control indices Φ and δ. Judging, the risk control costs are as follows:
其中,T1和T2是风险控制阈值,数值可由使用者根据实际情况设置;Φ、δ是风险控制成本参数,Φ∈[1,2]、δ∈[2,3]。Among them, T 1 and T 2 are risk control thresholds, and the values can be set by the user according to the actual situation; Φ, δ are risk control cost parameters, Φ∈[1,2], δ∈[2,3].
进一步的,建立基于熵增系统的运输成本模型;多式联运运输成本体现在运输过程中与运输数量、时间、距离相关的直接运输成本,以及与中转、管理相关的间接运输成本。由于多式联运的整体过程体现出与物理学熵增定律相同的现象,即随着运输时间、运输距离以及中转节点的增加,运输的混乱度会相应的增加,必须加输入一定的管理和控制成本才能有效地降低运输的无序度。因此基于熵增规律建立如下运输成本模型:Further, a transportation cost model based on the entropy increase system is established; the transportation cost of multimodal transportation is reflected in the direct transportation cost related to the transportation quantity, time and distance, and the indirect transportation cost related to the transit and management during the transportation process. Since the overall process of multimodal transportation reflects the same phenomenon as the law of entropy increase in physics, that is, with the increase of transportation time, transportation distance and transit nodes, the chaos of transportation will increase accordingly, and certain management and control must be added. Cost can effectively reduce the disorder of transportation. Therefore, the following transportation cost model is established based on the law of entropy increase:
其中,Lij表示第i点到第j点运输的距离;Uw表示第i点到第j点用w类运输方式的单位距离成本;G表示运输物品的数量或者质量或者体积。Among them, L ij represents the transportation distance from the i-th point to the j-th point; U w represents the unit distance cost of the w-type transportation method from the i-th point to the j-th point; G represents the quantity or quality or volume of the transported items.
进一步的,建立碳值成本模型,碳值成本在运输过程中与运输量、距离相关,因此建立如下运输成本模型:Further, a carbon value cost model is established. The carbon value cost is related to the transportation volume and distance in the transportation process. Therefore, the following transportation cost model is established:
其中,λ表示碳排放的成本参数;εw表示w类运输方式的单位碳排放量。Among them, λ represents the cost parameter of carbon emission; εw represents the unit carbon emission of the w type of transportation.
进一步的,对前述三个成本取合适的权重,建立基于风险评估模型、效率评估模型和碳值成本的最小惩罚成本模型,其表达函数为:Further, appropriate weights are taken for the aforementioned three costs, and a minimum penalty cost model based on the risk assessment model, the efficiency assessment model and the carbon value cost is established, and its expression function is:
MinC=α*C1+β*C2+γ*C3;MinC=α*C 1 +β*C 2 +γ*C 3 ;
α+β+γ=1,α、β、γ∈[0,1];α+β+γ=1, α, β, γ∈[0,1];
其中,C是多式联运过程的总评估值;C1是多式联运过程的风险控制成本;C2是多式联运过程的运输成本;C3是多式联运过程的碳值成本;α、β、γ为三个评估值的权重参数。Among them, C is the total evaluation value of the multimodal transport process; C1 is the risk control cost of the multimodal transport process; C2 is the transportation cost of the multimodal transport process; C3 is the carbon value cost of the multimodal transport process; α, β and γ are the weight parameters of the three evaluation values.
进一步的,所述步骤4中,根据最小惩罚成本函数模型,通过H-BWO算法生成一条全局最优路径的具体步骤如下:Further, in the step 4, according to the minimum penalty cost function model, the specific steps of generating a global optimal path through the H-BWO algorithm are as follows:
步骤4.1、初始化H-BWO算法参数:Step 4.1. Initialize H-BWO algorithm parameters:
初始化H-BWO算法参数包括:种群规模D、最大迭代次数Z、随机生成的参数m、Ω和r,引入混沌机制来使H-BWO算法的种群开局更优化,使初始种群个体分布能充分利用整个算法空间,将算法空间的信息利用度最大化,同时也具备良好的引导性,以便于加快算法的收敛速度,避免局部最优;利用混沌序列的规律性、随机性和遍历性等特点使H-BWO算法的初始种群可以尽可能地利用搜索空间的信息:The parameters of the initialized H-BWO algorithm include: population size D, the maximum number of iterations Z, randomly generated parameters m, Ω and r. The chaotic mechanism is introduced to optimize the population opening of the H-BWO algorithm, so that the initial population distribution can be fully utilized. The entire algorithm space maximizes the information utilization of the algorithm space, and also has good guidance, so as to speed up the convergence speed of the algorithm and avoid local optimization; the regularity, randomness and ergodicity of chaotic sequences are used to make the algorithm. The initial population of the H-BWO algorithm can utilize the information of the search space as much as possible:
其中,a,b为混沌的常数,a∈(0,1.4),b∈(0.2,0.314];Among them, a, b are chaotic constants, a∈(0,1.4), b∈(0.2,0.314];
步骤4.2、H-BWO算法位置更新:Step 4.2, H-BWO algorithm position update:
黑寡妇蜘蛛在网格内按照线性和螺旋的方式进行运动,位置更新如以下公式:The black widow spider moves in a linear and helical manner within the grid, and the position is updated as follows:
步骤4.3、计算信息素率值:Step 4.3, calculate the pheromone rate value:
信息素在蜘蛛的求偶过程中起着非常重要的作用,而雄性蜘蛛不喜欢信息素含量低的雌性蜘蛛;黑寡妇蜘蛛的信息素率值公式如下:Pheromone plays a very important role in the courtship process of spiders, and male spiders do not like female spiders with low pheromone content; the formula for the pheromone rate of black widow spiders is as follows:
其中,Ai表示黑寡妇蜘蛛的信息素率值;fmax和fmin为最差和最优的适应度函数值;fi为第i个黑寡妇获得的适应度值;Among them, A i represents the pheromone rate value of the black widow spider; f max and f min are the worst and optimal fitness function values; f i is the fitness value obtained by the ith black widow;
步骤4.4、更新低信息素率值的黑寡妇位置:改变原本BWO位置迭代公式,添加迭代速度控制因子放缓BWO算法在迭代初期的速度,避免局部最优;同时,随着迭代次数逐渐上升,收敛速度得到有效加快。Step 4.4. Update the position of the black widow with low pheromone rate value: change the original BWO position iteration formula and add an iterative speed control factor to slow down the speed of the BWO algorithm at the beginning of the iteration to avoid local optimization; at the same time, as the number of iterations gradually increases, The convergence speed is effectively accelerated.
当信息素率值等于或小于0.3时,雌性体内低信息素水平蜘蛛代表饥饿的食人蜘蛛;因此,如果它们在场时,上述雌性蜘蛛不会被选中,但将被另一个取代;因此针对位置迭代公式进行改进,添加迭代速度控制因子τ,使其具备良好的引导性,以便于控制算法的收敛速度,前期避免了出现局部最优的情况,后期加快算法的收敛速度,改进后的公式如下:When the pheromone rate value is equal to or less than 0.3, spiders with low pheromone levels in females represent hungry cannibal spiders; therefore, if they are present, the female spiders mentioned above will not be selected, but will be replaced by another; thus targeting the location The iterative formula is improved, and the iterative speed control factor τ is added to make it have good guidance, so as to control the convergence speed of the algorithm, avoid the local optimal situation in the early stage, and speed up the convergence speed of the algorithm in the later stage. The improved formula is as follows :
其中,Pi(t)为当前黑寡妇位置或者低信息素率值的黑寡妇位置;Pi(t+1) 为更新后的黑寡妇位置;Pb为当前黑寡妇的最优位置;Pr1(t)和Pr2(t)为随机第r1和r2只黑寡妇的位置,r1和r2为在[1,D]范围内的数,r1≠r2;τ为迭代速度控制因子;n为当前迭代次数;Z为H-BWO算法的最大迭代次数;η为随机二进制数{0,1};Among them, P i (t) is the current black widow position or the black widow position with low pheromone rate value; P i (t+1) is the updated black widow position; P b is the current optimal position of the black widow; P r1 (t) and P r2 (t) are the positions of the random r 1 and r 2 black widows, r 1 and r 2 are numbers in the range of [1, D], r 1 ≠r 2 ; τ is the iteration Speed control factor; n is the current iteration number; Z is the maximum iteration number of the H-BWO algorithm; η is a random binary number {0, 1};
步骤4.5、重新评估适应度函数值,并更新最优黑寡妇的位置及最优解;Step 4.5, re-evaluate the fitness function value, and update the position of the optimal black widow and the optimal solution;
步骤4.6、判断是否满足最大迭代次数,若算法达到最大迭代次数Z,则输出最优黑寡妇位置和全局最优解,否则返回步骤4.2重新迭代计算。Step 4.6: Determine whether the maximum number of iterations is satisfied. If the algorithm reaches the maximum number of iterations Z, output the optimal black widow position and the global optimal solution, otherwise return to step 4.2 to re-iteratively calculate.
本发明针对已经出现拥堵或者其他高风险原因的路径关键节点,提出了利用定位技术计算运输载具到出现拥堵或者其他高风险原因的路径关键节点的距离ξ,并根据计算所得距离的大小采取不同的风险规避方式。当e≥100km时,更新物流信息网络并将该关键节点剔除,再经H-BWO算法重新规划路径;当 10km≤e<100km时,运输载具可以停止前行,等待拥堵或者其他高风险降低以后在做进一步安排。Aiming at the key nodes of the path where congestion or other high-risk reasons have occurred, the present invention proposes to use the positioning technology to calculate the distance ξ from the transport vehicle to the key nodes of the path where congestion or other high-risk reasons occur, and take different measures according to the calculated distance. method of risk aversion. When e≥100km, update the logistics information network and remove the key node, and then re-plan the path through the H-BWO algorithm; when 10km≤e<100km, the transport vehicle can stop moving forward, waiting for congestion or other high risks to be reduced Further arrangements will be made in the future.
与现有技术相比,本发明的有益效果是:本发明混合混沌优化种群开局、添加迭代速度控制因子,从而形成了一种新的H-BWO算法,具有更好的开局,能降将算法空间的信息利用度最大化。同时也具备良好的引导性,以便于控制算法的收敛速度,前期避免了出现局部最优的情况,后期加快算法的收敛速度。在引入最小惩罚成本模型后通过H-BWO算法生成全局最优路径,可以实现对国际多式联运过程中总成本,尤其是对不同路径、不同运输方式带来的风险成本的控制,并且能够更好地保证国际多式联运的低碳性,对我国发展绿色物流有着一定的推动作用。Compared with the prior art, the beneficial effects of the present invention are: the present invention mixes chaos to optimize the population opening and adds an iterative speed control factor, thereby forming a new H-BWO algorithm, which has a better opening and can reduce the algorithm The information utilization of space is maximized. At the same time, it also has good guidance, so as to control the convergence speed of the algorithm, avoid the occurrence of local optimum in the early stage, and speed up the convergence speed of the algorithm in the later stage. After introducing the minimum penalty cost model, the global optimal path is generated by the H-BWO algorithm, which can realize the control of the total cost in the process of international multimodal transportation, especially the risk cost caused by different paths and different transportation methods, and can be more Ensuring the low-carbon nature of international multimodal transport will play a certain role in promoting the development of green logistics in my country.
附图说明Description of drawings
图1是本发明的流程框图。FIG. 1 is a flow chart of the present invention.
图2是本发明中H-BWO算法流程图。Fig. 2 is the flow chart of H-BWO algorithm in the present invention.
具体实施方式Detailed ways
下面详细描述本发明的实施方式,所述实施方式的示例在附图中示出,其中自始至终相同或类似的标号表示相同或类似的元件或具有相同或类似功能的元件。下面通过参考附图描述的实施方式是示例性的,仅用于解释本发明,而不能解释为对本发明的限制。Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, but not to be construed as a limitation of the present invention.
本实施例提出的一种基于风险评估模型的国际多式联运方法,包括以下具体步骤:An international multimodal transport method based on a risk assessment model proposed in this embodiment includes the following specific steps:
1.最小惩罚成本函数建模1. Minimum penalty cost function modeling
假设输入的相关物流信息:运输物品为农产品;运输始发地是美国爱荷华州,目的地是中国武汉。结合不同运输方式的风险指数评估表、运输路径重点路段的风险指数评估表、不同运输物品的风险指数评估表三张表格的相关数据,其中基本参数取值:Φ=1.5,δ=2.5、T1=10、T2=20、θi=3、λ= 0.5。形成综合的最小惩罚成本模型如:Assume that the relevant logistics information is input: the transported items are agricultural products; the transport origin is Iowa, USA, and the destination is Wuhan, China. Combined with the relevant data of the risk index evaluation table of different transportation methods, the risk index evaluation table of key sections of the transportation route, and the risk index evaluation table of different transportation items, the basic parameters are as follows: Φ=1.5, δ=2.5, T 1 = 10, T 2 =20, θ i =3, λ = 0.5. Form a comprehensive minimum penalty cost model such as:
MinC=0.5*C1+0.3*C2+0.2*C3 MinC=0.5*C 1 +0.3*C 2 +0.2*C 3
约束条件如下:The constraints are as follows:
i,j∈N;i<j;i,j∈N; i<j;
其中,风险指数评估表如下:Among them, the risk index evaluation table is as follows:
根据实际运输情况,针对不同的主要运输方式如航空运输、铁路运输、公路运输、管道运输、内河航运、海路运输建立了相应的风险指数表。表如下:According to the actual transportation situation, corresponding risk index tables have been established for different main transportation modes such as air transportation, railway transportation, road transportation, pipeline transportation, inland waterway shipping, and sea transportation. The table is as follows:
表1.不同运输方式的风险指数评估表Table 1. Risk index assessment table for different modes of transport
同时,根据实际情况,构建了针对运输路径重点路段的风险指数表,针对省界、国界、洲界等不同级别的重点路段进行风险指数评估,尤其是针对途经世界级运输枢纽和要道的运输路径的评估。表如下:At the same time, according to the actual situation, a risk index table is constructed for the key sections of the transportation route, and the risk index evaluation is carried out for key sections of different levels such as provincial boundaries, national boundaries, and continental boundaries, especially for transportation through world-class transportation hubs and major roads. Path evaluation. The table is as follows:
表2.运输路径重点路段的风险指数评估表Table 2. Risk index assessment table for key sections of transportation routes
并且,根据实际情况,构建了针对不同的运输物品的风险指数表,针对矿石、能源、农产品、高新技术产品等进行风险指数评估,尤其是针对工业用品和化石能源的评估。In addition, according to the actual situation, a risk index table for different transported items is constructed, and risk index assessment is carried out for ores, energy, agricultural products, high-tech products, etc., especially for industrial supplies and fossil energy.
表3.不同运输物品的风险指数评估表Table 3. Risk index assessment table for different transported items
2.改进算法并求解2. Improve the algorithm and solve
在国际多式联运的配送路径规划过程中,本发明通过发明引入了混沌、改变原本BWO位置迭代公式,对BWO算法进行了种群开局优化等多个方面的改进,从而形成了一种新的H-BWO算法,对最小惩罚成本模型进行求解。H- BWO算法会通过计算在众多路径中找出一条最优路径。In the process of planning the distribution path of international multimodal transport, the present invention introduces chaos, changes the original BWO position iteration formula, and improves the BWO algorithm in many aspects such as population opening optimization, thereby forming a new H -BWO algorithm to solve the minimum penalty cost model. The H-BWO algorithm finds an optimal path among many paths through calculation.
1)初始化H-BWO算法参数1) Initialize H-BWO algorithm parameters
初始化H-BWO算法参数包括;种群规模D、最大迭代次数Z、随机生成的参数m、Ω和r。其中引入混沌机制来进行种群开局优化。利用混沌序列的规律性、随机性和遍历性等特点使H-BWO算法的初始种群可以尽可能地利用搜索空间的信息:The parameters of the initialized H-BWO algorithm include: population size D, maximum number of iterations Z, randomly generated parameters m, Ω and r. The chaotic mechanism is introduced to optimize the population opening. Using the regularity, randomness and ergodicity of the chaotic sequence, the initial population of the H-BWO algorithm can use the information of the search space as much as possible:
2)H-BWO算法位置更新2) H-BWO algorithm location update
黑寡妇蜘蛛在网格内按照线性和螺旋的方式进行运动,位置更新如以下公式:The black widow spider moves in a linear and helical manner within the grid, and the position is updated as follows:
3)计算信息素率值3) Calculate the pheromone rate value
信息素在蜘蛛的求偶过程中起着非常重要的作用,而雄性蜘蛛不喜欢信息素含量低的雌性蜘蛛。黑寡妇蜘蛛的信息素率值公式如下:Pheromone plays a very important role in the courtship process of spiders, and male spiders do not like female spiders with low pheromone content. The formula for the pheromone rate value of the black widow spider is as follows:
4)更新低信息素率值的黑寡妇位置4) Update black widow position with low pheromone rate value
当信息素率值等于或小于0.3时,雌性体内低信息素水平蜘蛛代表饥饿的食人蜘蛛。因此,如果它们在场时,上述雌性蜘蛛不会被选中,但将被另一个取代。在此,本发明针对位置迭代公式进行改进,添加了一种迭代速度控制因子τ,使其具备良好的引导性,以便于控制算法的收敛速度,前期避免了出现局部最优的情况,后期加快算法的收敛速度,改进后的公式如下:When the pheromone rate value is equal to or less than 0.3, spiders with low pheromone levels in females represent hungry cannibal spiders. Therefore, if they are present, the female spiders mentioned above will not be selected, but will be replaced by another. Here, the present invention improves the position iteration formula, and adds an iterative speed control factor τ to make it have good guidance, so as to control the convergence speed of the algorithm, avoid the situation of local optimum in the early stage, and speed up the later stage. The convergence speed of the algorithm, the improved formula is as follows:
5)重新评估适应度函数值,并更新最优黑寡妇的位置及最优解。5) Re-evaluate the fitness function value, and update the position of the optimal black widow and the optimal solution.
6)算法终止6) The algorithm terminates
若算法达到最大迭代次数Z,则输出最优黑寡妇位置和全局最优解,否则返回步骤2重新迭代计算。If the algorithm reaches the maximum number of iterations Z, output the optimal black widow position and the global optimal solution, otherwise return to step 2 to re-iterate the calculation.
经H-BWO算法计算结果:从爱荷华州依靠铁路运输至洛杉矶港,转为海洋运输至中国上海港,再经内河航运沿长江至武汉。The results calculated by the H-BWO algorithm: from Iowa to the Port of Los Angeles by rail, transferred to the port of Shanghai, China by sea, and then to Wuhan along the Yangtze River via inland shipping.
从计算的结果可以看出:混合混沌且添加一种迭代速度控制因子τ,从而形成的H-BWO算法,能够有效地提高BWO算法的收敛速度和全局优化能力,避免陷入局部最优。针对国际多式联运的复杂情况,H-BWO算法结合最小惩罚成本模型后生成全局最优路径,可以实现对国际多式联运过程中风险的有效控制,并能够进一步减少碳排放,对我国的整个绿色物流行业有着促进发展的作用。It can be seen from the calculation results that the H-BWO algorithm formed by mixing chaos and adding an iterative speed control factor τ can effectively improve the convergence speed and global optimization ability of the BWO algorithm and avoid falling into local optimum. In view of the complex situation of international multimodal transport, the H-BWO algorithm combines the minimum penalty cost model to generate a global optimal path, which can effectively control the risks in the process of international multimodal transport, and can further reduce carbon emissions. The green logistics industry plays a role in promoting development.
应该注意的是,上述实施例对本发明进行说明而不是对本发明进行限制,并且本领域技术人员在不脱离所附权利要求的范围的情况下可设计出替换实施例。It should be noted that the above-described embodiments illustrate rather than limit the invention, and that alternative embodiments may be devised by those skilled in the art without departing from the scope of the appended claims.
Claims (9)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210251863.0A CN114662884B (en) | 2022-03-15 | 2022-03-15 | A risk assessment model for international multimodal transport |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210251863.0A CN114662884B (en) | 2022-03-15 | 2022-03-15 | A risk assessment model for international multimodal transport |
Publications (2)
Publication Number | Publication Date |
---|---|
CN114662884A true CN114662884A (en) | 2022-06-24 |
CN114662884B CN114662884B (en) | 2024-12-10 |
Family
ID=82029210
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210251863.0A Active CN114662884B (en) | 2022-03-15 | 2022-03-15 | A risk assessment model for international multimodal transport |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN114662884B (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115632443A (en) * | 2022-11-09 | 2023-01-20 | 淮阴工学院 | Energy monitoring and optimal regulation system and method based on black oligogynae algorithm |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107784618A (en) * | 2017-12-12 | 2018-03-09 | 唐艳丽 | A kind of construction method of Analysis of InternationalizationLevel Level for Cities index |
CN111626477A (en) * | 2020-04-29 | 2020-09-04 | 河海大学 | Multi-type joint transport path optimization method considering uncertain conditions |
CN113033885A (en) * | 2021-03-17 | 2021-06-25 | 长沙理工大学 | Multi-type intermodal transport path optimization method and system, storage medium and computer equipment |
-
2022
- 2022-03-15 CN CN202210251863.0A patent/CN114662884B/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107784618A (en) * | 2017-12-12 | 2018-03-09 | 唐艳丽 | A kind of construction method of Analysis of InternationalizationLevel Level for Cities index |
CN111626477A (en) * | 2020-04-29 | 2020-09-04 | 河海大学 | Multi-type joint transport path optimization method considering uncertain conditions |
CN113033885A (en) * | 2021-03-17 | 2021-06-25 | 长沙理工大学 | Multi-type intermodal transport path optimization method and system, storage medium and computer equipment |
Non-Patent Citations (2)
Title |
---|
杨楠;: "带时间窗的多式联运路径优化模型及算法研究", 广东交通职业技术学院学报, no. 02, 15 June 2020 (2020-06-15) * |
谢雪梅;杨家其;: "带时间窗的整车多式联运路径优化模型研究", 武汉理工大学学报(交通科学与工程版), no. 06, 15 December 2017 (2017-12-15) * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115632443A (en) * | 2022-11-09 | 2023-01-20 | 淮阴工学院 | Energy monitoring and optimal regulation system and method based on black oligogynae algorithm |
Also Published As
Publication number | Publication date |
---|---|
CN114662884B (en) | 2024-12-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN113033885A (en) | Multi-type intermodal transport path optimization method and system, storage medium and computer equipment | |
Barán et al. | A multiobjective ant colony system for vehicle routing problem with time windows. | |
CN109357678B (en) | Multi-unmanned aerial vehicle path planning method based on heterogeneous pigeon swarm optimization algorithm | |
Xiong | Research on cold chain logistics distribution route based on ant colony optimization algorithm | |
CN115953104A (en) | Mixed fleet scheduling method based on dung beetle optimization algorithm | |
CN115576343B (en) | A multi-objective vehicle routing optimization method combined with drone delivery | |
CN106529797B (en) | Electric vehicle charging network planing method | |
CN113052537B (en) | A low-carbon route planning method for logistics vehicles based on heuristic particle swarm optimization | |
CN114971011A (en) | A Multimodal Transport Path Optimization Method Based on Improved Genetic Simulated Annealing Algorithm | |
CN113850414B (en) | Logistics scheduling planning method based on graph neural network and reinforcement learning | |
CN114662884A (en) | A method of international multimodal transport based on risk assessment model | |
CN115032997A (en) | Fourth logistics transportation path planning method based on ant colony algorithm | |
CN115619065A (en) | Method, system, electronic equipment and medium for multimodal transport route optimization | |
Akhtar et al. | Particle swarm optimization modeling for solid waste collection problem with constraints | |
CN107274032A (en) | A kind of Bi-objective Transportation Network Planning model optimization computational methods | |
CN106295864A (en) | A kind of method solving single home-delivery center logistics transportation scheduling problem | |
Liu et al. | An improved path planning algorithm based on fuel consumption | |
CN116088530A (en) | Reinforcement Learning Self-Driving Fleet Control Method Based on Model Predictive Control Guidance | |
CN112330001A (en) | Logistics distribution vehicle route optimization method based on discrete bat algorithm | |
CN115048576A (en) | Flexible recommendation method for airport passenger group travel mode | |
Gao et al. | Biobjective optimization for railway alignment fine‐grained designs with parallel existing railways | |
CN107370191A (en) | A kind of fired power generating unit generation schedule preparation method based on improvement ant group algorithm | |
CN111415117A (en) | Method for optimizing truck path in container yard by considering random driving time | |
CN116306986A (en) | A federated learning method and related equipment based on dynamic affinity aggregation | |
Sun et al. | Research on intelligent guidance optimal path of shared car charging in the IOT environment |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |