Road trip index calculation method and device

Abstract

The application belongs to the field of computers and particularly relates to a road travel index calculation method and device. The method comprises the following steps: acquiring interchange station layout information of a target area; determining a logical relationship between the interchange station and a travel route according to the interchange station layout information; acquiring the number of vehicles of each travel route; calculating the number of vehicles of each travel route on each road section based on the logical relationship between the interchange station and the travel route and the number of vehicles of each travel route; and calculating a travel index. The application can reduce the difficulty of road travel investigation.

Description

Technical Field

[0001] This application relates to the field of computer technology, specifically to a method and apparatus for calculating road travel indicators. Background Technology

[0002] Traffic surveys provide fundamental information for planning, management, operation, and decision-making, and are a basic task in the transportation industry. Traffic surveys include intercity road traffic surveys and intra-city travel surveys.

[0003] Highway traffic surveys can obtain data such as traffic volume, vehicle speed, vehicle type, and license plate number by deploying automated traffic survey stations (hereinafter referred to as survey stations) at highway cross-sections. However, this data does not include travel information such as travel distance, origin-destination (OD) distance, and travel routes. The layout of survey stations affects the accuracy of highway traffic surveys. To comprehensively obtain travel traffic information within urban agglomerations, it is necessary to expand existing highway traffic surveys by including travel distance, OD distance, and travel routes. Due to the large scope of highways, complex natural conditions, and dispersed populations, traditional urban traffic survey methods such as door-to-door and on-site surveys are difficult to apply on a large scale. Summary of the Invention

[0004] This application provides a method and apparatus for calculating road travel indicators, which can improve the efficiency of road travel surveys and save costs compared to traditional manual travel surveys.

[0005] In a first aspect, embodiments of this application provide a method for calculating road travel indicators, including:

[0006] Obtain the layout information of traffic control stations in the target area;

[0007] Determine the logical relationship between traffic control stations and travel routes based on traffic control station layout information;

[0008] Get the number of trips for each travel route;

[0009] The number of vehicles on each route is calculated based on the logical relationship between the traffic control station and the travel route and the number of vehicles on each travel route.

[0010] Calculate travel indicators.

[0011] Secondly, embodiments of this application provide a road travel index calculation device, comprising:

[0012] The acquisition module is used to acquire the layout information of traffic control stations in the target area, as well as the number of vehicles on each travel route;

[0013] The logic module is used to determine the logical relationship between traffic control stations and travel routes based on the layout information of traffic control stations;

[0014] The indicator module calculates the number of vehicles on each route on each road segment based on the logical relationship between traffic control stations and travel routes and the number of vehicles on each travel route; and calculates travel indicators.

[0015] Thirdly, embodiments of this application provide a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method described in any of the above-mentioned embodiments.

[0016] Fourthly, embodiments of this application provide an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the method described in any of the above-mentioned embodiments. Attached Figure Description

[0017] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0018] Figure 1 A flowchart illustrating the road travel index calculation method according to an embodiment of this application is shown.

[0019] Figure 2 This illustration shows a road network structure diagram of one embodiment of the road travel index calculation method according to this application.

[0020] Figure 3 This illustration shows a route diagram with A as the starting point in the road travel index calculation method of this application embodiment;

[0021] Figure 4 This is a schematic diagram of the structure of the road travel index calculation device according to an embodiment of this application;

[0022] Figure 5 This diagram illustrates the structure of an electronic device provided in an embodiment of this application. Detailed Implementation

[0023] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present application.

[0024] The terms "first," "second," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish different objects, not to describe a specific order. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that comprises a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or apparatuses.

[0025] In this document, the term "embodiment" means that a particular feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of this application. The appearance of this phrase in various places throughout the specification does not necessarily refer to the same embodiment, nor is it a separate or alternative embodiment mutually exclusive with other embodiments. It will be explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0026] See Figure 1 This application provides a method for calculating road travel indicators, including:

[0027] Obtain the layout information of traffic control stations in the target area;

[0028] Determine the logical relationship between traffic control stations and travel routes based on traffic control station layout information;

[0029] Get the number of trips for each travel route;

[0030] The number of vehicles on each route is calculated based on the logical relationship between the traffic control station and the travel route and the number of vehicles on each travel route.

[0031] Calculate travel indicators.

[0032] In this embodiment, the logical relationship between traffic control stations and travel routes can be determined based on the layout information of traffic control stations. A travel route is generally formed by connecting multiple road segments end-to-end. Traffic control stations are typically located on a specific road segment. The layout information of traffic control stations determines whether a traffic control station is located on a travel route and, if so, on which road segment. Based on the logical relationship between traffic control stations and travel routes and the number of vehicles on each travel route, the number of vehicles on each road segment for each travel route is calculated, and various travel indicators can be calculated. The method of this application eliminates the need for door-to-door or on-site investigations, reducing difficulty and improving efficiency.

[0033] The layout of traffic control stations affects the accuracy of survey results. This application provides a method for laying out traffic control stations in a target area. The layout information of traffic control stations in the target area can be obtained using this method. The method includes the following steps:

[0034] Calculate the number of vehicles on each travel route within the target area;

[0035] Construct a logical matrix of road segments and travel routes in the target area. Each row represents a travel route, and each column represents a road segment. for The element, if the first The travel route passes through the first Each section of the road, ,otherwise ;

[0036] Based on vehicle count and logical matrix Based on the optimization objectives and constraints, determine the road sections in the target area where traffic control stations will be set up.

[0037] In this embodiment, the number of vehicles on each travel route in the target area is calculated, and a matrix of road segments and travel routes in the target area is constructed. Based on the number of trips on each route and matrix B, the road segments where traffic control stations should be set up in the target area are determined according to the optimization objective and constraints. This is achieved by mapping the number of trips on each route in the target area to the matrix of road segments and trip routes. Combining these factors to determine the layout of the dispatch stations can optimize their arrangement.

[0038] In this embodiment of the invention, all road segments traversed by a vehicle from its origin to its destination, connected end-to-end, constitute a travel route. A floating car refers to a vehicle equipped with a global positioning system (GPS) that continuously reports its latitude and longitude information during its journey. By using the GPS data reported by the floating car to track the vehicle's journey from origin to destination, the travel route of each floating car can be obtained, i.e., all road segments traversed in each trip. By recording each travel route and counting the number of floating car trips along that route, the number of floating car trips for each travel route in the target area can be obtained. In this embodiment of the invention, the number of trips for each travel route in the target area can be represented by the number of floating car trips.

[0039] In some embodiments, calculating the number of vehicles on each travel route in the target area includes: performing map matching on the location data of the floating cars to obtain the driving trajectory of the vehicles in the road network; recording all road segments traversed by the floating cars from the origin to the destination for each trip to obtain the travel route; and counting the number of floating cars on each travel route.

[0040] In some embodiments, in areas where floating car data is unavailable, the number of vehicles on each travel route in the target area is calculated, including: Represents the travel OD (origin to destination) matrix, its elements Representative from land to Number of trains to the destination It can be obtained via mobile phone signaling; or It can also be obtained based on a gravity model of urban population and inter-city distances. (Calculation elements) The formula is as follows:

[0041]

[0042] in, and Represent Dihe The population of the area; represent Dihe Distance between places These are the standardized coefficients for the gravity model. It can be determined based on experience or by referring to relevant literature.

[0043] By using traffic simulation software, the OD matrix (OD is short for Traffic Demand Origin and Destination, where "O" represents Origin and "D" represents Destination) can be assigned to the road network to obtain the number of vehicles on each travel route.

[0044] In regions lacking floating car data, the number of vehicles on each travel route can be obtained through simulation. Represents the travel origin-destination (OD) matrix, its elements Representative from land to Number of times the vehicle travels to the destination. It can be obtained through mobile phone signaling or a gravity model based on urban population and inter-city distances.

[0045] In this embodiment, traffic simulation software such as TransCAD can be used to assign the OD matrix to the road network, thereby obtaining the number of vehicles on each travel route.

[0046] Assume the target area has a total of Travel routes Each road segment. Construct a logical matrix of road segments and travel routes within the target area. , where the matrix Each row represents a travel route, and each column represents a road segment. for The element. If the first The travel route passes through the first Each section of the road, ,otherwise .

[0047] In some embodiments, the optimization objective and constraints may include maximizing the coverage of travel routes, constrained by a given number of traffic control stations. When the number of traffic control stations set up in the target area is a given value, it is necessary to maximize the number of travel routes covered by the traffic control stations in order to obtain as much traffic data as possible from the traffic control stations.

[0048] Given a fixed number of traffic control stations, and with the objective of maximizing coverage of travel routes, at most one traffic control station can be deployed per road segment. Select from the road sections Traffic control stations are deployed along each road segment to maximize the number of unique travel routes passing through these stations. In practice, this is done within a matrix... Selected Column, making this The column has the largest number of non-zero rows.

[0049] The optimization objective and constraints can be expressed by equations (1) and (2).

[0050] Optimization goal: (1)

[0051]

[0052] (2)

[0053] in This represents the set consisting of the road segment numbers of the deployment stations, and is a subset of the set of all column numbers. , for The One element; represent The number of elements in the middle; Indicates extraction The List; For the reason The dimension of a matrix formed by horizontally concatenating elements. This represents a logical matrix, where each bit corresponds to a matrix element. To check if a row contains a non-zero element, return 1 if non-zero and 0 if zero. To find the sum of the values ​​of each element in a vector.

[0054] In some embodiments, with a given number of traffic control stations as a constraint and the goal of covering the maximum number of travel routes, the road segments in the target area where traffic control stations are set up are determined, including:

[0055] Step 1. Set For set elements, , This represents the set consisting of the road segment numbers of the deployment stations, and is a subset of the set of all column numbers. Given the number of inter-stations. In the matrix Search for the column with the most non-zero elements and record its index; let Equal to the index; in the matrix Delete the row containing the non-zero elements in the column, and the remaining rows form a matrix. ;

[0056] Step 2. In the matrix Search for the column with the most non-zero elements and record its index. If two columns have the same number of non-zero elements, select the column with the smaller index. Equal to the index; in the matrix Delete the row containing the non-zero elements in the column, and the remaining rows form a matrix. ;

[0057] Step 3. Repeat step 2 in the matrix. Search for the column with the most non-zero elements and record its column number; let Equal to that serial number; in Delete the row containing the non-zero elements in the column, and the remaining rows form a matrix. ;

[0058] Step 4. When Stop iteration when set The value of each element represents the road segment number where a traffic control station needs to be set up.

[0059] In some embodiments, the optimization objective and constraints may include minimizing the number of traffic control stations while ensuring coverage of all travel routes. When traffic control stations are deployed in the target area to cover all travel routes, the number of traffic control stations that need to be deployed is minimized, thereby reducing costs while obtaining traffic data for as many travel routes as possible.

[0060] With the constraint of covering all travel routes and the goal of minimizing the number of traffic control stations, the minimum number of stations is selected while ensuring that each travel route passes through at least one control point. Traffic control stations will be deployed along each road segment, with the number of stations and their locations determined. In practice, ensuring that each travel route passes through at least one control point will be implemented within a matrix... Select the one with the fewest numbers Column, so that by this The number of non-zero rows in the matrix composed of columns is The optimization objective and constraints can be expressed by equations (3) and (4).

[0061] Optimization goal: (3)

[0062] (4)

[0063] in .

[0064] in , Represented by matrix A set consisting of column numbers, ; represent The number of elements in the middle; Represents the extraction matrix The List; This represents a logical matrix, where each bit corresponds to a matrix element. To check if a certain bit contains a non-zero element, take 1 if it is non-zero and 0 if it is zero; To find the sum of the values ​​of each element in a matrix.

[0065] In some embodiments, with the constraint of covering all travel routes and the objective of minimizing the number of traffic control stations, the road sections in the target area where traffic control stations are set up are determined, including:

[0066] Step 1. Set for elements, , For the variable to be determined, Represents the set consisting of the road segment numbers of the deployment stations, and is a subset of the set of all column numbers in the matrix. Search for the column with the most non-zero elements and record its column number; let Equal to that serial number; in Delete the row containing the non-zero elements in the column, and the remaining rows form a matrix. ;

[0067] Step 2. In the matrix Search for the column with the most non-zero elements and record its index. If two columns have the same number of non-zero elements, select the column with the smaller index. Equal to that serial number; in Delete the row containing the non-zero elements in the column, and the remaining rows form a matrix. ;

[0068] Step 3. Repeat step 2 in the matrix. Search for the column with the most non-zero elements and record its column number; let Equal to that serial number; in Delete the row containing the non-zero elements in the column, and the remaining rows form a matrix. ;

[0069] Step 4. Matrix All non-zero rows are deleted, iteration stops, and records are updated. The value of , The value is the road section number where a traffic control station needs to be set up.

[0070] In some embodiments, the logical relationship between traffic control stations and travel routes is determined based on traffic control station layout information, including:

[0071] Construct a logical matrix of the road segment where the traffic control station is located and the travel route. Dimension , For the number of travel routes, For the number of dispatch stations, Each row represents a travel route, and each column represents a road segment with stations deployed. for The element, if the first The travel route passes through the first Each section of the road, ,otherwise .

[0072] In some embodiments, the number of vehicles on each road segment for each travel route is calculated based on the logical relationship between the traffic control station and the travel route and the number of vehicles on each travel route, including: constructing a matrix of the number of vehicles on each travel route. dimensionality , For matrix The elements represent travel routes. Number of times the car was driven;

[0073] According to the logical matrix sum matrix Construction and The matrix of corresponding road segments and vehicle frequency dimensionality Its elements Representative travel route On the road section Number of times boarding the bus, specific implementation details, and travel routes. On the road section The number of times a vehicle can be loaded can be represented by a floating vehicle count; matrix The calculation formula is as follows:

[0074] (5)

[0075] in, For dot product, that is Each line and The dot product of corresponding bits, if but .

[0076] Travel route On the road section The number of times a vehicle enters a road segment is determined by allocating the traffic volume of that road segment according to the proportion of the floating number of times each travel route on that road segment is in the total floating number of times of that road segment.

[0077] Based on matrix Calculate travel routes On the road section Number of times you get on the bus.

[0078] In some embodiments, travel routes On the road section The number of vehicles on a given road segment is determined by allocating traffic volume to that segment based on the proportion of vehicle trips on each route within the total number of trips. The calculation formula is as follows:

[0079]

[0080] in, For travel routes On the road section Number of times boarding the bus ; For the dispatch station Traffic volume at monitored cross-sections . It can be obtained through automated traffic control stations, mobile traffic detection equipment, or manual counting. Representing the first of matrix F List; For each travel route, a traffic control station will be passed through. The sum of the number of times the train was driven. Specifically, it could refer to various travel routes passing through traffic control stations. The sum of the number of times the train was driven.

[0081] In this embodiment of the invention, travel indicators may include the number of vehicles on the travel route, the OD (Original Distance) vehicle frequency matrix, the OD average travel distance matrix, and the traffic volume on road sections without traffic control stations.

[0082] In some embodiments, calculating the travel index includes: calculating the number of vehicles on each travel route based on the number of vehicles on the road segment where the traffic control station is deployed, using the following formula:

[0083]

[0084] For the route Number of times the car, For travel routes On the road section Number of times boarding the bus The estimated number of trains on the line passing through each traffic control station. The arithmetic mean, constitute Vehicle frequency matrix .

[0085] In some embodiments, the method of this application further includes: constructing a vehicle count matrix corresponding to the origin and destination points. ,matrix The formula for calculating the elements is as follows:

[0086] (8)

[0087] in, for elements, The place of departure is The destination is By counting the number of trips along routes with the same origin and destination, a trip frequency matrix corresponding to each traffic volume can be obtained. .

[0088] In some embodiments, the method of this application further includes: constructing an OD average travel distance matrix. ,matrix The formula for calculating the elements is as follows:

[0089] (9)

[0090] in, For matrix The element represents from Earth to Average driving distance on land; For the first The length of the travel route.

[0091] In some embodiments, the method further includes: calculating the traffic volume on road sections without traffic control stations, including the following steps:

[0092] This will consist of the number of trips on each route. 3D matrix and Logical matrix of road segments and travel routes Multiply the results to obtain the number of trips on each road segment for each travel route. The calculation formula is as follows:

[0093] (10)

[0094] in, For the matrix of road segments and trip frequency, elements Representative Line On the road section Number of times you boarded the bus; Dot product, representing matrix Each line and Multiply the corresponding bits.

[0095] Dimensional road segment traffic volume matrix Calculated by the following formula,

[0096] (11)

[0097] in, for Element.

[0098] The methods and effects of the embodiments of this application will be described below with reference to specific examples.

[0099] See Figure 2 Taking a target area with a road network of 4 origin-destination (OD) points and 12 road segments as an example, where A, B, C, and D are the four OD points. The actual road network may have more or fewer than 12 road segments depending on the topology.

[0100] See Figure 3 Taking origin A as an example, there are three pairs of ODs, namely AB, AC and AD. AD corresponds to the green travel route, passing through segments (1, 2); AC corresponds to the blue travel route, passing through segments (3, 8); AD corresponds to three travel routes, passing through segments (3, 6, 9, 12), (1, 4, 9, 12), and (1, 2, 5, 10) respectively.

[0101] By sequentially numbering the five travel routes originating from A, a logical matrix of road segments and travel routes originating from A in the target area can be obtained, as shown in Table 1.

[0102] Table 1 Logical matrix of travel routes originating from point A

[0103]

[0104] Similarly, starting from points B, C, and D, we obtain their respective travel routes and the set of road segments traversed by each route, thereby obtaining the logical matrix of travel routes for the entire network in the target area. .

[0105] Table 2 Logical Matrix of Travel Routes Across the Target Area

[0106]

[0107] The optimization process for the layout of the dispatch station is as follows:

[0108] First iteration

[0109] Calculate the number of non-zero elements in each column of Table 2, i.e., the number of travel routes traversed by each road segment. Search for the column with the most non-zero elements; the column with the most non-zero elements in Table 2 has a sequence number of 8. Let... Then delete the rows containing non-zero elements in column 8 (2, 7, 10, 12, 15, 16, 18, 19, 21), and the remaining rows form a matrix. See Table 3.

[0110] Table 3 Logical matrix after the first iteration

[0111]

[0112] Second iteration

[0113] Calculate the matrix shown in Table 3 The number of non-zero elements in each column represents the number of travel routes traversed by each road segment. Searching for the column with the most non-zero elements, in Table 3, columns 1 and 10 both have 6 non-zero elements. Selecting column 1 with the smaller index, let... Then delete the rows containing non-zero elements in the first column (1, 4, 5, 6, 13, 22), and the remaining rows form a matrix. See Table 4.

[0114] Table 4 Logical matrix after the second iteration

[0115]

[0116] 3rd iteration

[0117] Calculate the matrix shown in Table 4. The number of non-zero elements in each column represents the number of travel routes traversed by each road segment. Search for the column with the most non-zero elements; among columns 5, 10, 11, and 12, select column 5. Then delete the rows containing non-zero elements (9, 11, 17, 20), and the remaining rows form a matrix. See Table 5.

[0118] Table 5 Logical matrix after the 3rd iteration

[0119]

[0120] 4th iteration

[0121] Calculate the matrix shown in Table 5. The number of non-zero elements in each column represents the number of travel routes traversed by each road segment. Search for the column with the most non-zero elements; select column 9. Then delete the rows (3, 8) containing non-zero elements in column 9, and the remaining rows form a matrix. See Table 6.

[0122] Table 6 Logical matrix after the 4th iteration

[0123]

[0124] 5th iteration

[0125] Calculate the matrix shown in Table 6. Find the column with the most non-zero elements, whose sequence number is 11. Based on the results of these five iterations, the set of road segments where traffic control stations are to be deployed is obtained. .

[0126] Therefore, the results of two types of inter-station layout optimization problems can be obtained:

[0127] (1) With the given number of inter-stations as a constraint, the goal is to cover the most travel routes.

[0128] For example, the number of dispatch stations deployed When optimizing for constraints, the number is... The first three elements Traffic control stations were deployed along the routes, covering 19 of the 22 travel routes.

[0129] (2) The goal is to minimize the number of traffic control stations while covering all travel routes.

[0130] With the least At the dispatch station, numbered as All elements Traffic control stations are deployed along certain sections of the road to cover all travel routes.

[0131] Travel index calculation results

[0132] Based on the constraint of covering all travel routes and aiming to minimize the number of traffic control stations, the optimization results are in the numbering... Traffic control stations are deployed on certain road sections, and a matrix showing the number of road sections with deployed traffic control stations and the number of travel routes is generated. See Table 7.

[0133] Table 7 Logical Matrix of Travel Routes and Station Locations

[0134]

[0135] Assume that the number of trips for each route is obtained based on the floating car data, as shown in Table 8.

[0136] Table 8 Floating Car Frequency Matrix for Each Travel Route

[0137]

[0138] According to equation (5), the relationship matrix between road segments and floating car frequency can be obtained. See Table 9.

[0139] Table 9. Relationship Matrix Between Road Segments and Floating Car Traffic Counts

[0140]

[0141] In formula (6) The floating car number represents the proportion of each travel route in the total number of floating car trips in the same road segment. The results are shown in Table 10.

[0142] Table 10 Percentage of floating car trips on different travel routes within the same road segment

[0143]

[0144] (1) Number of trips on each travel route

[0145] The number of trips for each route is obtained from equation (7), as shown in Table 11.

[0146] Table 11 Estimated number of trips for each travel route

[0147] (Unit: train trips / day)

[0148]

[0149] (2) OD vehicle frequency matrix

[0150] The OD vehicle frequency matrix is ​​obtained according to equation (8). See Table 12.

[0151] Table 12 OD Train Count Matrix

[0152] (Unit: train trips / day)

[0153]

[0154] (3) OD average travel distance matrix

[0155] Assume the lengths of each road segment are as shown in Table 13. According to Equation (9), the average driving distance matrix between ODs can be obtained, as shown in Table 14.

[0156] Table 13 Length of each road segment

[0157] (Unit: km)

[0158]

[0159] Table 14 OD Average Driving Distance Matrix

[0160]

[0161] (4) Traffic volume on road sections without traffic control stations

[0162] According to equations (10) and (11), the relationship between road segments and the number of trips can be obtained, as well as the traffic volume (i.e., the number of trips) of all road segments, as shown in Table 15. The last row of Table 15 is the traffic volume estimation results for each road segment, where road segments 1, 5, 8, 9, and 11 are road segments with traffic control stations deployed, and the remaining road segments are road segments without traffic control stations deployed.

[0163] Table 15 Traffic volume estimation results for each road segment

[0164] (Unit: vehicles / day)

[0165]

[0166] This application provides a road travel index calculation device. The device of this application can implement the method of the above embodiment. The above method embodiment can be used to understand the device of this application, and the description of the device embodiment below can also be used to understand the method of the above embodiment.

[0167] See Figure 4 The road travel index calculation device of this application embodiment includes an acquisition module, a logic module, and an index module. The acquisition module is used to acquire traffic control station layout information of the target area and the number of vehicles for each travel route; the logic module is used to determine the logical relationship between traffic control stations and travel routes based on the traffic control station layout information; the index module calculates the number of vehicles for each travel route on each road segment based on the logical relationship between traffic control stations and travel routes and the number of vehicles for each travel route, and calculates the travel index.

[0168] This application provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement any of the methods described above.

[0169] Please see Figure 5 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Figure 5 As shown, the electronic device 600 may include: at least one processor 601, at least one network interface 604, user interface 603, memory 605, and at least one communication bus 602.

[0170] The communication bus 602 is used to enable communication between these components.

[0171] The user interface 603 may include a display screen and a camera. Optionally, the user interface 603 may also include a standard wired interface and a wireless interface.

[0172] The network interface 604 may optionally include a standard wired interface or a wireless interface (such as a Wi-Fi interface).

[0173] The processor 601 may include one or more processing cores. The processor 601 connects to various parts within the electronic device 600 using various interfaces and lines, and performs various functions and processes data by running or executing instructions, programs, code sets, or instruction sets stored in the memory 605, and by calling data stored in the memory 605. Optionally, the processor 601 may be implemented using at least one hardware form of Digital Signal Processing (DSP), Field-Programmable Gate Array (FPGA), or Programmable Logic Array (PLA). The processor 601 may integrate one or a combination of several of the following: Central Processing Unit (CPU), Graphics Processing Unit (GPU), and modem. The CPU primarily handles the operating system, user interface, and applications; the GPU is responsible for rendering and drawing the content required for display; and the modem handles wireless communication. It is understood that the modem may also be implemented as a separate chip without being integrated into the processor 601.

[0174] The memory 605 may include random access memory (RAM) or read-only memory. Optionally, the memory 605 may include a non-transitory computer-readable storage medium. The memory 605 can be used to store instructions, programs, code, code sets, or instruction sets. The memory 605 may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for at least one function (such as touch function, sound playback function, image playback function, etc.), instructions for implementing the above-described method embodiments, etc.; the data storage area may store data involved in the above-described method embodiments, etc. Optionally, the memory 605 may also be at least one storage device located remotely from the aforementioned processor 601. Figure 5 As shown, the memory 605, which serves as a computer storage medium, may include an operating system, a network communication module, a user interface module, and application programs.

[0175] exist Figure 5 In the electronic device 600 shown, the user interface 603 is mainly used to provide an input interface for the user and to obtain the user input data; while the processor 601 can be used to call the application stored in the memory 605 and specifically execute the operations of any of the above method embodiments.

[0176] This application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the above-described method. The computer-readable storage medium may include, but is not limited to, any type of disk, including floppy disks, optical disks, DVDs, CD-ROMs, microdrives, as well as magneto-optical disks, ROMs, RAMs, EPROMs, EEPROMs, DRAMs, VRAMs, flash memory devices, magnetic cards or optical cards, nanosystems (including molecular memory ICs), or any type of medium or device suitable for storing instructions and / or data.

[0177] This application also provides a computer program product including a non-transitory computer-readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of any of the methods described in the above method embodiments.

[0178] Those skilled in the art will clearly understand that the technical solutions of this application can be implemented using software and / or hardware. In this specification, "unit" and "module" refer to software and / or hardware capable of independently or in conjunction with other components to perform a specific function. Hardware may include, for example, a Field-Programmable Gate Array (FPGA), an Integrated Circuit (IC), etc.

[0179] It should be noted that, for the sake of simplicity, the foregoing method embodiments are all described as a series of actions. However, those skilled in the art should understand that this application is not limited to the described order of actions, as some steps may be performed in other orders or simultaneously according to this application. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are preferred embodiments, and the actions and modules involved are not necessarily essential to this application.

[0180] In the above embodiments, the descriptions of each embodiment have different focuses. For parts not described in detail in a certain embodiment, please refer to the relevant descriptions in other embodiments.

[0181] In the several embodiments provided in this application, it should be understood that the disclosed apparatus can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical or other forms.

[0182] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0183] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0184] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage device (CMD). Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a memory and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned memory includes various media capable of storing program code, such as a USB flash drive, read-only memory (ROM), random access memory (RAM), portable hard drive, magnetic disk, or optical disk.

[0185] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage medium, which may include: a flash drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, etc.

[0186] The foregoing description is merely an exemplary embodiment of this disclosure and should not be construed as limiting the scope of this disclosure. Any equivalent changes and modifications made in accordance with the teachings of this disclosure shall still fall within the scope of this disclosure. Other embodiments of this disclosure will be readily apparent to those skilled in the art upon consideration of the specification and practice of the disclosure herein. This application is intended to cover any variations, uses, or adaptations of this disclosure that follow the general principles of this disclosure and include common knowledge or customary techniques in the art not described herein. The specification and embodiments are to be considered exemplary only, and the scope and spirit of this disclosure are defined by the claims.

Claims

1. A method for calculating road travel indicators, characterized in that, include: Obtain the layout information of traffic control stations in the target area; Determine the logical relationship between traffic control stations and travel routes based on traffic control station layout information, including: constructing a logical matrix between the road segments where traffic control stations are located and travel routes. Dimension , For the number of travel routes, For the number of dispatch stations, Each row represents a travel route, and each column represents a road segment with stations deployed. for The element, if the first The travel route passes through the first Each section of the road, ,otherwise ; Get the number of trips for each route. On the road section The number of vehicles on a given road segment is determined by allocating traffic volume to that segment based on the proportion of each travel route's number of vehicles within the total number of vehicles on that segment. The calculation formula is as follows: （6） in, For travel routes On the road section Number of times boarding the bus ; For the dispatch station Traffic volume at monitored cross-sections , Representative matrix The List, Representing the various travel routes passing through the traffic control station The sum of the number of times the train was driven; Based on the logical relationship between traffic control stations and travel routes, and the number of vehicles on each travel route, the number of vehicles on each road segment for each travel route is calculated, including: constructing a matrix of the number of vehicles on each travel route. dimensionality , For matrix The elements represent travel routes. The number of times the vehicle was driven; based on the aforementioned logical matrix. and the matrix Construction and The matrix of corresponding road segments and vehicle frequency dimensionality Its elements Representative travel route On the road section Number of times the vehicle was boarded; based on the matrix Get travel routes On the road section Number of times you boarded the bus; Calculate travel indicators.

2. The method according to claim 1, characterized in that, Also includes: The number of vehicles on each travel route is calculated based on the number of vehicles on the road sections where traffic control stations are deployed. The calculation formula is as follows: （7） For travel routes Number of times the car, For travel routes On the road section Number of times boarding the bus The estimated number of trains on the route passing through each traffic control station. The arithmetic mean, constitute Vehicle frequency matrix .

3. The method according to claim 2, characterized in that, Also includes: Construct the vehicle count matrix corresponding to the origin and destination points: By counting the number of trips along routes with the same origin and destination, a trip count matrix can be obtained for each origin and destination. See equation (8). （8） in, for elements, The place of departure is The destination is .

4. The method according to claim 3, characterized in that, Also includes: Constructing an average travel distance matrix ,matrix The formula for calculating the elements is as follows: （9） in, For matrix The element represents from Earth to Average driving distance on land; For the first The length of the travel route.

5. The method according to claim 1, characterized in that, Also includes: Calculating traffic volume on road sections without traffic control stations involves the following steps: This will consist of the number of trips on each route. 3D matrix and road section and Logical matrix of road segments and travel routes Multiply the results to obtain the number of trips on each road segment for each travel route. The calculation formula is as follows: in, For the matrix of road segments and trip frequency, elements Representative Line On the road section Number of times boarded the bus; " is the dot product, representing a matrix Each line and Multiply the corresponding bits; but Dimensional road segment traffic volume matrix Calculated by the following formula, in, for Element.

6. A road travel index calculation device for implementing the method according to any one of claims 1-5, characterized in that, include: The acquisition module is used to obtain traffic control station layout information for the target area, as well as the number of train trips for each travel route. ； The logic module is used to determine the logical relationship between traffic control stations and travel routes based on the layout information of traffic control stations, including: constructing a logical matrix of the road segments where traffic control stations are located and travel routes. Dimension , For the number of travel routes, For the number of dispatch stations, Each row represents a travel route, and each column represents a road segment with stations deployed. for The element, if the first The travel route passes through the first Each section of the road, ,otherwise ; The metrics module calculates the number of vehicles on each route on each road segment based on the logical relationship between traffic control stations and travel routes and the number of vehicles on each route. This includes constructing a matrix of the number of vehicles for each travel route. dimensionality , For matrix The elements represent travel routes. The number of times the vehicle was driven; based on the aforementioned logical matrix. and the matrix Construction and The matrix of corresponding road segments and vehicle frequency dimensionality Its elements Representative travel route On the road section Number of times the vehicle was boarded; based on the matrix Get travel routes On the road section Number of times boarded the train; calculate travel indicators.

7. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the method according to any one of claims 1-5.

Images