CN107633318A - A kind of newly-increased public bus network Optimization Design based on time generic line - Google Patents
A kind of newly-increased public bus network Optimization Design based on time generic line Download PDFInfo
- Publication number
- CN107633318A CN107633318A CN201710533322.6A CN201710533322A CN107633318A CN 107633318 A CN107633318 A CN 107633318A CN 201710533322 A CN201710533322 A CN 201710533322A CN 107633318 A CN107633318 A CN 107633318A
- Authority
- CN
- China
- Prior art keywords
- link
- station
- section
- road
- length
- 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.)
- Pending
Links
Landscapes
- Navigation (AREA)
Abstract
The present invention provides a kind of newly-increased public bus network Optimization Design based on time generic line of time generic line, shortest path is solved by application dijkstra's algorithm, and during search, direction of search angle is added to limit the scope of search, the direction of search is allowed to be maintained near start and end space of points line, reduce the search of unnecessary website, accelerate algorithm the convergence speed, simultaneously limit irrational bending of public bus network, roundabout phenomenon, enable non-linear coefficient one preferably in the range of.In addition, newly-increased public bus network optimization specifies beginning and end by owner, therefore when Dijstra algorithms are when the point searched is terminal, you can terminate search, without calculating other unnecessary points.
Description
Technical field
The present invention relates to wisdom traffic technical field, in particular to a kind of newly-increased public transport based on time generic line
Line optimization design method.
Background technology
City bus is the important carrying in city " modern service industry ".Urban public bus lines optimize, in particular for newly-increased
The optimization design of the public bus network added, it is by changing public transport path, bus station under conditions of existing city bus resource
The controlled conditions such as position, bus departure frequency, to improve public transport operation efficiency, lift the main of public transport attraction trip share rate
Method.
The content of the invention
Present invention aims at a kind of newly-increased public bus network Optimization Design based on time generic line is provided, realize
To the optimization design for the time generic line for increasing public bus network newly.
According to disclosure of the invention, a kind of newly-increased public bus network Optimization Design based on time generic line is proposed,
Comprise the steps：
Step0 reception starting points, endpoint data, website number and circuit types data are multiplexed, first determine whether table MD_NEW_BUS_
Whether the basic data version time in ROUTE_INPUT and basic data version time in table BASIC_ROAD_NET are identical,
If it is different, optimize；If identical, judge whether starting point, terminal, circuit types, multiplexing website number have historical record, if so,
Historical record is returned, if nothing, is optimized；
Step1 judges circuit types based on the optimisation strategy apart from generic line：
When circuit types is main transit line, into Step2；
When circuit types is public transport time main line, into Step5；
When circuit types is public transport branch road/in unlimited time, into Step7；
Step2 chooses the chain that link type is 01,02,07,08,09,10,00 from basic road network BASIC_ROAD_NET
Road composition public bus network optimization road network, the weight using run time as side, according to multiplexing website number, selection target function, is called
Route optimization algorithm, into Step3；
Step3 judges to chain the type of node, when the node type for linking both sides it is all 2 when, into Step4；When
It is 1 i.e. intersection to have node type, then merges the link using the intersection link coupled as node, make the chain after merging
The link type for connecing both sides is 2；The length linked after merging is calculated, into Step4；
Step4 judges the length 1500 of every link>=LINK_LENGTH>Whether=800 set up, if so, do not do then
Processing；If less than 800, the link at the station at the link two is taken, and the link is merged with obtained shorter linking, it is middle
Station is designated as needing the station given up；If more than 1500 meters, the link is put into the link-group for needing newly-increased website.Link is pressed
Result table is sequentially outputted to according to route optimization algorithm, with ", " segmentation；
Step5 chooses the link that link type is 02,03,10,11,00 and formed from basic road network BASIC_ROAD_NET
Public bus network optimizes road network, the weight using run time after amendment as side, according to multiplexing website number, selection target function, calls
Route optimization algorithm, into Step6；
Step6 judges the length 500 of every link<=LINK_LENGTH<Whether=800 set up, if so, do not do then
Processing；If less than 500 meters, the link at the station at the link two is taken, and the link is merged with obtained shorter linking, in
Between station be designated as needing the station given up；If more than 800 meters, the link is put into the link-group for needing newly-increased website；Finally
Link after will be treated is sequentially outputted to result table according to route optimization algorithm, with ", " segmentation；
Step7 is in basic road network BASIC_ROAD_NET, the weight using run time after amendment as side, according to multiplexing website
Number, selection target function, route optimization algorithm is called, into Step8；
Step8 judges the length LINK_LENGTH of every link<Whether 500 set up, if so, do not process then；If no
Set up, then the link is put into the link-group for needing newly-increased website；And by the link after processing according to the suitable of route optimization algorithm
Sequence is output to result table, with ", " segmentation；
Step9 calculates line length：In the link-group of circuit is obtained, the length of all-links is summed, as line
The physical length l on roadR；
Step10 calculates non-linear coefficient：The sky between actual track length and first and last station between public bus network first and last station
Between air line distance ratio ηR：
ηR=lR/dR
Wherein：
ηRLine R non-linear coefficient is represented respectively
lR：Circuit R length
dR：Circuit R starting point, the air line distance between terminal
Step11 calculates multiple number of lines：Multiple number of lines where circuit is passed through into website in road section ID takes out, and summation, removes
With the multiple number of lines of all section numbers, as this circuit；
Step12 calculates run time
For main transit line, run time is the run time sum of all-links；For public transport time main line and public transport
Branch line, run time are run time sum after the amendment of all-links.
In further embodiment, the route optimization algorithm is the optimization method based on dijkstra's algorithm, specific bag
Include：
The initial seasonal S={ V0 } of Step1.1, T=V-S={ remaining summit }, Q={ is abandoned a little }, and d is vertex correspondence in T
Distance value, V are that the finite nonempty set on all summits closes, and the finite set side collection of relation is defined as E between summit, and summit is each
Bus station, the connection section between website are to link, and turn into side；
If in the presence of<V0,Vj>, d (V0, Vj) is<V0,Vj>Weights on arc
If it is not present<V0,Vj>, d (V0, Vj) is ∞
Step1.2 chooses the summit W of a side relevant with summit in S and target function value minimum from T, first determines whether
Whether W is terminal, if terminal, is terminated；
If not terminal, continues to judge whether W meets deflection mechanism, if satisfied, being added in S, turns Step1.3；If
Deflection mechanism is unsatisfactory for, is put into Q, turns Step1.2；
Step1.3 chooses a fixed W relevant with summit in S and that target function value is minimum from T, adds in S, turns
Step1.4；
Step1.4 modifies to the distance value on summit in remaining T：If adding W makees intermediate vertex, the distance from V0 to Vi
Value shortens, then changes this distance value；
Repeat the above steps 1.2,1.3, all summits are included in terminal or S until finding, i.e. untill W=Vi.
By above technical scheme, the present invention realizes newly-increased public transport using path optimization's algorithm based on dijkstra's algorithm
The optimization design of circuit, dijkstra's algorithm apply greedy algorithm pattern, are best solution shortest paths generally acknowledged at present
Method.What algorithm solved is that to the shortest route problem on other summits, it is mainly characterized by every time single source point in digraph
The next summit selected during iteration is summit nearest apart from source point outside mark point.But because dijkstra algorithm is mainly counted
Calculate from source point to other shortest path a little, the bus station enormous amount in transit network planning system, so algorithm
It is less efficient.For this during search, in implementation process of the invention, we add direction of search angle to limit search
Scope, allow the direction of search to be maintained near start and end space of points line, reduce the search of unnecessary website, accelerate algorithmic statement
Speed, another benefit of the way is the irrational bending for limiting public bus network, roundabout phenomenon, non-linear coefficient is existed
One preferably in the range of.In addition, newly-increased public bus network optimization specifies beginning and end by owner, therefore when Dijstra is calculated
When the point searched is terminal, we can terminate to search for method, without calculating other unnecessary points.
It should be appreciated that as long as all combinations of aforementioned concepts and the extra design described in greater detail below are at this
Sample design it is not conflicting in the case of can be viewed as the disclosure subject matter a part.In addition, required guarantor
All combinations of the theme of shield are considered as a part for the subject matter of the disclosure.
Can be more fully appreciated from the following description with reference to accompanying drawing present invention teach that foregoing and other aspect, reality
Apply example and feature.The feature and/or beneficial effect of other additional aspects such as illustrative embodiments of the present invention will be below
Description in it is obvious, or by according to present invention teach that embodiment practice in learn.
Brief description of the drawings
Accompanying drawing is not intended to drawn to scale.In the accompanying drawings, each identical or approximately uniform group shown in each figure
It can be indicated by the same numeral into part.For clarity, in each figure, not each part is labeled.
Now, by example and the embodiment of various aspects of the invention will be described in reference to the drawings, wherein：
Fig. 1 is showing for the newly-increased public bus network Optimization Design according to embodiments of the present invention based on time generic line
It is intended to.
Fig. 2 is the principle schematic of Dijstra algorithm flows.
Fig. 3 is Dijstra algorithms citing exemplary plot.
Fig. 4 is link construction method schematic diagram.
Fig. 5 is the recommended value schematic diagram of multiple line coefficient.
Fig. 6 is the schematic diagram of deflection mechanism.
Fig. 7 is route optimization algorithm flow schematic diagram.
Embodiment
In order to know more about the technology contents of the present invention, especially exemplified by specific embodiment and institute's accompanying drawings are coordinated to be described as follows.
Each side with reference to the accompanying drawings to describe the present invention in the disclosure, shown in the drawings of the embodiment of many explanations.
It is not intended to cover all aspects of the invention for embodiment of the disclosure.It should be appreciated that a variety of designs presented hereinbefore and reality
Apply example, and those designs described in more detail below and embodiment can in many ways in any one come it is real
Apply, because design disclosed in this invention and embodiment are not limited to any embodiment.In addition, disclosed by the invention one
A little aspects can be used alone, or otherwise any appropriately combined be used with disclosed by the invention.
With reference to shown in Fig. 1, a kind of newly-increased public bus network Optimization Design based on time generic line, including following steps
Suddenly：
Step0 reception starting points, endpoint data, website number and circuit types data are multiplexed, first determine whether table MD_NEW_BUS_
Whether the basic data version time in ROUTE_INPUT and basic data version time in table BASIC_ROAD_NET are identical,
If it is different, optimize；If identical, judge whether starting point, terminal, circuit types, multiplexing website number have historical record, if so,
Historical record is returned, if nothing, is optimized；
Step1 judges circuit types based on the optimisation strategy apart from generic line：
When circuit types is main transit line, into Step2；
When circuit types is public transport time main line, into Step5；
When circuit types is public transport branch road/in unlimited time, into Step7；
Step2 chooses the chain that link type is 01,02,07,08,09,10,00 from basic road network BASIC_ROAD_NET
Road composition public bus network optimization road network, the weight using run time as side, according to multiplexing website number, selection target function, is called
Route optimization algorithm, into Step3；
Step3 judges to chain the type of node, when the node type for linking both sides it is all 2 when, into Step4；When
It is 1 i.e. intersection to have node type, then merges the link using the intersection link coupled as node, make the chain after merging
The link type for connecing both sides is 2；The length linked after merging is calculated, into Step4；
Step4 judges the length 1500 of every link>=LINK_LENGTH>Whether=800 set up, if so, do not do then
Processing；If less than 800, the link at the station at the link two is taken, and the link is merged with obtained shorter linking, it is middle
Station is designated as needing the station given up；If more than 1500 meters, the link is put into the link-group for needing newly-increased website.Link is pressed
Result table is sequentially outputted to according to route optimization algorithm, with ", " segmentation；
Step5 chooses the link that link type is 02,03,10,11,00 and formed from basic road network BASIC_ROAD_NET
Public bus network optimizes road network, the weight using run time after amendment as side, according to multiplexing website number, selection target function, calls
Route optimization algorithm, into Step6；
Step6 judges the length 500 of every link<=LINK_LENGTH<Whether=800 set up, if so, do not do then
Processing；If less than 500 meters, the link at the station at the link two is taken, and the link is merged with obtained shorter linking, in
Between station be designated as needing the station given up；If more than 800 meters, the link is put into the link-group for needing newly-increased website；Finally
Link after will be treated is sequentially outputted to result table according to route optimization algorithm, with ", " segmentation；
Step7 is in basic road network BASIC_ROAD_NET, the weight using run time after amendment as side, according to multiplexing website
Number, selection target function, route optimization algorithm is called, into Step8；
Step8 judges the length LINK_LENGTH of every link<Whether 500 set up, if so, do not process then；If no
Set up, then the link is put into the link-group for needing newly-increased website；And by the link after processing according to the suitable of route optimization algorithm
Sequence is output to result table, with ", " segmentation；
Step9 calculates line length：In the link-group of circuit is obtained, the length of all-links is summed, as line
The physical length l on roadR；
Step10 calculates non-linear coefficient：The sky between actual track length and first and last station between public bus network first and last station
Between air line distance ratio ηR：
ηR=lR/dR
Wherein：
ηRLine R non-linear coefficient is represented respectively
lR：Circuit R length
dR：Circuit R starting point, the air line distance between terminal
Step11 calculates multiple number of lines：Multiple number of lines where circuit is passed through into website in road section ID takes out, and summation, removes
With the multiple number of lines of all section numbers, as this circuit；
Step12 calculates run time
For main transit line, run time is the run time sum of all-links；For public transport time main line and public transport
Branch line, run time are run time sum after the amendment of all-links.
In further embodiment, the route optimization algorithm is the optimization method based on dijkstra's algorithm, specific bag
Include：
The initial seasonal S={ V0 } of Step1.1, T=V-S={ remaining summit }, Q={ is abandoned a little }, and d is vertex correspondence in T
Distance value, V are that the finite nonempty set on all summits closes, and the finite set side collection of relation is defined as E between summit, and summit is each
Bus station, the connection section between website are to link, and turn into side；
If in the presence of<V0,Vj>, d (V0, Vj) is<V0,Vj>Weights on arc
If it is not present<V0,Vj>, d (V0, Vj) is ∞
Step1.2 chooses the summit W of a side relevant with summit in S and target function value minimum from T, first determines whether
Whether W is terminal, if terminal, is terminated；
If not terminal, continues to judge whether W meets deflection mechanism, if satisfied, being added in S, turns Step1.3；If
Deflection mechanism is unsatisfactory for, is put into Q, turns Step1.2；
Step1.3 chooses a fixed W relevant with summit in S and that target function value is minimum from T, adds in S, turns
Step1.4；
Step1.4 modifies to the distance value on summit in remaining T：If adding W makees intermediate vertex, the distance from V0 to Vi
Value shortens, then changes this distance value；
Repeat the above steps 1.2,1.3, all summits are included in terminal or S until finding, i.e. untill W=Vi.
The specific implementation with reference to accompanying drawing and each calculating process is further described showing for the above method by us below
Example property implementation process.
Dijstra algorithms
The basic definition of Dijstra algorithms, with reference to shown in Fig. 2, it is specifically defined as follows with principle：
Scheme (Graph)：One figure can be defined by 2 set, and one is the set put, commonly referred to as summit
(Vertex)；Another set is the set on the side for connecting 2 summits, commonly referred to as side (Edge).The definition of figure is：Graph
=(V, E), V are that the finite nonempty set on all summits closes, and E is the finite set side collection of relation between summit.
Path (Path)：In figure G=(V, E), if from vertex viSet out, by a series of vertex vp1, vp2...,
vpm, finally reach vertex vj, then vertex sequence (v is claimedi, vp1, vp2... vpm, vj) it is vertex viTo vertex vjPath.
Simple path：If each summit passed through on path does not repeat mutually, as path be referred to as simple path.
Shortest path：For authorized graph, shortest path refers to the letter that weights sum is minimum on the side passed through between two summits
Single path.And first summit on path is referred to as source point, last summit is terminal.
The basic step of Dijstra algorithms
Initially seasonal S={ V0 }, T=V-S={ remaining summit }, d are the distance value of vertex correspondence in T to Step1
If in the presence of<V0,Vi>, d (V0, Vi) is<V0,Vi>Weights on arc
If it is not present<V0,Vi>, d (V0, Vi) is ∞
Step2 chooses the summit W of a side relevant with summit in S and weights minimum from T, is added in S
Step3 modifies to the distance value on summit in remaining T：If adding W makees intermediate vertex, the distance value from V0 to Vi
Shorten,
Then change this distance value
2,3 are repeated the above steps, until including all summits in S, i.e. untill W=Vi.
With reference to shown in Fig. 3, first we illustrate the computing example of Dijstra algorithms come the example with reference to shown in Fig. 3
Step1：Weight matrix is established according to figure：
}；(- 1 represents 2 points of non-conterminous, weights infinities)
Such as：W [0] [2]=4 represents that point V0 to point V2 weights are 4
W [0] [3]=- 1 represents that point V0 and V3 is non-conterminous, so weights are infinitely great.
Step2：To V0 labels；The path of V0 to other points obtains distance:{0,1,4,-1,-1,-1}；V0 is found to arrive
That minimum point (except the point of label, -1 represents infinity) of weights in each point, therefore 1 i.e. corresponding subscript 1 is obtained, obtain
V1；
To V1 labels, then change V0 and distance is obtained by the path of V1 to other points:{0,1,3,8,6,-1}；
Step3：That point that weights are minimum in distance is found, V2 is obtained (except the point of label), to V2 labels, then changes V0
Pass through V1->The path of V2 to other points obtains distance:{0,1,3,8,4,-1}；
Step4：That minimum point of weights in distance is found, V4 is obtained (except the point of label), to V4 labels, so
Change V0 passes through V1- afterwards>V2->The path of V4 to other points obtains distance:{0,1,3,7,4,10}；
Step5：That minimum point of weights in distance is found, V3 is obtained (except the point of label), to V3 labels, so
Change V0 passes through V1- afterwards>V2->V4->The path of V3 to other points obtains distance:{0,1,3,7,4,9}；
Last only remaining V5 is not numbered, and just finds V5.Terminate.
The basis definition of Dijstra algorithms employed in each embodiment of the invention set forth above, computing example, under
Face by combine Fig. 4-Fig. 6 its present invention line optimization algorithm concrete application.
Basic road network
In embodiments of the invention, using each bus station as summit in map, each link (connects between website for we
Connect section) side is used as, link length is as power, then the figure obtained is an authorized graph, therefore given any two summit, necessarily
A shortest path between this 2 points can be found.The storage of this figure we protected using basic road network BASIC_ROAD_NET
Deposit, such as following table.
| Link ID | LINK_ID | NUMBER(9) |
| Link type | LINK_TYPE | NUMBER(3) |
| Link length | LINK_LENGTH | NUMBER(5,3) |
| Upstream node ID | STATION_UPSTARE | VARchar2(60) |
| Downstream node ID | STATION_DOWNSTARE | VARchar2(60) |
Wherein upstream stations and downstream website represent the summit of figure respectively, and link is then the side of figure, and link length is figure
Power.
Multiple line coefficient
In embodiments of the invention, we determine multiple line coefficient according to public bus network and section relation, specifically, pass through
The public bus network number passed through on each section is counted from MD_BUS_ROUTE_SEGMENT, is denoted as multiple number of lines.MD_BUS_
ROUTE_SEGMENT tables are as follows.
| BUS_ROUTE_ID | Public bus network identifies ID | NUMBER(9) |
| BUS_ROUTE_NAME | Public bus network title | VARchar2(60) |
| SN | Serial number | NUMBER(3) |
| DIRECTION | Direction | VARchar2(2) |
| SEGMENT_ID | Road section ID | VARchar2(60) |
Link structure
In embodiments of the invention, we are according to road network intersection, road section information (intersection containing upstream and downstream) and station
Information (transportation network) finely links structure.The road network intersection as input data, road section information (are handed over containing upstream and downstream
Prong) and station information (transportation network) it is as shown in the table.
1) intersection MD_INTERSECTION
2) section MD_SEGMENT (intersection containing upstream and downstream)
| SEGMENT_ID | Road section ID | VARchar2(60) |
| SEGMENT_NAME | Section title | VARchar2(120) |
| INTERSECTION_UPSTARE | Upstream crossing | VARchar2(60) |
| INTERSECTION_DOWNSTARE | Downstream road junction | VARchar2(60) |
| SEGMENT_LEVEL | Road type | VARchar2(3) |
| ROAD_LANES_TYPE | Number of track-lines code | NUMBER(6) |
| LENGTH | Length | NUMBER(10,2) |
| WIDTH | Width | NUMBER(3,2) |
| SEGMENT_CAPACITY | The traffic capacity | NUMBER(6) |
| SEGMENT_CODE | Section encodes | VARchar2(60) |
| ROAD_ID | Road codes | VARchar2(60) |
| SEGMENT_DIRECTION | Section direction | VARchar2(10) |
| SEGMENT_NAME2 | Section alias | VARchar2(60) |
Category of roads, 01 through street, 02 major trunk roads, 03 subsidiary road, 04 branch road, 05 street road 06 are overhead
3) station information (transportation network) TN_BUS_STATION
Link type includes：Compound 08 is led soon in the street road 06 overhead 07 of 01 through street, 02 major trunk roads, 03 subsidiary road, 04 branch road 05
Fast compound 09 fast main 12 Zhi Fuhe 00 of Zhi Fuhe of the primary and secondarys of Zhi Fuhe 10 compound 11 other
With reference to shown in Fig. 4, link structure specifically includes：
All whether mark is analysis to intersection ID in Step1 discriminatory analysises region, chooses one of them and does not analyze
Intersection IDp
Start, by intersection IDp labeled as having analyzed, into Step2；
Step2 finds out all road section IDs being connected with intersection IDp (by section from the MD_SEGMENT tables of section
Width is less than 7 meters of rejecting), method is：Section using intersection ID as upstream and downstream crossing；Closed according to section and intersection
The friendship rule of system and right travel, section are formed a team, into Step3；
Step3 pulls station code on above-mentioned section out using these stations as node, type from BUS_STATION tables
2 are designated as, if not having station on section, 1 is designated as using section downstream intersection as node, type；
If there is station in each section of the Step4 intersections, according to the relation of forming a team in section, chain between station is assigned
Relation is connect, into Step5；If there is no station on section, according to the relation of forming a team in section, chain between station and intersection is assigned
Relation is connect, into Step5；
Step5 encodes to link, and the link between two stations is unique；Type definition is carried out to link, method is：If
The road type residing for section between link is identical, then road type is assigned into link type, if residing for the section between link
Road type differ, then corresponding types value is assigned to link type；Into Step6；
Step6 calculates the distance between station and intersection IDp, is by station and the distance between intersection IDp summation
For the length of link；Into Step7；
If the station ID at Step7 links two is upstream and downstream website mutually, a data is preserved, ensures each two car
Linked between standing unique；Turn Step1, all analysis finishes until all intersections.
Built by link, output data is as follows：
Run time amendment
In an embodiment of the present invention, we believe according to the multiple number of lines in section and public bus network with section relation, section
Breath (intersection containing upstream and downstream), section speed limit data, multiple line coefficient recommended value carry out run time amendment.
Multiple number of lines and public bus network and section relation, road section information (intersection containing upstream and downstream), section speed limit data,
Multiple line coefficient recommended value (such as Fig. 5), it is as follows：
The multiple number of lines table SEGMENT_MULTIPLE_TRAC_NUM in section
| Parameter | Field | Type |
| Road section ID | SEGMENT_ID | VARchar2(60) |
| Multiple number of lines | MULTIPLE_TRAC_NUM | NUMBER(3) |
| Renewal time | TIMESTAMP | NUMBER(13) |
Public bus network and section relation MD_BUS_ROUTE_SEGMENT
| BUS_ROUTE_ID | Public bus network identifies ID | NUMBER(9) |
| BUS_STATION_ID | Station code | NUMBER(9) |
| SN | Serial number | NUMBER(3) |
| DIRECTION | Direction | VARchar2(2) |
| SEGMENT_ID | Road section ID | VARchar2(60) |
Section MD_SEGMENT (intersection containing upstream and downstream)
Section speed limit data
| Road type | National standard speed limit | It is recommended that value |
| Through street | 60~80 | 47 |
| Major trunk roads | 40~60 | 30 |
| Subsidiary road | 40 | 25 |
| Branch road | 30 | 15 |
| At a high speed | 80~100 | 47 |
Specific makeover process includes：
Step1 obtains the distance between station and intersection IDp d1, d2 in the Step6 of link developing algorithm step
Afterwards, look into MD_SEGMENT obtain road segment classification, according to " section speed limit data " calculate intersection to station run time,
T1=d1/ sections speed limit, t2=d2/ sections speed limit；
Step2 calculating linking run times t=t1+t2
Step3 inquires about SEGMENT_MULTIPLE_TRAC_NUM tables, obtains the multiple number of lines on section residing for station, presses
Run time is modified according to multiple number of lines and multiple line Relationship of Coefficients：
T1 '=t1* sections multiple line coefficient, t2 '=t2* sections multiple line coefficient；
Amendment run time the t=t1 '+t2 ' then linked
Route optimization based on Dijstra
Dijkstra's algorithm applies greedy algorithm pattern, is the method for best solution shortest path generally acknowledged at present.
What algorithm solved is that to the shortest route problem on other summits, it is mainly characterized by selecting during each iteration single source point in digraph
The next summit selected is summit nearest apart from source point outside mark point.But because dijkstra algorithm is mainly calculated from source point
To other shortest path a little, the bus station enormous amount in transit network planning system, thus the efficiency of algorithm compared with
It is low.For this during search, we add direction of search angle to limit the scope of search, allow the direction of search to be maintained at start and end
Near space of points line, the search of unnecessary website is reduced, accelerates algorithm the convergence speed, another benefit of the way is limit
Irrational bending of public bus network processed, roundabout phenomenon, enable non-linear coefficient one preferably in the range of.It is in addition, newly-increased
Public bus network optimization specifies beginning and end by owner, therefore when Dijstra algorithms are when the point searched is terminal, we
It can terminate to search for, without calculating other unnecessary points.
Coordinate Conversion
Data are gone after station information, for the longitude and latitude of bus station, we are converted using Gauss Lv Ke projections
For space coordinates, coordinate (x corresponding to starting pointu,yu), coordinate (x corresponding to terminald,yd), utilize formulaThe air line distance between Origin And Destination is calculated.The computational methods phase of other each points
Together.
Deflection mechanism
It is starting point in figure interior joint v15, node v6 is terminal, and node v22 is the point of intermediate search with reference to shown in Fig. 6.By
When Dijstra algorithms calculate the shortest path between v15 to v6, whether intermediate node, which needs, calculates, and can shift to an earlier date by deflection
Controlling mechanism judges in advance, is unsatisfactory for the point of condition, it is not necessary to calculates, will greatly save and calculate the time, improves Dijstra and calculate
The aging performance of method.
By Coordinate Conversion, the latitude and longitude value for the website that we are taken is had been converted under rectangular coordinate system in space
Coordinate value.First, obtain the distance between Origin And Destination d0, starting point and intermediate point distance d1 by abovementioned steps, terminal with
The distance d2 of intermediate point, then deflection A=arcos [0.5* (d0^2+d1^2-d2^2)/(d0*d1)], as deflection A<=90 °
When, the point calculates into Dijstra algorithms, and otherwise, the point is not counted in calculating.Only need to judge d0^2+d1^2-d2 in the implementation
^2>Whether=0 set up, and substitutes into and calculates if setting up, otherwise not calculates.
With reference to shown in Fig. 6, Fig. 7, include with reference to the route optimization method of Coordinate Conversion and deflection mechanism：
The initial seasonal S={ V0 } of Step1.1, T=V-S={ remaining summit }, Q={ is abandoned a little }, and d is vertex correspondence in T
Distance value, V are that the finite nonempty set on all summits closes, and the finite set side collection of relation is defined as E between summit, and summit is each
Bus station, the connection section between website are to link, and turn into side；
If in the presence of<V0,Vj>, d (V0, Vj) is<V0,Vj>Weights on arc
If it is not present<V0,Vj>, d (V0, Vj) is ∞
Step1.2 chooses the summit W of a side relevant with summit in S and target function value minimum from T, first determines whether
Whether W is terminal, if terminal, is terminated；
If not terminal, continues to judge whether W meets deflection mechanism, if satisfied, being added in S, turns Step1.3；If
Deflection mechanism is unsatisfactory for, is put into Q, turns Step1.2；
Step1.3 chooses a fixed W relevant with summit in S and that target function value is minimum from T, adds in S, turns
Step1.4；
Step1.4 modifies to the distance value on summit in remaining T：If adding W makees intermediate vertex, the distance from V0 to Vi
Value shortens, then changes this distance value；
Repeat the above steps 1.2,1.3, all summits are included in terminal or S until finding, i.e. untill W=Vi.
Newly-increased public bus network optimization
The calculating of newly-increased public bus network optimization specifically includes：
Step0 reception starting points, endpoint data, website number and circuit types data are multiplexed, first determine whether table MD_NEW_BUS_
Whether the basic data version time in ROUTE_INPUT and basic data version time in table BASIC_ROAD_NET are identical,
If it is different, optimize；If identical, judge whether starting point, terminal, circuit types, multiplexing website number have historical record, if so,
Historical record is returned, if nothing, is optimized；
Optimisation strategies of the Step1 based on time generic line, judges circuit types：
When circuit types is main transit line, into Step2；
When circuit types is public transport time main line, into Step5；
When circuit types is public transport branch road/in unlimited time, into Step7；
Step2 chooses the chain that link type is 01,02,07,08,09,10,00 from basic road network BASIC_ROAD_NET
Road composition public bus network optimization road network, the weight using run time as side, according to multiplexing website number, selection target function, is called
Route optimization algorithm, into Step3；
Step3 judges to chain the type of node, when the node type for linking both sides it is all 2 when, into Step4；When
It is 1 i.e. intersection to have node type, then merges the link using the intersection link coupled as node, make the chain after merging
The link type for connecing both sides is 2；The length linked after merging is calculated, into Step4；
Step4 judges the length 1500 of every link>=LINK_LENGTH>Whether=800 set up, if so, do not do then
Processing；If less than 800, the link at the station at the link two is taken, and the link is merged with obtained shorter linking, it is middle
Station is designated as needing the station given up；If more than 1500 meters, the link is put into the link-group for needing newly-increased website.Link is pressed
Result table is sequentially outputted to according to route optimization algorithm, with ", " segmentation；
Step5 chooses the link that link type is 02,03,10,11,00 and formed from basic road network BASIC_ROAD_NET
Public bus network optimizes road network, the weight using run time after amendment as side, according to multiplexing website number, selection target function, calls
Route optimization algorithm, into Step6；
Step6 judges the length 500 of every link<=LINK_LENGTH<Whether=800 set up, if so, do not do then
Processing；If less than 500 meters, the link at the station at the link two is taken, and the link is merged with obtained shorter linking, in
Between station be designated as needing the station given up；If more than 800 meters, the link is put into the link-group for needing newly-increased website；Finally
Link after will be treated is sequentially outputted to result table according to route optimization algorithm, with ", " segmentation；
Step7 is in basic road network BASIC_ROAD_NET, the weight using run time after amendment as side, according to multiplexing website
Number, selection target function, route optimization algorithm is called, into Step8；
Step8 judges the length LINK_LENGTH of every link<Whether 500 set up, if so, do not process then；If no
Set up, then the link is put into the link-group for needing newly-increased website；And by the link after processing according to the suitable of route optimization algorithm
Sequence is output to result table, with ", " segmentation.
Wherein:
POI weights standardize：POI power=POI weight/2
Link length standardizes：Side right=link length/max (link length)
Run time standardizes：Side right=run time/max (run time)
Correct run time standardization：Run time/max (run time after amendment) after side right=amendment
Work as side right>When 1.5, link is half-and-half splitted into two, corresponding POI is also divided half-and-half, and produces a new phantom station
Point, the side right and POI of former website are accordingly made an amendment, and the link is put into the link-group for needing newly-increased website
Object function 1=side right * w1+ (1-POI power) * w2
Object function 2=side right * w2+ (1-POI power) * w1
Default value w1=0.8, w2=0.2, weight can set
It is multiplexed website number>When=8, with object function 1；When multiplexing website number<8, with object function 2.Parameter 8 can be according to feelings
Condition is changed.
After step8 is obtained and newly increased the Optimum Design Results of circuit, the meter of routing indicator has been carried out also directed to result
Calculate, specifically include uncle's Ah week 9- step 12.
Step9 calculates line length：In the link-group of circuit is obtained, the length of all-links is summed, as line
The physical length l on roadR；
Step10 calculates non-linear coefficient：The sky between actual track length and first and last station between public bus network first and last station
Between air line distance ratio ηR：
ηR=lR/dR
Wherein：
ηRLine R non-linear coefficient is represented respectively
lR：Circuit R length
dR：Circuit R starting point, the air line distance between terminal
Step11 calculates multiple number of lines：Multiple number of lines where circuit is passed through into website in road section ID takes out, and summation, removes
With the multiple number of lines of all section numbers, as this circuit；
Step12 calculates run time
For main transit line, run time is the run time sum of all-links；For public transport time main line and public transport
Branch line, run time are run time sum after the amendment of all-links.
It is noted that the optimization design calculating process of the newly-increased circuit of the above is based on time generic line principle
Optimization design algorithm, for especially needing the occasion of newly-increased public bus network to provide science public traffic planning and designing
Foundation and support.
Although the present invention is disclosed above with preferred embodiment, so it is not limited to the present invention.Skill belonging to the present invention
Has usually intellectual in art field, without departing from the spirit and scope of the present invention, when can be used for a variety of modifications and variations.Cause
This, the scope of protection of the present invention is defined by those of the claims.
Claims (5)
1. a kind of newly-increased public bus network Optimization Design based on time generic line, it is characterised in that comprise the steps：
Step0 reception starting points, endpoint data, website number and circuit types data are multiplexed, first determine whether table MD_NEW_BUS_
Whether the basic data version time in ROUTE_INPUT and basic data version time in table BASIC_ROAD_NET are identical,
If it is different, optimize；If identical, judge whether starting point, terminal, circuit types, multiplexing website number have historical record, if so,
Historical record is returned, if nothing, is optimized；
Step1 judges circuit types based on the optimisation strategy apart from generic line：
When circuit types is main transit line, into Step2；
When circuit types is public transport time main line, into Step5；
When circuit types is public transport branch road/in unlimited time, into Step7；
Step2 chooses the link group that link type is 01,02,07,08,09,10,00 from basic road network BASIC_ROAD_NET
Optimize road network into public bus network, the weight using run time as side, according to multiplexing website number, selection target function, call route
Optimized algorithm, into Step3；
Step3 judges to chain the type of node, when the node type for linking both sides it is all 2 when, into Step4；When there is section
Vertex type is 1 i.e. intersection, then merges the link using the intersection link coupled as node, make the link after merging two
The link type of side is 2；The length linked after merging is calculated, into Step4；
Step4 judges the length 1500 of every link>=LINK_LENGTH>Whether=800 set up, if so, do not do then and locate
Reason；If less than 800, the link at the station at the link two is taken, and the link is merged with obtained shorter linking, middle car
Station is designated as needing the station given up；If more than 1500 meters, the link is put into the link-group for needing newly-increased website.Will link according to
Route optimization algorithm is sequentially outputted to result table, with ", " segmentation；
Step5 chooses the link that link type is 02,03,10,11,00 and forms public transport from basic road network BASIC_ROAD_NET
Line optimization road network, the weight using run time after amendment as side, according to multiplexing website number, selection target function, call route
Optimized algorithm, into Step6；
Step6 judges the length 500 of every link<=LINK_LENGTH<Whether=800 set up, if so, do not process then；
If less than 500 meters, the link at the station at the link two is taken, and the link is merged with obtained shorter linking, middle car
Station is designated as needing the station given up；If more than 800 meters, the link is put into the link-group for needing newly-increased website；Finally will place
Link after reason is sequentially outputted to result table according to route optimization algorithm, with ", " segmentation；
Step7 is in basic road network BASIC_ROAD_NET, the weight using run time after amendment as side, according to multiplexing website number,
Selection target function, route optimization algorithm is called, into Step8；
Step8 judges the length LINK_LENGTH of every link<Whether 500 set up, if so, do not process then；If not into
It is vertical, then the link is put into the link-group for needing newly-increased website；And the order by the link after processing according to route optimization algorithm
Result table is output to, with ", " segmentation.
2. the newly-increased public bus network Optimization Design according to claim 1 based on time generic line, it is characterised in that should
Method more includes：
Step9 calculates line length：In the link-group of circuit is obtained, the length of all-links is summed, as circuit
Physical length lR；
Step10 calculates non-linear coefficient：The space between actual track length and first and last station between public bus network first and last station is straight
The ratio η of linear distanceR：
ηR=lR/dR
Wherein：
ηRLine R non-linear coefficient is represented respectively
lR：Circuit R length
dR：Circuit R starting point, the air line distance between terminal
Step11 calculates multiple number of lines：Multiple number of lines where circuit is passed through into website in road section ID takes out, summation, Chu Yisuo
There is section number, be the multiple number of lines of this circuit；
Step12 calculates run time
For main transit line, run time is the run time sum of all-links；For public transport time main line and supplementary bus route,
Run time is run time sum after the amendment of all-links.
3. the newly-increased public bus network Optimization Design according to claim 1 based on time generic line, it is characterised in that institute
It is the optimization method based on dijkstra's algorithm to state route optimization algorithm, is specifically included：
The initial seasonal S={ V0 } of Step1.1, T=V-S={ remaining summit }, Q={ is abandoned a little }, and d is the distance of vertex correspondence in T
Value, V are that the finite nonempty set on all summits closes, and the finite set side collection of relation is defined as E between summit, and summit is each public transport
Website, the connection section between website are to link, and turn into side；
If in the presence of<V0,Vj>, d (V0, Vj) is<V0,Vj>Weights on arc
If it is not present<V0,Vj>, d (V0, Vj) is ∞
Step1.2 chooses the summit W of a side relevant with summit in S and target function value minimum from T, first determines whether that W is
No is terminal, if terminal, is terminated；
If not terminal, continues to judge whether W meets deflection mechanism, if satisfied, being added in S, turns Step1.3；It is if discontented
Sufficient deflection mechanism, is put into Q, turns Step1.2；
Step1.3 chooses a fixed W relevant with summit in S and that target function value is minimum from T, adds in S, turns
Step1.4；
Step1.4 modifies to the distance value on summit in remaining T：If adding W makees intermediate vertex, the distance value contracting from V0 to Vi
It is short, then change this distance value；
Repeat the above steps 1.2,1.3, all summits are included in terminal or S until finding, i.e. untill W=Vi.
4. the newly-increased public bus network Optimization Design according to claim 3 based on time generic line, it is characterised in that institute
The judgement for stating deflection mechanism is as follows：
First, the distance of the distance d1 of the distance d0 between Origin And Destination is obtained, starting point and intermediate point, terminal and intermediate point
After d2, calculated direction angle A, deflection A=arcos [0.5* (d0^2+d1^2-d2^2)/(d0*d1)], as deflection A<=
At 90 °, the point calculates into Dijstra algorithms, and otherwise, the point is not counted in calculating.
5. the newly-increased public bus network Optimization Design according to claim 3 based on time generic line, it is characterised in that institute
The distance between the summit for stating the judgement of deflection mechanism calculates, i.e. the distance between Origin And Destination d0, starting point and intermediate point
Distance d1, the distance d2 of terminal and intermediate point obtain according to structure is linked, and link structure specifically includes：
All whether mark is analysis to intersection ID in Step2.1 discriminatory analysises region, chooses what one of them was not analyzed
Intersection IDp starts, by intersection IDp labeled as having analyzed, into Step2.2；
Step2.2 finds out all road section IDs being connected with intersection IDp from the MD_SEGMENT tables of section, and section is wide
Rejecting of the degree less than 7 meters, method are：Section using intersection ID as upstream and downstream crossing；According to section and intersection relation, with
And the friendship rule of right travel, section is formed a team, into Step2.3；
The station code that Step2.3 is pulled out from BUS_STATION tables on above-mentioned section is remembered these stations as node, type
For 2, if not having station on section, 1 is designated as using section downstream intersection as node, type；
If there is station in each section of the Step2.4 intersections, according to the relation of forming a team in section, imparting links between station
Relation, into Step2.5；If there is no station on section, according to the relation of forming a team in section, chain between station and intersection is assigned
Relation is connect, into Step2.5；
Step2.5 encodes to link, and the link between two stations is unique；Type definition is carried out to link, method is：If chain
The road type residing for section between connecing is identical, then road type is assigned into link type, if residing for the section between link
Road type differs, then corresponding types value is assigned into link type；Into Step2.6；
Step2.6 calculates the distance between station and intersection IDp, is by station and the distance between intersection IDp summation
The length of link；Into Step2.7；
If the station ID at Step2.7 links two is upstream and downstream website mutually, a data is preserved, ensures each two station
Between link it is unique；Turn Step2.1, all analysis finishes until all intersections.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710533322.6A CN107633318A (en) | 2017-07-03 | 2017-07-03 | A kind of newly-increased public bus network Optimization Design based on time generic line |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710533322.6A CN107633318A (en) | 2017-07-03 | 2017-07-03 | A kind of newly-increased public bus network Optimization Design based on time generic line |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107633318A true CN107633318A (en) | 2018-01-26 |
Family
ID=61099246
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710533322.6A Pending CN107633318A (en) | 2017-07-03 | 2017-07-03 | A kind of newly-increased public bus network Optimization Design based on time generic line |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107633318A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108416480A (en) * | 2018-03-23 | 2018-08-17 | 中山市博林树投资管理有限公司 | A kind of intelligence share-car matching process |
| CN109753694A (en) * | 2018-12-13 | 2019-05-14 | 东南大学 | Small and medium-sized cities Transit Network Design method based on overall process trip detecting period |
| CN110782178A (en) * | 2019-11-01 | 2020-02-11 | 北京航空航天大学 | Traffic network planning aid decision-making method and device |
| CN110782651A (en) * | 2019-11-11 | 2020-02-11 | 上海交通大学 | Non-routing public traffic control system based on quick response riding request |
| CN110793535A (en) * | 2019-08-22 | 2020-02-14 | 腾讯科技（深圳）有限公司 | Commuting line planning method and device |
| CN112466122A (en) * | 2021-01-28 | 2021-03-09 | 深圳市城市交通规划设计研究中心股份有限公司 | Method and device for generating alternative line set and planning line of public traffic line network |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101944096A (en) * | 2009-07-08 | 2011-01-12 | 广东融讯信息科技有限公司 | Method and system for providing bus routes |
| CN103679286A (en) * | 2013-11-29 | 2014-03-26 | 华为技术有限公司 | Path optimizing method and path optimizing device |
| WO2014084345A1 (en) * | 2012-11-29 | 2014-06-05 | イーグルバス株式会社 | Information processing device and program |
| CN103942948A (en) * | 2014-04-10 | 2014-07-23 | 中南大学 | Method for generating urban bus route network based on segmented splicing |
| CN104200127A (en) * | 2014-09-25 | 2014-12-10 | 武汉大学 | Optimal path analyzing method based on road corner weight |
| CN105225473A (en) * | 2015-11-05 | 2016-01-06 | 北京航空航天大学 | The fast line design method of a kind of public transport based on website efficiency calculation |
| US20170059331A1 (en) * | 2015-08-31 | 2017-03-02 | Sap Se | Route planner for transportation systems |
-
2017
- 2017-07-03 CN CN201710533322.6A patent/CN107633318A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101944096A (en) * | 2009-07-08 | 2011-01-12 | 广东融讯信息科技有限公司 | Method and system for providing bus routes |
| WO2014084345A1 (en) * | 2012-11-29 | 2014-06-05 | イーグルバス株式会社 | Information processing device and program |
| CN103679286A (en) * | 2013-11-29 | 2014-03-26 | 华为技术有限公司 | Path optimizing method and path optimizing device |
| CN103942948A (en) * | 2014-04-10 | 2014-07-23 | 中南大学 | Method for generating urban bus route network based on segmented splicing |
| CN104200127A (en) * | 2014-09-25 | 2014-12-10 | 武汉大学 | Optimal path analyzing method based on road corner weight |
| US20170059331A1 (en) * | 2015-08-31 | 2017-03-02 | Sap Se | Route planner for transportation systems |
| CN105225473A (en) * | 2015-11-05 | 2016-01-06 | 北京航空航天大学 | The fast line design method of a kind of public transport based on website efficiency calculation |
Non-Patent Citations (2)
| Title |
|---|
| 康文雄 等: "节点约束型最短路径的分层Dijkstra 算法", 《华南理工大学学报（自然科学版）》 * |
| 田庆飞 等: "基于边介数的大城市公交网络优化模型", 《哈尔滨工业大学学报》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108416480A (en) * | 2018-03-23 | 2018-08-17 | 中山市博林树投资管理有限公司 | A kind of intelligence share-car matching process |
| CN109753694A (en) * | 2018-12-13 | 2019-05-14 | 东南大学 | Small and medium-sized cities Transit Network Design method based on overall process trip detecting period |
| CN109753694B (en) * | 2018-12-13 | 2023-10-03 | 东南大学 | Method for designing medium and small city public transportation network based on whole-process travel sensing time |
| CN110793535A (en) * | 2019-08-22 | 2020-02-14 | 腾讯科技（深圳）有限公司 | Commuting line planning method and device |
| CN110782178A (en) * | 2019-11-01 | 2020-02-11 | 北京航空航天大学 | Traffic network planning aid decision-making method and device |
| CN110782178B (en) * | 2019-11-01 | 2020-11-06 | 北京航空航天大学 | Traffic network planning aid decision-making method and device |
| CN110782651A (en) * | 2019-11-11 | 2020-02-11 | 上海交通大学 | Non-routing public traffic control system based on quick response riding request |
| CN110782651B (en) * | 2019-11-11 | 2021-06-29 | 上海交通大学 | Non-routing public traffic control system based on quick response riding request |
| CN112466122A (en) * | 2021-01-28 | 2021-03-09 | 深圳市城市交通规划设计研究中心股份有限公司 | Method and device for generating alternative line set and planning line of public traffic line network |
| CN112466122B (en) * | 2021-01-28 | 2021-06-15 | 深圳市城市交通规划设计研究中心股份有限公司 | Method and device for generating alternative line set and planning line of public traffic line network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107633318A (en) | A kind of newly-increased public bus network Optimization Design based on time generic line | |
| CN107633319A (en) | A kind of newly-increased public bus network Optimization Design | |
| CN101694749B (en) | Method and device for speculating routes | |
| Florian et al. | A combined trip distribution modal split and trip assignment model | |
| CN102081658B (en) | Hierarchical road network-based path search method and device | |
| CN100463009C (en) | Traffic information fusion processing method and system | |
| CN109959388B (en) | Intelligent traffic refined path planning method based on grid expansion model | |
| CN101957208B (en) | Method for discovering new road based on probe vehicle technology | |
| KR101092690B1 (en) | Method for Finding Path for Reducing Cost of Fuel | |
| CN113763741B (en) | Trunk road traffic guidance method in Internet of vehicles environment | |
| CN103471603A (en) | Method and apparatus for matching of bus route and road network | |
| CN107092986B (en) | Bus passenger travel path selection method based on stations and collinear operation | |
| CN106052701A (en) | Vehicle route selection method under traffic overflow state | |
| CN108108855A (en) | A kind of pipeline paths planning method | |
| CN103309932A (en) | Path searching method and path searching device | |
| De Nunzio et al. | Bi-objective eco-routing in large urban road networks | |
| CN108647475B (en) | Urban discrete traffic network design R language implementation method based on load balancing | |
| CN101807348B (en) | Dynamic network navigation system and method | |
| CN116403410A (en) | Highway mixed path induction model construction method considering congestion traffic sources | |
| Zavin et al. | Towards developing an intelligent system to suggest optimal path based on historic and real-time traffic data | |
| CN104574966B (en) | Variable information identity device and variable information identification method | |
| CN117553818A (en) | Path planning method and system based on improved A-algorithm | |
| Verbas et al. | Finding least cost hyperpaths in multimodal transit networks: Methodology, algorithm, and large-scale application | |
| CN114999162B (en) | Road traffic flow obtaining method and device | |
| CN105427581B (en) | traffic simulation method and system based on floating car data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 210012 room 627, Ning Shuang Road, Yuhuatai District, Nanjing, Jiangsu, 627 Applicant after: Ho whale cloud computing Polytron Technologies Inc Address before: 210012 No. 68 Bauhinia Road, Yuhuatai District, Jiangsu, Nanjing Applicant before: ZTEsoft Technology Co., Ltd. |
|
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180126 |