Highway travel data processing method and device

Abstract

The present application belongs to the field of computers, and specifically relates to a method and apparatus for processing highway travel data. The method comprises: obtaining toll data for a target highway section, the toll data including toll data from toll booths and toll gantries; recording toll data with complete entry and exit times as valid data, the entry and exit times being the time of entering and exiting the toll booth; if at least one of the entry and exit times in the toll data is missing, and if the exit node and / or entry node can be determined based on the toll gantries' toll data, then recording the toll data as valid data, the exit node and the entry node being the nodes in the target section that enter or exit the target section outside of the toll booth; retaining the valid data, and deleting all other toll data as abnormal data. The method of the present application can fully filter out abnormal data.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a method and device for processing highway travel data. Background Art

[0002] With the increase in highway mileage and the growth in car ownership, the complexity of highway vehicle operations has increased, and some highways have gradually begun to experience traffic congestion. Alleviating traffic congestion and improving highway operating efficiency can be achieved by regulating traffic demand and optimizing traffic supply. Traffic demand management, however, requires understanding the utilization of transportation resources—that is, the travel characteristics of highway travelers. To ensure the accuracy of travel characteristic analysis, it is necessary to remove outliers and retain sufficient valid data. Summary of the Invention

[0003] The embodiments of the present application provide a method and apparatus for processing highway travel data, which can provide a good data basis for understanding the travel characteristics of highway travelers.

[0004] In a first aspect, an embodiment of the present application provides a method for processing highway travel data, comprising:

[0005] Acquire toll data for a target section of a highway, the toll data including toll data from toll booths and toll gantries;

[0006] Record the toll collection data with complete entry and exit times as valid data, where the entry and exit times are the time of entering the toll station and the time of exiting the toll station;

[0007] If at least one of the entry and exit times in the toll collection data is missing, and if the exit and / or entry nodes can be determined based on the toll collection data from the toll gantry, the toll collection data shall be recorded as valid data. The exit and entry nodes are the nodes outside the toll booth in the target road section where the vehicle enters or exits the target road section.

[0008] The valid data is retained, and other charging data other than the valid data is deleted as abnormal data.

[0009] In a second aspect, an embodiment of the present application provides a highway travel data processing device, comprising:

[0010] An acquisition module is used to acquire toll data of a target section of a highway, wherein the toll data includes toll data of toll stations and toll gantries;

[0011] A processing module is used to record the toll data with complete entry and exit times as valid data, where the entry and exit times are the time of entering and exiting a toll station; if at least one of the entry and exit times of the toll data is missing, and if the exit node and / or the entry node can be determined based on the toll data of the toll gantry, the toll data will be recorded as valid data, where the exit node and the entry node are the nodes entering or exiting a target section outside a toll station in the target section; the valid data will be retained, and other toll data other than the valid data will be deleted as abnormal data.

[0012] In a third aspect, an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, which implements any of the methods described above when executed by a processor.

[0013] In a fourth aspect, an embodiment of the present application provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements any of the above-described methods when executing the computer program. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0015] Figure 1 A schematic diagram showing a flow chart of a method for processing highway travel data according to an embodiment of the present application;

[0016] Figure 2 A schematic diagram showing the structure of a highway travel data processing device according to an embodiment of the present application is shown;

[0017] Figure 3 A schematic structural diagram of an electronic device provided in an embodiment of the present application is shown. DETAILED DESCRIPTION

[0018] In order to help those skilled in the art better understand the present invention, the following will clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0019] The terms "first," "second," and the like in the specification and claims of this application and the accompanying drawings are used to distinguish between different objects, not to describe a particular order. Furthermore, the terms "including," "having," and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or apparatus comprising a series of steps or elements is not limited to the listed steps or elements but may optionally include steps or elements not listed, or may optionally include other steps or elements inherent to the process, method, product, or apparatus.

[0020] References herein to "embodiments" mean that a particular feature, structure, or characteristic described in connection with the embodiments may be included in at least one embodiment of the present application. The appearance of this phrase in various places in the specification does not necessarily refer to the same embodiment, nor does it constitute an independent or alternative embodiment that is mutually exclusive of other embodiments. It is understood, both explicitly and implicitly, by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0021] See also Figure 1 , an embodiment of the present application provides a method for processing highway travel data, comprising:

[0022] Obtain toll data for the target section of the expressway, including toll data from toll booths and toll gantries;

[0023] The toll collection data with complete entry and exit time is recorded as valid data. The entry and exit time is the time of entering the toll station and the time of exiting the toll station;

[0024] If at least one of the entry and exit times in the toll data is missing, and if the exit and / or entry nodes can be determined based on the toll data from the toll gantry, the toll data will be recorded as valid data. The exit and entry nodes are the nodes outside the toll booth in the target road section where the vehicle enters or exits the target road section.

[0025] Valid data is retained, and other charging data other than valid data is deleted as abnormal data.

[0026] The basis for the highway travel data in this application can be toll data obtained from the toll collection system of the highway operation and management department. Toll data generally includes relevant information such as the time when a vehicle enters and exits the highway, the name of the toll station, and the vehicle model. The starting and ending points of the vehicle trip are important parameters based on toll data research. In order to eliminate the impact of noise data, the data needs to be cleaned to delete invalid data and retain only valid data. Generally, data cleaning is done by deleting incomplete data on the starting and ending points to retain valid data. However, there are many factors that lead to the lack of information on entering and exiting toll stations in toll data. Using the lack of information on entering and exiting toll stations as a criterion for invalid data may lead to the mistaken deletion of valid data, resulting in large deviations in subsequent research. For example, highways run through multiple provinces and are interconnected with other highways. Therefore, when studying highway data within a certain province, vehicles may exit or enter the target highway section through the highway interchange, resulting in missing entry and / or exit information. If such toll data is deleted, data on such trips will be missing.

[0027] The method of this application determines valid data by using toll station information and gantry information within the target section of the highway. This data is extracted from the original data and abnormal data is discarded to achieve the purpose of data cleaning. This avoids the problem of accidentally deleting valid data, fully retaining vehicle travel information, and achieving data cleaning.

[0028] For toll collection data with complete entry and exit times, since it includes information about both entry and exit toll stations, it can be determined as valid data and recorded, facilitating extraction of valid data from the original data while discarding invalid data. For toll collection data with at least one entry and exit time missing, for example, missing entry toll station information, missing exit toll station information, or missing both entry and exit toll station information, the exit node and / or entry node can be determined based on the toll collection data from the toll gantry. If the missing exit node and / or entry node can be determined, the toll collection data can be determined as valid data and recorded as such, facilitating extraction of valid data from the original data while discarding invalid data.

[0029] In this application, the exit node and the entry node are nodes outside the toll station in the target section that enter or exit the target section.

[0030] In some embodiments, the nodes for entering or exiting the target road segment outside of a toll station include highway interchange nodes and provincial boundary nodes within the target road segment. For example, a vehicle may enter or exit the target road segment from a highway interchange node, thereby preventing the toll station on the target road segment from recording the corresponding information. Alternatively, a vehicle may enter or exit the target road segment from a provincial boundary node, thereby preventing the toll station on the target road segment from recording the corresponding information.

[0031] For example, if a vehicle enters the Beijing section of the expressway from Tianjin, the toll collection data for the Beijing section will be missing information about the vehicle entering the toll booth. If the vehicle then exits the expressway at an interchange after entering the Beijing section, the toll collection data for the Beijing section will also be missing information about the vehicle exiting the toll booth.

[0032] Alternatively, if a vehicle leaves the Beijing section of the highway and enters Tianjin, the toll collection data for the Beijing section of the highway will be missing information about the vehicle exiting the toll station. If the vehicle enters the highway from an interchange, the toll collection data for the Beijing section of the highway will also be missing information about the vehicle entering the toll station.

[0033] There are also toll gantries on the highway. In order to facilitate non-stop billing, toll gantries are set up near nodes such as highway interchanges and provincial borders. For valid data, the vehicle's entry node or exit node can be determined based on the toll information of the toll gantries. Therefore, if the exit node and / or entry node can be determined based on the toll data of the toll gantries, then the toll data is valid data.

[0034] In some embodiments, at least one of the entry and exit times of the toll data is missing. If the exit node and / or entry node can be determined based on the toll data of the toll gantry, the toll data will be recorded as valid data, including: the toll data has the time of entering the toll station. When the time of exiting the toll station is missing, if the last gantry in the toll data is the gantry closest to the highway interchange node or provincial boundary node in front, then the highway interchange node or provincial boundary node closest to the last gantry is the exit node of the toll data, and the toll data is valid data. The toll data with missing entry and exit times includes at least one gantry information, that is, the vehicle passes through at least one gantry in the target section and is recorded by the gantry. After the vehicle enters the target section from the toll station, if it exits the target section from the highway interchange node or provincial boundary node, the highway interchange node or provincial boundary node that the vehicle exits will be recorded by the gantry, and the last gantry in the toll data of the vehicle is the gantry closest to the highway interchange node or provincial boundary node to exit.

[0035] In some embodiments, when the toll data has the time of entering the toll station but lacks the time of exiting the toll station, if there are other gantries between the last gantry in the toll data and the nearest highway interchange node or provincial boundary node in front, the toll data is abnormal data.

[0036] In this application, the front refers to the direction of the front of the vehicle, and the rear refers to the direction of the rear of the vehicle.

[0037] In some embodiments, at least one of the entry and exit times of the toll data is missing. If the exit node and / or entry node can be determined based on the toll data of the toll gantry, the toll data will be recorded as valid data, including: when the toll data has the time of exiting the toll station and the time of entering the toll station is missing, if the first gantry in the toll data is the gantry closest to the highway interchange node or provincial boundary node behind it, then the highway interchange node or provincial boundary node closest to the first gantry is the entry node of the toll data, and the toll data is valid data. The toll data with missing entry and exit times includes at least one gantry information, that is, the vehicle passes through at least one gantry in the target section and is recorded by the gantry. After the vehicle enters the target section from the highway interchange node or provincial boundary node, the vehicle will be recorded by the gantry, and the first gantry in the toll data of the vehicle is the gantry closest to the highway interchange node or provincial boundary node after entering the target section.

[0038] In some embodiments, when toll collection data includes the time of exiting a toll station but lacks the time of entering a toll station, if there are other gantries between the first gantry in the toll collection data and the nearest highway interchange or provincial boundary node behind, the toll collection data is considered abnormal. Alternatively, if there are other gantries between the last gantry in the toll collection data and the nearest highway interchange or provincial boundary node ahead, the toll collection data is considered abnormal.

[0039] In some embodiments, if at least one of the entry and exit times in the toll data is missing, and if the exit node and / or entry node can be determined based on the toll data from the toll gantry, the toll data will be recorded as valid data, including: when the toll data is missing the time of exiting the toll station and the time of entering the toll station, if the toll data only includes one gantry, and the gantry is the only gantry between two adjacent nodes, and the nodes include highway interchange nodes and provincial boundary nodes, then the adjacent nodes on both sides of the gantry are the entry node and exit node of the toll data, and the toll data is valid; otherwise, the toll data is abnormal data. The target road section is generally equipped with multiple gantries. If the toll data of the target road section only includes one gantry for a vehicle, and the gantry is the only gantry between two adjacent nodes, it can be considered that the vehicle entered from one of the two adjacent nodes and exited from the other. For example, there is only the first gantry between the provincial boundary node and the first highway interchange node. If the vehicle's charging data only includes the first gantry, that is, it is only recorded by the first gantry, and not recorded by other gantries on the target section, such as the second gantry, the third gantry, etc., then it can be considered that the vehicle enters the target section from one of the provincial boundary node and the first highway interchange node, and exits the target section from the other. The vehicle's driving direction can be determined based on the gantry's charging data, so the entry node and exit node can be determined. For example, if the charging data of the first gantry determines that the vehicle enters the target section from the provincial boundary, then the vehicle enters from the provincial boundary node and exits from the first highway interchange node. Conversely, the vehicle enters the target section from the provincial boundary node and exits from the first highway node.

[0040] In some embodiments, when the toll data lacks the time of exiting and entering a toll station, if the toll data includes at least two gantries, and the first gantry in the toll data is the gantry closest to the subsequent highway interchange or provincial boundary node, and the last gantry in the toll data is the gantry closest to the preceding highway interchange or provincial boundary node, then the nearest highway interchange or provincial boundary node behind the first gantry is the entry node of the toll data, and the nearest highway interchange or provincial boundary node in front of the last gantry is the exit node of the toll data, and the toll data is valid; otherwise, the toll data is abnormal. The target road section generally has multiple gantries. When the toll data of a vehicle on the target road section includes at least two gantries, if the first gantry in the toll data is the gantry closest to the subsequent highway interchange or provincial boundary node, it can be assumed that the vehicle entered from the highway interchange or provincial boundary node behind the first gantry. This node can be used as the vehicle's starting point on the target road section. After the vehicle enters from this node, it is recorded by the first gantry. If the last gantry in the toll data is the gantry closest to the highway interchange node or provincial boundary node in front, it can be considered that the vehicle exited from the highway interchange node or provincial boundary node in front of the last gantry, and this node can be used as the end point of the vehicle in the target section.

[0041] For example, if there is a first gantry and a second gantry between the provincial boundary node and the first highway interchange node, with the first gantry closer to the provincial boundary node and the second gantry closer to the first highway interchange node, and if the first gantry in the vehicle's toll collection data is the first gantry and the last gantry is the second gantry, then it can be assumed that the vehicle entered the target section from the provincial boundary node and exited the target section from the first highway interchange node. If the first gantry in the vehicle's toll collection data is the second gantry and the last gantry is the first gantry, then it can be assumed that the vehicle entered the target section from the first highway interchange node and exited the target section from the provincial boundary node.

[0042] In some embodiments, the method of the embodiment of the present application further includes: determining the starting and ending points of each valid data. The valid data can determine the nodes where the vehicle enters or exits the target road section, thereby determining the starting and ending points of the vehicle on the target road section.

[0043] The starting and ending points of toll collection data with complete entry and exit times are the toll stations for entering and exiting the target road section, respectively. If the toll collection data includes toll stations for both entering and exiting the target road section, the starting point is the toll station for entering the target road section, and the ending point is the toll station for exiting the target road section.

[0044] Valid data with toll station entry times but missing toll station exit times starts at the toll station that entered the target road section, and ends at the exit node immediately preceding the last gantry in the valid data. For data missing from a toll station exit, the node at which the vehicle exited the target road section can be determined based on the gantry. This node is the end point of the vehicle's journey on the target road section. The exit node can be a highway interchange or a provincial boundary.

[0045] For valid data with toll station exit times but missing toll station entry times, the starting point is the nearest entry node behind the first gantry in the valid data, and the end point is the toll station exiting the target road section. For valid data missing from a toll station entry, the node at which the vehicle entered the target road section can be determined based on the gantry. This node is the starting point of the vehicle's journey on the target road section. The node entered by the vehicle can be a highway interchange or a provincial boundary node.

[0046] For valid data with missing entry and exit times, if the data includes at least two gantries, the starting point is the nearest entry node behind the first gantry, and the end point is the nearest exit node in front of the last gantry. For valid data missing for both entry and exit toll stations, the node at which the vehicle enters the target section can be determined based on the first gantry in the valid data. This node is the starting point of the vehicle's journey on the target section. The node at which the vehicle exits the target section can be determined based on the last gantry in the valid data. This node is the end point of the vehicle's journey on the target section. The vehicle's entry and exit nodes can be highway interchange nodes or provincial boundary nodes.

[0047] For valid data with missing entry and exit times, if only one gantry is included, the starting point is the nearest entry node behind the gantry, and the end point is the nearest exit node in front of the gantry. For valid data with missing entry and exit times for a toll station, the nodes at which the vehicle enters and exits the target road section can be determined based on the unique gantry, serving as the starting and end points of the vehicle's journey on the target road section, respectively. The entry node can be a highway interchange or a provincial boundary.

[0048] In some embodiments, the method of the present invention further includes analyzing travel characteristics of the target road segment based on valid data, where the travel characteristics include trip type, travel time, trip duration, and travel space. The toll collection data includes the start and end points, which can be used to determine the travel time and duration of each vehicle on the target road segment. The start and end points can then be used to analyze the trip type and travel space.

[0049] For valid data missing from entry and exit times, the time a vehicle enters and / or leaves the target road section can be determined based on the time information in the toll collection data recorded by the corresponding gantry. For example, the time recorded by the corresponding gantry can be directly used as the time the vehicle enters and / or leaves the target road section. Alternatively, the time from the gantry to the entry or exit node can be calculated based on the distance from the gantry to the entry or exit node and the vehicle's speed. The calculated time can then be subtracted from or added to the time recorded by the corresponding gantry to determine the entry or exit time.

[0050] An embodiment of the present application provides a highway travel data processing device. The device of the embodiment of the present application can implement the method of the above embodiment. The above method embodiment can be used to understand the device of the embodiment of the present application, and the description part of the embodiment of the following device can also be used to understand the method of the above embodiment.

[0051] See also Figure 2The highway travel data processing device of the embodiment of the present application includes an acquisition module and a processing module. The acquisition module is used to obtain the toll data of the target section of the highway, and the toll data includes the toll data of the toll station and the toll data of the toll gantry; the processing module is used to record the toll data with complete entry and exit times as valid data, and the entry and exit times are the time of entering the toll station and the time of exiting the toll station; if at least one of the entry and exit times of the toll data is missing, if the exit node and / or the entry node can be determined based on the toll data of the toll gantry, the toll data will be recorded as valid data, and the exit node and the entry node are the nodes entering or exiting the target section outside the toll station in the target section; the valid data is retained, and other toll data other than the valid data is deleted as abnormal data.

[0052] An 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, wherein the processor implements any of the above methods when executing the computer program.

[0053] See Figure 3 , is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. Figure 3 As shown, the electronic device 600 may 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 .

[0054] The communication bus 602 is used to implement the connection and communication between these components.

[0055] The user interface 603 may include a display screen (Display) and a camera (Camera). Optionally, the user interface 603 may also include a standard wired interface and a wireless interface.

[0056] The network interface 604 may optionally include a standard wired interface or a wireless interface (such as a WI-FI interface).

[0057] The processor 601 may include one or more processing cores. Using various interfaces and circuits, the processor 601 connects to various components within the electronic device 600. It executes instructions, programs, code sets, or instruction sets stored in the memory 605, and accesses data stored in the memory 605 to perform various functions and process data within the electronic device 600. Optionally, the processor 601 may be implemented using at least one of the following hardware forms: a digital signal processing (DSP), a field-programmable gate array (FPGA), or a programmable logic array (PLA). The processor 601 may integrate one or a combination of a central processing unit (CPU), a graphics processing unit (GPU), and a modem. The CPU primarily processes the operating system, user interface, and application programs; the GPU is responsible for rendering and drawing content displayed on the display; and the modem handles wireless communications. It is understood that the modem may also be implemented as a separate chip, rather than integrated into the processor 601.

[0058] Among them, the memory 605 may include a random access memory (RAM) or a read-only memory (Read-Only Memory). 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 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 a touch function, a sound playback function, an image playback function, etc.), instructions for implementing the above-mentioned various method embodiments, etc.; the data storage area may store data involved in the above-mentioned various method embodiments, etc. The memory 605 may also be optionally at least one storage device located away from the aforementioned processor 601. As Figure 3 As shown, the memory 605 as a computer storage medium may include an operating system, a network communication module, a user interface module, and an application program.

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

[0060] 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 may include, but is not limited to, any type of disk, including a floppy disk, an optical disk, a DVD, a CD-ROM, a microdrive, 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.

[0061] An embodiment of the present application also provides a computer program product, which includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to cause a computer to execute part or all of the steps of any one of the methods described in the above method embodiments.

[0062] Those skilled in the art will clearly understand that the technical solution of this application can be implemented with the help of software and / or hardware. "Unit" and "module" in this specification refer to software and / or hardware that can independently complete or cooperate with other components to complete specific functions, where the hardware can be, for example, a Field-Programmable Gate Array (FPGA) or an Integrated Circuit (IC).

[0063] It should be noted that for the aforementioned method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that this application is not limited by the order of the actions described, because according to this application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by this application.

[0064] In the above embodiments, the description of each embodiment has its own focus. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

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

[0066] Units described as separate components may or may not be physically separate, and 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 these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0067] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0068] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable memory. Based on this understanding, the technical solution of the present application, 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. The computer software product is stored in a memory and includes a number of instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the various embodiments of the present application. The aforementioned memory includes: U disk, read-only memory (ROM), random access memory (RAM), mobile hard disk, magnetic disk, or optical disk, etc., various media that can store program code.

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

[0070] The above is only an exemplary embodiment of the present disclosure and cannot be used to limit the scope of the present disclosure. That is, any equivalent changes and modifications made according to the teachings of the present disclosure are still within the scope of the present disclosure. After considering the specification and practicing the disclosure herein, those skilled in the art will easily think of other embodiments of the present disclosure. This application is intended to cover any variations, uses or adaptations of the present disclosure, which follow the general principles of the present disclosure and include common knowledge or customary technical means in the art that are not recorded in the present disclosure. The description and examples are to be regarded as exemplary only, and the scope and spirit of the present disclosure are defined by the claims.

Claims

1. A method for processing highway travel data, characterized in that: include: Acquire toll data for a target section of a highway, the toll data including toll data from toll booths and toll gantries; Record the toll collection data with complete entry and exit times as valid data, where the entry and exit times are the time of entering the toll station and the time of exiting the toll station; If at least one of the entry and exit times in the toll collection data is missing, and if the exit and / or entry nodes can be determined based on the toll collection data from the toll gantry, the toll collection data shall be recorded as valid data. The exit and entry nodes are the nodes outside the toll booth in the target road section where the vehicle enters or exits the target road section. The valid data is retained, and other charging data other than the valid data is deleted as abnormal data; Among them, the nodes entering or exiting the target road section outside the toll station include the highway interchange nodes and provincial boundary nodes in the target road section; If at least one of the entry and exit times of the toll data is missing, and if the exit and / or entry nodes can be determined based on the toll data of the toll gantry, the toll data will be recorded as valid data, including: If the toll data contains the time of entry into the toll station but lacks the time of exiting the toll station, if the last gantry in the toll data is the gantry closest to the preceding highway interchange or provincial boundary node, then the nearest highway interchange or provincial boundary node in front of the last gantry is the exit node of the toll data, and the toll data is valid; If there are other gantries between the last gantry in the toll data and the nearest highway interchange node or provincial boundary node, the toll data is abnormal data; or If the toll data contains the time of exiting the toll station but lacks the time of entering the toll station, if the first gantry in the toll data is the gantry closest to the highway interchange node or provincial boundary node behind it, then the highway interchange node or provincial boundary node closest to the first gantry is the entry node of the toll data, and the toll data is valid; If there are other gantries between the first gantry in the toll data and the nearest highway interchange node or provincial boundary node, the toll data is abnormal data; or When the toll data lacks the time of exiting and entering the toll station, if the toll data only includes one gantry, and the gantry is the only gantry between two adjacent nodes, and the nodes include a highway interchange node and a provincial boundary node, then the nodes adjacent to both sides of the gantry are the entry and exit nodes of the toll data, and the toll data is valid data; otherwise, the toll data is abnormal data; or When the toll data lacks the time of exiting and entering the toll station, if the toll data includes at least two gantries, and the first gantry in the toll data is the gantry closest to the highway interchange node or provincial boundary node behind, and the last gantry in the toll data is the gantry closest to the highway interchange node or provincial boundary node in front, then the highway interchange node or provincial boundary node closest to the rear of the first gantry is the entry node of the toll data, and the highway interchange node or provincial boundary node closest to the front of the last gantry is the exit node of the toll data, and the toll data is valid data; otherwise, the toll data is abnormal data.

2. The method according to claim 1, characterized in that Also includes: Determine the starting and ending points of each valid data; in The starting and ending points of the toll collection data with complete entry and exit times are the toll stations for entering and exiting the target road section respectively; The valid data with the time of entering the toll station but missing the time of exiting the toll station starts from the toll station entering the target road section, and ends at the nearest exit node in front of the last gantry in the valid data; The starting point of valid data with the time of exiting the toll station but missing the time of entering the toll station is the nearest entry node behind the first gantry in the valid data, and the end point is the toll station of the target road section; For valid data with missing entry and exit times, if the valid data includes at least two gantries, the starting point is the nearest entry node behind the first gantry, and the end point is the nearest exit node in front of the last gantry; if the valid data only includes one gantry, the starting point is the nearest entry node behind the gantry, and the end point is the nearest exit node in front of the gantry.

3. The method according to claim 2, characterized in that Also includes: The travel characteristics of the target road section are analyzed based on the valid data, and the travel characteristics include travel type, travel time, travel duration and travel space.

4. A highway travel data processing device, characterized in that: include: An acquisition module is used to acquire toll data of a target section of a highway, wherein the toll data includes toll data of toll stations and toll gantries; a processing module configured to record toll data with complete entry and exit times as valid data, wherein the entry and exit times are the time of entering and exiting a toll station; if at least one of the entry and exit times in the toll data is missing, and if an exit node and / or an entry node can be determined based on the toll data from the toll gantry, then the toll data is recorded as valid data, wherein the exit node and the entry node are nodes outside the toll station in the target road section at which the vehicle enters or exits the target road section; The valid data is retained, and other toll data other than the valid data is deleted as abnormal data; wherein, the nodes entering or exiting the target road section outside the toll station include the highway interchange nodes and provincial boundary nodes in the target road section; If at least one of the entry and exit times of the toll data is missing, and if the exit and / or entry nodes can be determined based on the toll data of the toll gantry, the toll data will be recorded as valid data, including: When the toll data contains the time of entering the toll station but lacks the time of exiting the toll station, if the last gantry in the toll data is the gantry closest to the highway interchange node or provincial boundary node ahead, then the highway interchange node or provincial boundary node closest to the last gantry is the exit node of the toll data, and the toll data is valid data; if there are other gantries between the last gantry in the toll data and the nearest highway interchange node or provincial boundary node ahead, the toll data is abnormal data; or When the toll data contains the time of exiting the toll station but lacks the time of entering the toll station, if the first gantry in the toll data is the gantry closest to the highway interchange node or provincial boundary node behind it, then the highway interchange node or provincial boundary node closest to the first gantry is the entry node of the toll data, and the toll data is valid data; if there are other gantries between the first gantry and the highway interchange node or provincial boundary node closest to the rear, the toll data is abnormal data; or When the toll data lacks the time of exiting and entering the toll station, if the toll data only includes one gantry, and the gantry is the only gantry between two adjacent nodes, and the nodes include a highway interchange node and a provincial boundary node, then the nodes adjacent to both sides of the gantry are the entry and exit nodes of the toll data, and the toll data is valid data; otherwise, the toll data is abnormal data; or When the toll data lacks the time of exiting and entering the toll station, if the toll data includes at least two gantries, and the first gantry in the toll data is the gantry closest to the highway interchange node or provincial boundary node behind, and the last gantry in the toll data is the gantry closest to the highway interchange node or provincial boundary node in front, then the highway interchange node or provincial boundary node closest to the rear of the first gantry is the entry node of the toll data, and the highway interchange node or provincial boundary node closest to the front of the last gantry is the exit node of the toll data, and the toll data is valid data; otherwise, the toll data is abnormal data.

5. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 3 is implemented.

6. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the method according to any one of claims 1 to 3 is implemented.

Images