Road trip monitoring point layout method and device

Abstract

This application belongs to the field of computer science, specifically relating to a method and apparatus for the layout of road traffic monitoring points. The method includes: calculating the number of vehicles on each travel route in a target area; and constructing a logical matrix of road segments and travel routes in the target area. B Each row represents a travel route, and each column represents a road segment. b i,j for B The element, if the first i The travel route passes through the first j Each section of the road, b i,j =1, otherwise b i,j =0; Based on the number of vehicles and the logical matrix B, the road sections where traffic monitoring stations are set up in the target area are determined according to the optimization objective and constraints. This application can optimize the layout of road travel monitoring points and improve the accuracy of road travel surveys.

Description

Technical Field

[0001] This application relates to the field of computer technology, specifically to a method and apparatus for the layout of road traffic monitoring points. 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 highway 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 traffic survey stations) at highway cross-sections, but they do not include travel information such as vehicle travel distance, origin-destination (OD) distance, and travel routes. It is necessary to add travel survey functionality to traditional cross-section traffic surveys, upgrading traffic survey stations to travel survey stations or comprehensive traffic survey stations. The layout of the stations affects the accuracy of the survey results; more stations generally result in more accurate results, but also in higher construction and maintenance costs. Therefore, a rational planning of the station layout is needed to achieve the best economic and technical benefits. Summary of the Invention

[0004] This application provides a method and apparatus for the layout of road travel monitoring points, which can optimize the layout of road travel monitoring points and improve the accuracy of road travel surveys.

[0005] In a first aspect, embodiments of this application provide a method for arranging road travel monitoring points, including:

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

[0007] 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 ;

[0008] Based on the number of traffic trips and the logical matrix B, the road sections in the target area where traffic control stations are set up are determined according to the optimization objective and constraints.

[0009] Secondly, embodiments of this application provide a road traffic monitoring point layout device, comprising:

[0010] The travel module is used to calculate the number of vehicles on each travel route within the target area;

[0011] The construction module is used to 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 ;

[0012] The optimization module is used to determine the road sections in the target area where traffic control stations are set up, based on the number of traffic trips and the logical matrix B, according to the optimization objective and constraints.

[0013] 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.

[0014] 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

[0015] 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.

[0016] Figure 1 A flowchart illustrating the road travel monitoring point layout method according to an embodiment of this application is shown;

[0017] Figure 2 This illustration shows a road network structure diagram of one embodiment of the road travel monitoring point layout method according to this application.

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

[0019] Figure 4 This is a schematic diagram of the road travel monitoring point layout device according to an embodiment of this application;

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

[0021] 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.

[0022] 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.

[0023] 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.

[0024] See Figure 1 This application provides a method for arranging road travel monitoring points, including:

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

[0026] 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 ;

[0027] 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.

[0028] 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.

[0029] 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.

[0030] 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.

[0031] 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:

[0032]

[0033] 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.

[0034] 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.

[0035] 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.

[0036] 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.

[0037] 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 .

[0038] 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.

[0039] 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.

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

[0041] Optimization goal: (1)

[0042]

[0043] (2)

[0044] 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.

[0045] 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:

[0046] 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. ;

[0047] 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. ;

[0048] 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. ;

[0049] 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.

[0050] 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.

[0051] 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).

[0052] Optimization goal: (3)

[0053] (4)

[0054] in .

[0055] 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.

[0056] 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:

[0057] 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. ;

[0058] 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. ;

[0059] 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. ;

[0060] 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.

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

[0062] 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.

[0063] See Figure 3Taking 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.

[0064] 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.

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

[0066]

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

[0068] Table 2 Logical matrix of travel routes across the entire network in the target area

[0069]

[0070] The optimization process for the layout of road travel monitoring points is as follows:

[0071] First iteration

[0072] Calculate the number of non-zero elements in each column of Table 2, which represents 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 𝑎1=8, and delete the rows containing the non-zero elements in column 8 (2, 7, 10, 12, 15, 16, 18, 19, 21). The remaining rows form a matrix. See Table 3.

[0073] Table 3 Logical matrix after the first iteration

[0074]

[0075] Second iteration

[0076] 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 the column with the smaller index, we set α2=1 and delete the rows containing non-zero elements in column 1 (1, 4, 5, 6, 13, 22). The remaining rows form a matrix. See Table 4.

[0077] Table 4 Logical matrix after the second iteration

[0078]

[0079] 3rd iteration

[0080] 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 (columns 5, 10, 11, and 12). Select column 5, set α3=5, and delete the rows containing non-zero elements (9, 11, 17, and 20). The remaining rows form a matrix. See Table 5.

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

[0082]

[0083] 4th iteration

[0084] 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, selecting column 9. Let ∠4 = 9, and delete the rows containing non-zero elements in column 9 (rows 3 and 8). The remaining rows form the matrix. See Table 6.

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

[0086]

[0087] 5th iteration

[0088] 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. .

[0089] Therefore, the results of optimizing the layout of two types of road travel monitoring points can be obtained:

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

[0091] 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.

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

[0093] 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.

[0094] This application provides a road travel monitoring point layout 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.

[0095] See Figure 4 The road travel monitoring point layout device of this application includes a travel module, a construction module, and an optimization module. The travel module is used to calculate the number of vehicles on each travel route in the target area; the construction module is used to 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 The optimization module is used to determine the road sections where traffic control stations are set up in the target area based on the number of vehicles and the logical matrix B, according to the optimization objectives and constraints.

[0096] 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.

[0097] 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.

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

[0099] 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.

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

[0101] 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 not be integrated into the processor 601 and may be implemented as a separate chip.

[0102] 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.

[0103] 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.

[0104] 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.

[0105] 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.

[0106] 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.

[0107] 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.

[0108] 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.

[0109] 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.

[0110] 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.

[0111] 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.

[0112] 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.

[0113] 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.

[0114] 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 arranging road travel monitoring points, characterized in that, include: Calculate the number of vehicles on each travel route within the target area; 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 ; Based on the number of traffic trips and the logical matrix B, the road sections in the target area where traffic control stations are set up are determined according to the optimization objective and constraints. Calculating the number of vehicles on each travel route within the target area includes: matching the floating car's location data with a map to obtain the vehicle's trajectory in the road network; recording all road segments traversed by the floating car from its origin to its destination for each trip to obtain the travel route; and counting the number of floating car trips on each travel route; or Calculate the number of vehicles on each travel route within the target area, including: make Represents the travel origin-destination (OD) matrix, its elements Representative from land to Number of trains to the destination Obtained via mobile phone signaling; Based on a gravity model derived from urban population and inter-city distances, the calculation elements are obtained. The formula is as follows: in, and Represent Dihe The population of the area; represent Dihe Distance between places The normalization coefficients for the gravity model are used; traffic simulation software is used to assign the OD matrix to the road network to obtain the number of vehicles for each travel route; Based on the optimization objectives and constraints, the road sections in the target area where traffic control stations will be set up will be identified, including: With a given number of dispatch stations as a constraint, the objective is to cover the most travel routes; or The goal is to minimize the number of traffic control stations while covering all travel routes. Given a fixed number of inter-stations, the objective is to cover the maximum number of travel routes. At most one traffic control station can be deployed per road segment, in the matrix. Selected Column, so that by this The number of non-zero rows in the matrix formed by the columns is maximized. The optimization objective and constraints are shown in equations (1) and (2). Optimization goal: (1) （2） 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 specific element of the matrix. Check if a row contains a non-zero element; if it is non-zero, take 1; if it is zero, take 0. To find the sum of the values ​​of each element of a vector; Given a specific number of traffic control stations as a constraint, and with the objective of maximizing coverage of travel routes, determine the road segments within the target area where traffic control stations should be set up, including: Step 1. Set for 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. ; 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. ; 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. ; Step 4. When Stop iteration when set The value of each element represents the road segment number where traffic control stations need to be deployed; When the constraint is to cover all travel routes and the goal is to minimize the number of traffic control stations, Under the premise of ensuring that each travel route passes through at least one checkpoint, in the matrix Select the one with the fewest numbers Column, so that by this Columns form a matrix The number of non-zero rows is The optimization objectives and constraints are shown in equations (3) and (4). Optimization goal: (3) （4） in, in ,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 specific element of the matrix. Whether a certain bit of the symbol contains a non-zero element; if it is non-zero, take 1; if it is zero, take 0. To find the sum of the values ​​of each digit of a matrix; With the constraint of covering all travel routes and the goal of minimizing the number of traffic control stations, the road sections in the target area where traffic control stations will be set up are determined, including: 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. ; 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. ; 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. ; 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.

2. A road travel monitoring point layout device, used to implement the method of claim 1, characterized in that, include: The travel module is used to calculate the number of vehicles on each travel route within the target area; The construction module is used to 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 ; The optimization module is used to determine the road sections in the target area where traffic control stations are set up, based on the floating car number and the logical matrix B, according to the optimization objective and constraints.

3. 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 of claim 1.

Images