Road trip monitoring point layout method and device

Abstract

The invention belongs to the field of computers, and particularly relates to a road travel monitoring point layout method and device, and the method comprises the steps: calculating the number of vehicle times of each travel route in a target region; a logic matrix B of the target area road sections and the travel routes is constructed, each row represents one travel route, each column represents one road section, bi and j are elements of B, if the ith travel route passes through the jth road section, bi and j are equal to 1, otherwise, bi and j are equal to 0; and on the basis of the number of vehicles and the logic matrix B, determining a road section for setting an intermodulation station in a target area according to an optimization target and a constraint condition. According to the invention, the layout of the road trip monitoring points can be optimized, and the accuracy of road trip survey is improved.

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: 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.

[0006] Secondly, embodiments of this application provide a road traffic monitoring point layout device, comprising: 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 trip route of the first passage passes through the first road segment, then , otherwise ; an optimization module, configured to determine a road segment on which a terminal is arranged according to an optimization target and a constraint condition based on the number of vehicles and the logical matrix B.

[0007] In a third aspect, an embodiment of the present application provides a computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to implement the method in any of the preceding embodiments.

[0008] In a fourth aspect, an embodiment of the present application provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the method in any of the preceding embodiments when executing the computer program. BRIEF DESCRIPTION OF DRAWINGS

[0009] In order to more clearly illustrate the technical solutions of the embodiments of the present application or the prior art, the following will briefly introduce the drawings needed to be used in the embodiments or the prior art description. Obviously, the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can also be obtained without creative labor.

[0010] Figure 1 A flowchart of a road travel monitoring point layout method of an embodiment of the present application is shown; Figure 2 A road network structure diagram of an embodiment of the road travel monitoring point layout method of the present application is shown; Figure 3 A line diagram with A as the starting point in the road travel monitoring point layout method of the present application is shown; Figure 4 A structure diagram of a road travel monitoring point layout device of an embodiment of the present application is shown; Figure 5 A structure diagram of an electronic device provided by an embodiment of the present application is shown. DETAILED DESCRIPTION

[0011] In order to make the person skilled in the art better understand the present application, the technical solutions in the embodiments of the present application will be described clearly and completely. Obviously, the described embodiments are only some of the embodiments of the present application, but not all. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative labor are within the scope of protection of the present application.

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

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

[0014] See Figure 1 This application provides a method for arranging road travel monitoring points, including: 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 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.

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

[0016] In the embodiment of the present application, all road segments that a vehicle passes through from a starting point to a destination are connected at the beginning and the end to form a travel route. A probe vehicle refers to a vehicle equipped with a global positioning device that continuously reports the latitude and longitude information of the vehicle during travel. Using the global positioning data reported by the probe vehicle, the travel process of the vehicle from the starting point to the destination can be tracked, and the travel route of the probe vehicle for each trip can be obtained, i.e., all road segments passed through for each trip. Recording each travel route and counting the number of probe vehicles for the travel route can obtain the number of probe vehicles for each travel route in the target area. In the embodiment of the present application, the number of vehicles for each travel route in the target area can be the number of probe vehicles.

[0017] In some embodiments, calculating the number of vehicles for each travel route in the target area comprises: performing map matching on the positioning data of the probe vehicle to obtain the travel trajectory of the vehicle in the road network; recording all road segments passed through by the probe vehicle from the starting point to the destination for each trip to obtain the travel route; and counting the number of probe vehicles for each travel route.

[0018] In some embodiments, in areas without probe vehicle data, calculating the number of vehicles for each travel route in the target area comprises: The OD (Origin-Destination) matrix represents the number of vehicles from the starting point to the destination. The OD matrix represents the number of vehicles from the starting point to the destination. The OD matrix represents the number of vehicles from the starting point to the destination. The OD matrix represents the number of vehicles from the starting point to the destination. The OD matrix represents the number of vehicles from the starting point to the destination. The OD matrix represents the number of vehicles from the starting point to the destination. The formula for calculating the element of the OD matrix is as follows: wherein, and represent the population of the starting point and the destination, respectively. represent the population of the starting point and the destination, respectively. represent the population of the starting point and the destination, respectively. is the standardized coefficient of the gravity model. The value of the standardized coefficient can be determined according to experience or by referring to relevant literature.

[0019] Using traffic simulation software, the OD matrix can be distributed to the road network to obtain the number of vehicles for each travel route.

[0020] In areas without probe vehicle data, the number of vehicles for each travel route can be obtained by simulation, i.e., ​​​represent the trip OD matrix, whose element represents the number of trips from to . The number of trips can be obtained by using mobile phone signaling or a gravity model based on the population of the city and the distance between the two places.

[0021] In the embodiments of the present application, the traffic simulation software such as TransCAD can be used to distribute the OD matrix to the road network, and the number of trips on each trip route can be obtained.

[0022] Suppose that the target area has trip routes and road segments. A logical matrix of the road segments and the trip routes in the target area is constructed as , wherein each row of the matrix represents a trip route, each column represents a road segment, and is an element of . If the th trip route passes through the th road segment, then , otherwise .

[0023] In some embodiments, the optimization target and the constraint condition can include maximizing the number of covered trip routes with a given number of intercept stations as the constraint. When the number of intercept stations set in the target area is a given value, the number of trip routes covered by the intercept stations needs to be maximized so that as many trip routes as possible can obtain traffic data through the intercept stations.

[0024] When the optimization target is maximizing the number of covered trip routes with a given number of intercept stations as the constraint, at most one intercept station is deployed on each road segment, and road segments are selected from the road segments to deploy intercept stations, so that the number of non-repeated trip routes passing through these intercept stations is maximized. In a specific implementation, the column is selected from the matrix so that the number of non-zero rows of the column is maximized.

[0025] The optimization target and the constraint condition can be expressed by equation (1) and equation (2), Optimization target: (1) (2) wherein represents a set composed of the road segment numbers of the deployed stations, is a subset of the set of all column numbers, , is the number of non-zero rows of the column. ​the first element of the matrix; represent the number of elements in the middle element; indicates the extraction the first column; is a matrix formed by horizontally spliced in turn, the dimension represent a logical matrix, each bit corresponds to a row of the matrix whether to contain non-zero elements, non-zero 1, for zero 0; is to find the sum of the values of each bit of the vector.

[0026] In some embodiments, with the constraint of a given number of interworking stations, the maximum coverage of the outbound route is the goal, and the road section where the target area is set to interworking station is determined, including: Step 1. Set as an element of the set , , represent the set composed of the road section number of the site, which is a subset of the set of all column numbers, is a given number of interworking stations. Search for the column with the most non-zero elements in the matrix , and record the column sequence number; let equal to the sequence number; delete the row where the non-zero element of the column is in the matrix , and the remaining rows constitute the matrix ; Step 2. Search for the column with the most non-zero elements in the matrix , and record the column sequence number, if the number of non-zero elements of the two columns is the same, select the column with the smaller sequence number; let equal to the sequence number; delete the row where the non-zero element of the column is in the matrix , and the remaining rows constitute the matrix ; Step 3. Repeat Step 2, search for the column with the most non-zero elements in the matrix , record the column sequence number; let equal to the sequence number; delete the row where the non-zero element of the column is in the matrix , and the remaining rows constitute the matrix ; Step 4. When stop iteration, the value of each element in the set represents the road section number where the interworking station needs to be set.

[0027] In some embodiments, the optimization objective and constraint condition can include taking the least number of intersection stations as the objective and taking covering all travel routes as the constraint. When the intersection stations set in the target area cover all travel routes, the number of intersection stations to be arranged is minimized, and the cost is reduced while obtaining traffic data of as many travel routes as possible.

[0028] When taking the least number of intersection stations as the objective and taking covering all travel routes as the constraint, the least number of road sections on which the intersection stations are arranged is selected under the premise that each travel route passes through at least one detection point, and the number of intersection stations and the road sections on which the intersection stations are arranged are determined. In a specific implementation, the least number of columns in the matrix is selected in the matrix under the premise that each travel route passes through at least one detection point, the number of non-zero rows of the matrix composed of the columns is, and the number of intersection stations and the road sections on which the intersection stations are arranged are determined. The optimization objective and constraint condition can be expressed by formula (3) and formula (4).

[0029] Optimization objective: (3) (4) Wherein .

[0030] Wherein , represents a set composed of column numbers of the matrix ; represents the number of elements in the matrix ; indicates extracting the i-th column of the matrix ; represents a logical matrix, each bit respectively corresponds to indicating whether a bit of the matrix contains a non-zero element, and 1 is taken for a non-zero element and 0 is taken for a zero element; is the sum of values of bits of the matrix.

[0031] In some embodiments, when taking the least number of intersection stations as the objective and taking covering all travel routes as the constraint, the road sections on which the intersection stations are arranged in the target area are determined, including: Step 1. Let be an element of the matrix , , be a variable to be solved, represent a set composed of road section numbers of the arranged stations, which is a subset of all column number sets, search for a column with the most non-zero elements in the matrix , record the column sequence number; let be equal to the sequence number; in the matrix​​​​​​ The row in which the non-zero element of the column is located is deleted from the matrix ; Step 2. A column with the most non-zero elements is searched in the matrix , a column serial number is recorded, if the number of non-zero elements of two columns is the same, a column with a smaller serial number is selected; let be equal to the serial number; the row in which the non-zero element of the column is located is deleted from the matrix . ; Step 3. Step 2 is repeated, a column with the most non-zero elements is searched in the matrix , a column serial number is recorded; let be equal to the serial number; the row in which the non-zero element of the column is located is deleted from the matrix . ; Step 4. All non-zero rows in the matrix are deleted, iteration is stopped, the value of is recorded, and the value of is the road section number in which a crossover station needs to be arranged.

[0032] The method and effects of the embodiments of the present application will be described below in combination with specific embodiments.

[0033] Referring to Figure 2 , the target area takes a road network with 4 OD points and 12 road sections as an example, wherein A, B, C and D are the four OD points. The actual road network may be more or less than 12 road sections according to the topological condition.

[0034] Referring to Figure 3 , take the departure place A as an example, there are three pairs of OD, which are AB, AC and AD, wherein the AD pair corresponds to a green travel route passing through road sections (1, 2); the AC pair corresponds to a blue travel route passing through road sections (3, 8); and the AD pair corresponds to three travel routes passing through road sections (3, 6, 9, 12), (1, 4, 9, 12) and (1, 2, 5, 10) respectively.

[0035] The five travel routes with A as the departure place are sequentially numbered, and the logical matrix of the road sections and the travel routes with A as the departure place of the target area can be obtained, as shown in Table 1. Table 1 Logical matrix of travel routes with A as the departure place Similarly, the travel routes with B, C and D as the departure place are obtained respectively, and the set of road sections passed through by each travel route is obtained, and then the logical matrix B of the travel routes of the whole network of the target area is obtained.

[0036] Table 2 Logical matrix B of the travel routes of the whole network of the target area The optimization process for the layout of road travel monitoring points is as follows: First iteration 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.

[0037] Table 3 Logical matrix after the first iteration Second iteration 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.

[0038] Table 4 Logical matrix after the second iteration 3rd iteration 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.

[0039] Table 5 Logical matrix after the 3rd iteration 4th iteration 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.

[0040] Table 6 Logical matrix after the 4th iteration The 5th iteration The matrix shown in Table 6 is calculated The number of non-zero elements in each column of the matrix is calculated, and the column with the most non-zero elements is searched. The sequence number of the column is 11, and the column is denoted as According to the result of the 5th iteration, the road section set in which the co-modulation station is to be deployed is obtained .

[0041] Further, the results of two types of road trip monitoring point layout optimization problems can be obtained: (1) The number of co-modulation stations is given as a constraint, and the number of covered trip routes is the maximum as the target.

[0042] For example, when the number of deployed co-modulation stations is optimized as a constraint, the road sections numbered The first three elements deploy co-modulation stations, covering 19 of the 22 trip routes.

[0043] (2) Covering all trip routes as a constraint, the number of co-modulation stations is the minimum as the target.

[0044] With the minimum co-modulation stations, deploying co-modulation stations on the road sections numbered all elements can cover all trip routes.

[0045] The embodiment of the application provides a road trip monitoring point layout device. The device of the embodiment of the application can implement the method of the above-described embodiment. The method embodiment can be used to understand the device of the embodiment of the application. The description part of the following device embodiment can also be used to understand the method of the above-described embodiment.

[0046] Referring to Figure 4 , the road trip monitoring point layout device of the embodiment of the application comprises a trip module, a construction module, and an optimization module. The trip module is configured to calculate the number of vehicles for each trip route in a target area. The construction module is configured to construct a logical matrix of road sections and trip routes in the target area , wherein each row represents a trip route, and each column represents a road section, is an element, if the first trip route passes through the first road section, then , otherwise ; and the optimization module is configured to determine the road section in which the co-modulation station is to be set in the target area based on the number of vehicles and the logical matrix B according to an optimization target and a constraint condition.

[0047] ​​The embodiment of the present application provides an electronic device, including a memory, a processor and a computer program stored in the memory and executable on the processor, and the processor executes the computer program to implement the method of any one of the above.

[0048] Please refer to Figure 5 , the embodiment of the present application provides a structural schematic diagram of an electronic device. As shown in the figure Figure 5 , the electronic device 600 can include at least one processor 601, at least one network interface 604, a user interface 603, a memory 605 and at least one communication bus 602.

[0049] Among them, the communication bus 602 is used to realize the connection communication between the components.

[0050] Among them, the user interface 603 can include a display screen (Display), a camera (Camera), and the optional user interface 603 can also include a standard wired interface, a wireless interface.

[0051] Among them, the network interface 604 can optionally include a standard wired interface, a wireless interface (such as a WI-FI interface).

[0052] Among them, the processor 601 can include one or more processing cores. The processor 601 connects various parts in the whole electronic device 600 through various interfaces and lines, executes various functions of the electronic device 600 and processes data by running or executing instructions, programs, code sets or instruction sets stored in the memory 605, and calling data stored in the memory 605. Optionally, the processor 601 can be realized in at least one of the hardware forms of digital signal processing (Digital Signal Processing, DSP), field programmable gate array (Field-Programmable Gate Array, FPGA) and programmable logic array (Programmable Logic Array, PLA). The processor 601 can integrate a combination of one or several of central processing unit (Central Processing Unit, CPU), graphics processing unit (Graphics Processing Unit, GPU) and modem. Among them, the CPU mainly processes operating systems, user interfaces and application programs; the GPU is responsible for rendering and drawing the content to be displayed on the display screen; the modem is used for processing wireless communication. It can be understood that the above-mentioned modem can also not be integrated into the processor 601, but be realized by a separate chip.

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

[0054] In the electronic device 600 shown in Figure 5 In the electronic device 600 shown in

[0055] The present 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 method. The computer readable storage medium can include, but is not limited to, any type of disk, including a floppy disk, an optical disk, a DVD, a CD-ROM, a micro drive, and a magneto-optical disk, a ROM, a RAM, an EPROM, an EEPROM, a DRAM, a VRAM, a flash memory device, a magnetic card or an optical card, a nanosystem (including a molecular memory IC), or any type of medium or device suitable for storing instructions and / or data.

[0056] The present application also provides a computer program product, which includes a non-transitory computer readable storage medium storing a computer program, the computer program being operable to cause a computer to perform some or all of the steps of any one of the methods described in the above method embodiments.

[0057] Those skilled in the art can clearly understand that the technical solutions of the present application can be implemented by means of software and / or hardware. The "unit" and "module" in the specification refer to software and / or hardware that can independently complete or cooperate with other components to complete a specific function, and the hardware can be, for example, a Field-Programmable Gate Array (FPGA), an Integrated Circuit (IC), and the like.

[0058] It should be noted that, for the foregoing method embodiments, in order to simply describe, they are all expressed as a series of action combinations, but those skilled in the art should know that the present application is not limited by the action sequence described, because according to the present application, certain steps can be performed in other sequences or simultaneously. Secondly, those skilled in the art should know that the embodiments described in the specification all belong to preferred embodiments, and the actions and modules involved are not necessarily necessary for the present application.

[0059] In the above embodiments, the description of each embodiment has its own focus, and the parts not described in detail in a certain embodiment can be referred to the related description of other embodiments.

[0060] In several embodiments provided by the present application, it should be understood that the disclosed device can be implemented by other means. For example, the device embodiments described above are only illustrative, for example, the division of units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the displayed or discussed units can be indirect coupling or communication connection through some interfaces, devices or units, which can be electrical or other forms.

[0061] The units described as separate components can or can not be physically separated, and the components shown as units can or can not be physical units, that is, they can be located in one place, or they can be distributed on a plurality of network units. Part or all of the units can be selected to achieve the purpose of the embodiment scheme according to actual needs.

[0062] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can exist physically, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0063] The integrated unit, if implemented in the form of a software function unit and sold or used as an independent product, can be stored in a computer readable memory. Based on such understanding, the technical solutions of the present application essentially or the part that contributes to the prior art or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a memory and includes a plurality of instructions for causing a computer device (which can be a personal computer, a server or a network device, etc.) to execute all or part of the steps of the embodiments of the present application. The aforementioned memory includes: a U disk, a read-only memory (Read-Only Memory, ROM), a random access memory (Random Access Memory, RAM), a mobile hard disk, a magnetic disk or an optical disk, and various media that can store program codes.

[0064] A person of ordinary skill in the art can understand that all or part of the steps in the various methods of the above embodiments can be completed by a program instructing relevant hardware, and the program can be stored in a computer readable memory, which can include a flash disk, a read-only memory (Read-Only Memory, ROM), a random access memory (Random Access Memory, RAM), a magnetic disk or an optical disk, etc.

[0065] The above is only exemplary embodiments of the present disclosure, and cannot limit the scope of the present disclosure. That is, any equivalent changes and modifications made in accordance with the teachings of the present disclosure are still within the scope of the present disclosure. Other embodiments of the present disclosure will be readily apparent to those skilled in the art upon considering the specification and practicing the present disclosure. The present application is intended to cover any variations, uses or adaptive changes of the present disclosure that follow the general principles of the present disclosure and include common knowledge or conventional technical means in the technical field not described in the present disclosure. The specification and examples are only considered as exemplary, and the scope and spirit of the present disclosure are defined by the claims.

Claims

1. A method for road trip monitoring point layout, characterized in that, The method comprises: calculating the number of vehicles for each trip route in 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 ; determining the road sections on which the interworking stations are arranged in the target area based on the number of vehicles and the logical matrix B according to an optimization target and a constraint condition.

2. The method of claim 1, wherein, The method of determining the road sections on which the interworking stations are arranged in the target area according to an optimization target and a constraint condition comprises: maximizing the number of covered trip routes with a given number of interworking stations as a constraint; or minimizing the number of interworking stations with covering all trip routes as a constraint.

3. The method of claim 2, wherein, When maximizing the number of covered trip routes with a given number of interworking stations as a constraint, 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 objectives: (1) （2） wherein represents a set consisting of the section numbers of the layout site, which is a subset of all column number sets, is the th element of ; represents the number of elements in ; represents the th column of ; is a matrix formed by transversely splicing ; represents a logical matrix, each bit of which corresponds to whether a certain row of the matrix " contains a non-zero element, with 1 for a non-zero element and 0 for a zero element; is the sum of the values of each bit of the vector.

4. The method of claim 3, wherein, When maximizing the number of covered trip routes with a given number of interworking stations as a constraint, the method of determining the road sections on which the interworking stations are arranged in the target area comprises: Step 1. Set For the elements, , representing a set consisting of the site section numbers laid out, is a subset of all column number sets, for a given number of intermodulation stations, search for the column with the most non-zero elements in the matrix and record the column number; let equal the number; delete the row in which the non-zero elements of the column are located in the matrix , and the remaining rows constitute the matrix ; Step 2. Search the column with the most non-zero elements in the matrix and record the column index, if the number of non-zero elements in two columns are the same, select the column with smaller index; let be equal to the index; delete the rows in which the non-zero elements of the column are located in the matrix , and the remaining rows form the matrix ; Step 3. Repeat Step 2, search the column with the most non-zero elements in matrix , record the column index; let equal the index; delete the row in which the non-zero elements of the column are located in matrix , the remaining rows form matrix ; Step 4. When iteration is stopped, the set each element of which represents the number of the road section for which an intermodulation station is required.

5. The method of claim 3, wherein, When minimizing the number of interworking stations with covering all trip routes as a constraint, 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 The number of non-zero rows in the matrix formed by the columns is The optimization objectives and constraints are shown in equations (3) and (4). Optimization objectives: (3) （4） wherein 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 element in a matrix.

6. The method of claim 5, wherein, When minimizing the number of interworking stations with covering all trip routes as a constraint, the method of determining the road sections on which the interworking stations are arranged in the target area comprises: Step 1. Set For element, , is the variable to be solved, A represents a set consisting of the route section number of the layout site, is a subset of all column number sets, search for the column with the most non-zero elements in the matrix , record the column sequence number; let equal to the sequence number; delete the row where the non-zero element of the column is located in , and the remaining rows constitute the matrix ; Step 2. Search the column with the most non-zero elements in matrix , record the column sequence number, if the number of non-zero elements in two columns is the same, select the column with smaller sequence number; let equal to the sequence number; delete the rows in which the non-zero elements of the column are located in , and the remaining rows constitute matrix ; Step 3. Repeat Step 2, search the column with the most non-zero elements in matrix , record the column index; let equal the index; delete the row in which the non-zero elements of the column are located in matrix , the remaining rows form matrix ; Step 4. Matrix All non-zero rows in the matrix are deleted, the iteration is stopped, and the recorded values are recorded. The value of is the road section number where the intermodulation station needs to be deployed.

7. The method of claim 1, wherein, The method of calculating the number of vehicles for each trip route in the target area comprises: After map matching the positioning data of the floating vehicles, the driving trajectories of the vehicles in the road network are obtained; all road sections passed by the floating vehicles during each trip from the departure place to the destination are recorded to obtain the trip route; and the number of floating vehicles for each trip route is counted.

8. The method of claim 1, wherein, The method of calculating the number of vehicles for each trip route in the target area comprises: Let be the trip OD matrix, whose element represents the number of trips from to , which is obtained by using mobile phone signaling; is obtained based on the gravity model of city population and distance, and the formula of the element is as follows, wherein, and respectively represent the population of the population of represent the distance between the distance between is the standardization coefficient of the gravity model; The OD matrix is distributed on the road network by using a traffic simulation software to obtain the number of vehicles for each trip route.

9. A road trip monitoring point layout device, characterized in that, The method comprises: a trip module configured to calculate the number of vehicles for each trip route in the target area; Constructing a module for constructing a logical matrix of target area road segments and travel routes where each row represents a travel route and each column represents a road segment, is an element of , if the th travel route passes through the th road segment, then , otherwise ; an optimization module configured to determine the road sections on which the interworking stations are arranged in the target area based on the number of floating vehicles and the logical matrix B according to an optimization target and a constraint condition.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, The processor implements the method of any one of claims 1-8 when executing the computer program.

Images