CN111475898A - Method for constructing Zhongouban transport network considering hub node failure - Google Patents

Method for constructing Zhongouban transport network considering hub node failure Download PDF

Info

Publication number
CN111475898A
CN111475898A CN202010156928.4A CN202010156928A CN111475898A CN 111475898 A CN111475898 A CN 111475898A CN 202010156928 A CN202010156928 A CN 202010156928A CN 111475898 A CN111475898 A CN 111475898A
Authority
CN
China
Prior art keywords
node
transportation
hub
cost
constraint
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
Application number
CN202010156928.4A
Other languages
Chinese (zh)
Other versions
CN111475898B (en
Inventor
汤银英
张琪胜
陈思
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Southwest Jiaotong University
China State Railway Group Co Ltd
Original Assignee
Southwest Jiaotong University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Southwest Jiaotong University filed Critical Southwest Jiaotong University
Priority to CN202010156928.4A priority Critical patent/CN111475898B/en
Publication of CN111475898A publication Critical patent/CN111475898A/en
Application granted granted Critical
Publication of CN111475898B publication Critical patent/CN111475898B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Quality & Reliability (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a method for constructing a middle-European class transportation network considering the failure of a hub node, which comprises the steps of obtaining the data of middle-European class transportation amount among cities, calculating the transportation cost of unit transportation amount among the cities according to distance data and freight rate data, constructing a total transportation cost objective function, constructing constraint conditions, and solving the positions of the hub point, a general node set of a hub point service and an alternative point corresponding to the hub point for the total transportation cost objective function and the constraint conditions. The invention can rapidly and accurately calculate the trunk-branch combination of the central and European banrows, the hub node site selection, the alternative node site selection and the measurement and calculation hub service range in the hub distributed banrow organization mode, thereby improving the transport organization mode of the central and European banrows and reducing the transport cost of the central and European banrows.

Description

Method for constructing Zhongouban transport network considering hub node failure
Technical Field
The invention belongs to the technical field of transport network construction, and particularly relates to a method for constructing a transport network of a central European class in consideration of hub node failure.
Background
In recent years, the number of the Chinese European class is rapidly increased, the service range is rapidly expanded, the operation efficiency is continuously improved, the operation cost is continuously reduced, and the types of goods sources are continuously enriched. However, the problems of facility connection, transportation price, source of goods and complicated geopolitical environment are still important factors for restricting the development of central European class. In advance, European class is mainly in a point-to-point direct organization mode, so that the problems of low utilization rate of transportation resources, difficult brand construction and disordered competition of local classes are caused.
Disclosure of Invention
The purpose of the invention is: in order to improve the current situation of the transportation organization of the central-European class, relieve the problems of low resource utilization rate, serious circuit repetition, disordered competition of local class and the like, reduce the transportation cost of the central-European class and exert the scale benefit of a hub, the construction method of the central-European class transportation network considering the failure of the hub node is provided, the site selection of the hub node, the site selection of an alternative node and the measurement and calculation of the service range of the hub can be quickly and accurately calculated, and further, a basic method support is provided for the establishment of a traffic transportation policy.
In order to achieve the purpose of the invention, the invention adopts the technical scheme that:
a method for constructing a Zhongoubang train transportation network considering the failure of a hub node comprises the following steps:
s1, acquiring middle-European class traffic data among cities;
s2, calculating the transportation cost of unit transportation volume between cities according to the distance data and the freight rate data in the specific time period of the specific city set;
s3, constructing a total transportation cost objective function by taking the conventional transportation cost, the route resetting cost, the goods source loss cost and the congestion cost as influence factors;
s4, constructing constraint conditions by taking node distribution constraint, path selection constraint, pivot quantity constraint, pure hub and spoke constraint, alternative set constraint and alternative quantity constraint as constraint factors;
s5, solving the positions of the pivot points, the general node set of the pivot point service and the positions of the alternative points corresponding to the pivot points according to the total transportation cost objective function constructed in the step S3 and the constraint conditions constructed in the step S4.
Further, the data of the inter-city central european class freight volume in step S1 is specifically a matrix of the container freight volume between the normal-operation central european class cities at home and abroad.
Further, the distance data in step S2 is specifically an expansion matrix of transportation distances between cities of the eurban column in the domestic and foreign normalized start-up, and the freight rate data is specifically a matrix of general freight rates between cities of the eurban column in the domestic and foreign normalized start-up.
Further, the conventional transportation cost in the step S3 is expressed as:
Figure BDA0002404399550000021
the path reset cost is expressed as:
Figure BDA0002404399550000022
the source loss cost is expressed as:
Figure BDA0002404399550000023
the congestion cost is expressed as:
Figure BDA0002404399550000031
wherein N represents a total node set in the central European Bankson hub and spoke network, p represents a discount coefficient generated between hub nodes due to scale effect, q represents a hub failure probability, α represents a transportation cost discount coefficient based on the scale effect, β represents a congestion cost coefficient,
Figure BDA0002404399550000032
denotes the capacity limit of the hub k, CijRepresenting the cost of transportation of a unit container from node city i to node city j, cijCost per kilometer of transportation of unit containers representing node cities i to j, dijRepresents the distance, w, from node city i to node city jijRepresenting the container traffic, y, from node city i to node city jikRepresenting the allocation of non-pivot nodes, if the node i is allocated to k, then 1 is taken, otherwise 0, y is takenikmjIndicates the OD flow i → j passesIf the container flow of i → j passes through the junction k → m, then take 1, otherwise take 0,
Figure BDA0002404399550000033
and (4) representing alternative pivot decision, if the alternative pivot of the pivot k is l, taking 1, and otherwise, taking 0.
Further, in the step S3, an objective function of the total transportation cost is constructed, which is expressed as:
Cs＝CMC+RTRS+FL+CG。
further, the node allocation constraint in step S4 is expressed as:
Figure BDA0002404399550000034
the path selection constraint is expressed as:
Figure BDA0002404399550000035
Figure BDA0002404399550000036
the pivot number constraint is expressed as:
Figure BDA0002404399550000037
the pure hub and spoke constraint is expressed as:
Figure BDA0002404399550000041
the alternative set constraint is expressed as:
Figure BDA0002404399550000042
the alternative quantity constraint is expressed as:
Figure BDA0002404399550000043
wherein p represents the number of the pivot nodes.
The invention has the following beneficial effects: according to the invention, a total transportation cost objective function and constraint conditions are constructed by considering various cost influence factors and constraint factors, and the trunk-branch combination of the central and European banquet trains can be rapidly and accurately calculated by solving, and the hub node site selection, the alternative node site selection and the calculation hub service range are measured in a hub distributed banquet organization mode, so that the central and European banquet train transportation organization mode is improved, and the central and European banquet train transportation cost is reduced.
Drawings
FIG. 1 is a flow chart of a method for constructing a Central European class transportation network in consideration of a hub node failure according to the present invention;
fig. 2 is a schematic diagram of a central european bang train transportation network constructed in accordance with the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
As shown in fig. 1, an embodiment of the present invention provides a method for constructing a central european ban transportation network considering a terminal node failure, including the following steps S1 to S5:
s1, acquiring middle-European class traffic data among cities;
in an optional embodiment of the invention, the method firstly obtains the transportation volume data of the central European class between cities, specifically, the transportation volume data is a matrix of container transportation volume between the national European class at home and abroad. The mid-european class traffic data information between cities is shown in table 1.
TABLE 1 interurban transportation data storage table
0 0 0 0 0 189 149 42 36 30
0 0 0 0 0 43 59 9 12 28
0 0 0 0 0 43 49 9 13 11
0 0 0 0 0 49 34 141 32 44
0 0 0 0 0 12 12 5 8 21
87 31 68 79 26 0 0 0 0 0
29 49 47 26 14 0 0 0 0 0
80 29 23 76 22 0 0 0 0 0
15 4 9 12 15 0 0 0 0 0
22 19 17 22 9 0 0 0 0 0
S2, calculating the transportation cost of unit transportation volume between cities according to the distance data and the freight rate data in the specific time period of the specific city set;
in an optional embodiment of the present invention, the present invention obtains distance data and freight rate data in a specific time period of a specific city set, wherein the distance data is specifically a matrix of transportation distances between cities in the european class column in a domestic and foreign normalized start row, as shown in table 2.
TABLE 2 data sheet of inter-city transport distance
Figure BDA0002404399550000051
Figure BDA0002404399550000061
The freight rate data is specifically an extended matrix of the general freight rate between cities in the european class column in the domestic and foreign normalized development, and the matrix includes all the starting and ending points at home and foreign to ensure that the system is still feasible under the condition of unbalanced return trip, and the normalization processing is performed on the system, as shown in table 3.
TABLE 3 inter-City freight data sheet
Figure BDA0002404399550000062
Figure BDA0002404399550000071
The present invention calculates the transportation cost per unit transportation amount between cities according to the obtained distance data and the obtained transportation price data, as shown in table 4, and calculates the inter-city transportation price matrix, as shown in table 5.
TABLE 4 transportation charge data sheet for inter-city unit transportation volume
Figure BDA0002404399550000072
TABLE 5 inter-city freight matrix (× 10)-3)
Figure BDA0002404399550000073
Figure BDA0002404399550000081
S3, constructing a total transportation cost objective function by taking the conventional transportation cost, the route resetting cost, the goods source loss cost and the congestion cost as influence factors;
in an alternative embodiment of the present invention, the total transportation cost of the present invention includes a regular transportation cost, a route reset cost, a source loss cost, and a congestion cost.
Wherein the conventional transportation cost CMC, i.e. the network transportation cost of the part not affected by the hub failure, is expressed as:
Figure BDA0002404399550000082
the route resetting cost RTRS, i.e. the route resetting cost for the cargo flow originally passing through the failed node to turn to the alternative node due to the failure of the junction node, the route i → k → m → j is converted into i → l → m → j, and is represented as:
Figure BDA0002404399550000083
the source loss cost F L, i.e. the cost of the source loss of a container originating from or terminating at a node due to a complete failure of the terminal node, is expressed as:
Figure BDA0002404399550000084
the congestion cost CG, i.e. the original set of traffic of the candidate node and the cost of the traffic that needs to be converted into the set of nodes due to the path reset and the capacity limit of the node exceeded, is expressed as:
Figure BDA0002404399550000085
wherein, N represents a total node set in the central-european-banquet hub-spoke network, N ═ 1, 2.., N }, ρ represents a discount coefficient between hub nodes due to scale efficiency, q represents a hub failure probability, α represents a transportation cost discount coefficient based on a scale effect, β represents a congestion cost coefficient,
Figure BDA0002404399550000091
denotes the capacity limit of the hub k, k being 1,2ijRepresenting the cost per container transport from node city i to node city j,
Figure BDA0002404399550000092
cijcost per kilometer of transportation of unit containers, d, representing node cities i to jijRepresents the distance, w, from node city i to node city jijRepresenting the container traffic, y, from node city i to node city jikRepresenting the allocation of non-pivot nodes, if the node i is allocated to k, then 1 is taken, otherwise 0, y is takenikmjRepresenting the path that the OD flow i → j passes, if the container flow of i → j passes through the junction k → m, then take 1, otherwise take 0, ulkAnd (4) representing alternative pivot decision, if the alternative pivot of the pivot k is l, taking 1, and otherwise, taking 0.
The method takes the conventional transportation cost, the route resetting cost, the goods source loss cost and the congestion cost as influence factors, constructs a total transportation cost objective function, and expresses as follows:
Cs＝CMC+RTRS+FL+CG。
s4, constructing constraint conditions by taking node distribution constraint, path selection constraint, pivot quantity constraint, pure hub and spoke constraint, alternative set constraint and alternative quantity constraint as constraint factors;
in an alternative embodiment of the present invention, the constraints of the present invention include node assignment constraints, path selection constraints, pivot quantity constraints, pure hub and spoke constraints, alternative set constraints, and alternative quantity constraints.
The node allocation constraint takes single allocation as a network topology structure, that is, each non-hub node can be connected with only one hub node, and is represented as:
Figure BDA0002404399550000093
the path selection constraint for traffic from the originating node i to the destination node j to traverse the path needs to include a hub transit k → m, which is expressed as:
Figure BDA0002404399550000094
Figure BDA0002404399550000101
the pivot quantity constraint can be set according to actual needs, and is expressed as:
Figure BDA0002404399550000102
pure hub and spoke constraints, a single distribution hub and spoke network requires that non-hub nodes are not connected with each other, that is, any OD flows are transported in a hub node transfer aggregation mode, and the expression is as follows:
Figure BDA0002404399550000103
and (3) constraint of alternative sets, wherein an alternative node set of a certain pivot node comprises other pivot nodes except the pivot node, and the alternative node set is represented as:
Figure BDA0002404399550000104
and (3) restricting the number of the alternative nodes, wherein each pivot node has one and only one alternative node, and the alternative nodes are expressed as:
Figure BDA0002404399550000105
wherein, p represents the number of the set pivot nodes, and p is less than n.
The method takes node distribution constraint, path selection constraint, pivot quantity constraint, pure hub and spoke constraint, alternative set constraint and alternative quantity constraint as constraint factors to construct constraint conditions of a total transportation cost objective function.
S5, solving the positions of the pivot points, the general node set of the pivot point service and the positions of the alternative points corresponding to the pivot points according to the total transportation cost objective function constructed in the step S3 and the constraint conditions constructed in the step S4.
In an optional embodiment of the present invention, the CP L EX optimization engine is adopted to solve the total transportation cost objective function constructed in step S3 and the constraint condition constructed in step S4, so as to obtain a pivot point position, a general node set of pivot point services, and a pivot point corresponding alternative point position, as shown in table 5, thereby constructing a central european fleet transportation network, as shown in fig. 2.
TABLE 5 pivot site selection and service range measurement data sheet
1 0 0 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0 0 0
0 0 0 0 1 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0 0 0
0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 1 0
The invention provides a foundation method support for traffic and transportation policy making by calculating pivot node selection, alternative node selection and calculating pivot service range in the mode of ' combination of trunk and branch and ' pivot distribution ' of the European class.
It will be appreciated by those of ordinary skill in the art that the embodiments described herein are intended to assist the reader in understanding the principles of the invention, and it is to be understood that the scope of the invention is not to be limited to such specific statements and embodiments. Those skilled in the art can make various other specific changes and combinations based on the teachings of the present invention without departing from the spirit of the invention, and these changes and combinations are within the scope of the invention.

Claims (6)

1. A method for constructing a Zhongoubang train transportation network considering the failure of a hub node is characterized by comprising the following steps:
s1, acquiring middle-European class traffic data among cities;
s2, calculating the transportation cost of unit transportation volume between cities according to the distance data and the freight rate data in the specific time period of the specific city set;
s3, constructing a total transportation cost objective function by taking the conventional transportation cost, the route resetting cost, the goods source loss cost and the congestion cost as influence factors;
s4, constructing constraint conditions by taking node distribution constraint, path selection constraint, pivot quantity constraint, pure hub and spoke constraint, alternative set constraint and alternative quantity constraint as constraint factors;
s5, solving the positions of the pivot points, the general node set of the pivot point service and the positions of the alternative points corresponding to the pivot points according to the total transportation cost objective function constructed in the step S3 and the constraint conditions constructed in the step S4.
2. The method for constructing a central european class transportation network considering hub node failure according to claim 1, wherein the central european class transportation volume data between cities in step S1 is a matrix of container transportation volumes between central european class cities at home and abroad.
3. The method for constructing a central european class transportation network considering hub node failure according to claim 1 or 2, wherein the distance data in step S2 is an extended matrix of transportation distances between cities of the central european class in a domestic and foreign normalized start row, and the freight rate data is a matrix of general freight rates between cities of the central european class in a domestic and foreign normalized start row.
4. The method for constructing a central European class transportation network considering terminal node failure according to claim 3, wherein the regular transportation cost in the step S3 is expressed as:
Figure FDA0002404399540000011
the path reset cost is expressed as:
Figure FDA0002404399540000021
the source loss cost is expressed as:
Figure FDA0002404399540000022
the congestion cost is expressed as:
Figure FDA0002404399540000023
wherein N represents the total node set in the central European Bankson hub and spoke network, ρ represents the discount coefficient generated between the hub nodes due to the scale benefit, q represents the hub failure probability, α represents the transportation cost discount coefficient based on the scale benefit, β represents the congestion cost coefficient,
Figure FDA0002404399540000024
denotes the capacity limit of the hub k, CijRepresenting the cost of transportation of a unit container from node city i to node city j, cijCost per kilometer of transportation of unit containers, d, representing node cities i to jijRepresents the distance, w, from node city i to node city jijRepresenting the container traffic, y, from node city i to node city jikIndicating the assignment of non-pivotal nodes if it is to beThe node i is allocated to k and then takes 1, otherwise takes 0, yikmjRepresenting the path traveled by the OD flow i → j, takes 1 if the container flow of i → j passes through the junction k → m, otherwise takes 0,
Figure FDA0002404399540000025
and (4) representing alternative pivot decision, if the alternative pivot of the pivot k is l, taking 1, and otherwise, taking 0.
5. The method for constructing a central European class transportation network considering terminal node failure according to claim 4, wherein said step S3 is implemented by constructing a total transportation cost objective function expressed as:
Cs＝CMC+RTRS+FL+CG。
6. the method for constructing a central european banbury transportation network in consideration of terminal node failure according to claim 3, wherein said node allocation constraint in step S4 is expressed as:
Figure FDA0002404399540000031
the path selection constraint is expressed as:
Figure FDA0002404399540000032
Figure FDA0002404399540000033
the pivot number constraint is expressed as:
Figure FDA0002404399540000034
the pure hub and spoke constraint is expressed as:
Figure FDA0002404399540000035
the alternative set constraint is expressed as:
Figure FDA0002404399540000036
the alternative quantity constraint is expressed as:
Figure FDA0002404399540000037
wherein p represents the number of the pivot nodes.
CN202010156928.4A 2020-03-09 2020-03-09 Method for constructing Zhongouban transport network considering hub node failure Active CN111475898B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010156928.4A CN111475898B (en) 2020-03-09 2020-03-09 Method for constructing Zhongouban transport network considering hub node failure

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010156928.4A CN111475898B (en) 2020-03-09 2020-03-09 Method for constructing Zhongouban transport network considering hub node failure

Publications (2)

Publication Number Publication Date
CN111475898A true CN111475898A (en) 2020-07-31
CN111475898B CN111475898B (en) 2022-11-01

Family

ID=71748067

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010156928.4A Active CN111475898B (en) 2020-03-09 2020-03-09 Method for constructing Zhongouban transport network considering hub node failure

Country Status (1)

Country Link
CN (1) CN111475898B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113343400A (en) * 2021-06-23 2021-09-03 北京航空航天大学 Cooperative layout optimization method and system for urban group comprehensive passenger transport hub
CN113743852A (en) * 2020-10-30 2021-12-03 北京京东振世信息技术有限公司 Routing method, device, equipment and storage medium
CN114662854A (en) * 2022-02-25 2022-06-24 中铁第一勘察设计院集团有限公司 Oil spill model-based land bridge channel hub node radiation range division method
CN114707918A (en) * 2021-12-07 2022-07-05 西南交通大学 Railway hierarchical node transportation method

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170337813A1 (en) * 2013-03-15 2017-11-23 Donald Warren Taylor Sustained vehicle velocity via virtual private infrastructure
CN109377048A (en) * 2018-10-23 2019-02-22 北京航空航天大学 A kind of comprehensive traffic network hub node selection method
CN109858688A (en) * 2019-01-18 2019-06-07 东南大学 A kind of Container Intermodal Transportation hub location method
US20190303859A1 (en) * 2018-04-03 2019-10-03 Florida A&M University Application of a multi-objective optimization model for automatic vessel scheduling in liner shipping

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170337813A1 (en) * 2013-03-15 2017-11-23 Donald Warren Taylor Sustained vehicle velocity via virtual private infrastructure
US20190303859A1 (en) * 2018-04-03 2019-10-03 Florida A&M University Application of a multi-objective optimization model for automatic vessel scheduling in liner shipping
CN109377048A (en) * 2018-10-23 2019-02-22 北京航空航天大学 A kind of comprehensive traffic network hub node selection method
CN109858688A (en) * 2019-01-18 2019-06-07 东南大学 A kind of Container Intermodal Transportation hub location method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
王帮俊等: "考虑枢纽点失效和拥堵情形的轴辐式物流网络设计研究", 《工业工程与管理》 *
闫妍等: "基于节点失效的弹性供应链应急管理策略", 《控制与决策》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113743852A (en) * 2020-10-30 2021-12-03 北京京东振世信息技术有限公司 Routing method, device, equipment and storage medium
CN113343400A (en) * 2021-06-23 2021-09-03 北京航空航天大学 Cooperative layout optimization method and system for urban group comprehensive passenger transport hub
CN114707918A (en) * 2021-12-07 2022-07-05 西南交通大学 Railway hierarchical node transportation method
CN114707918B (en) * 2021-12-07 2023-04-07 西南交通大学 Railway hierarchical node transportation method
CN114662854A (en) * 2022-02-25 2022-06-24 中铁第一勘察设计院集团有限公司 Oil spill model-based land bridge channel hub node radiation range division method

Also Published As

Publication number Publication date
CN111475898B (en) 2022-11-01

Similar Documents

Publication Publication Date Title
CN111475898B (en) Method for constructing Zhongouban transport network considering hub node failure
CN107194128B (en) Multi-mode public transport network design method based on central radiation type network framework
CN112837172B (en) Power distribution network post-disaster first-aid repair decision method considering information fusion of traffic network and power distribution network
CN107832958A (en) A kind of electric taxi charging station planing method based on demand analysis
CN103745277A (en) Rail transit connection public transit network optimizing system
CN112418610B (en) Charging optimization method based on fusion of SOC information and road network power grid information
CN106530180A (en) High-cold region charging service network planning method
CN101187996A (en) A quick bus line selection algorithm based on self-adapted backbone network
CN110493844A (en) The data fusion Game with Coalitions method and system of Wireless Sensor Networks
Li et al. Efficiency evaluation of bus transport operations given exogenous environmental factors
Kirci A novel model for vehicle routing problem with minimizing CO2 emissions
CN101616085A (en) A kind of constraint route generating method and device
CN112070334A (en) Multi-intelligent-theory-based charging and battery-changing station coordination planning method and system
CN106741018A (en) A kind of train based on network evolution starts control method and system
Xinfeng et al. Route selection for railway passengers: a multi-objective model and optimization algorithm
Zhang et al. Analysis of Guangzhou metro network based on L-space and P-space using complex network
Zhu et al. Research on location of comprehensive passenger transport hub in small and medium-sized cities based on MIP model
Xu et al. Model and algorithm of optimizing bus transit network based on line segment combination
Liu et al. Park and ride practice in Shanghai
CN104572861A (en) Bus information inquiry method and system
Wei et al. A last-mile delivery system for underground logistics with “self-pickup+” and “home-entry+” modes
CN111832882B (en) Traffic control method and device, storage medium and electronic equipment
Wang et al. Regional logistics network reliability evaluation and optimization
Cheng et al. Notice of Retraction: Optimal Route Model for Urban Transit Network and Research on Its Algorithm
Cheng et al. Structural Characteristics and Evolution Regularity of Urban Rail Transit Network: A Case Study of Xi’an, China

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
TA01 Transfer of patent application right

Effective date of registration: 20220805

Address after: 610031 north section of two ring road, Sichuan, Chengdu

Applicant after: SOUTHWEST JIAOTONG University

Applicant after: China National Railway Group Co.,Ltd.

Address before: 610031 north section of two ring road, Sichuan, Chengdu

Applicant before: SOUTHWEST JIAOTONG University

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant