CN111259308A - Bus network hub evaluation method based on multiple mappings - Google Patents
Bus network hub evaluation method based on multiple mappings Download PDFInfo
- Publication number
- CN111259308A CN111259308A CN202010035291.3A CN202010035291A CN111259308A CN 111259308 A CN111259308 A CN 111259308A CN 202010035291 A CN202010035291 A CN 202010035291A CN 111259308 A CN111259308 A CN 111259308A
- Authority
- CN
- China
- Prior art keywords
- bus
- stops
- data set
- network
- stop
- 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
- 238000013507 mapping Methods 0.000 title claims abstract description 48
- 238000011156 evaluation Methods 0.000 title claims abstract description 20
- 238000011160 research Methods 0.000 claims abstract description 13
- 238000004364 calculation method Methods 0.000 claims abstract description 10
- 238000000034 method Methods 0.000 claims description 7
- 238000012800 visualization Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 6
- 238000010276 construction Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000013178 mathematical model Methods 0.000 description 2
- 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
- 238000007726 management method Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000000007 visual effect Effects 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 bus network hub evaluation method based on multiple mappings. Firstly, establishing 2 types of public transportation complex networks for bus stops and bus lines in a research area based on established multiple mapping rules, and respectively recording the networks as Net1 and Net 2; secondly, identifying the bus junction station and the bus junction line for Net1 and Net2 respectively; then, reverse mapping calculation is carried out on the bus junction stations identified by Net1, and related bus stations are found; and finally, performing reverse mapping calculation on the bus hub stations identified by Net2, and finding out related bus lines. The invention can identify important bus junction stations and junction lines on the basis of solving the problem that bus stations need to be merged 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 transport network hub evaluation method based on multiple mapping rules.
Background
At present, the optimization of the urban public transport network is an important means for guaranteeing residents to enjoy basic public services, and is also one of important ways for realizing better green and low-carbon travel. The construction of the mathematical model of the public transportation network is one of the important technical means for optimizing the urban public transportation network, and the mathematical model must be established on the basis of reasonable abstraction of practical problems and also takes the actual requirements of planning and management into consideration. However, certain problems still exist in the current public transport network modeling process:
the first problem is: some bus stops are close to each other in a city, and people can transfer bus trips among the bus stops close to each other. These stations should be considered together as a node on the public transportation network in a sense, not just multiple public transportation stations.
Aiming at the problem, the one-to-one correspondence relationship between the bus stops with the shorter distance and the combined bus stops can be established, so that planning design and managers can be helped to better evaluate the current bus network. It should be noted that in this way, a plurality of bus stops within a certain spatial distance range are not directly merged into one bus stop, so that each bus stop can only correspond to one unique bus stop (merged bus stop). In fact, in the bus network established in this way, each bus stop may be merged to a different bus stop (merged bus stop), thereby forming a multiple mapping relationship.
The second problem is: when the traditional public transport network is modeled, bus stops are taken as nodes of the network, and the connection of the bus stops in each shift is taken as an edge of the network. The construction mode takes the bus stop as a core evaluation object, and the detailed analysis of the bus route is ignored to a great extent.
Aiming at the problem, the analysis shows that if a bus line is taken as a node of the network, if a common bus stop exists between 2 bus lines, the bus line is considered to have a network edge. The bus network model constructed in the mode takes the bus line as the core to a great extent during evaluation. As for a manager of bus planning, the bus route can be quickly adjusted and perfected, and the travel demand of urban residents can be met at the highest speed. In contrast, changes to the bus stop (e.g., new build and obsolete) are relatively weak in terms of timeliness.
Disclosure of Invention
The invention aims to solve the technical problem of overcoming the defects of the prior art and providing a bus network hub evaluation method based on multiple mappings, and on the basis of 2 bus network models, the combination problem among short-distance bus stops and the space scale combination problem of the bus stops are also considered, so that the evaluation of the bus 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 mappings, which comprises the following steps:
step 1), establishing 2 types of public transportation complex networks for bus stops and bus lines in a research area based on the established multiple mapping rules, and respectively recording the networks as a first network Net1 and a second network Net 2;
step 2), respectively identifying the bus junction stations and the bus junction lines of Net1 and Net 2;
step 3), carrying out reverse mapping calculation on the bus junction stations identified by Net1 to find out related bus stations;
and step 4), carrying out reverse mapping calculation on the bus hub stations identified by Net2 to find out related bus lines and bus stations.
Further, the invention provides a bus network hub evaluation method based on multiple mapping rules, and the step 1) specifically comprises the following substeps:
step 1.1), establishing a multiple mapping rule f: as long as bus stops within a specified spatial distance range need to be mapped to a new bus stop, a many-to-one stop mapping relation is established; wherein, each bus stop can be mapped to different new bus stops as long as a certain spatial distance range is met;
step 1.2), recording a bus stop data set in a research area as P and recording a bus route data set as L;
step 1.3), establishing a public transportation complex network Net1 based on a multiple mapping rule f:
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 the unique value identification number of each bus stop in the data set P and the P1;
step 1.3.2), according to a regular bus arrangement list among bus stops in a bus route data set, if reachable bus routes exist among any 2 bus stops, a complex network edge exists among the 2 bus stops; meanwhile, the number of reachable bus routes between any 2 bus stops is used as the weight w1 of the complex network side;
step 1.3.3), constructing a public transportation complex network Net1 by utilizing P1 and w1 according to a complex network theory;
step 1.4), establishing a public transportation complex network Net2 based on a multiple mapping rule f:
step 1.4.1), according to a regular bus arrangement list among bus route data centralized stops, if bus stops in P1 passing through the bus routes together exist among any 2 bus routes, a complex network edge exists among the 2 bus routes; meanwhile, the number of bus stops in P1, which can be passed by any 2 bus lines together, is used as the weight w2 of the complex network side;
step 1.4.2), establishing a one-to-one correspondence relationship between the identification numbers of any two lines and the unique identification numbers of all bus stops in P1 passing through together for all bus stops in P1 passing through together by any two bus lines in L, and recording as a relationship table f 2;
step 1.4.3), constructing a public transportation complex network Net2 by utilizing L and w2 according to a complex network theory.
Further, the bus network hub evaluation method based on multiple mapping rules provided by the invention comprises the following specific substeps in step 2):
step 2.1), calculating the weighted intermediate index/degree of the complex network node for Net1, selecting the bus stop ten percent or ten percent before the ranking, and recording as a data set P2;
step 2.2), calculating the weighted intermediacy index/degree of the complex network node for Net2, selecting the bus route ten percent or ten percent before the ranking, and recording as a data set L2.
Further, the bus network hub evaluation method based on multiple mapping rules provided by the invention comprises the following specific substeps in step 3):
step 3.1), finding out original unique value identification numbers of all bus stops in a data set P2 according to a corresponding relation table f1, and recording the unique value identification numbers as a set P3;
step 3.2), performing space visualization display on the found original bus stop according to the set P3.
Further, the bus network hub evaluation method based on multiple mapping rules provided by the invention comprises the following specific substeps in step 4):
step 4.1), finding out original unique value identification numbers of all bus stops in a data set L2 according to the corresponding relation tables f2 and f1, and recording the unique value identification numbers as a set P4;
step 4.2), performing space visualization display on the found original bus stop and the L2 according to the set P4.
Compared with the prior art, the invention adopting the technical scheme has the following technical effects:
(1) the invention provides a bus network hub evaluation method based on multiple mappings, which can consider the problem of station merging between bus stations with similar distances and make the evaluation of a bus network more consistent with the actual situation. Meanwhile, the combination rule in the invention allows each bus stop to be combined for multiple times, so that each bus stop can fully exert the best proximity advantage.
(2) The invention can integrate the merging problem of the bus stops under the distance constraint with 2 types of bus network modeling, so that the evaluation of the bus network not only focuses on the evaluation of the stops more effectively, but also realizes the effective evaluation of bus routes.
Drawings
FIG. 1 is a schematic overall flow diagram of the present invention.
FIG. 2 is a schematic view of bus stops and bus routes within the research area of the present invention.
FIG. 3 is a schematic view of the bus stop numbering in the research area of the present invention.
Fig. 4 is a schematic diagram of a region in which bus stops needing to be merged in the research region of the invention are located.
FIG. 5 is a diagram illustrating a multiple mapping process of the present invention.
Fig. 6 is a number schematic diagram of the merged bus stops in the research area of the present invention.
Fig. 7 is a schematic diagram of the construction of 2 public transportation complex networks of the invention.
FIG. 8 is a diagram illustrating the result of finding the original bus stop at the bus hub according to the present invention.
Detailed Description
The technical scheme of the invention is further explained in detail by combining the attached drawings:
the invention provides a bus network hub evaluation method based on multiple mappings, which comprises the following steps:
step 1) referring to the attached figure 1, 2 types of public transportation complex networks are established for bus stops and bus lines in a research area based on multiple mapping rules and are respectively marked as Net1 and Net 2.
Step 1.1) fig. 2 shows the distribution of the public transport network in the study area in the example: the research area comprises 4 bus lines which are respectively line1, line2, line3 and line4, wherein bus stops included in the line1 are A0, A1, A2, A3, A4, A5, A6, A7 and A8, bus stops included in the line2 are B1, B2, B3 and B4, bus stops included in the line3 are C1, C2, C3, C4, C5 and C6, and bus stops included in the line4 are D1, D2 and D3.
And then establishing a multiple mapping rule f: as long as bus stops within the specified spatial distance range need to be mapped to a new bus stop, a many-to-one stop mapping relation is established. Each bus stop can be mapped to different new bus stops as long as a certain spatial distance range is met, and only one merging operation is allowed.
And step 1.2) recording a bus stop data set in the research area as P and a bus route data set as L.
Step 1.3) establishing a public transportation complex network Net1 based on the multiple mapping rule f.
Step 1.3.1) see fig. 3, numbering the unique values of all bus stops in the study area.
Based on the multiple mapping rule f, the bus stop data set P is generated into a new bus stop data set P1, and a one-to-one correspondence table f1 of unique value identification numbers of each bus stop in the data set P and the data set P1 is established.
Referring to fig. 4, for the present example, there are cases where bus stops in 4 zones need to be merged. The area 3 and the area 4 are 2 bus stops which need to be combined into one bus stop, and the bus stop combination method belongs to general bus stop combination.
The areas 1 and 2 reflect the situation of multiple mappings, that is, the bus stop B needs to be merged with the bus stop A8 and with the bus stop C1, which can be seen in fig. 5.
Referring to fig. 6, the reassignment condition of the unique value identification number of the bus stop in the research area after the bus stops are merged. And further establishing a meaning corresponding relation table f1 of the unique value identification numbers of the original bus stop and the merged bus stop.
For example, for the present example, the original bus stops with unique value identification numbers of 4 and 16 will both correspond to the bus stop with unique value identification number of 4 after being merged. That is to say, if a combined bus stop with a unique value identification number of 4 is found, it can be known that the bus stop is composed of the original bus stops with unique value identification numbers of 4 and 16 only by reverse calculation.
Step 1.3.2) according to a regular bus arrangement list among bus stops in the bus route data set, if reachable bus routes exist among any 2 bus stops, a complex network edge exists among the 2 bus stops. Meanwhile, the number of reachable bus routes between any 2 bus stops is taken as the weight w1 of the complex network side.
Step 1.3.3) according to the complex network theory, constructing a public transportation complex network Net1 by utilizing P1 and w 1.
And step 1.4) establishing a public transport complex network Net2 based on the multiple mapping rule f.
Step 1.4.1) according to a regular bus arrangement list among bus route data centralized stops, if bus stops in P1 passing through commonly exist among any 2 bus routes, a complex network edge exists among the 2 bus routes. Meanwhile, the number of bus stops in P1, which can be passed by 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 where any two bus lines in L pass through together, establishing a one-to-one correspondence relationship between the identification numbers of the two lines and the unique identification numbers of all bus stops in P1 where the two lines pass through together, and recording the correspondence relationship as a relationship table f 2.
Step 1.4.3) according to the complex network theory, constructing a public transport complex network Net2 by using L and w 2.
The 2 ways for constructing the complex public transportation network can be seen in fig. 7.
And step 2) respectively identifying the bus junction station and the bus junction line for Net1 and Net 2.
And 2.1) calculating the weighted intermediacy index/degree of the Net1 for the complex network nodes, selecting the bus stations ten percent or ten percent before the ranking, and recording as a data set P2.
And 2.2) calculating the weighted intermediacy index/degree of the Net2 for the complex network nodes, selecting the bus routes ten percent or ten percent before the ranking, and recording the bus routes as a data set L2.
And 3) carrying out reverse mapping calculation on the bus junction stations identified by Net1 to find out related bus stations.
And 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 recording the unique value identification numbers as a set P3.
And 3.2) further performing space visualization display on the found original bus stop according to the set P3.
For the example, referring to fig. 8, the combined bus stop with the unique value identification number of 4 is used as a bus hub stop, and through reverse mapping calculation, the bus stop is found to correspond to the unique value identification number of 4 and the unique value identification number of 16, so that it can be known that the bus hub stop is composed of 2 bus stops, i.e., a4 and C4 in reality.
And 4) carrying out reverse mapping calculation on the bus junction stations identified by Net2 to find out related bus lines and bus stations.
And 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 recording the unique value identification numbers as a set P4.
And 4.2) further performing space visual display on the found original bus stop and the L2 according to the set P4.
The foregoing is a more detailed description of the invention in connection with specific preferred embodiments and it is not intended that the invention be limited to these specific details. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all should be considered as belonging to the protection scope of the invention.
Claims (5)
1. A bus network hub evaluation method based on multiple mapping rules is characterized by comprising the following steps:
step 1), establishing 2 types of public transportation complex networks for bus stops and bus lines in a research area based on the established multiple mapping rules, and respectively recording the networks as a first network Net1 and a second network Net 2;
step 2), respectively identifying the bus junction stations and the bus junction lines of Net1 and Net 2;
step 3), carrying out reverse mapping calculation on the bus junction stations identified by Net1 to find out related bus stations;
and step 4), carrying out reverse mapping calculation on the bus hub stations identified by Net2 to find out related bus lines and bus stations.
2. The method for evaluating the bus network hub based on the multiple mapping rules according to claim 1, wherein the step 1) specifically comprises the following substeps:
step 1.1), establishing a multiple mapping rule f: as long as bus stops within a specified spatial distance range need to be mapped to a new bus stop, a many-to-one stop mapping relation is established; wherein, each bus stop can be mapped to different new bus stops as long as a certain spatial distance range is met;
step 1.2), recording a bus stop data set in a research area as P and recording a bus route data set as L;
step 1.3), establishing a public transportation complex network Net1 based on a multiple mapping rule f:
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 the unique value identification number of each bus stop in the data set P and the P1;
step 1.3.2), according to a regular bus arrangement list among bus stops in a bus route data set, if reachable bus routes exist among any 2 bus stops, a complex network edge exists among the 2 bus stops; meanwhile, the number of reachable bus routes between any 2 bus stops is used as the weight w1 of the complex network side;
step 1.3.3), constructing a public transportation complex network Net1 by utilizing P1 and w1 according to a complex network theory;
step 1.4), establishing a public transportation complex network Net2 based on a multiple mapping rule f:
step 1.4.1), according to a regular bus arrangement list among bus route data centralized stops, if bus stops in P1 passing through the bus routes together exist among any 2 bus routes, a complex network edge exists among the 2 bus routes; meanwhile, the number of bus stops in P1, which can be passed by any 2 bus lines together, is used as the weight w2 of the complex network side;
step 1.4.2), establishing a one-to-one correspondence relationship between the identification numbers of any two lines and the unique identification numbers of all bus stops in P1 passing through together for all bus stops in P1 passing through together by any two bus lines in L, and recording as a relationship table f 2;
step 1.4.3), constructing a public transportation complex network Net2 by utilizing L and w2 according to a complex network theory.
3. The method for evaluating the bus network hub based on the multiple mapping rules according to claim 1, wherein the step 2) specifically comprises the following substeps:
step 2.1), calculating the weighted intermediate index/degree of the complex network node for Net1, selecting the bus stop ten percent or ten percent before the ranking, and recording as a data set P2;
step 2.2), calculating the weighted intermediacy index/degree of the complex network node for Net2, selecting the bus route ten percent or ten percent before the ranking, and recording as a data set L2.
4. The method for evaluating the bus network hub based on the multiple mapping rules according to claim 2, wherein the step 3) specifically comprises the following substeps:
step 3.1), finding out original unique value identification numbers of all bus stops in a data set P2 according to a corresponding relation table f1, and recording the unique value identification numbers as a set P3;
step 3.2), performing space visualization display on the found original bus stop according to the set P3.
5. The method for evaluating the bus network hub based on the multiple mapping rules according to claim 2, wherein the step 4) specifically comprises the following substeps:
step 4.1), finding out original unique value identification numbers of all bus stops in a data set L2 according to the corresponding relation tables f2 and f1, and recording the unique value identification numbers as a set P4;
step 4.2), performing space visualization display on the found original bus stop and the L2 according to the set P4.
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 true CN111259308A (en) | 2020-06-09 |
| CN111259308B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113268843A (en) * | 2021-06-28 | 2021-08-17 | 江苏省城市规划设计研究院有限公司 | Line-polygon public transportation complex network construction method considering planar element incidence relation |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20160048006A (en) * | 2014-10-22 | 2016-05-03 | 바이두 온라인 네트웍 테크놀러지 (베이징) 캄파니 리미티드 | Feedback method for bus information inquiry, 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 |
| CN109360420A (en) * | 2018-11-21 | 2019-02-19 | 青岛大学 | A kind of public transport big data processing system and method |
| CN110472797A (en) * | 2019-08-22 | 2019-11-19 | 江苏省城市规划设计研究院 | A kind of city bus complex network automatic generating method based on web |
-
2020
- 2020-01-14 CN CN202010035291.3A patent/CN111259308B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20160048006A (en) * | 2014-10-22 | 2016-05-03 | 바이두 온라인 네트웍 테크놀러지 (베이징) 캄파니 리미티드 | Feedback method for bus information inquiry, 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 |
| CN109360420A (en) * | 2018-11-21 | 2019-02-19 | 青岛大学 | A kind of public transport big data processing system and method |
| CN110472797A (en) * | 2019-08-22 | 2019-11-19 | 江苏省城市规划设计研究院 | A kind of city bus complex network automatic generating method based on web |
Non-Patent Citations (1)
| Title |
|---|
| 金彪等: "基于复杂网络的福州公交网络分析与评价", 《福建师范大学学报(自然科学版)》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113268843A (en) * | 2021-06-28 | 2021-08-17 | 江苏省城市规划设计研究院有限公司 | Line-polygon public transportation complex network construction method considering planar element incidence relation |
| CN113268843B (en) * | 2021-06-28 | 2022-12-02 | 江苏省城市规划设计研究院有限公司 | Line-polygon public transportation complex network construction method considering planar element incidence relation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111259308B (en) | 2023-04-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Barceló et al. | Vehicle routing and scheduling models, simulation and city logistics | |
| CN104809112B (en) | A kind of city bus development level integrated evaluating method based on multi-source data | |
| CN109409662B (en) | Measuring method for correlation between urban traffic and commercial space based on space syntax | |
| CN110472797B (en) | Web-based urban public transportation complex network automatic generation method | |
| Davila et al. | Modeling Boston: A workflow for the generation of complete urban building energy demand models from existing urban geospatial datasets | |
| CN108426579B (en) | Automatic generation method for internal floor path network | |
| Bilişik et al. | Passenger satisfaction evaluation of public transportation in Istanbul by using fuzzy quality function deployment methodology | |
| CN108776875A (en) | A kind of cooperative operation system based on design, construction and O&M set | |
| CN113642814A (en) | Intelligent resource planning method and system implemented based on city management service | |
| Huang et al. | A GIS-based framework for bus network optimization using genetic algorithm | |
| Kim et al. | p‐Functional Clusters Location Problem for Detecting Spatial Clusters with Covering Approach | |
| CN111259308B (en) | Bus network hub evaluation method based on multiple mapping | |
| CN114240107A (en) | Accessibility evaluation method between station stations in public transport composite network | |
| Zhang et al. | Approximating actual flows in physical infrastructure networks: the case of the Yangtze River Delta high-speed railway network | |
| CN105243439A (en) | Road network structure based urban agglomeration intercity railway line network scale measuring method | |
| Glackin et al. | A software-aided workflow for precinct-scale residential redevelopment | |
| CN109840611A (en) | A kind of Integrated services access area constant volume addressing processing method and processing device | |
| Laporte et al. | Assessing the efficiency of rapid transit configurations | |
| Young et al. | A parking model hierarchy | |
| CN110674990A (en) | Instant delivery path selection method and system with sliding window updating mechanism | |
| CN108027902A (en) | Interconnection engine for interconnection facilities | |
| Monzón et al. | Influence of the first and last mile on HSR accessibility levels | |
| Erkut et al. | TransAlta redesigns its service-delivery network | |
| CN107909226A (en) | A kind of Business Process System power supply plan design method and device | |
| Derrible | The properties and effects of metro network designs |
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 |