Traffic project path comparison and selection method and system

Abstract

The invention provides a traffic project path comparison and selection method and system, and belongs to the technical field of traffic planning. The method comprises the following steps: constructing a basic traffic network, adding each scheme line position of a project, and setting traffic restriction information; creating an OD cell centroid node, and communicating the centroid node with the traffic network; constructing a project-free network and each scheme network, and setting impedance and limiting conditions; calculating the shortest path line and cost of each OD interval in the project-free network and each scheme network by taking mileage, time, cost and carbon emission as cost factors of impedance; on the basis of the acquired shortest path line and cost, generating an expected path comparison diagram of each OD interval in the project-free network and the optimal scheme network; and interval evaluation is carried out by adopting an entropy weight TOPSIS method, and a global optimal scheme is determined in combination with a weighted comprehensive scoring method. By calculating the expected path cost and the GIS circuit diagram under different impedances in the multi-scheme network, the analysis content of scheme comparison and selection is enriched, and the necessity of scheme construction is enhanced.

Description

Technical Field

[0001] The present invention belongs to the technical field of traffic planning, and in particular relates to a traffic project path comparison method and system. Background Art

[0002] The statements in this section merely provide background information related to the present invention and do not necessarily constitute prior art.

[0003] In the early stages of transportation project plan research, it is necessary to form a preliminary channel plan based on the project's main service area, combined with the current situation and planned transportation network layout, and conduct path comparison based on traffic travel distribution to select a recommended channel plan.

[0004] Currently, the four-stage method for selecting transportation project routes primarily uses a four-stage approach, allocating traffic volume based on the OD of key impact areas and using traffic volume as the primary basis for route selection. This method fails to directly compare the mileage, time, cost, and carbon emissions savings of various options, fails to clearly demonstrate which impact areas are most attractive to each option, and lacks analysis and presentation of the desired route within each OD interval.

[0005] Traditional methods for analyzing and presenting paths across multiple intervals and scenarios require repeated calculations and drawing, resulting in high workload and low efficiency. This repetitive work not only wastes significant manpower and time, but is also prone to errors and omissions.

[0006] Existing methods do not have an algorithm for automatic batch analysis of expected paths, which makes the path selection process cumbersome and difficult to manage when dealing with large-scale transportation projects. Summary of the Invention

[0007] To overcome the deficiencies of the above-mentioned prior art, the present invention provides a method and system for comparing and selecting transportation project paths. By calculating the expected path with the lowest cost in terms of mileage, time, cost, carbon emissions, etc. for each interval in the network with and without the project, a comparison chart of the expected paths for each interval in the network with and without the project is formed, intuitively showing the attraction of each solution to the traffic flow in different intervals. An expected path analysis system is provided to automatically calculate the shortest path and optimal solution for each interval, and batch generate comparison charts of the expected paths for each interval with and without the project. The entropy-weighted TOPSIS+ weighted comprehensive scoring method is adopted to comprehensively consider the impact of various cost factors on the solution selection and recommend the global optimal solution.

[0008] To achieve the above objectives, one or more embodiments of the present invention provide the following technical solutions:

[0009] A first aspect of the present invention provides a method for comparing and selecting routes for a transportation project;

[0010] A method for comparing and selecting routes for transportation projects, comprising:

[0011] Build a basic transportation network, add the line positions of each project plan, and set restricted access information; create the OD community centroid node and connect the centroid node to the transportation network; build a non-project network and each plan network, and set impedance and restriction conditions;

[0012] Using mileage, time, cost, and carbon emissions as impedance cost factors, calculate the shortest path and cost of each OD interval in the network without the project and the network of each solution;

[0013] Based on the obtained shortest path routes and costs, a comparison diagram of the expected paths of each OD interval in the network without the project and the network with the optimal solution is generated;

[0014] The entropy weighted TOPSIS method is used to conduct interval evaluation of each scheme, and the global optimal scheme is determined in combination with the weighted comprehensive scoring method.

[0015] As a further technical solution, the construction of the basic transportation network includes:

[0016] Establish a basic transportation network without projects in the geographic information system, add speed, unit mileage, and cost information, and calculate mileage, time, cost, and carbon emissions;

[0017] Add the route locations of each transportation project that requires scheme comparison to the basic transportation network, add the scheme name and restricted access information of each scheme, and the restricted access value is 0 for allowing access and 1 for prohibiting access;

[0018] Set the value of the restricted access of each scheme in the network without project to 1, the restricted access value of this scheme in the network of each scheme to 0, and the value of other schemes to 1;

[0019] Mileage, time, expense, and carbon emissions are set as cost factors in the network impedance. Restrictions are set for the network without a project and the networks of each scheme, so that elements with a pass value of 1 are not included in the network.

[0020] As a further technical solution, the calculation of the shortest path and cost includes:

[0021] Taking the OD centroid node as the starting and ending points, the Dijkstra algorithm is used to calculate the shortest path under different impedances in each scheme network;

[0022] Record the shortest path route and corresponding cost data for each plan.

[0023] As a further technical solution, the process of generating the expected path comparison diagram is to merge the shortest path cost calculation results of each OD interval under different networks and different impedances;

[0024] Determine the optimal solution corresponding to the minimum cost of each interval and overlay it with the shortest path in the project-free network.

[0025] As a further technical solution, the entropy weight TOPSIS method includes: converting mileage, time, cost, and carbon emissions into unit mileage indicators and performing standardization processing;

[0026] Use the entropy weight method to calculate the objective weight of each indicator, or set the subjective weight according to needs;

[0027] Calculate the proximity of each solution in each interval, and the solution with the largest proximity is the optimal solution in the interval.

[0028] As a further technical solution, the weighted comprehensive scoring method includes calculating the weighted comprehensive proximity of each solution using the traffic proportion of each interval as a weight; the solution with the largest weighted comprehensive proximity is the global optimal solution.

[0029] A second aspect of the present invention provides a transportation project route comparison system.

[0030] A transportation project route comparison system, comprising:

[0031] The network construction module is configured to: construct a basic transportation network, add the line positions of each channel plan, and set the restricted access information; create the OD cell centroid node and connect the centroid node to the transportation network; construct the project-free network and each plan network, and set the impedance and restriction conditions;

[0032] The path calculation module is configured to calculate the shortest path and cost of each OD interval in the non-project network and each solution network, using mileage, time, cost, and carbon emissions as impedance cost factors;

[0033] The visualization module is configured to: generate a comparison diagram of expected paths of each OD interval in the network without the project and the network with the optimal solution based on the obtained shortest path routes and costs;

[0034] The evaluation module is configured to: use the entropy weight TOPSIS method to perform interval evaluation on each solution, and combine it with the weighted comprehensive scoring method to determine the global optimal solution.

[0035] A third aspect of the present invention provides a computer-readable storage medium having a program stored thereon, which, when executed by a processor, implements the steps of a method for comparing and selecting a path for a transportation project as described in the first aspect of the present invention.

[0036] The fourth aspect of the present invention provides an electronic device, comprising a memory, a processor, and a program stored in the memory and executable on the processor. When the processor executes the program, the steps in the method for path comparison of a transportation project as described in the first aspect of the present invention are implemented.

[0037] One or more of the above technical solutions have the following beneficial effects:

[0038] The present invention calculates the expected path costs and GIS route maps under different impedances in a multi-scheme network, intuitively compares the mileage, time, expenses, carbon emissions and other costs saved by each scheme, and intuitively demonstrates the attractiveness of each scheme to the affected area, enriching the analysis content of scheme comparison and enhancing the necessity of scheme construction.

[0039] The entropy-weighted TOPSIS+weighted comprehensive scoring method is adopted to comprehensively consider the impact of various cost factors and the traffic flow in each interval on the scheme selection, avoiding the collinearity of influencing factors and the subjectivity of weight assignment, and can perform a global comprehensive ranking of various schemes.

[0040] An algorithm has been formed for automatic batch comparison and analysis of multi-interval, multi-scheme, and multi-impedance expected paths. It can be used in transportation project planning, preliminary feasibility studies, feasibility studies, and other work to compare project plans, intermodal transport modes, etc., greatly reducing repetitive work and improving work efficiency.

[0041] Advantages of additional aspects of the present invention will be given in part in the following description and in part will be obvious from the following description, or will be learned through practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] The accompanying drawings, which constitute a part of the present invention, are used to provide a further understanding of the present invention. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute improper limitations on the present invention.

[0043] Figure 1 This is a flow chart of the method of the first embodiment.

[0044] Figure 2 This is a schematic diagram of the shortest path cost results for each interval in the first embodiment.

[0045] Figure 3 Schematic diagram of the proximity results of each interval scheme in the first embodiment.

[0046] Figure 4 This is a schematic diagram of the results of the scheme comparison in the first embodiment.

[0047] Figure 5 This is a system structure diagram of the second embodiment. DETAILED DESCRIPTION

[0048] It should be noted that the following detailed descriptions are exemplary and intended to provide further explanation of the present invention. Unless otherwise specified, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the art to which the present invention belongs.

[0049] It should be noted that the terms used herein are for describing particular embodiments only and are not intended to limit the exemplary embodiments according to the present invention.

[0050] In the absence of conflict, the embodiments of the present invention and the features thereof may be combined with each other.

[0051] Example 1

[0052] This embodiment discloses a method for comparing and selecting routes for a transportation project;

[0053] like Figure 1 As shown in FIG, a method for comparing and selecting paths for transportation projects includes:

[0054] Step S1: Build a basic transportation network, add the line positions of each channel scheme, and set the restricted access information; create the OD cell centroid node and connect the centroid node to the transportation network; build the project-free network and each scheme network, and set the impedance and restriction conditions;

[0055] Establish a basic transportation network without projects in the geographic information system, add information such as speed per hour and unit mileage cost, and calculate mileage, time, cost, carbon emissions, etc.

[0056] Add the line positions of each channel plan of this project to the basic transportation network, add the plan name and restricted access information of each plan, and the value of restricted access is 0 for allowing access and 1 for prohibiting access.

[0057] Establish nodes, create OD cell centroid nodes, connect the centroid nodes with the transportation network, and use them to calculate the shortest path between OD cells.

[0058] Create a network without a project and a network with various schemes. In the network without a project, the restricted access values of all the schemes in the project are all 1. In the network with various schemes, the restricted access value of this scheme is 0, and the values of other schemes are 1.

[0059] Set restrictions on the no-project network and each scheme network, and restrict the elements with a pass value of 1 to not be included in the network.

[0060] Set the cost impedance of the network without the project and each plan network, including mileage, time, cost, carbon emissions, etc.

[0061] Step S2: Calculate the shortest path and cost of each OD interval in the network without the project and in each solution network, using mileage, time, cost, and carbon emissions as cost factors of impedance;

[0062] The starting and ending points of the paths are set as the centroid nodes of the OD cells. The network without the project and the networks of each solution are used, and the Dijkstra algorithm is used to calculate the shortest paths between all starting and ending points using mileage, time, cost, carbon emissions, etc. as impedances. The shortest path routes and costs of all starting and ending points in each solution network are generated. The calculation results of all OD intervals in each solution network are recorded with the solution name. The route results are stored as GIS files, and the cost results are stored as tables.

[0063] Step S3: Based on the obtained shortest path and cost, a comparison diagram of the expected path of each OD interval in the network without the project and the network with the optimal solution is generated;

[0064] According to the same OD interval, the shortest path cost calculation result tables with different scheme names and different impedances are merged, and the scheme name corresponding to the minimum cost of each interval under different impedances is calculated to obtain the optimal scheme under the mileage, time, cost, and carbon emission bias of each interval.

[0065] In the shortest path line gis file of all OD intervals in each solution network, select the line corresponding to the interval of the optimal solution, and merge the lines selected in each solution network into one optimal solution line gis file;

[0066] In the shortest path route gis file of all OD intervals in the network without a project, select the shortest path route of a certain OD interval; in the optimal solution route gis file, select the optimal solution route for the interval; superimpose and display the two selected routes for the interval, and display the name of the OD interval and the name of the optimal solution to obtain the expected path diagram of the interval; loop through all OD intervals to obtain the expected path diagram of all intervals, and intuitively compare the path selected when there is no project in each interval with the path selected using the optimal solution when there is a project.

[0067] In step S4, the entropy-weighted TOPSIS method is used to perform interval evaluation on each solution, and the weighted comprehensive scoring method is combined to determine the global optimal solution.

[0068] Step S41 constructs a decision matrix for each OD interval, creating a data matrix for each scenario with and without the project, based on cost factors such as mileage, cost, time, and carbon emissions. To eliminate the direct impact of mileage on cost, time, and carbon emissions, these factors are converted into per-mileage metrics. The data matrix is constructed using factors such as mileage, cost per mileage, time per mileage, and carbon emissions per mileage.

[0069] Step S42: normalize the original data into dimensionless values by using range normalization to eliminate the influence of units and dimensions, and add a small norm (1e-10) to avoid zero division.

[0070] The standardized calculation formula is as follows:

[0071]

[0072] Among them, rij is the standardized value of the i-th plan on the j-th factor, xij is the original value, i represents the project plan, and j represents the cost factor.

[0073] The weights are determined using both objective and subjective methods. Under the subjective method, custom weights are set according to project needs. If no custom weights are set, the entropy weight method is used to calculate the objective weights of each factor, and a sensitivity analysis is performed. The weight combinations are randomly generated through Monte Carlo simulation, and the frequency of each solution becoming the global optimal is counted.

[0074] The calculation formula of the entropy weight method is as follows:

[0075]

[0076]

[0077] Among them, ωj is the weight of the j-th factor, Ej is the entropy value of the j-th factor, n is the number of solutions, and m is the number of factors.

[0078] In step S43, the normalized matrix is multiplied by the weight vector to construct a weighted normalized matrix. Positive and negative ideal solutions, Euclidean distance, and proximity are calculated, with a small range (1e-10) added to avoid division by zero. The no-project and project solutions are sorted, and the solution with the highest proximity is selected as the optimal solution for the OD interval. If the project solutions have the same proximity to the no-project solution, the no-project solution is selected as the optimal solution.

[0079] V=[υij];

[0080] υij=ωj·rij;

[0081]

[0082] Among them, V is the weighted normalization matrix, is the positive ideal solution of the jth factor, is the negative ideal solution of the j-th factor, is the Euclidean distance from the i-th solution to the positive ideal solution, is the Euclidean distance from the i-th solution to the negative ideal solution, C i is the closeness of the ith solution to the positive ideal solution.

[0083] Finally, the cost savings in mileage, expenses, time, carbon emissions, etc. of the optimal solution compared to no project are calculated.

[0084] Furthermore, the evaluation results for each interval are summarized, and the traffic attracted, mileage saved, time, cost, and carbon emissions of each solution are calculated to form a solution comparison table. The traffic proportion is used as the weight of each OD interval, and the weight of each interval is multiplied by the proximity of each solution to obtain the weighted proximity of each solution. The solution with the highest weighted proximity is selected as the global optimal solution.

[0085]

[0086] Where S i is the weighted proximity of the ith solution, is the proximity of solution i in the kth OD interval.

[0087] Calculate the traffic flow and proportion of no project and each plan as the optimal plan, and evaluate the attractiveness of each plan to traffic; calculate the weighted average savings in mileage, expenses, time, carbon emissions and other costs when each plan is the optimal plan compared with no project, and evaluate the advantages of each plan.

[0088] Specifically, in this embodiment, new expressway project plans from area A to area B are compared and selected.

[0089] Import existing highway data into a GIS platform (such as QGIS) and set attributes such as speed, tolls, and carbon emission coefficients for the road network. Design three project plans:

[0090] Option 1: North Line; Option 2: Central Line; Option 3: South Line.

[0091] Add the line positions of each scheme in GIS and set the restricted access information (0 means allowing access, 1 means prohibiting access).

[0092] Divide the starting point influence area A and the ending point influence area B into five traffic zones, and determine the centroid node (traffic starting point / end point) of each zone. Connect the centroid node to the road network to ensure the connectivity of the path calculation.

[0093] Use Dijkstra algorithm or GIS network analysis tools to calculate: the shortest path and cost (in terms of mileage, time, cost, and carbon emissions) for each OD pair in the non-project network. The shortest path and cost for the same OD pair in each alternative network. Example calculation results (partial data) are as follows: Figure 2 shown.

[0094] Furthermore, the optimal solution for each OD pair is selected based on the minimum mileage, time, cost, and carbon emissions. For example, based on the minimum mileage, solution 2 is the optimal solution for O9-D1.

[0095] Overlay the paths without the project and those of Option 2 in GIS to generate a comparison chart that visually demonstrates the path changes and cost savings.

[0096] Using entropy weight TOPSIS evaluation, standardize the cost data of each OD pair (unit mileage index), set or calculate the weight of each cost factor. Calculate the proximity of each OD pair to each solution. Example calculation results (partial data) are as follows Figure 3 Taking O9-D1 as an example, solution 2 is the optimal solution for this OD pair.

[0097] Using weighted comprehensive score: using the traffic proportion of each OD pair and the proximity of each solution, calculate the weighted proximity, such as Figure 5 As shown, solution 2 with the largest weighted proximity is determined to be the global optimal recommendation solution.

[0098] Finally, a scheme comparison report is generated, including: a comparison chart of the expected paths of each OD pair; a statistical table of attracted traffic and cost savings, and a recommendation for the global optimal scheme.

[0099] Example 2

[0100] This embodiment discloses a transportation project route comparison system;

[0101] like Figure 5 As shown, a transportation project route selection system includes:

[0102] The network construction module is configured to: build a basic transportation network, add the line positions of each project plan, and set the restricted access information; create the centroid node of the OD community and connect the centroid node to the transportation network; build the non-project network and the network of each plan, and set the impedance and restriction conditions;

[0103] The path calculation module is configured to calculate the shortest path and cost of each OD interval in the non-project network and each solution network, using mileage, time, cost, and carbon emissions as impedance cost factors;

[0104] The visualization module is configured to: generate a comparison diagram of expected paths of each OD interval in the network without the project and the network with the optimal solution based on the obtained shortest path routes and costs;

[0105] The evaluation module is configured to: use the entropy weight TOPSIS method to perform interval evaluation on each solution, and combine it with the weighted comprehensive scoring method to determine the global optimal solution.

[0106] Example 3

[0107] The purpose of this embodiment is to provide a computer-readable storage medium.

[0108] A computer-readable storage medium stores a computer program, which, when executed by a processor, implements the steps of a transportation project path comparison method as described in Example 1.

[0109] Example 4

[0110] The purpose of this embodiment is to provide an electronic device.

[0111] An electronic device includes a memory, a processor, and a program stored in the memory and executable on the processor. When the processor executes the program, the steps in the method for comparing and selecting a path for a transportation project as described in Example 1 are implemented.

[0112] The steps involved in the apparatuses of Examples 2, 3, and 4 above correspond to those of Method Example 1. For detailed implementations, please refer to the relevant description of Example 1. The term "computer-readable storage medium" should be understood to mean a single medium or multiple media containing one or more instruction sets; it should also be understood to include any medium capable of storing, encoding, or carrying an instruction set for execution by a processor and causing the processor to perform any method of the present invention.

[0113] Those skilled in the art will appreciate that the modules or steps of the present invention described above can be implemented using a general-purpose computer device. Alternatively, they can be implemented using program code executable by a computing device, which can then be stored in a storage device and executed by the computing device. Alternatively, they can be fabricated into separate integrated circuit modules, or multiple modules or steps can be fabricated into a single integrated circuit module for implementation. The present invention is not limited to any specific combination of hardware and software.

[0114] Although the above describes the specific embodiments of the present invention in conjunction with the accompanying drawings, it is not intended to limit the scope of protection of the present invention. Those skilled in the art should understand that various modifications or variations that can be made by those skilled in the art on the basis of the technical solution of the present invention without any creative work are still within the scope of protection of the present invention.

Claims

1. A method for comparing and selecting routes for transportation projects, characterized in that: include: Build a basic transportation network, add the route locations of each project plan, and set restricted access information; Create the OD cell centroid node and connect it to the transportation network; build the non-project network and each scheme network, and set impedance and restriction conditions; Using mileage, time, cost, and carbon emissions as impedance cost factors, calculate the shortest path and cost of each OD interval in the network without the project and the network of each solution; Based on the obtained shortest path routes and costs, a comparison diagram of the expected paths of each OD interval in the network without the project and the network with the optimal solution is generated; The entropy weighted TOPSIS method is used to conduct interval evaluation of each scheme, and the global optimal scheme is determined in combination with the weighted comprehensive scoring method.

2. A method for comparing and selecting routes for a transportation project according to claim 1, characterized in that: The construction of the basic transportation network includes: Establish a basic transportation network without projects in the geographic information system, add speed, unit mileage, and cost information, and calculate mileage, time, cost, and carbon emissions; Add the route locations of each transportation project that requires scheme comparison to the basic transportation network, add the scheme name and restricted access information of each scheme, and the restricted access value is 0 for allowing access and 1 for prohibiting access; Set the restricted access value of each scheme in the no-project network to 1, the restricted access value of this scheme in each scheme network to 0, and 1 for other schemes; set mileage, time, cost, and carbon emissions as cost factors in the network impedance; set restrictions for the no-project network and each scheme network, and exclude elements with a restricted access value of 1 from the network.

3. A method for comparing and selecting routes for a transportation project according to claim 1, characterized in that: The calculation of the shortest path and cost includes: Taking the OD centroid node as the starting and ending points, the shortest path algorithm is used to calculate the shortest path under different impedances in each scheme network; Record the shortest path route and corresponding cost data for each plan.

4. A method for comparing and selecting routes for a transportation project according to claim 1, characterized in that: The process of generating the expected path comparison diagram is to merge the shortest path cost calculation results of each OD interval under different networks and different impedances; Determine the optimal solution corresponding to the minimum cost of each interval and overlay it with the shortest path in the project-free network.

5. A method for comparing and selecting routes for a transportation project according to claim 1, characterized in that: The entropy weight TOPSIS method includes: converting mileage, time, cost, and carbon emissions into unit mileage indicators and performing standardization processing; Use the entropy weight method to calculate the objective weight of each indicator, or set the subjective weight according to needs; Calculate the proximity of each solution in each interval, and the solution with the largest proximity is the optimal solution in the interval.

6. A method for comparing and selecting routes for a transportation project according to claim 1, characterized in that: The weighted comprehensive scoring method includes calculating the weighted comprehensive proximity of each solution using the traffic proportion of each interval as a weight; The solution with the largest weighted comprehensive proximity is the global optimal solution.

7. A transportation project route selection system, characterized in that: include: The network construction module is configured to: build a basic transportation network, add the route positions of each project plan, and set restricted access information; Create the OD cell centroid node and connect it to the transportation network; build the non-project network and each scheme network, and set impedance and restriction conditions; The path calculation module is configured to calculate the shortest path and cost of each OD interval in the non-project network and each solution network using mileage, time, cost, and carbon emissions as impedances; The visualization module is configured to: generate a comparison diagram of expected paths of each OD interval in the network without the project and the network with the optimal solution based on the obtained shortest path routes and costs; The evaluation module is configured to: use the entropy weight TOPSIS method to perform interval evaluation on each solution, and combine it with the weighted comprehensive scoring method to determine the global optimal solution.

8. A transportation project route selection system according to claim 7, characterized in that: The construction of the basic transportation network includes: Establish a basic transportation network without projects in the geographic information system, add speed, unit mileage, and cost information, and calculate mileage, time, cost, and carbon emissions; Add the line positions of each channel scheme of this project to the basic transportation network, add the scheme name and restricted access information of each scheme, and the restricted access value is 0 for allowing access and 1 for prohibiting access; Set the value of the restricted access of each scheme in the network without project to 1, the restricted access value of this scheme in the network of each scheme to 0, and the value of other schemes to 1; Set mileage, time, fee, and carbon emissions as cost factors in network impedance.

9. A computer-readable storage medium having a program stored thereon, characterized in that: When the program is executed by a processor, the steps of the method for comparing and selecting a path for a transportation project as described in any one of claims 1 to 6 are implemented.

10. An electronic device comprising a memory, a processor, and a program stored in the memory and executable on the processor, wherein: When the processor executes the program, the steps in the method for path comparison of a transportation project as described in any one of claims 1 to 6 are implemented.

Images