CN110598930A - Bus route optimization adjustment method and device - Google Patents
Bus route optimization adjustment method and device Download PDFInfo
- Publication number
- CN110598930A CN110598930A CN201910861039.5A CN201910861039A CN110598930A CN 110598930 A CN110598930 A CN 110598930A CN 201910861039 A CN201910861039 A CN 201910861039A CN 110598930 A CN110598930 A CN 110598930A
- Authority
- CN
- China
- Prior art keywords
- traffic
- target area
- bus
- cell
- traffic cell
- 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
- 238000005457 optimization Methods 0.000 title claims abstract description 41
- 238000000034 method Methods 0.000 title claims abstract description 38
- 239000011159 matrix material Substances 0.000 claims description 24
- 230000032823 cell division Effects 0.000 claims description 17
- 238000004590 computer program Methods 0.000 claims description 11
- 238000004891 communication Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 238000003745 diagnosis Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000001133 acceleration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000006698 induction Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method and a device for optimizing and adjusting a bus route, wherein the method comprises the following steps: dividing the traffic cells of the target area according to the basic data of the public traffic network, and acquiring the division result of the traffic cells of the target area; acquiring the direct performance of each traffic cell according to the basic data of the public traffic network and the division result of the traffic cells of the target area; determining the direct performance matching degree index of each traffic cell according to the basic data of the public traffic network and the direct performance of each traffic cell; and determining a bus route optimization adjustment scheme of the target area according to the direct performance matching degree index of each traffic cell. According to the invention, a more reasonable bus route optimization adjustment scheme can be obtained, so that the utilization efficiency of public resources can be improved.
Description
Technical Field
The invention relates to the technical field of public transport, in particular to a method and a device for optimizing and adjusting a bus route.
Background
In recent years, with the development of economic society and the acceleration of urbanization progress, the problems of urban traffic jam, inconvenience in people going out and the like are increasingly highlighted, and the prior development of urban public transport is an important means for improving the utilization efficiency of traffic resources and relieving traffic jam. The public transport network needs to be optimized for developing urban public transport, the direct performance is an important index for evaluating the public transport network, the direct performance is directly related to whether residents take the public transport for trip or not, and the matching degree of the direct performance and the public transport trip requirements of the residents reflects whether the public transport resource configuration is reasonable or not. Therefore, the non-stop diagnosis of the public traffic network has important guiding significance for the optimization of the public traffic network, the reasonable public traffic network layout can reduce the operation cost, improve the utilization efficiency of public resources, meet the public travel demands of residents, and relieve urban traffic congestion.
The existing bus network direct research mainly aims at direct calculation between stops or at a single source point, and the traditional traffic zone division is mainly based on a rule of convention, so that the rationality of traffic zone division cannot be guaranteed, the demand degree of resident bus travel cannot be accurately matched, and further the bus network layout optimization is influenced. The traditional public traffic network layout method is limited by experience and subjective preference of planners, and is not suitable for the current big data era.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a method and a device for optimizing and adjusting a bus route.
Specifically, the invention provides the following technical scheme:
in a first aspect, an embodiment of the present invention provides a method for optimizing and adjusting a bus route, including:
acquiring bus network basic data of a target area; the target area is an area to be subjected to bus route optimization adjustment;
dividing the traffic cells of the target area according to the basic data of the public traffic network, and acquiring the division result of the traffic cells of the target area;
acquiring the direct performance of each traffic cell according to the basic data of the public traffic network and the division result of the traffic cells of the target area;
determining the direct performance matching degree index of each traffic cell according to the basic data of the public traffic network and the direct performance of each traffic cell;
and determining a bus route optimization adjustment scheme of the target area according to the direct performance matching degree index of each traffic cell.
Further, the public traffic line network basic data comprises: the system comprises surface vector data of the target area, bus route vector data of the target area and bus travel demand data of the target area.
Further, the dividing of the traffic zone of the target area according to the public transportation network basic data to obtain the traffic zone division result of the target area specifically includes:
importing the surface vector data of the target area and the bus route vector data of the target area into a GIS, and performing unit grid division on the target area by using a GIS fishing net tool according to the surface vector data of the target area and the bus route vector data of the target area to obtain a grid division result; the mesh division result is a traffic cell division result of the target area, and one unit mesh represents one traffic cell.
Further, the obtaining the direct performance of each traffic zone according to the public transportation network basic data and the traffic zone division result of the target area specifically includes:
constructing a direct matrix according to the bus route vector data of the target area and the traffic zone division result of the target area; wherein the direct matrix comprises a direct performance analysis result between every two traffic cells;
and acquiring the number of cells through which each traffic cell can directly reach according to the direct matrix.
Further, the constructing a direct matrix according to the bus route vector data of the target area and the traffic zone division result of the target area specifically includes:
and carrying out spatial connection on the traffic cell division result data of the target area and the bus route vector data of the target area, iterating the bus route number field, obtaining a traffic cell OD pair capable of directly reaching by using a means for generating a neighbor list, assigning the OD pair to be 1, and then combining iteration results to obtain a direct matrix.
Further, the determining the direct performance matching degree index of each traffic cell according to the basic data of the public traffic network and the direct performance of each traffic cell specifically comprises:
determining bus travel demand data of each traffic cell by the bus travel demand data of the target area;
according to the bus travel demand data of each traffic district and the direct performance of each traffic district, determining the direct performance matching degree index of each traffic district according to the following relation model:
δ＝n/∑iKi
where i, j denotes a traffic cell, fijZ represents whether the traffic cell i and the traffic cell j can directly reachiIndex representing the degree of through matching, D, of the ith traffic celliExpress the public transport travel demand of the ith traffic district, KiA judgment value, K, representing whether the ith traffic cell is capable of direct traffici0 means that the ith traffic cell cannot reach directly, KiNot equal to 0 indicates that the ith traffic cell can reach directly and KiAnd delta represents an expansion factor for the number of the cells which can be directly reached by the ith traffic cell, and n represents the number of the traffic cells which can be directly reached in the target area.
Further, the determining of the optimal adjustment scheme for the bus route in the target area according to the direct matching degree index of each traffic cell specifically includes:
if the direct matching degree index of the traffic cell is within the range (mu-3 sigma, mu +3 sigma), the bus route of the traffic cell does not need to be optimized and adjusted:
if the direct matching degree index of the traffic cell exceeds the range (mu-3 sigma, mu +3 sigma), the following optimization adjustment needs to be carried out on the bus route of the traffic cell:
when the direct matching degree index of the traffic cell is lower than mu-3 sigma, reducing the bus lines of the traffic cell;
when the direct matching degree index of the traffic cell is higher than mu +3 sigma, the bus lines of the traffic cell need to be added;
wherein mu represents the index mean of the degree of direct matching, and sigma represents the index standard deviation of the degree of direct matching.
In a second aspect, an embodiment of the present invention further provides a device for optimizing and adjusting a bus route, including:
the first acquisition module is used for acquiring the basic data of the public traffic network in the target area; the target area is an area to be subjected to bus route optimization adjustment;
the second acquisition module is used for dividing the traffic cells of the target area according to the basic data of the public traffic network and acquiring the division result of the traffic cells of the target area;
the third acquisition module is used for acquiring the direct performance of each traffic cell according to the basic data of the public traffic network and the traffic cell division result of the target area;
the first determining module is used for determining the direct performance matching degree index of each traffic cell according to the basic data of the public traffic network and the direct performance of each traffic cell;
and the second determining module is used for determining the bus route optimization adjusting scheme of the target area according to the direct matching degree index of each traffic cell.
In a third aspect, an embodiment of the present invention further provides an electronic device, which includes a memory, a processor, and a computer program that is stored in the memory and is executable on the processor, where the processor implements the steps of the bus route optimization adjustment method according to the first aspect when executing the program.
In a fourth aspect, an embodiment of the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps of the bus route optimization adjustment method according to the first aspect.
According to the technical scheme, the method and the device for optimizing and adjusting the bus route provided by the embodiment of the invention firstly divide the traffic cells of the target area according to the basic data of the bus network to obtain the result of dividing the traffic cells of the target area, then obtain the reachability of each traffic cell according to the basic data of the bus network and the result of dividing the traffic cells of the target area, then determine the index of the reachability matching degree of each traffic cell according to the basic data of the bus network and the reachability of each traffic cell, and finally determine the scheme for optimizing and adjusting the bus route of the target area according to the index of the reachability matching degree of each traffic cell. According to the method and the device for optimizing and adjusting the bus routes, the direct performance of each traffic cell is obtained according to the basic data of the bus network and the division result of the traffic cells, and the direct performance matching degree index of each traffic cell is determined according to the basic data of the bus network and the direct performance of each traffic cell, so that a reasonable bus route optimizing and adjusting scheme can be obtained, and the utilization efficiency of public resources can be improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a flowchart of a bus route optimization and adjustment method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a process for constructing a direct matrix according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of plane vector data and bus route vector data of a target area according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating the traffic cell segmentation results of a target area according to an embodiment of the present invention;
fig. 5 is a schematic diagram illustrating the number of cells through which each traffic cell can reach according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a bus route optimization adjustment device according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
An embodiment of the present invention provides a method for optimizing and adjusting a bus route, and referring to fig. 1, the method for optimizing and adjusting a bus route includes:
step 101: acquiring bus network basic data of a target area; the target area is an area to be subjected to bus route optimization adjustment;
step 102: dividing the traffic cells of the target area according to the basic data of the public traffic network, and acquiring the division result of the traffic cells of the target area;
step 103: acquiring the direct performance of each traffic cell according to the basic data of the public traffic network and the division result of the traffic cells of the target area;
step 104: determining the direct performance matching degree index of each traffic cell according to the basic data of the public traffic network and the direct performance of each traffic cell;
step 105: and determining a bus route optimization adjustment scheme of the target area according to the direct performance matching degree index of each traffic cell.
In this embodiment, the public transportation network basic data includes: the system comprises surface vector data of the target area, bus route vector data of the target area and bus travel demand data of the target area.
In this embodiment, the traffic cell may be finely divided according to the plane vector data and the bus route vector data of the target area, and the traffic cell division result of the target area is obtained, for example, the target area may be divided into a suitable number of unit grids by using a GIS fishing net tool, and each grid represents one traffic cell.
In this embodiment, because the direct performance is an important index for evaluating the public transportation network, it is a more critical step to obtain the direct performance of each traffic cell. In this embodiment, the direct performance of each traffic cell may be determined according to the bus route vector data of the target area and the traffic cell division result of the target area. For example, it can be determined which traffic cells can meet the direct characteristics of the current bus route according to the distribution position of the target bus route and the distribution positions of the traffic cells.
In this embodiment, the through-going matching degree index of each traffic cell may be determined according to the bus travel demand data of each traffic cell in the target area and the through-going performance of each traffic cell. The index of the degree of matching of the direct performance here refers to: the matching degree between the bus travel demand of the traffic district and the direct performance of the traffic district. Only if the matching degree is within the preset range, the line optimization adjustment is not needed, and if the matching degree is too high or too low, the line optimization adjustment is needed.
According to the technical scheme, the method for optimizing and adjusting the bus route comprises the steps of dividing a target area into traffic cells according to bus network basic data, obtaining a traffic cell division result of the target area, obtaining the direct performance of each traffic cell according to the bus network basic data and the traffic cell division result of the target area, determining the direct performance matching degree index of each traffic cell according to the bus network basic data and the direct performance of each traffic cell, and determining the bus route optimizing and adjusting scheme of the target area according to the direct performance matching degree index of each traffic cell. According to the method and the device for optimizing and adjusting the bus routes, the direct performance of each traffic cell is obtained according to the basic data of the bus network and the division result of the traffic cells, and the direct performance matching degree index of each traffic cell is determined according to the basic data of the bus network and the direct performance of each traffic cell, so that a reasonable bus route optimizing and adjusting scheme can be obtained, and the utilization efficiency of public resources can be improved.
Further, based on the content of the foregoing embodiment, in this embodiment, the foregoing step 102 may be implemented as follows:
importing the surface vector data of the target area and the bus route vector data of the target area into a GIS, and performing unit grid division on the target area by using a GIS fishing net tool according to the surface vector data of the target area and the bus route vector data of the target area to obtain a grid division result; the mesh division result is a traffic cell division result of the target area, and one unit mesh represents one traffic cell.
In the present embodiment, it is assumed that the plane vector data and the bus route vector data within the target area are as shown in fig. 3. Wherein, the white region is the face vector data, and the black lines are bus route vector data, totally 7 bus routes. In this embodiment, the target area is finely divided, for example, the target area may be divided into 5 × 5 traffic cells, as shown in fig. 4, the specific implementation steps are as follows: and importing target area surface vector data and bus route vector data into the GIS, and finely dividing the traffic cells by using a fishing net creating tool, wherein the division result is shown in figure 4, and the number represents the number of the traffic cell.
Further, based on the content of the foregoing embodiment, in the present embodiment, the foregoing step 103 can be implemented as follows:
step A: constructing a direct matrix according to the bus route vector data of the target area and the traffic zone division result of the target area; wherein the direct matrix comprises a direct performance analysis result between every two traffic cells;
and B: and acquiring the number of cells through which each traffic cell can directly reach according to the direct matrix.
In this embodiment, the step a constructs a direct matrix according to the bus route vector data of the target area and the traffic zone division result of the target area, and can be implemented in the following manner:
and carrying out spatial connection on the traffic cell division result data of the target area and the bus route vector data of the target area, iterating the bus route number field, obtaining a traffic cell OD pair capable of directly reaching by using a means for generating a neighbor list, assigning the OD pair to be 1, and then combining iteration results to obtain a direct matrix.
In this embodiment, the OD pairs mean origin-destination points, and an OD pair means a group of origin-destination points, which mean the origin and destination points. For example, if there is direct communication between cell 1 and cell 5, then (1, 5) the OD pair should be assigned a value of 1 in the direct communication matrix, and similarly (5, 1) is also 1.
In this embodiment, the space connection tool in the GIS is used to spatially connect the traffic cell division result data of the target area with the bus route vector data of the target area, so as to obtain the traffic cell through which each bus route passes. In this embodiment, the bus line number field needs to be iterated, where the bus line number field needs to be constructed in advance, which belongs to an attribute of a bus line, and the meaning of iterating the bus line number field is to simulate manual work for one bus line for several times. In this embodiment, a traffic cell OD pair capable of direct access is obtained by using a neighbor table generation tool in the GIS, and is assigned as 1, and then iteration results are combined to obtain a direct access matrix. For example, if the line 1 is iterated first, the OD pair generated by the neighbor table generation tool is assigned according to the cell through which the line 1 passes, the assignment value is 1 when the line is directly reachable, and iteration results are combined when all the lines are iterated later, so that a direct matrix is obtained.
In this embodiment, the direct matrix may be constructed by a model builder in a GIS, and a specific processing procedure is as shown in fig. 2: spatially connecting the traffic cell division result data of the target area with the bus route vector data of the target area, iterating the bus route number field, obtaining a traffic cell OD pair capable of directly reaching by using a neighbor table generating tool, assigning the OD pair to be 1, and then combining iteration results to obtain a direct matrix as shown in the following table 1:
TABLE 1
And C, acquiring the number of cells through which each traffic cell can reach according to the direct matrix in the step B, wherein the specific processing mode is as follows:
the values of each row of the direct matrix are summed in the GIS to obtain the number of cells through which each traffic cell can directly reach, and the result is shown in fig. 5. In fig. 5, the number indicates a direct value, that is, the number of cells that can reach directly to each traffic cell.
Further, based on the content of the foregoing embodiment, in the present embodiment, the foregoing step 104 may be implemented as follows:
determining bus travel demand data of each traffic cell by the bus travel demand data of the target area;
according to the bus travel demand data of each traffic district and the direct performance of each traffic district, determining the direct performance matching degree index of each traffic district according to the following relation model:
δ＝n/∑iKi
where i, j denotes a traffic cell, fijZ represents whether the traffic cell i and the traffic cell j can directly reachiIndex representing the degree of through matching, D, of the ith traffic celliExpress the public transport travel demand of the ith traffic district, KiIs shown asJudgment value, K, of whether i traffic cells can reach directlyi0 means that the ith traffic cell cannot reach directly, KiNot equal to 0 indicates that the ith traffic cell can reach directly and KiAnd delta represents an expansion factor for the number of the cells which can be directly reached by the ith traffic cell, and n represents the number of the traffic cells which can be directly reached in the target area.
In this embodiment, it is assumed that the bus travel demand data of each traffic cell is shown in table 2 below (units are people/day):
TABLE 2
The index of the degree of matching of the reachability of each traffic cell obtained according to the above relationship model is shown in the following table 3:
TABLE 3
The bus route optimization and adjustment method provided by the embodiment of the invention can ensure the rationality of traffic district division and accurately match the demand degree of resident bus travel, so that a reasonable bus route optimization scheme can be obtained, and the utilization efficiency of public resources is improved.
Further, based on the content of the foregoing embodiment, in the present embodiment, the foregoing step 105 may be implemented as follows:
if the direct matching degree index of the traffic cell is within the range (mu-3 sigma, mu +3 sigma), the bus route of the traffic cell does not need to be optimized and adjusted:
if the direct matching degree index of the traffic cell exceeds the range (mu-3 sigma, mu +3 sigma), the following optimization adjustment needs to be carried out on the bus route of the traffic cell:
when the direct matching degree index of the traffic cell is lower than mu-3 sigma, reducing the bus lines of the traffic cell;
when the direct matching degree index of the traffic cell is higher than mu +3 sigma, the bus lines of the traffic cell need to be added;
wherein mu represents the index mean of the degree of direct matching, and sigma represents the index standard deviation of the degree of direct matching.
In the present embodiment, according to the raleigh criterion, the probability that the value of the through matching degree index exceeds the range (μ -3 σ, μ +3 σ) is not more than 3%. In addition, it should be noted that the closer the value of the direct matching degree index is to the ideal value of the direct matching degree index, the better the direct matching degree of the traffic cell is, and the ideal value of the direct matching degree index can be obtained by induction according to the domestic bus route operation data. The traffic districts with the direct matching degree indexes far larger than the ideal value need to be additionally provided with bus lines, and the bus lines of the traffic districts with the direct matching degree indexes far smaller than the ideal value are too dense.
In this embodiment, for the direct matching degree indexes of the traffic cells shown in table 3 above, it is assumed that the ideal value of the direct matching degree index is replaced by the mean value of the direct matching degree indexes, and the mean value and the standard deviation of the direct matching degree indexes are obtained by calculation, which are 113.79 and 461.63, respectively. Therefore, the traffic cell direct matching degree index of number 4 is larger than μ +3 σ, and it can be considered that it is necessary to add a bus line.
According to the technical scheme, the bus route optimization and adjustment method provided by the embodiment of the invention obtains the basic data of the bus line network, divides the traffic cells, calculates the direct matrix and the direct performance of each traffic cell, and constructs the direct performance matching degree index to judge whether the bus line network needs to be optimized and adjusted. According to the embodiment of the invention, the GIS can be used for carrying out fine diagnosis on the public traffic network, and a theory and a method are provided for optimizing the public traffic network, so that the rationality of the public traffic network layout is improved.
Another embodiment of the present invention provides an optimized adjusting device for a bus route, as shown in fig. 6, the optimized adjusting device for a bus route, including: a first obtaining module 21, a second obtaining module 22, a third obtaining module 23, a first determining module 24, and a second determining module 25, wherein:
the first acquisition module 21 is used for acquiring the basic data of the public transportation network in the target area; the target area is an area to be subjected to bus route optimization adjustment;
the second obtaining module 22 is configured to perform traffic cell division on the target area according to the public transportation network basic data, and obtain a traffic cell division result of the target area;
the third obtaining module 23 is configured to obtain the reachability of each traffic cell according to the basic data of the public transportation network and the traffic cell division result of the target area;
the first determining module 24 is configured to determine a direct performance matching degree index of each traffic cell according to the basic data of the public transportation network and the direct performance of each traffic cell;
and a second determining module 25, configured to determine, according to the direct matching degree index of each traffic cell, a bus route optimization adjustment scheme for the target area.
The bus route optimization and adjustment device provided by the embodiment of the invention can be used for executing the bus route optimization and adjustment method of the embodiment, and the working principle and the beneficial effect are similar, so detailed description is omitted here, and specific contents can be referred to the introduction of the embodiment.
Based on the same inventive concept, another embodiment of the present invention provides an electronic device, which specifically includes the following components, with reference to fig. 3: a processor 301, a memory 302, a communication interface 303, and a communication bus 304;
the processor 301, the memory 302 and the communication interface 303 complete mutual communication through the communication bus 304;
the processor 301 is configured to call a computer program in the memory 302, and when the processor executes the computer program, all the steps of the bus route optimization and adjustment method are implemented, for example, when the processor executes the computer program, the following processes are implemented: acquiring bus network basic data of a target area; the target area is an area to be subjected to bus route optimization adjustment; dividing the traffic cells of the target area according to the basic data of the public traffic network, and acquiring the division result of the traffic cells of the target area; acquiring the direct performance of each traffic cell according to the basic data of the public traffic network and the division result of the traffic cells of the target area; determining the direct performance matching degree index of each traffic cell according to the basic data of the public traffic network and the direct performance of each traffic cell; and determining a bus route optimization adjustment scheme of the target area according to the direct performance matching degree index of each traffic cell.
Based on the same inventive concept, another embodiment of the present invention provides a computer-readable storage medium, wherein a computer program is stored on the computer-readable storage medium, and when being executed by a processor, the computer program implements all the steps of the above-mentioned bus route optimization adjustment method, for example, when the processor executes the computer program, the processor implements the following processes: acquiring bus network basic data of a target area; the target area is an area to be subjected to bus route optimization adjustment; dividing the traffic cells of the target area according to the basic data of the public traffic network, and acquiring the division result of the traffic cells of the target area; acquiring the direct performance of each traffic cell according to the basic data of the public traffic network and the division result of the traffic cells of the target area; determining the direct performance matching degree index of each traffic cell according to the basic data of the public traffic network and the direct performance of each traffic cell; and determining a bus route optimization adjustment scheme of the target area according to the direct performance matching degree index of each traffic cell.
In addition, the logic instructions in the memory may be implemented in the form of software functional units and may be stored in a computer readable storage medium when sold or used as a stand-alone product. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment of the present invention. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. Based on such understanding, the above technical solutions may be essentially or partially implemented in the form of software products, which may be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and include instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the network service simulation method according to the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A bus route optimization and adjustment method is characterized by comprising the following steps:
acquiring bus network basic data of a target area; the target area is an area to be subjected to bus route optimization adjustment;
dividing the traffic cells of the target area according to the basic data of the public traffic network, and acquiring the division result of the traffic cells of the target area;
acquiring the direct performance of each traffic cell according to the basic data of the public traffic network and the division result of the traffic cells of the target area;
determining the direct performance matching degree index of each traffic cell according to the basic data of the public traffic network and the direct performance of each traffic cell;
and determining a bus route optimization adjustment scheme of the target area according to the direct performance matching degree index of each traffic cell.
2. The method for optimizing and adjusting bus routes according to claim 1, wherein the bus network basic data comprises: the system comprises surface vector data of the target area, bus route vector data of the target area and bus travel demand data of the target area.
3. The method for optimizing and adjusting the bus route according to claim 2, wherein the dividing of the traffic cells into the target area according to the basic data of the bus network to obtain the result of dividing the traffic cells into the target area specifically comprises:
importing the surface vector data of the target area and the bus route vector data of the target area into a GIS, and performing unit grid division on the target area by using a GIS fishing net tool according to the surface vector data of the target area and the bus route vector data of the target area to obtain a grid division result; the mesh division result is a traffic cell division result of the target area, and one unit mesh represents one traffic cell.
4. The method according to claim 3, wherein the obtaining of the non-stop performance of each traffic cell according to the basic data of the public traffic network and the result of the division of the traffic cells of the target area specifically comprises:
constructing a direct matrix according to the bus route vector data of the target area and the traffic zone division result of the target area; wherein the direct matrix comprises a direct performance analysis result between every two traffic cells;
and acquiring the number of cells through which each traffic cell can directly reach according to the direct matrix.
5. The method for optimizing and adjusting the bus route according to claim 4, wherein the constructing a direct matrix according to the bus route vector data of the target area and the traffic zone division result of the target area specifically comprises:
and carrying out spatial connection on the traffic cell division result data of the target area and the bus route vector data of the target area, iterating the bus route number field, obtaining a traffic cell OD pair capable of directly reaching by using a means for generating a neighbor list, assigning the OD pair to be 1, and then combining iteration results to obtain a direct matrix.
6. The method for optimizing and adjusting the bus routes according to claim 4 or 5, wherein the determining the direct performance matching degree index of each traffic cell according to the basic data of the bus network and the direct performance of each traffic cell specifically comprises:
determining bus travel demand data of each traffic cell by the bus travel demand data of the target area;
according to the bus travel demand data of each traffic district and the direct performance of each traffic district, determining the direct performance matching degree index of each traffic district according to the following relation model:
δ＝n/∑iKi
where i, j denotes a traffic cell, fijZ represents whether the traffic cell i and the traffic cell j can directly reachiIndex representing the degree of through matching, D, of the ith traffic celliExpress the public transport travel demand of the ith traffic district, KiA judgment value, K, representing whether the ith traffic cell is capable of direct traffici0 means that the ith traffic cell cannot reach directly, KiNot equal to 0 indicates that the ith traffic cell can reach directly and KiAnd delta represents an expansion factor for the number of the cells which can be directly reached by the ith traffic cell, and n represents the number of the traffic cells which can be directly reached in the target area.
7. The method according to claim 6, wherein the determining of the optimal adjustment scheme for the bus route in the target area according to the index of the degree of through matching of each traffic cell specifically comprises:
if the direct matching degree index of the traffic cell is within the range (mu-3 sigma, mu +3 sigma), the bus route of the traffic cell does not need to be optimized and adjusted:
if the direct matching degree index of the traffic cell exceeds the range (mu-3 sigma, mu +3 sigma), the following optimization adjustment needs to be carried out on the bus route of the traffic cell:
when the direct matching degree index of the traffic cell is lower than mu-3 sigma, reducing the bus lines of the traffic cell;
when the direct matching degree index of the traffic cell is higher than mu +3 sigma, the bus lines of the traffic cell need to be added;
wherein mu represents the index mean of the degree of direct matching, and sigma represents the index standard deviation of the degree of direct matching.
8. The utility model provides a bus route optimizing and adjusting device which characterized in that includes:
the first acquisition module is used for acquiring the basic data of the public traffic network in the target area; the target area is an area to be subjected to bus route optimization adjustment;
the second acquisition module is used for dividing the traffic cells of the target area according to the basic data of the public traffic network and acquiring the division result of the traffic cells of the target area;
the third acquisition module is used for acquiring the direct performance of each traffic cell according to the basic data of the public traffic network and the traffic cell division result of the target area;
the first determining module is used for determining the direct performance matching degree index of each traffic cell according to the basic data of the public traffic network and the direct performance of each traffic cell;
and the second determining module is used for determining the bus route optimization adjusting scheme of the target area according to the direct matching degree index of each traffic cell.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method for bus route optimization adjustment according to any one of claims 1 to 7 are implemented when the processor executes the program.
10. A non-transitory computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the bus route optimization adjustment method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910861039.5A CN110598930B (en) | 2019-09-11 | 2019-09-11 | Bus route optimization adjustment method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910861039.5A CN110598930B (en) | 2019-09-11 | 2019-09-11 | Bus route optimization adjustment method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110598930A true CN110598930A (en) | 2019-12-20 |
| CN110598930B CN110598930B (en) | 2023-11-07 |
Family
ID=68858998
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910861039.5A Active CN110598930B (en) | 2019-09-11 | 2019-09-11 | Bus route optimization adjustment method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110598930B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113514071A (en) * | 2021-06-29 | 2021-10-19 | 阿波罗智联(北京)科技有限公司 | Method and device for determining public transport route |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006085602A (en) * | 2004-09-17 | 2006-03-30 | Gosei:Kk | Traffic analysis system |
| CN101819717A (en) * | 2010-03-05 | 2010-09-01 | 吉林大学 | Road network performance judgment method based on traffic state space-time model |
| CN101976500A (en) * | 2010-10-25 | 2011-02-16 | 中国科学院深圳先进技术研究院 | Method and system for analyzing traffic network |
| CN109583633A (en) * | 2018-11-16 | 2019-04-05 | 浩鲸云计算科技股份有限公司 | A kind of method of public transport and the route shift adjustment of Public Transport Transfer trip |
-
2019
- 2019-09-11 CN CN201910861039.5A patent/CN110598930B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006085602A (en) * | 2004-09-17 | 2006-03-30 | Gosei:Kk | Traffic analysis system |
| CN101819717A (en) * | 2010-03-05 | 2010-09-01 | 吉林大学 | Road network performance judgment method based on traffic state space-time model |
| CN101976500A (en) * | 2010-10-25 | 2011-02-16 | 中国科学院深圳先进技术研究院 | Method and system for analyzing traffic network |
| CN109583633A (en) * | 2018-11-16 | 2019-04-05 | 浩鲸云计算科技股份有限公司 | A kind of method of public transport and the route shift adjustment of Public Transport Transfer trip |
Non-Patent Citations (1)
| Title |
|---|
| 杨兆升: "《城市智能公共交通系统理论与方法》", 31 December 2004, 中国铁道出版社 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113514071A (en) * | 2021-06-29 | 2021-10-19 | 阿波罗智联(北京)科技有限公司 | Method and device for determining public transport route |
| US11867518B2 (en) | 2021-06-29 | 2024-01-09 | Apollo Intelligent Connectivity (Beijing) Technology Co., Ltd. | Method and apparatus for determining public transport route |
| CN113514071B (en) * | 2021-06-29 | 2024-04-16 | 阿波罗智联(北京)科技有限公司 | Public traffic route determining method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110598930B (en) | 2023-11-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105553869B (en) | A kind of risk balance method and system of power telecom network | |
| CN103985058B (en) | Available transfer capability calculation method based on improved multiple centrality-correction interior point method | |
| Ravadanegh et al. | A heuristic algorithm for optimal multistage sizing, siting and timing of MV distribution substations | |
| CN104466959A (en) | Power system key line identification method and system | |
| CN110784883B (en) | Base station construction evaluation method, device, equipment and storage medium | |
| CN110414796B (en) | AC/DC hybrid power distribution network frame planning method and device and storage medium | |
| CN116316589A (en) | Distribution network distributed photovoltaic bearing capacity assessment method considering source load uncertainty | |
| CN110598930A (en) | Bus route optimization adjustment method and device | |
| CN113469522A (en) | Comprehensive energy Internet of things evaluation method and device, electronic equipment and storage medium | |
| JP7313300B2 (en) | Distributed resource management device and distributed resource management method | |
| Zhao et al. | Prediction method of 5G high-load cellular based on BP neural network | |
| Alipour et al. | An efficient optimization framework for distribution network planning by simultaneous allocation of photovoltaic distributed generations and transformers | |
| CN112257950A (en) | Trade path configuration method applied to power market and computer-readable storage medium | |
| CN108808670B (en) | Partition scheme optimization method and device for power system recovery after blackout | |
| CN115329428A (en) | Method, device and equipment for determining fan arrangement mode and storage medium | |
| CN111861040B (en) | Optimization adjustment method and device for bus route, equipment and storage medium | |
| CN104680263A (en) | Power transmission network topology structure design method based on particle swarm optimization | |
| CN115238423A (en) | S-SCDN dynamic topology analysis and loop detection algorithm based on graph calculation | |
| Li et al. | Power distribution network reconfiguration for bounded transient power loss | |
| CN113270879B (en) | Dynamic partitioning method based on modularity | |
| CN111080008B (en) | Urban ecological vulnerability spatial prediction method based on GIS and CA simulation | |
| CN114091271A (en) | Method and device for simplifying equipment model, electronic equipment and storage medium | |
| CN111106631B (en) | Distributed reactive power scheduling method, system, equipment and storage medium for power distribution network | |
| CN110442452B (en) | Particle swarm optimization algorithm-based edge computing terminal hardware resource use scheduling method | |
| CN110336286B (en) | Reactive voltage partitioning method and device under wind power access |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |