CN111259308B - Bus network hub evaluation method based on multiple mapping - Google Patents
Bus network hub evaluation method based on multiple mapping Download PDFInfo
- Publication number
- CN111259308B CN111259308B CN202010035291.3A CN202010035291A CN111259308B CN 111259308 B CN111259308 B CN 111259308B CN 202010035291 A CN202010035291 A CN 202010035291A CN 111259308 B CN111259308 B CN 111259308B
- Authority
- CN
- China
- Prior art keywords
- bus
- lines
- stops
- stations
- data set
- 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.)
- Active
Links
- 238000013507 mapping Methods 0.000 title claims abstract description 47
- 238000011156 evaluation Methods 0.000 title claims abstract description 20
- 238000004364 calculation method Methods 0.000 claims abstract description 10
- 230000000007 visual effect Effects 0.000 claims description 6
- 238000000034 method Methods 0.000 claims description 5
- 238000011160 research Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 8
- 238000010276 construction Methods 0.000 description 4
- 238000013439 planning Methods 0.000 description 4
- 238000007726 management method Methods 0.000 description 2
- 238000013178 mathematical model Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 229910052799 carbon Inorganic materials 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Tourism & Hospitality (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- Mathematical Optimization (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Pure & Applied Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention discloses a public transport network hub evaluation method based on multiple mapping. Firstly, based on the established multiple mapping rules, establishing 2 types of bus complex networks, namely Net1 and Net2, for the bus stops and bus lines of a study area; secondly, respectively identifying bus hub stations and bus hub lines of Net1 and Net2; performing reverse mapping calculation on the bus hub station identified by Net1 to find out the related bus station; and finally, carrying out reverse mapping calculation on the bus hub station identified by Net2, and finding out the related bus route. The invention can identify important bus junction stations and junction lines on the basis of solving the problem that bus stations need to be combined under the constraint of space distance.
Description
Technical Field
The invention relates to the technical field of urban planning and urban traffic systems, in particular to a public transportation network hub evaluation method based on multiple mapping rules.
Background
At present, optimizing the urban public transport network is an important means for guaranteeing residents to enjoy basic public service, and is also one of important ways for realizing better green low-carbon travel. The mathematical model construction of the public transportation network is one of important technical means for optimizing the urban public transportation network, and the mathematical model construction must be established on the basis of reasonable abstraction of the real problems, and the actual requirements of planning and management are considered. However, there is a certain problem in the current public transportation network modeling process:
the first problem is: some buses exist in cities with very short distances, and people can transfer buses among the buses with very short distances. These stations should be considered together in a sense as one node on the public transportation network, not just a plurality of public transportation stations.
Aiming at the problem, the bus stops with the shorter distance and the combined bus stops can be in one-to-one correspondence, so that planning, design and management are helped to better evaluate the current bus network. It should be noted that this approach does not directly combine multiple bus stops within a certain spatial distance range into one bus stop, so that each bus stop can only correspond to a single bus stop (combined bus stop). In practice, in the bus network thus established, each bus stop may be merged into a different bus stop (merged bus stop), thereby forming multiple mapping relations.
The second problem is: when the traditional public transport network is modeled, bus stops are taken as nodes of the network, and shift connection among the bus stops is taken as an edge of the network. The construction mode takes bus stops as core evaluation objects, and detailed analysis of bus routes is ignored to a great extent.
In order to solve the problem, we analyze and find that if a bus line is used as a node of a network, if a common bus station exists between 2 bus lines, then a network edge exists between the bus lines. The bus network model constructed in the mode takes bus lines as cores to a great extent during evaluation. Because the bus route is fast for the manager of bus planning, it can be adjusted and perfected fast to meet the travel demands of urban residents. Conversely, changes in bus stops (such as new and obsolete) are relatively inefficient.
Disclosure of Invention
The technical problem to be solved by the invention is to overcome the defects of the prior art and provide a public transportation network hub evaluation method based on multiple mapping, on the basis of 2 public transportation network models, the merging problem among short-distance public transportation stations is also considered, and the space scale merging problem of the public transportation stations is considered, so that the evaluation of the public transportation network is more practical.
The invention adopts the following technical scheme for solving the technical problems:
the invention provides a bus network hub evaluation method based on multiple mapping, which comprises the following steps:
step 1), based on the established multiple mapping rules, establishing 2 types of bus complex networks for the bus stops and the bus lines in the study area, and respectively marking the complex networks as a first network Net1 and a second network Net2;
step 2), respectively identifying bus hub stations and bus hub lines for Net1 and Net2;
step 3), carrying out reverse mapping calculation on the bus hub station identified by Net1 to find out the related bus station;
and 4) carrying out reverse mapping calculation on the bus hub station identified by Net2 to find out related bus routes and bus stations.
Further, the invention provides a bus network hub evaluation method based on multiple mapping rules, wherein the step 1) specifically comprises the following sub-steps:
step 1.1), establishing a multiple mapping rule f: as long as bus stops within a specified space distance range are mapped to a new bus stop, a multi-to-one stop mapping relation is established; wherein, each bus stop can be mapped to different new bus stops, so long as a certain space distance range is satisfied;
step 1.2), marking a bus stop data set in a research area as P and marking a bus line data set as L;
step 1.3), based on multiple mapping rules f, establishing a bus complex network Net1:
step 1.3.1), generating a bus stop data set P into a new bus stop data set P1 based on a multiple mapping rule f, and establishing a one-to-one correspondence table f1 of unique value identification numbers of each bus stop in the data sets P and P1;
step 1.3.2), according to a bus arrangement list among bus stops in the bus route data set, if an accessible bus route exists among any 2 bus stops, a complex network edge exists among the 2 bus stops; meanwhile, the line number of the bus lines which can be reached between any 2 bus stops is used as the weight w1 of the complex network side;
step 1.3.3), constructing a bus complex network Net1 by using P1 and w1 according to a complex network theory;
step 1.4), based on the multiple mapping rule f, establishing a bus complex network Net2:
step 1.4.1), according to a bus arrangement list among stations in the bus line data set, if public bus stations in P1 which pass through jointly exist among any 2 bus lines, a complex network edge exists among the 2 bus lines; meanwhile, taking the number of bus stations in P1 which can jointly pass through among any 2 bus lines as the weight w2 of the complex network side;
step 1.4.2), establishing a one-to-one correspondence between the identification numbers of any two public transportation lines in L and the unique identification numbers of all public transportation stations in the common P1 for all public transportation stations in the common P1, and marking the correspondence as a relation table f2;
step 1.4.3), constructing a bus complex network Net2 by using L and w2 according to the complex network theory.
Further, the invention provides a bus network hub evaluation method based on multiple mapping rules, wherein the step 2) specifically comprises the following sub-steps:
step 2.1), calculating weighted intermediacy indexes/degrees of the complex network nodes for Net1, selecting ten percent of bus stops with the top ranking or ten bus stops with the top ranking, and recording the bus stops as a data set P2;
step 2.2), calculating weighted intermediacy index/degree of the complex network node for Net2, selecting ten percent of public transportation lines with the top ranking or ten public transportation lines with the top ranking, and recording the public transportation lines as a data set L2.
Further, the invention provides a bus network hub evaluation method based on multiple mapping rules, wherein the step 3) specifically comprises the following sub-steps:
step 3.1), finding out original unique value identification numbers of all bus stops in the data set P2 according to the corresponding relation table f1, and marking the unique value identification numbers as a set P3;
step 3.2), according to the set P3, carrying out space visual display on the found original bus stop.
Further, the invention provides a bus network hub evaluation method based on multiple mapping rules, wherein the step 4) specifically comprises the following sub-steps:
step 4.1), finding out original unique value identification numbers of all bus stops in the data set L2 according to the corresponding relation tables f2 and f1, and marking the unique value identification numbers as a set P4;
step 4.2), according to the set P4, carrying out space visual display on the found original bus stop and L2.
Compared with the prior art, the technical scheme provided by the invention has the following technical effects:
(1) The invention provides a bus network hub evaluation method based on multiple mapping, which can consider the problem of station merging between bus stops close to each other, so that the evaluation of a bus network is more in line with the actual situation. Meanwhile, the merging rule in the invention allows each bus stop to merge for a plurality of times, so that each bus stop fully plays the best adjacent advantage.
(2) The invention can integrate the merging problem of the bus stops under the distance constraint with the modeling of 2 bus networks, so that the evaluation of the bus networks is more effectively focused on the evaluation of the stops, and the effective evaluation of the bus lines is realized.
Drawings
Fig. 1 is a schematic overall flow diagram of the present invention.
Fig. 2 is a schematic diagram of a bus stop and a bus route in a research area according to the present invention.
Fig. 3 is a schematic diagram of the number of bus stops in the investigation region of the present invention.
Fig. 4 is a schematic diagram of a bus stop in which merging is required in a research area according to the present invention.
FIG. 5 is a schematic diagram of the multiple mapping process of the present invention.
Fig. 6 is a schematic diagram of the numbering of the combined bus stops in the study area of the present invention.
Fig. 7 is a schematic diagram of the construction of 2 kinds of bus complex networks according to the present invention.
FIG. 8 is a diagram of the results of the original bus stop finding out the bus hub according to the present invention.
Detailed Description
The technical scheme of the invention is further described in detail below with reference to the accompanying drawings:
the invention provides a public transport network hub evaluation method based on multiple mapping, which comprises the following steps:
step 1) referring to fig. 1, based on multiple mapping rules, 2 types of bus complex networks, respectively denoted as Net1 and Net2, are established for the bus stops and bus lines of the study area.
Step 1.1) fig. 2 shows the distribution of public transportation networks in the study area in the example: the study area comprises 4 bus lines, namely line1, line2, line3 and line4, wherein bus stations contained in line1 are A0, A1, A2, A3, A4, A5, A6, A7 and A8, bus stations contained in line2 are B1, B2, B3 and B4, bus stations contained in line3 are C1, C2, C3, C4, C5 and C6, and bus stations contained in line4 are D1, D2 and D3.
And establishing a multiple mapping rule f: as long as bus stops within the specified space distance range all need to be mapped to a new bus stop, a multi-to-one stop mapping relation is established. Wherein, each bus stop can be mapped to different new bus stops, so long as a certain space distance range is met, instead of only allowing the merging operation to be performed once.
Step 1.2) the data set of the bus stop in the research area is marked as P, and the data set of the bus line is marked as L.
Step 1.3) based on the multiple mapping rule f, establishing a bus complex network Net1.
Step 1.3.1) referring to fig. 3, the unique value numbers of all bus stops in the study area are given.
Based on the multiple mapping rule f, generating a bus stop data set P into a new bus stop data set P1, and establishing a one-to-one correspondence table f1 of the unique value identification numbers of each bus stop in the data set P and the data set P1.
Referring to fig. 4, for the present example, there are 4 areas of bus stops that need to be consolidated. The area 3 and the area 4 are 2 bus stops to be combined into one bus stop, and belong to common stop combination.
The area 1 and the area 2 reflect the situation of multiple mapping, that is, the bus stop B needs to be combined with the bus stop A8 and the bus stop C1, and particularly, refer to fig. 5.
Referring to fig. 6, after the bus stops are combined, the reassignment of unique value identification numbers of the bus stops in the study area is performed. Further establishing a meaning correspondence table f1 of unique value identification numbers of the original bus stop and the combined bus stop.
For example, for the present example, the bus stops with unique value identifiers 4 and 16 will both correspond to the combined bus stop with unique value identifier 4. That is, a bus stop with the unique value identification number 4 after combination is found, and the bus stop can be known to be composed of the original bus stops with the unique value identification numbers 4 and 16 only by reverse calculation.
Step 1.3.2) according to the bus arrangement list among the bus stations in the bus route data set, if the reachable bus route exists among any 2 bus stations, a complex network edge exists among the 2 bus stations. Meanwhile, the number of lines of bus lines which can be reached between any 2 bus stops is used as the weight w1 of the complex network side.
Step 1.3.3) constructing a bus complex network Net1 by using P1 and w1 according to the complex network theory.
Step 1.4) based on the multiple mapping rule f, establishing a bus complex network Net2.
Step 1.4.1) according to the bus arrangement list among the stations in the bus line data set, if the bus stations in P1 passing through jointly exist among any 2 bus lines, a complex network edge exists among the 2 bus lines. Meanwhile, the number of bus stations in P1 which can pass through among any 2 bus lines together is used as the weight w2 of the complex network side.
Step 1.4.2) for all bus stops in P1 which any two bus lines in L pass through together, establishing a one-to-one correspondence between the identification numbers of the two lines and the unique identification numbers of all bus stops in P1 which pass through together, and recording as a relation table f2.
Step 1.4.3) constructing a bus complex network Net2 by using L and w2 according to the complex network theory.
The above 2 ways of constructing the bus complex network can be seen in fig. 7.
Step 2) respectively identifying bus hub stations and bus hub lines for Net1 and Net2.
Step 2.1) calculating weighted intermediacy index/degree of complex network node for Net1, selecting ten percent of top-ranked or ten top-ranked bus stops, and recording as data set P2.
Step 2.2) calculating weighted intermediacy index/degree of complex network node for Net2, selecting ten percent of public transportation lines with top ranking or ten public transportation lines with top ranking, and recording as data set L2.
And 3) carrying out reverse mapping calculation on the bus hub station identified by the Net1 to find out the related bus station.
Step 3.1), finding out the original unique value identification numbers of all bus stops in the data set P2 according to the corresponding relation table f1, and marking the unique value identification numbers as a set P3.
And 3.2) further carrying out space visual display on the found original bus stop according to the set P3.
For this example, referring to fig. 8, the combined bus stop with unique value identification number 4 is used as a bus hub stop, and the bus hub stop is found to be composed of 2 bus stops, namely A4 bus stop and a C4 bus stop in reality, by reverse mapping calculation, and the unique value identification number 4 and the unique value identification number 16 are found to correspond to each other.
And 4) carrying out reverse mapping calculation on the bus hub station identified by the Net2 to find out related bus routes and bus stations.
Step 4.1), finding out the original unique value identification numbers of all bus stops in the data set L2 according to the corresponding relation tables f2 and f1, and marking the unique value identification numbers as a set P4.
Step 4.2) further carrying out space visual display on the found original bus stop and L2 according to the set P4.
The foregoing is a further detailed description of the invention in connection with the preferred embodiments, and it is not intended that the invention be limited to the specific embodiments described. It will be apparent to those skilled in the art that several simple deductions or substitutions may be made without departing from the spirit of the invention, and these should be considered to be within the scope of the invention.
Claims (4)
1. The bus network hub evaluation method based on the multiple mapping rules is characterized by comprising the following steps of:
step 1), based on the established multiple mapping rules, establishing 2 types of bus complex networks for the bus stops and the bus lines in the study area, and respectively marking the complex networks as a first network Net1 and a second network Net2;
step 2), respectively identifying bus hub stations and bus hub lines for Net1 and Net2;
step 3), carrying out reverse mapping calculation on the bus hub station identified by Net1 to find out the related bus station;
step 4), carrying out reverse mapping calculation on the bus hub station identified by Net2, and finding out related bus routes and bus stations;
wherein, the step 1) specifically comprises the following sub-steps:
step 1.1), establishing a multiple mapping rule f: as long as bus stops within a specified space distance range are mapped to a new bus stop, a multi-to-one stop mapping relation is established; wherein, each bus stop can be mapped to different new bus stops, so long as a certain space distance range is satisfied;
step 1.2), marking a bus stop data set in a research area as P and marking a bus line data set as L;
step 1.3), based on multiple mapping rules f, establishing a bus complex network Net1:
step 1.3.1), generating a bus stop data set P into a new bus stop data set P1 based on a multiple mapping rule f, and establishing a one-to-one correspondence table f1 of unique value identification numbers of each bus stop in the data sets P and P1;
step 1.3.2), according to a bus arrangement list among bus stops in the bus route data set, if an accessible bus route exists among any 2 bus stops, a complex network edge exists among the 2 bus stops; meanwhile, the line number of the bus lines which can be reached between any 2 bus stops is used as the weight w1 of the complex network side;
step 1.3.3), constructing a bus complex network Net1 by using P1 and w1 according to a complex network theory;
step 1.4), based on the multiple mapping rule f, establishing a bus complex network Net2:
step 1.4.1), according to a bus arrangement list among stations in the bus line data set, if public bus stations in P1 which pass through jointly exist among any 2 bus lines, a complex network edge exists among the 2 bus lines; meanwhile, taking the number of bus stations in P1 which can jointly pass through among any 2 bus lines as the weight w2 of the complex network side;
step 1.4.2), establishing a one-to-one correspondence between the identification numbers of any two public transportation lines in L and the unique identification numbers of all public transportation stations in the common P1 for all public transportation stations in the common P1, and marking the correspondence as a relation table f2;
step 1.4.3), constructing a bus complex network Net2 by using L and w2 according to the complex network theory.
2. The method for evaluating a public transportation network hub based on multiple mapping rules according to claim 1, wherein the step 2) specifically comprises the following sub-steps:
step 2.1), calculating weighted intermediacy indexes/degrees of the complex network nodes for Net1, selecting ten percent of bus stops with the top ranking or ten bus stops with the top ranking, and recording the bus stops as a data set P2;
step 2.2), calculating weighted intermediacy index/degree of the complex network node for Net2, selecting ten percent of public transportation lines with the top ranking or ten public transportation lines with the top ranking, and recording the public transportation lines as a data set L2.
3. The method for evaluating a public transportation network hub based on multiple mapping rules according to claim 1, wherein the step 3) specifically comprises the following sub-steps:
step 3.1), finding out original unique value identification numbers of all bus stops in the data set P2 according to the corresponding relation table f1, and marking the unique value identification numbers as a set P3;
step 3.2), according to the set P3, carrying out space visual display on the found original bus stop.
4. The method for evaluating a public transportation network hub based on multiple mapping rules according to claim 1, wherein the step 4) specifically comprises the following sub-steps:
step 4.1), finding out original unique value identification numbers of all bus stops in the data set L2 according to the corresponding relation tables f2 and f1, and marking the unique value identification numbers as a set P4;
step 4.2), according to the set P4, carrying out space visual display on the found original bus stop and L2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010035291.3A CN111259308B (en) | 2020-01-14 | 2020-01-14 | Bus network hub evaluation method based on multiple mapping |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010035291.3A CN111259308B (en) | 2020-01-14 | 2020-01-14 | Bus network hub evaluation method based on multiple mapping |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111259308A CN111259308A (en) | 2020-06-09 |
| CN111259308B true CN111259308B (en) | 2023-04-28 |
Family
ID=70950389
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010035291.3A Active CN111259308B (en) | 2020-01-14 | 2020-01-14 | Bus network hub evaluation method based on multiple mapping |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111259308B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113268843B (en) * | 2021-06-28 | 2022-12-02 | 江苏省城市规划设计研究院有限公司 | Line-polygon public transportation complex network construction method considering planar element incidence relation |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104361024A (en) * | 2014-10-22 | 2015-02-18 | 百度在线网络技术（北京）有限公司 | Bus information inquiring and feedback method, mobile terminal and server |
| CN107742169A (en) * | 2017-10-24 | 2018-02-27 | 山东大学 | A kind of Urban Transit Network system constituting method and performance estimating method based on complex network |
| CN109360420B (en) * | 2018-11-21 | 2021-03-16 | 青岛大学 | Public traffic big data processing system and method |
| CN110472797B (en) * | 2019-08-22 | 2021-04-23 | 江苏省城市规划设计研究院 | Web-based urban public transportation complex network automatic generation method |
-
2020
- 2020-01-14 CN CN202010035291.3A patent/CN111259308B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN111259308A (en) | 2020-06-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| AU2020100703A4 (en) | A method of spatial accessibility evaluation of urban facility services based on GIS | |
| CN110008413B (en) | Traffic travel problem query method and device | |
| Barceló et al. | Vehicle routing and scheduling models, simulation and city logistics | |
| CN102411764B (en) | The data management system of grid equipment and management method | |
| CN110472797B (en) | Web-based urban public transportation complex network automatic generation method | |
| CN112036766A (en) | Gridding distribution network service management method and device, computer equipment and storage medium | |
| CN105354680B (en) | GIS-based power grid section auxiliary determination analysis method | |
| Mashhoodi et al. | The two and half minute walk: Fast charging of electric vehicles and the economic value of walkability | |
| CN111259308B (en) | Bus network hub evaluation method based on multiple mapping | |
| CN113642814A (en) | Intelligent resource planning method and system implemented based on city management service | |
| CN115481890A (en) | Intelligent supply chain logistics scheduling method | |
| CN104967534B (en) | A kind of Grid Central and distribution substation's cable resource unified management and planing method | |
| CN116187605A (en) | Bus network line selection method based on GIS technology | |
| CN115049215A (en) | Method for constructing urban traffic flow spatial distribution model | |
| Bandt et al. | Building a spatial decision support system for tourism and infrastructure planning: Τechnical solution and data integration challenges | |
| CN108875032A (en) | Area type determines method and device | |
| CN111008730B (en) | Crowd concentration prediction model construction method and device based on urban space structure | |
| Wang et al. | In‐Depth Learning Layout and Path Optimization of Energy Service Urban Distribution Sites under e‐Commerce Environment | |
| CN109193946B (en) | Urgent repair information release system for power consumer | |
| CN115545663A (en) | Urban rail transit asset information matching method based on contract asset mapping model | |
| CN107909226A (en) | A kind of Business Process System power supply plan design method and device | |
| CN113705623A (en) | Rail transit station classification method and device | |
| CN113268843B (en) | Line-polygon public transportation complex network construction method considering planar element incidence relation | |
| CN107066486A (en) | A kind of cross-domain querying method of the visualization of Urban Data | |
| Guo et al. | Research on digital management system of transport infrastructure in the era of big data |
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 | ||
| CB02 | Change of applicant information |
Address after: 210019 Building B3, No. 1, Yunlongshan Road, Jianye District, Nanjing, Jiangsu Applicant after: Jiangsu urban planning and Design Institute Co.,Ltd. Address before: 210036 Jiangsu Jianshe Building, No. 88, Caochangmen Street, Gulou District, Nanjing, Jiangsu Applicant before: JIANGSU INSTITUTE OF URBAN PLANNING AND DESIGN |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |