CN109961252A - Underground logistics network system based on fractal dynamic growth and construction method - Google Patents
Underground logistics network system based on fractal dynamic growth and construction method Download PDFInfo
- Publication number
- CN109961252A CN109961252A CN201910053352.6A CN201910053352A CN109961252A CN 109961252 A CN109961252 A CN 109961252A CN 201910053352 A CN201910053352 A CN 201910053352A CN 109961252 A CN109961252 A CN 109961252A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- level node
- ground
- underground
- 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
- 238000010276 construction Methods 0.000 title abstract description 18
- 210000004027 cell Anatomy 0.000 claims description 21
- 238000000034 method Methods 0.000 claims description 17
- 206010057249 Phagocytosis Diseases 0.000 claims description 8
- 230000008782 phagocytosis Effects 0.000 claims description 8
- 238000005457 optimization Methods 0.000 claims description 6
- 230000000242 pagocytic effect Effects 0.000 claims description 6
- 210000001539 phagocyte Anatomy 0.000 claims description 6
- 238000005284 basis set Methods 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 claims description 3
- 210000000805 cytoplasm Anatomy 0.000 claims description 2
- 238000012423 maintenance Methods 0.000 description 6
- 230000032258 transport Effects 0.000 description 5
- 238000013461 design Methods 0.000 description 4
- 238000011161 development Methods 0.000 description 3
- 230000018109 developmental process Effects 0.000 description 3
- 230000000903 blocking effect Effects 0.000 description 1
- 238000004140 cleaning Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 201000010099 disease Diseases 0.000 description 1
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000002427 irreversible effect Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000000116 mitigating effect Effects 0.000 description 1
- 238000004642 transportation engineering Methods 0.000 description 1
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
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
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 an underground logistics network system based on fractal dynamic growth, which comprises a logistics park, a primary node and a secondary node, and also provides a construction method of the underground logistics system.
Description
Technical field
The present invention relates to underground space developments and application and Communication and Transportation Engineering field, are related to a kind of Urban Underground logistics
System.
Background technique
To solve urban development problem, urban sustainable development is realized, construction smart city has become world today city
Develop an irreversible historical trend.The appearance of underground logistics is to alleviate urban disease, accelerates Urbanization Construction, and construction intelligence
Intelligent city is filled with new vitality.
Underground Logistic System refers to the transport of urban inner and intercity underground piping or tunnel by similar subway
And supply system.It is not take up surface road, alleviates the traffic pressure of surface road, to alleviate urban traffic blocking；It
Using cleaning power, effectively mitigation municipal pollution；It is not interfered by external condition, is transported relatively reliable, efficient.Underground logistics
System is not take up surface road, mitigates municipal pollution while capable of alleviating urban transportation, on solving Urban Traffic Jam Based
With great potential.Underground Logistic System is a kind of effective form that urban underground space resource utilizes, and the following construction ground
One of the final goal that lower city is realized.But how to realize that the underground Logistics Network System of above-mentioned anticipation incorporates instantly
Urban construction in be a problem to be solved.
Summary of the invention
Goal of the invention: it is an object of the present invention to provide one kind can incorporate the underground logistics network system in city instantly
System.
Another object of the present invention is to provide a kind of constructing method of underground Logistics Network System, can be to underground logistics
The underground logistics node location and orbital path of system optimize, and effectively reduce ground logistics under the premise of controlling construction cost
The pressure of transport and traffic.
Technical solution: for achieving the above object, following technical side can be used in underground Logistics Network System of the present invention
Case:
It is a kind of based on the underground Logistics Network System for dividing shape dynamic growth, comprising:
Logistics Park: to connect first nodes and mutually transmit cargo with first nodes；
First nodes: it accepts and is sent to other first nodes or one's respective area after being sorted after Logistics Park cargo
Two-level node, service radius r1, cargo day handling capacity in above and below ground is q1；
Two-level node: entrance or outlet as underground Logistics Network System, level-one of the two-level node with one's respective area
Node or two-level node are connected, and two-level node service radius is r2, cargo day handling capacity in above and below ground is q2；
Ground based terminal: connection two-level node is simultaneously located within two-level node service range, travels to and fro between ground by ground dispatching
Between face terminal and two-level node；The day freight demand for remembering i-th of ground based terminal is pi, and piLess than q1, piLess than q2。
Further, r1=3000 meters, q1=4000 tons, r2=3000 meters, q2=3000 tons.
The utility model has the advantages that Logistics Network System structure in underground of the present invention is simple, be conducive to current urban underground space into
Row construction is transformed urban underground space.
And following technical side can be used in the constructing method of the above-mentioned underground Logistics Network System based on point shape dynamic growth
Case, comprising:
A. the calculating of alternative first nodes,
B. alternative two-level node calculates,
C. it is dynamically connected to one of them optimal two-level node by selected first nodes, and set therebetween
Glove trajectory road,
D. all first nodes are traversed in the limited situation of scale and combine the network grown with it, are found out and are met optimization
That optimal scheme of target.
Further, step a further comprises following sub-step,
(a1) it is carried out in a manner of cell phagocytosis, regards the ground based terminal cell different as each quality, freight demand is thin
Cytoplasm amount；
(a2) first using wherein any one ground based terminal as initial cell, within the limit of power of oneself as far as possible
Other cells of more phagocytosiss；
(a3) phagocytic activity meets two standards, first is that the cell group energy after being annexed is r by radius1Circle covering, two
It is ∑ pi≤q1；
(a4) annexation calculating is carried out as initial cell using different ground endpoints, finally obtains alternative first nodes.
Further, step b further comprises following sub-step,
(b1) after selecting four first nodes, remove what this four first nodes were serviced in all ground based terminals
Ground based terminal carries out cluster calculation to remaining ground based terminal with same cell phagocytosis method, and phagocytic activity is limited in physics half
Diameter r2Within and quality ∑ pi≤q2, to obtain two-level node group；
(b2) the node collection that minimum number is found in M two-level node, if basis set S={ e1,e2,e3,…,eM, eiTable
Show ground based terminal, SmIt is the cluster subset of S, is alternative two-level node；
Remember index setIfThen claimIt is covered for the set of S, such asIt is S
One set covering；
It is now to make index set J small as far as possible, for each subset Sj, judgment variable is introduced,
Establish the 0-1 judgment models LP for combining covering problem as follows:
xj=0,1, j=1,2 ..., M；
The intlinprog function for reusing matlab solves the optimal solution of the problem, to obtain alternative second level
Node.
Further, step c further comprises following sub-step,
(c1) a most suitable connecting node is looked in the two-level node that step b is completed；Remember alternative second level section
Point is Newi, already existing first nodes or two-level node are Existj；
(c2) valuation functions, Fix are establishedij=Fix (Newi,Existj)；
Assessment factor has unicity I, volume of goods transported C, distance d, cargo roading density D；
Unicity refers to, NewiNode is to ExistjThe volume of goods transported of the affiliated garden of node is divided by its shipping to all nodes
Amount, for embodying NewiThe garden belongingness of node；
The volume of goods transported refers to, NewiThe underground of node is handled up total amount；
Distance refers to NewiThe central point for the phagocyte that the ground based terminal of node serve is formed is to ExistjNode serve
The distance of the central point for the phagocyte that the terminal on ground is formed, apart from smaller more preferential foundation；
(c3) assessment distance is optimized
Wherein d ' indicates assessment distance, and d indicates actual range to be less than in actual rangeWhen, assess distance
Difference is not very greatly, when actual range is greater than r2When, assessment distance is just exponentially increased；
Cargo roading density refers to the underground cargo total amount of the affiliated garden exist divided by the current tube of the garden
Road length；
(c4) it is directly calculated using valuation functions:
New corresponding to maximum score is found in grade formi, ExistjThe two new and old sections as interconnected
Point, and their distance is contributed into route track length L.
The utility model has the advantages that design takes into account construction the invention discloses a kind of constructing method for underground Logistics Network System
The underground logistics node location and Path selection design method of timing, this method, which has, to be similar to the no regularity for dividing shape and moves
State property can satisfy in different environmental requirements.The logistics network main purpose that this method generates is to meet following design to want
It asks, first is that controlling logistics tunnel construction as far as possible under conditions of making logistics network service range cover all demand points
With the cost of the construction of logistics node.Second is that design logistics network service range is enabled to cover all demand points, make
By underground logistics network service to the traffic congestion situation of demand point range be eased, and circulation of traffic degree reaches
It is required to preparatory.Third is that provide the construction timing of logistics network simultaneously, enable logistics network construction at the same time
There is the volume of goods transported as big as possible it is expected on scale.
Detailed description of the invention
The location map of Fig. 1 Logistics Park and ground based terminal.
Fig. 2 Underground Logistic System Logistics Park and first nodes distribution map.
Fig. 3 Underground Logistic System node path planning chart.
The underground Fig. 4 logistics network builds timing diagram.
Specific embodiment
It is combined shown in Fig. 1 to Fig. 3, and the present invention provides a kind of underground Logistics Network System based on point shape dynamic growth,
Include:
Logistics Park: to connect first nodes and mutually transmit cargo with first nodes；
First nodes: it accepts and is sent to other first nodes or one's respective area after being sorted after Logistics Park cargo
Two-level node, service radius r1, cargo day handling capacity in above and below ground is q1；
Two-level node: entrance or outlet as underground Logistics Network System, level-one of the two-level node with one's respective area
Node or two-level node are connected, and two-level node service radius is r2, cargo day handling capacity in above and below ground is q2；
Ground based terminal: connection two-level node is simultaneously located within two-level node service range, travels to and fro between ground by ground dispatching
Between face terminal and two-level node；The day freight demand for remembering i-th of ground based terminal is pi, and piLess than q1, piLess than q2.At this
In embodiment, r is taken1=3000 meters, q1=4000 tons, r2=3000 meters, q2=3000 tons.
According to type difference, comprehensive cost is divided into following several:
1) by the underground rail expense of garden to each first nodes, day depreciation cost and maintenance expense add up to daily GF1。
2) each first nodes underground rail interconnected, day depreciation cost and maintenance expense add up to daily GF2。
3) each two-level node underground rail interconnected, day depreciation cost and maintenance expense add up to daily GF3。
4) first nodes day amortization charge and maintenance cost add up to daily NF1。
5) two-level node day amortization charge and maintenance cost add up to daily NF2。
6) the energy consumption expense of cargo transport calculates inside maintenance expense.
The transport of shipping and the transhipment of node have been optimized in terms of default operation management, and Transport Rate can bear model
Within enclosing, then with the angle of statistics expense averagely arrived daily, the laying cost of the unit length of track is 400,000,000 yuan/kilometer.
By service life 100 years, can obtain day amortization charge be 1.1 ten thousand yuan/day kilometers, 1.5 hundred million yuan of single first nodes construction cost/
A and single 100,000,000 yuan/of two-level node construction cost, service life are 100 years, and day amortization charge can be obtained by, which being computed, is respectively
0.41 ten thousand yuan/day, 0.27 ten thousand yuan/day.And our optimization aim is, in the requirement for meeting ground based terminal freight demand
Under, the length of track and the quantity of logistics node are reduced, as far as possible to reach the minimum of comprehensive cost.
As shown in Figures 1 to 4, present invention simultaneously provides the optimization construction sides of above-mentioned Urban Underground postal transportation networks
Method is carried out the selection of underground logistics node and the planning in path with dividing the randomness and dynamic of shape simultaneously.In timing,
Start node is spread to region with a point shape, this method comprises:
A. the calculating of alternative first nodes,
B. alternative two-level node calculates,
C. it is dynamically connected to one of them optimal two-level node by selected first nodes, and set therebetween
Glove trajectory road,
D. all first nodes are traversed in the limited situation of scale and combine the network grown with it, are found out and are met optimization
That optimal scheme of target.
Details are as follows for each step:
Step a further comprises following sub-step,
(a1) it is carried out in a manner of cell phagocytosis, regards the ground based terminal cell different as each quality, freight demand is it
Quality.
(a2) first using wherein any one ground based terminal as initial cell, within the limit of power of oneself as far as possible
Other cells of more phagocytosiss.
(a3) phagocytic activity is there are two standard, and one is that physical extent cannot be too big, that is, the cell group energy after being annexed
It is r by radius1Circle covering, second is that quality cannot be too big, i.e. ∑ pi≤q1。
(a4) annexation calculating is carried out as initial cell using different ground endpoints, finally obtains alternative first nodes.
Step b further comprises following sub-step,
(b1) after selecting four first nodes, remove what this four first nodes were serviced in all ground based terminals
Ground based terminal carries out cluster calculation to remaining ground based terminal with same cell phagocytosis method, and phagocytic activity is limited in physics half
Diameter r2Within and quality ∑ pi≤q2, to obtain two-level node group.Than if any N number of ground based terminal, then two-level node group is a
Number at most has N number of.
(b2) it is now to find the node collection of minimum number in this M two-level node, their union is covered
To all ground based terminals to be serviced.If basis set S={ e1,e2,e3,…,eM, eiIndicate ground based terminal, SmIt is the cluster of S
Subset is alternative two-level node.
Remember index setIfThen claimIt is covered for the set of S, such asIt is S
One set covering.
It is now to make index set J small as far as possible, for each subset Sj, judgment variable is introduced,
Establish the 0-1 judgment models LP for combining covering problem as follows:
xj=0,1, j=1,2 ..., M (4)
Wherein constraint equation (3) indicates each element e in SiAll at least it is aggregated covering SjA certain collection in (j ∈ J)
Conjunction covers.
The intlinprog function for reusing matlab solves the optimal solution of the problem.To obtain alternative two
Grade node.
Step c further comprises following sub-step,
(c1) a most suitable connecting node is looked in the two-level node that b step is completed.An assessment table is established,
Remember that alternative two-level node is Newi, already existing node (level-one or second level) is Existj.Abscissa expression has existed
Node, ordinate be alternative two-level node to be connected.
(c2) valuation functions, Fix are establishedij=Fix (Newi,Existj)
Assessment factor has unicity (I), the volume of goods transported (C), distance (d), cargo roading density (D).
Unicity refers to, NewiNode is to ExistjThe volume of goods transported of the affiliated garden of node is divided by its shipping to all nodes
Amount, for embodying NewiThe garden belongingness of node.
The volume of goods transported refers to, NewiThe underground of node is handled up total amount.New is built for embodyingiThe urgency of node.Handling capacity
More bigger, more preferential construction.
Distance refers to NewiThe central point for the phagocyte that the ground based terminal of node serve is formed is to ExistjNode serve
The distance of the central point for the phagocyte that the terminal on ground is formed, apart from smaller more preferential foundation.Using the inverse of distance.It examines
Consider the Similarity Principle of distance,
(c3) assessment distance is optimized
Wherein d ' indicates assessment distance, and d indicates actual range to be less than in actual rangeWhen, assess distance
Difference is not very greatly, when actual range is greater than r2When, assessment distance is just exponentially increased.
Cargo roading density refers to the underground cargo total amount of the affiliated garden exist divided by the current tube of the garden
Road length.When assessment, the index the big more preferred growth node.And road tunnel is long after having grown a new node
Degree increases, which reduces, as Growth trends change.
(c4) it is directly calculated using valuation functions:
New corresponding to maximum score is found in grade formi, ExistjThe two new and old sections as interconnected
Point, and their distance is contributed into route track length L.
(d) all first nodes are traversed in the limited situation of scale and combine the network grown with it, are found out and are met optimization
That the smallest scheme of target, that is, overall cost.
Claims (6)
1. a kind of based on the underground Logistics Network System for dividing shape dynamic growth characterized by comprising
Logistics Park: to connect first nodes and mutually transmit cargo with first nodes；
First nodes: the second level section of other first nodes or one's respective area is sent to after being sorted after undertaking Logistics Park cargo
Point, service radius r1, cargo day handling capacity in above and below ground is q1；
Two-level node: entrance or outlet as underground Logistics Network System, first nodes of the two-level node with one's respective area
Or two-level node is connected, two-level node service radius is r2, cargo day handling capacity in above and below ground is q2；
Ground based terminal: connection two-level node is simultaneously located within two-level node service range, travels to and fro between ground end by ground dispatching
Between end and two-level node；The day freight demand for remembering i-th of ground based terminal is pi, and piLess than q1, piLess than q2。
2. underground Logistics Network System according to claim 1, which is characterized in that r1=3000 meters, q1=4000 tons, r2
=3000 meters, q2=3000 tons.
3. it is a kind of according to claim 1 or the constructing method based on the underground Logistics Network System for dividing shape dynamic growth in 2, it is special
Sign is, comprising:
A. the calculating of alternative first nodes,
B. alternative two-level node calculates,
C. it is dynamically connected to one of them optimal two-level node by selected first nodes, and logistics is set therebetween
Track,
D. all first nodes are traversed in the limited situation of scale and combine the network grown with it, are found out and are met optimization aim most
That excellent scheme.
4. constructing method according to claim 3, which is characterized in that
Step a further comprises following sub-step,
(a1) it is carried out in a manner of cell phagocytosis, regards the ground based terminal cell different as each quality, freight demand is cytoplasm
Amount；
(a2) as much as possible within the limit of power of oneself to gulp down first using wherein any one ground based terminal as initial cell
Bite other cells；
(a3) phagocytic activity meets two standards, first is that the cell group energy after being annexed is r by radius1Circle covering, second is that ∑ pi
≤q1；
(a4) annexation calculating is carried out as initial cell using different ground endpoints, finally obtains alternative first nodes.
5. constructing method according to claim 3, which is characterized in that
Step b further comprises following sub-step,
(b1) after selecting four first nodes, it is whole to remove the ground that this four first nodes are serviced in all ground based terminals
End carries out cluster calculation to remaining ground based terminal with same cell phagocytosis method, and phagocytic activity is limited in physical radius r2It
Interior and quality ∑ pi≤q2, to obtain two-level node group；
(b2) the node collection that minimum number is found in M two-level node, if basis set S={ c1, e2, e3..., eM, eiIndicate ground
Face terminal, SmIt is the cluster subset of S, is alternative two-level node；
Remember index setIfThen claimIt is covered for the set of S, such asIt is one of S
Set covering；
It is now to make index set J small as far as possible, for each subset Sj, judgment variable is introduced,Establish following knot
Close the 0-1 judgment models LP of covering problem:
xj=0,1, j=1,2 ..., M；
The intlinprog function for reusing matlab solves the optimal solution of the problem, to obtain alternative two-level node.
6. constructing method according to claim 3, which is characterized in that
Step c further comprises following sub-step,
(c1) a most suitable connecting node is looked in the two-level node that step b is completed；Remember that alternative two-level node is
Newi, already existing first nodes or two-level node are Existj；
(c2) valuation functions, Fix are establishedij=Fix (Newi, Existj)；
Assessment factor has unicity I, volume of goods transported C, distance d, cargo roading density D；
Unicity refers to, NewiNode is to ExistjThe volume of goods transported of the affiliated garden of node, to the volume of goods transported of all nodes, is used divided by it
To embody NewiThe garden belongingness of node；
The volume of goods transported refers to, NewiThe underground of node is handled up total amount；
Distance refers to NewiThe central point for the phagocyte that the ground based terminal of node serve is formed is to ExistjNode serve ground
The distance of the central point for the phagocyte that terminal is formed, apart from smaller more preferential foundation；
(c3) assessment distance is optimized
Wherein d ' indicates assessment distance, and d indicates actual range to be less than in actual rangeWhen, assess the difference of distance
It is not very greatly, when actual range is greater than r2When, assessment distance is just exponentially increased；
Cargo roading density refers to that the underground cargo total amount of the affiliated garden exist is long divided by the current road tunnel of the garden
Degree；
(c4) it is directly calculated using valuation functions:
New corresponding to maximum score is found in grade formi, ExistjThe two new and old nodes as interconnected, and will
Their distance contributes to route track length L.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910053352.6A CN109961252B (en) | 2019-01-21 | 2019-01-21 | Underground logistics network system based on fractal dynamic growth and construction method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910053352.6A CN109961252B (en) | 2019-01-21 | 2019-01-21 | Underground logistics network system based on fractal dynamic growth and construction method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109961252A true CN109961252A (en) | 2019-07-02 |
| CN109961252B CN109961252B (en) | 2023-09-19 |
Family
ID=67023569
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910053352.6A Active CN109961252B (en) | 2019-01-21 | 2019-01-21 | Underground logistics network system based on fractal dynamic growth and construction method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109961252B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090089145A1 (en) * | 2007-09-28 | 2009-04-02 | Paul Edward Kent | Freight transport logistics performance modeling software system and process |
| CN107967590A (en) * | 2017-12-13 | 2018-04-27 | 浙江理工大学 | A kind of optimization constructing method of Urban Underground Logistics System |
-
2019
- 2019-01-21 CN CN201910053352.6A patent/CN109961252B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090089145A1 (en) * | 2007-09-28 | 2009-04-02 | Paul Edward Kent | Freight transport logistics performance modeling software system and process |
| CN107967590A (en) * | 2017-12-13 | 2018-04-27 | 浙江理工大学 | A kind of optimization constructing method of Urban Underground Logistics System |
Non-Patent Citations (2)
| Title |
|---|
| 胡万杰等: "基于综合效益的城市地下物流网络设计与优化方法", 《数学的实践与认识》 * |
| 颜冰等: "构建地下物流系统网络", 《数学的实践与认识》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109961252B (en) | 2023-09-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102880921B (en) | A kind of electric automobile charging station Optimization Method for Location-Selection | |
| CN109934382B (en) | Multistage subway freight network system based on shaft-amplitude layout and construction method | |
| CN105225503B (en) | Traffic control sub-district optimizes and self-adapting regulation method | |
| CN110874704A (en) | Floyd algorithm-based emergency rescue traffic path optimization method | |
| CN107766994A (en) | A kind of shared bicycle dispatching method and scheduling system | |
| Li et al. | Direct vehicle-to-vehicle charging strategy in vehicular ad-hoc networks | |
| CN107833002A (en) | Multistage low-carbon logistics distribution network planing method based on collaboration multi-objective Algorithm | |
| CN111401614A (en) | Dynamic passenger flow distribution method and system for urban rail transit | |
| CN112668129B (en) | Space load clustering-based intelligent grid dividing method for power distribution network | |
| CN107274035A (en) | A kind of transportation network and the method for electric automobile charging station coordinated planning | |
| CN107967590A (en) | A kind of optimization constructing method of Urban Underground Logistics System | |
| CN107730049A (en) | Electric vehicle rapid charging optimal location system of selection | |
| CN107872354A (en) | A kind of method for optimizing route for zonal flow rate complex network | |
| CN111063191B (en) | Departure frequency and line network structure combined optimization method for bus line network design | |
| CN101782986A (en) | Logistic distribution partitioning balance optimizing method based on immune algorithm | |
| CN112990564A (en) | Method for planning task network point mixed route of coffer boot | |
| CN110895749B (en) | Positioning-path planning method for emergency logistics | |
| CN117151482A (en) | Emergency material scheduling and path planning method based on multi-objective optimization | |
| CN109961252A (en) | Underground logistics network system based on fractal dynamic growth and construction method | |
| CN109697590A (en) | A kind of city distribution vehicle driving monitoring system based on big data | |
| US20240203264A1 (en) | Methods and internet of things systems for managing garbage treatment device in smart cities | |
| CN111882137B (en) | Charging facility optimization planning method considering consumption of pressure energy of natural gas pipe network | |
| Baron et al. | Vehicles as big data carriers: Road map space reduction and efficient data assignment | |
| CN109543917B (en) | Underground logistics system network planning method based on 0-1 planning and prim algorithm | |
| Wang et al. | Stochastic dynamic location-routing-inventory problem in closed-loop logistics system for reusing end-of-use products |
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 |