CN112052276B - Mining method and device for riding route - Google Patents

Mining method and device for riding route Download PDF

Info

Publication number
CN112052276B
CN112052276B CN202010837671.9A CN202010837671A CN112052276B CN 112052276 B CN112052276 B CN 112052276B CN 202010837671 A CN202010837671 A CN 202010837671A CN 112052276 B CN112052276 B CN 112052276B
Authority
CN
China
Prior art keywords
target
bus
passenger
passengers
route
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010837671.9A
Other languages
Chinese (zh)
Other versions
CN112052276A (en
Inventor
许益彬
杨帆
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Priority to CN202010837671.9A priority Critical patent/CN112052276B/en
Publication of CN112052276A publication Critical patent/CN112052276A/en
Application granted granted Critical
Publication of CN112052276B publication Critical patent/CN112052276B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2458Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2465Query processing support for facilitating data mining operations in structured databases
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29Geographical information databases
    • G06Q50/40

Abstract

The embodiment of the application provides a method and a device for excavating a riding route, and relates to the technical field of computers. The mining method of the riding route in the embodiment of the application comprises the following steps: according to the riding code information corresponding to the passengers in each passenger set and the line information corresponding to each bus line, respectively determining the matching degree between each bus line and each passenger set; associating a target passenger set with a target bus route, wherein the matching degree of the target passenger set is higher than a preset matching degree threshold value; determining the number of passengers on the target bus route according to the riding code information corresponding to the passengers in the target passenger set; determining the number of passengers getting off the target bus line according to the position information of positioning points corresponding to the passengers in the target passenger set and the line information corresponding to the target bus line; based on the number of passengers getting on the target bus line and the number of passengers getting off the target bus line. The technical scheme of the embodiment of the application can obviously improve the accuracy of the determined bus taking route of the hot bus.

Description

Mining method and device for riding route
Technical Field
The application relates to the technical field of computers, in particular to a method and a device for excavating a riding route.
Background
With the rapid development of mobile internet technology, riding route selection of people for traveling is more and more intelligent. In the related art, a method for analyzing a hot bus taking route based on passenger taking code data is proposed, specifically, the bus taking routes are directly evaluated through the boarding information contained in the passenger taking code data, and then the hot bus taking route is determined in the bus taking routes, and the determined hot bus taking route can provide references for passenger traveling and references for bus route optimization of bus companies.
However, the approach proposed by the related art does not consider the situation of the user getting off the bus during the riding process, and thus the accuracy of the determined transit riding route is not high.
Disclosure of Invention
The embodiment of the application provides a method and a device for excavating a bus taking route, which can solve the technical problem that the determined bus taking route of a hot bus is not high in accuracy to a certain extent.
Other features and advantages of the application will be apparent from the following detailed description, or may be learned by the practice of the application.
According to an aspect of the embodiment of the present application, there is provided a method of excavating a riding route, including: according to the information of the bus taking codes corresponding to the passengers in the passenger sets and the line information corresponding to the bus lines, the matching degree between the bus lines and the passenger sets is respectively determined, and the information of the bus taking codes corresponding to the passengers in the passenger sets is the information of the bus taking codes generated by the same card swiping equipment; associating a target passenger set with a target bus route, wherein the matching degree of the target passenger set is higher than a preset matching degree threshold value; determining the number of passengers on the target bus route according to the riding code information corresponding to the passengers in the target passenger set; determining the number of passengers getting off the target bus line according to the position information of positioning points corresponding to the passengers in the target passenger set and the line information corresponding to the target bus line; and determining a hot riding route in the target bus route based on the number of passengers on the target bus route and the number of passengers off the target bus route.
According to an aspect of an embodiment of the present application, there is provided an excavating apparatus of a riding route including: the matching unit is used for respectively determining the matching degree between each bus line and each passenger set according to the bus code information corresponding to the passengers in each passenger set and the line information corresponding to each bus line, wherein the bus code information corresponding to the passengers in the passenger set is generated by the same card swiping equipment; the association unit is used for associating the target passenger set with the target bus route, wherein the matching degree of the target passenger set is higher than a preset matching degree threshold value; the first execution unit is used for determining the number of passengers on the target bus line according to the riding code information corresponding to the passengers in the target passenger set; the second execution unit is used for determining the number of passengers getting off the target bus line according to the position information of the positioning points corresponding to the passengers in the target passenger set and the line information corresponding to the target bus line; and the third execution unit is used for determining a hot bus taking route in the target bus line based on the number of passengers getting on the target bus line and the number of passengers getting off the target bus line.
In some embodiments of the present application, based on the foregoing aspect, the ride code information includes position information of a boarding point, and the matching unit is configured to: according to the position information of the boarding points corresponding to the passengers in the passenger sets and the line information corresponding to the public transportation lines, respectively determining a first shortest straight line distance between each public transportation line and the boarding points corresponding to the passengers in the passenger sets; determining the number of boarding points, of which the first shortest straight line distance is smaller than a first preset distance threshold, as the number of boarding points matched between each bus route and each passenger set respectively; and generating the matching degree between each bus line and each passenger set based on the number of boarding points matched between each bus line and each passenger set and the total number of boarding points corresponding to passengers in each passenger set.
In some embodiments of the application, based on the foregoing scheme, the association unit is configured to: if the number of the target bus routes with the matching degree higher than the preset matching degree threshold is more than one, selecting the target bus route with the largest number of boarding points matched with the target passenger set from the target bus routes; and associating the selected target bus route with the target passenger set.
In some embodiments of the application, based on the foregoing scheme, the matching unit is configured to: if the number of the target bus routes with the matching degree higher than the preset matching degree threshold value with the target passenger sets is more than one, and the number of the target bus routes with the matching degree higher than the preset matching degree threshold value with the target passenger sets is smaller than the preset number threshold value, selecting the target bus route with the largest number of the bus boarding points matched with the target passenger sets from the target bus routes.
In some embodiments of the application, based on the foregoing, the second execution unit is configured to: determining a second shortest linear distance from the locating point corresponding to the passenger in the target passenger set to the target bus route and a third shortest linear distance from the locating point corresponding to the passenger in the target passenger set to the bus stop corresponding to the target bus route according to the position information of the locating point corresponding to the passenger in the target passenger set and the route information corresponding to the target bus route; selecting a target positioning point with the second shortest linear distance larger than a second preset distance threshold and the third shortest linear distance smaller than a third preset distance threshold from positioning points corresponding to passengers in the target passenger set; and determining the number of passengers getting off the target bus line based on the selected target positioning point.
In some embodiments of the present application, based on the foregoing aspect, the ride code information includes a boarding time of a boarding point, and the second execution unit is configured to: selecting a positioning point with a positioning time after the boarding time and with a time difference between the positioning time and the boarding time smaller than a preset time threshold value from the positioning points corresponding to the passengers in the target passenger set based on the boarding time of the boarding point corresponding to the passengers in the target passenger set and the positioning time of the positioning point corresponding to the passengers in the target passenger set; and determining a second shortest linear distance between the selected locating point and the target bus line and a third shortest linear distance between the selected locating point and each bus stop corresponding to the target bus line according to the position information of the selected locating point and the line information corresponding to the target bus line.
In some embodiments of the application, based on the foregoing, the second execution unit is configured to: selecting a bus stop with the shortest linear distance between the bus stop and the selected target positioning point from bus stops corresponding to the target bus route as a get-off stop corresponding to the concentrated passengers of the target passengers; and determining the number of passengers getting off the bus on the target bus route based on the number of getting off stations corresponding to the passengers in the target passenger set.
In some embodiments of the present application, based on the foregoing aspect, the ride code information includes a boarding time of a boarding point, and the second execution unit is configured to: selecting a target passenger with only one boarding point in a first time period and a second time period of the same day from the target passenger set based on boarding times of boarding points corresponding to passengers in the target passenger set, and acquiring a positioning track of the target passenger in the first time period and a positioning track of the target passenger in the second time period; if the shortest linear distance between the boarding point corresponding to the first time period and the positioning track of the second time period of the target passenger is smaller than a fourth preset distance threshold value and the shortest linear distance between the boarding point corresponding to the second time period and the positioning track of the first time period of the target passenger is smaller than a fourth preset distance threshold value, determining the boarding point corresponding to the first time period of the target passenger as the alighting point corresponding to the second time period of the target passenger and determining the boarding point corresponding to the second time period of the target passenger as the alighting point corresponding to the first time period of the target passenger; determining the number of get-off points corresponding to the first time period of the target passengers and the number of get-off points corresponding to the second time period of the target passengers; and determining the number of passengers getting off the bus line of the target based on the number of getting off points of the target passengers corresponding to the first time period and the number of getting off points of the target passengers corresponding to the second time period.
In some embodiments of the present application, based on the foregoing aspect, the excavation apparatus of a riding route further includes: a fourth execution unit, configured to determine the number of passengers boarding the bus corresponding to each line segment included in the hot riding route, based on position information of boarding points corresponding to the concentrated passengers of the target passengers associated with the hot riding route and position information of each bus stop corresponding to the hot riding route; a fifth execution unit, configured to determine a number of passengers getting off corresponding to each line segment included in the hot riding route based on a get-off station corresponding to a concentrated passenger of the target passengers associated with the hot riding route; and the sixth execution unit is used for determining the hot line segment from the line segments contained in the hot line segment according to the number of passengers on the vehicle and the number of passengers off the vehicle corresponding to the line segments contained in the hot line segment.
According to an aspect of the embodiments of the present application, there is provided a computer-readable medium having stored thereon a computer program which, when executed by a processor, implements the method of mining a ride route as described in the above embodiments.
According to an aspect of an embodiment of the present application, there is provided an electronic apparatus including: one or more processors; and a storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method of mining a ride route as described in the above embodiments.
According to the technical scheme provided by the embodiments of the application, the hot bus taking route is determined in the target bus route according to the number of passengers on the target bus route and the number of passengers off the target bus route, so that analysis is carried out on each bus taking route according to the number of passengers on the target bus route and the number of passengers off the target bus route simultaneously, and the accuracy of the determined hot bus taking route can be remarkably improved compared with a mode of directly determining the hot bus taking route only through the upper bus information contained in the bus taking code data of the passengers.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application as claimed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application. It is evident that the drawings in the following description are only some embodiments of the present application and that other drawings may be obtained from these drawings without inventive effort for a person of ordinary skill in the art. In the drawings:
Fig. 1 shows a schematic diagram of an exemplary system architecture to which the technical solution of an embodiment of the present application may be applied.
FIG. 2 illustrates a flow chart of a method of mining a ride route according to one embodiment of the application.
Fig. 3 shows a specific flowchart of step S210 of the mining method of the riding route according to an embodiment of the present application.
Fig. 4 shows a specific flowchart of step S220 of the mining method of the riding route according to an embodiment of the present application.
Fig. 5 shows a specific flowchart of step S240 of the mining method of the riding route according to an embodiment of the present application.
Fig. 6 shows a specific flowchart of step S510 of the mining method of the riding route according to an embodiment of the present application.
Fig. 7 shows a specific flowchart of step S530 of the mining method of the riding route according to an embodiment of the present application.
Fig. 8 shows a specific flowchart of step S240 of the mining method of the riding route according to an embodiment of the present application.
Fig. 9 shows a flowchart of a method of mining a ride route according to an embodiment of the present application.
Fig. 10 shows a block diagram of an excavating apparatus of a riding route according to an embodiment of the present application.
Fig. 11 shows a schematic diagram of a computer system suitable for use in implementing an embodiment of the application.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments may be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the application. One skilled in the relevant art will recognize, however, that the application may be practiced without one or more of the specific details, or with other methods, components, devices, steps, etc. In other instances, well-known methods, devices, implementations, or operations are not shown or described in detail to avoid obscuring aspects of the application.
The block diagrams depicted in the figures are merely functional entities and do not necessarily correspond to physically separate entities. That is, the functional entities may be implemented in software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
The flow diagrams depicted in the figures are exemplary only, and do not necessarily include all of the elements and operations/steps, nor must they be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the order of actual execution may be changed according to actual situations.
Fig. 1 shows a schematic diagram of an exemplary system architecture to which the technical solution of an embodiment of the present application may be applied.
As shown in fig. 1, the system architecture 100 may include a bus 101, clients 102, and servers 103. The network is the medium used to provide communication links between clients 102 and servers 103. The network may include various connection types, such as wired communication links, wireless communication links, and the like.
It should be understood that the number of clients 102, networks, and servers 103 in fig. 1 is merely illustrative. There may be any number of clients 102, networks, and servers 103, such as a server cluster of servers 103, which may be a plurality of servers, etc., as desired for an implementation.
The client 102 interacts with the server 103 through a network to receive or transmit messages or the like, and the server 103 may be a server providing various services, for example, a server providing a ride navigation service or a map navigation service.
The client 102 may be a terminal device used by a passenger, such as a smart phone, a tablet computer, etc., where the passenger is taking a bus, and may interact with a card swiping device in the bus 101 through the terminal device to generate a riding code. The server 103 may obtain the passenger's ride code information from the client 102, and optionally, the card swiping device in the bus 101 may also send the generated ride code information to the server 103.
The server 103 respectively determines the matching degree between each bus line and each passenger set according to the passenger code information corresponding to each passenger set and the line information corresponding to each bus line, and associates a target passenger set with the target bus line, wherein the matching degree is higher than a preset matching degree threshold value, and the passenger code information corresponding to the passengers in the passenger set is generated by the same card swiping equipment; the number of passengers on the target bus route is determined according to the information of the taking-in codes corresponding to the passengers in the target passenger set, and the number of passengers off the target bus route is determined according to the position information of the positioning points corresponding to the passengers in the target passenger set and the route information corresponding to the target bus route; and finally, determining a hot riding route in the target bus line based on the number of passengers on the target bus line and the number of passengers off the target bus line. The method and the device realize that the bus taking routes are analyzed according to the number of passengers on the target bus route and the number of passengers off the target bus route at the same time so as to determine the hot bus taking route, and compared with a mode of directly determining the hot bus taking route only through the information of the passengers contained in the taking code data, the accuracy of the determined hot bus taking route can be remarkably improved.
It should be noted that, the method for mining a bus route according to the embodiment of the present application is generally executed by the server 103, and accordingly, the device for mining a bus route is generally disposed in the server 103. However, in other embodiments of the present application, the client 102 may also have a similar function as the server 103, so as to execute the scheme of the mining method of the riding route provided by the embodiment of the present application.
Implementation details of the technical solution of the embodiment of the present application are set forth in detail below.
Fig. 2 illustrates a flowchart of a method of mining a ride route, which may be performed by a server, which may be the server 103 illustrated in fig. 1, according to one embodiment of the present application. Referring to fig. 2, the method for excavating a riding route at least includes steps S210 to S240, which will be described in detail below.
In step S210, the matching degree between each bus line and each passenger set is determined according to the passenger code information corresponding to the passengers in each passenger set and the line information corresponding to each bus line, where the passenger code information corresponding to the passengers in the passenger set is generated by the same card swiping device.
In one embodiment, the riding code information may be riding information generated by riding and punching a card by using a card punching device on the bus through the intelligent terminal when a passenger gets on the bus, where the riding information includes various information related to riding attributes, specifically may include location information of a boarding point, identity information of the passenger and identification information corresponding to the card punching device, and may of course also include cost information or name information corresponding to a payment application.
The riding code information can be obtained from payment application in the intelligent terminal, and when riding code information corresponding to the passengers in the passenger set is determined, the riding code information can be classified according to the identification information corresponding to the card swiping equipment, so that riding code information generated by the same card swiping equipment is obtained and used as riding code information corresponding to the passengers in the passenger set.
Alternatively, the obtained ride code information corresponding to the passengers in the passenger set may be ride code information within a predetermined period of time, for example, may be ride code information within one month.
In one embodiment, the line information corresponding to the bus line is the actual running line information of the bus corresponding to the bus line, that is, the line information formed by the geographical positions of the bus corresponding to the bus line when running from the start bus stop to the end bus stop, where the line information corresponding to each bus line can be obtained from the information base of the bus company.
In one embodiment, the passenger sets the corresponding passcode information of the passengers to the passcode information generated by the same card swiping device, i.e. the passcode information generated by the card swiping device on the same bus. Because the same bus route comprises a plurality of buses, the bus taking codes generated by the card swiping devices on the buses can belong to the same bus route.
It can be understood that the situation to which the present embodiment is directed is a situation in which the bus route to which the card swiping device belongs cannot be known.
In one embodiment, according to the information of the riding code corresponding to each passenger in the passenger set and the information of the route corresponding to each public transportation route, the matching degree between the information of the riding code corresponding to each passenger in the passenger set and the information of the route corresponding to each public transportation route can be respectively determined, the matching degree reflects the possibility of the passenger in the passenger set riding on the corresponding public transportation route, and according to the matching degree, the public transportation route on which the passenger in the passenger set rides can be determined.
Referring to fig. 3, fig. 3 shows a specific flowchart of step S210 of the excavation method of the ride route according to an embodiment of the present application, in which step S210 may include steps S310 to S340 in particular, as described in detail below.
In step S310, a first shortest straight line distance between each bus route and the boarding point corresponding to each passenger group passenger is determined according to the position information of the boarding point corresponding to each passenger group passenger and the route information corresponding to each bus route.
In one embodiment, the passenger sets the passenger-corresponding ride code information to include position information of a boarding point corresponding to the passenger, where the boarding point position information is geographic position information where the ride code information is located when being generated. For each passenger set and each bus line, when the matching degree between a certain passenger set and a certain bus line is determined, the position information of the boarding point and the line information corresponding to the corresponding bus line can be acquired from the boarding code information corresponding to the passenger in the passenger set, the shortest straight line distance between the line information corresponding to the bus line and the boarding point corresponding to the passenger in the passenger set can be calculated by adopting the mode of calculating the shortest straight line distance between the points and the line segments, and the matching degree between each passenger set and each passenger set can be calculated by adopting the mode.
In step S320, the number of boarding points with the first shortest straight-line distance smaller than the first predetermined distance threshold is determined as the number of boarding points with which each bus route is respectively matched with each passenger set.
In one embodiment, the first predetermined distance threshold is set to be 50 meters as a predetermined distance value that is preset to determine whether the passengers in the passenger group are on the bus line according to the position information of the boarding point. When the first shortest straight line distance between the bus line and the boarding point corresponding to a certain passenger is smaller than a first preset distance threshold value, the fact that the boarding point corresponding to the passenger is closer to the bus line is indicated, and then the passenger is determined to be on the bus line; otherwise, the distance between the boarding point corresponding to the passenger and the bus line is far, and the passenger is determined not to be on the bus line.
For any passenger set and one bus route, the number of boarding points, of which the first shortest straight line distance is smaller than a first preset distance threshold, can be selected from boarding points corresponding to the passengers in the passenger set and used as the number of boarding points, which are respectively matched with the passenger set, of the bus route.
In step S330, a degree of matching between each bus line and each passenger set is generated based on the number of boarding points that each bus line matches with each passenger set and the total number of boarding points corresponding to passengers in each passenger set.
In one embodiment, the number of the matched boarding points is the number of boarding actions of the passengers in the passenger set on the corresponding bus route, and the total number of boarding points corresponding to the passengers in the passenger set is the total number of boarding actions of the passengers in the passenger set, so that the matching degree between the bus route and the passenger set can be generated based on the number of the matched boarding points and the total number of boarding actions of the passengers in the passenger set.
Specifically, the ratio between the number of boarding points, which are matched with the passenger set, of the bus line and the total number of boarding points, which are corresponding to the passengers in the passenger set, can be used as the matching degree between the bus line and the passenger set.
In the technical solution of the embodiment shown in fig. 3, by calculating the shortest straight line distance between the corresponding boarding point of the passenger and the bus route, it can be determined whether the passenger is on the corresponding bus route, thereby determining the boarding times of the passenger in the passenger set on the bus route, and further determining the matching degree between the passenger set and the bus route according to the boarding times of the passenger in the passenger set on the bus route, so as to accurately correlate each passenger set with each bus route.
Still referring to fig. 2, in step S220, a target passenger set with a matching degree higher than a predetermined matching degree threshold is associated with a target bus route.
In one embodiment, the predetermined matching degree threshold is a preset matching degree threshold for determining whether the matched bus route is a bus route most likely to be taken by a passenger in the passenger set, and when determining the bus route most likely to be taken by a passenger in the target passenger set, the matching degree between each bus route and the target passenger set may be compared with the predetermined matching degree threshold, and a target passenger set with a matching degree higher than the predetermined matching degree threshold may be associated with the target bus route. Of course, since the riding code information corresponding to the passengers in the same passenger set belongs to the riding code generated by the same card swiping device, the card swiping device and the bus line can be bound according to the identification information corresponding to the card swiping device.
It will be appreciated that since the same bus route comprises a plurality of buses running, the target bus route will generally correspond to a plurality of target passenger sets, and accordingly, the target bus route may be associated with a plurality of target passenger sets simultaneously.
Referring to fig. 4, fig. 4 shows a specific flowchart of step S220 of the excavation method of the ride route according to an embodiment of the present application, in which step S220 may specifically include steps S410 to S420, which will be described in detail below.
In step S410, if there are a plurality of target bus routes with a matching degree with the target passenger set higher than the predetermined matching degree threshold, selecting a target bus route with the largest number of boarding points matching with the target passenger set from the plurality of target bus routes.
In step S420, the selected target bus route is associated with a target passenger set.
In one embodiment, since there may be an extreme case where a plurality of bus routes have more identical road sections, in this extreme case, the target bus route on which the passengers in the target passenger set are most likely to take cannot be accurately determined only according to the degree of matching between the target bus route and the target passenger set.
Therefore, in order to improve the accuracy of the determined target bus route most likely to be taken by the passengers in the target passenger set, under the condition that the number of target bus routes matched with the target passenger set is more than a predetermined matching threshold, the target bus route with the largest number of boarding points matched with the target passenger set can be selected, and the more the number of the boarding points matched is, the greater the likelihood that the corresponding target bus route is the bus route most likely to be taken by the passengers in the target passenger set is, so that the selected target bus route can be associated with the target passenger set.
In the technical solution of the embodiment shown in fig. 4, when there are multiple destination bus routes with a degree of matching with the destination passenger set higher than the predetermined degree of matching threshold, by selecting the destination bus route for association according to the number of the matched boarding points, it is possible to determine the bus route most likely to be taken by the passenger in the passenger set from the two bus routes under the extreme condition that the multiple bus routes have more identical road sections, and the accuracy of association between the passenger set and the bus route is improved.
Optionally, step S420 may include: if the number of the target bus routes with the matching degree higher than the preset matching degree threshold value with the target passenger sets is more than one, and the number of the target bus routes with the matching degree higher than the preset matching degree threshold value with the target passenger sets is smaller than the preset number threshold value, selecting the target bus route with the largest number of the bus boarding points matched with the target passenger sets from the multiple target bus routes.
In this embodiment, since there may be an extreme case that multiple bus routes have more identical road sections, when there are multiple target bus routes with a matching degree with the target passenger set higher than a predetermined matching degree threshold, it may also be determined whether the number of target bus routes with a matching degree with the target passenger set higher than the predetermined matching degree threshold is smaller than a predetermined number threshold, when the number of target bus routes with a matching degree with the target passenger set higher than the predetermined matching degree threshold is smaller than the predetermined number threshold, then the target bus route with the largest number of bus points matched with the target passenger set is selected from the multiple target bus routes, otherwise, the target bus route is not associated with the target passenger set any more, and the predetermined number threshold may be set to two or three.
By judging whether the number of the target bus routes with the matching degree with the target passenger set being higher than the preset matching degree threshold value is smaller than the preset number threshold value, the determination of a plurality of target bus routes associated with the passenger set can be avoided, and the accuracy of the association between the passenger set and the bus routes can be improved.
Still referring to fig. 2, in step S230, the number of passengers on the target bus route is determined according to the passenger code information corresponding to the passengers in the target passenger set.
In one embodiment, after the target passenger set is associated with the target bus line, the number of passengers on the target bus line may be determined according to the passenger code information corresponding to the passengers in the target passenger set. Specifically, the total number of boarding points corresponding to the passengers in the target passenger set can be determined according to the boarding code information corresponding to the passengers in the target passenger set, namely the boarding times of the passengers in the target bus route in the target passenger set, so that the boarding times of the passengers in the target bus route can be determined conveniently according to the boarding times of the passengers in the target passenger set in the target bus route.
It will be appreciated that a destination bus may be associated with one or more destination passenger sets, as the same bus may contain one or more buses running. When the target bus line is associated with a plurality of target passenger sets, the number of passengers on the target bus line is the sum of the number of times of passengers on the target bus line in the plurality of target passenger sets.
In step S240, the number of passengers getting off the target bus line is determined according to the location information of the locating point corresponding to the passengers in the target passenger set and the line information corresponding to the target bus line.
In one embodiment, the positioning points corresponding to the passengers in the target passenger set are the positioning points determined by the terminal equipment held by the passengers when positioning is initiated, the position information of the positioning points is the geographic position information determined by the terminal equipment held by the passengers when positioning, the geographic position information can comprise longitude information and latitude information, and one or more positioning points corresponding to each passenger can be provided.
When the number of passengers getting off the target bus line is determined according to the position information of the positioning points corresponding to the passengers in the target passenger set and the line information corresponding to the target bus line, the positioning points which can be used as the getting-off points can be selected from the positioning points corresponding to the passengers in the target passenger set, the number of the positioning points which are selected as the getting-off points reflects the number of times of getting off the passengers in the target bus line, and the number of times of the passengers getting on the target bus line can be determined based on the number of times of getting off the passengers in the target bus line.
It can be understood that, when the target bus route associates a plurality of target passenger sets, the number of passengers getting off the target bus route is the sum of the number of times of getting off the target bus route for the plurality of target passengers.
Referring to fig. 5, fig. 5 shows a specific flowchart of step S240 of the excavation method of a ride route according to an embodiment of the present application, in which step S240 may specifically include steps S510 to S530, as described in detail below.
In step S510, according to the location information of the locating point corresponding to the passenger in the target passenger set and the line information corresponding to the target bus line, the second shortest straight line distance between the locating point corresponding to the passenger in the target passenger set and the target bus line and the third shortest straight line distance between the locating point corresponding to the passenger in the target passenger set and the bus stop corresponding to the target bus line are determined.
In one embodiment, when determining the number of passengers getting off the target bus according to the position information of the positioning points corresponding to the passengers in the target passenger set and the line information corresponding to the target bus, the positioning points capable of being used as the getting-off points need to be selected from the positioning points corresponding to the passengers in the target passenger set.
Alternatively, a positioning point satisfying two conditions that a distance between bus routes corresponding to the target bus route is within a predetermined distance range of a certain bus stop corresponding to the target bus route and exceeds the predetermined distance range may be used as the departure point.
Therefore, a second shortest linear distance between the locating point corresponding to the concentrated passenger of the target passenger and the target bus line can be calculated by adopting a mode of calculating the shortest linear distance between the point and the line segment; calculating a third shortest linear distance from a locating point corresponding to the passenger in the target passenger set to each bus stop corresponding to the target bus route in a mode of calculating the shortest linear distance between the points; the shortest linear distance between each locating point and the target bus line and the shortest linear distance between each locating point and each bus stop corresponding to the target bus line are determined.
Referring to fig. 6, fig. 6 shows a specific flowchart of step S510 of the method of mining a ride route according to an embodiment of the present application, in which ride code information includes a boarding time of a boarding point, and step S510 may specifically include steps S610 to S620, which will be described in detail below.
In step S610, a location point having a location time after the boarding time and having a time difference between the location time and the boarding time less than a predetermined time threshold is selected among the location points corresponding to the passengers in the target passenger set based on the boarding time of the boarding point corresponding to the passengers in the target passenger set and the location time of the location point corresponding to the passengers in the target passenger set.
In one embodiment, the riding code information further includes a boarding time corresponding to the boarding point, that is, a generation time for generating the boarding point, where the positioning time of the positioning point is a time for initiating positioning by the positioning point. For each passenger in the target passenger set, the number of corresponding positioning points can be multiple, and in order to improve the accuracy of determining the get-off point corresponding to the passenger in the target passenger set according to the positioning points, each positioning point corresponding to each passenger needs to be screened first to obtain the selected positioning point.
The passenger gets off the bus and the time for the user to get on the bus is not particularly long, for example, two hours are not exceeded, so that a positioning point with a positioning time after the getting-on time and a time difference between the positioning time and the getting-on time being smaller than a preset time threshold value can be selected from positioning points corresponding to the passengers in the target passenger set, so as to obtain the positioning point meeting the requirement, and the preset time threshold value can be set to 2 hours or 1.5 hours, which is not limited herein.
In step S620, according to the location information of the selected anchor point and the line information corresponding to the destination bus line, the second shortest linear distance between the selected anchor point and the destination bus line and the third shortest linear distance between the selected anchor point and each bus stop corresponding to the destination bus line are determined.
In one embodiment, after the anchor points are selected from the anchor points corresponding to the passengers in the target passenger set, the second shortest linear distance between the selected anchor point and the target bus line and the third shortest linear distance between the selected anchor point and the bus stops corresponding to the target bus line are determined according to the position information of the selected anchor point and the line information corresponding to the target bus line, so that the anchor point meeting the get-off condition can be further determined in the selected anchor point, and the anchor point can be used as the get-off point corresponding to the passengers in the target passenger set.
In the technical solution of the embodiment shown in fig. 6, by screening the positioning points corresponding to each passenger in the set of target passengers, the positioning points which cannot be used as the departure point can be directly removed, so that the need of performing corresponding data processing on the positioning points which do not meet the departure point condition is avoided, unnecessary data processing can be reduced, and the efficiency of system data processing is improved.
Optionally, after the locating time is selected from locating points corresponding to each passenger in the target passenger set, and after the time difference between the locating time and the boarding time is smaller than a predetermined time threshold, for the selected locating points, a linear distance between the two locating points can be determined according to the position information of the two locating points, if the linear distance between the two locating points is smaller than the predetermined distance value, it is indicated that the two locating points are closer, and in order to avoid the situation that two getting-off points are determined according to the two locating points, one locating point can be deleted.
The positioning points meeting the get-off condition are further screened according to the linear distance between the two positioning points, so that the situation of determining repeated get-off points can be reduced, the accuracy of the get-off points corresponding to the passengers of the determined target passenger set can be improved, meanwhile, the number of the positioning points needing to be subjected to data processing is reduced, the system avoids unnecessary data processing, and the efficiency of system data processing can be further improved.
Still further referring to fig. 5, in step S520, a target positioning point having a second shortest linear distance greater than a second predetermined distance threshold and a third shortest linear distance less than a third predetermined distance threshold is selected from positioning points corresponding to the passengers in the target passenger set.
In one embodiment, the second predetermined distance threshold is a preset predetermined distance value, which is used to determine whether the distance between the locating point and the bus route corresponding to the target bus route is outside the predetermined distance range, that is, determine whether the passenger gets on or off the bus, where the predetermined distance value may be specifically 200 meters or 300 meters, and the specific value of the second predetermined distance threshold is not limited herein. And when the second shortest straight line distance is greater than a second preset distance threshold value, determining that the passenger is not on the bus and gets off the bus.
The third predetermined distance threshold is preset as a preset predetermined distance value, and is used for judging whether the positioning point is within a predetermined distance range of a certain bus stop corresponding to the target bus route, that is, judging whether the passenger has been off the bus from the certain bus stop of the bus, where the predetermined distance value can be specifically 1500 meters or 2100 meters, and the specific value is not limited herein.
When the second shortest straight distance is greater than the second preset distance threshold value, it is determined that the passenger is not on the bus and is near a certain bus stop of the bus, and therefore the probability that the bus stop is a corresponding departure point of the passenger is high. And selecting a target positioning point with the second shortest linear distance larger than a second preset distance threshold and the third shortest linear distance smaller than a third preset distance threshold from positioning points corresponding to the passengers in the target passenger set, wherein the selected target positioning point is the get-off point corresponding to the passengers in the target passenger set.
In step S530, the number of passengers getting off the destination bus line is determined based on the selected destination anchor point.
In one embodiment, after the selected target positioning points are obtained, the number of the target positioning points can be calculated, wherein the number of the target positioning points is the number of the departure points corresponding to the passengers in the target passenger set, namely the number of the departure behaviors of the passengers in the target public transportation line in the target passenger set, so that the number of the passengers in the target public transportation line can be determined.
It can be understood that, when the target bus route associates a plurality of target passenger sets, the number of passengers getting off the target bus route is the sum of the number of times of getting off the target bus route for the plurality of target passengers.
Referring to fig. 7, fig. 7 shows a specific flowchart of step S530 of the excavation method of the ride route according to an embodiment of the present application, in which step S530 may specifically include steps S710 to S720, as described in detail below.
In step S710, a bus stop with the shortest linear distance from the selected target positioning point is selected as a get-off stop corresponding to the passengers in the target passenger set from the bus stops corresponding to the target bus route.
In one embodiment, when the number of passengers getting off the bus route is determined based on the selected target positioning points, a bus stop with the shortest linear distance between the selected target positioning points can be selected from bus stops corresponding to the target bus route as a get-off stop corresponding to the passengers in the passenger set, so that the number of get-off points can be conveniently determined, and meanwhile, the specific bus stop when the passengers get off the bus route in the target passenger set can be determined according to the target positioning points.
In step S720, the number of passengers getting off the target bus route is determined based on the number of getting off stops corresponding to the passengers in the target passenger set.
In one embodiment, after obtaining the departure stations corresponding to the passengers in the target passenger set, the number of departure stations corresponding to the passengers in the target passenger set may be calculated, that is, the number of departure behaviors of the passengers in the target passenger set on the target bus route is obtained, and the number of passengers in the target bus route is determined according to the number of departure behaviors of the passengers in the target passenger set on the target bus route.
In the scheme of the embodiment shown in fig. 7, the actual getting-off station of the passenger is determined according to the position of the positioning point corresponding to the passenger in the target passenger set, so that the number of times of getting off the passenger in the target bus route is determined according to the actual getting-off station of the passenger in the target passenger set, and the accuracy of the determined hot bus taking route is improved.
Referring to fig. 8, fig. 8 shows a specific flowchart of step S240 of the method of mining a ride route according to an embodiment of the present application, in which ride code information includes a boarding time of a boarding point, step S240 may specifically include steps S810 to S840, which will be described in detail below.
In step S810, a target passenger having only one boarding point in both a first period and a second period of the same day is selected from the target passenger set based on the boarding time of the boarding point corresponding to the passenger in the target passenger set, and a positioning track of the target passenger in the first period and a positioning track of the target passenger in the second period are acquired.
In one embodiment, when the number of passengers getting off the target bus line is determined according to the position information of the locating point corresponding to the passenger in the target passenger set and the line information corresponding to the target bus line, the getting-off point when the passenger in the target passenger set gets on the target bus line can be determined by digging the passengers in a round trip manner when the passengers get on the bus in different time periods. The first period and the second period are two periods when passengers take the same bus route and there may be round trip behavior.
Alternatively, the first period may be an early commute period, the specific time may be 7 am to 10 am, the second period may be a late commute time, and the specific time may be 5 pm to 8 pm. When the target passenger has only one boarding point in the first time period and the second time period of the same day, the target passenger may have a round trip behavior of taking the target bus route in the same day.
Because the target passengers may take the same bus of the same target bus route in the first time period and the second time period and may also be different buses of the same target bus route, the boarding points of the target passengers in the first time period and the boarding points in the second time period may be boarding points corresponding to the target passengers in the same target passenger set, or boarding points corresponding to the target passengers in different target passenger sets. The positioning track of the target passenger in the first time period and the positioning track of the target passenger in the second time period are generated according to a plurality of positioning points of the target passenger in the corresponding time period.
In step S820, if the shortest linear distance between the boarding point corresponding to the first period and the positioning track of the second period is smaller than the fourth predetermined distance threshold and the shortest linear distance between the boarding point corresponding to the second period and the positioning track of the first period is smaller than the fourth predetermined distance threshold, the boarding point corresponding to the first period of the target passenger is determined to be the alighting point corresponding to the second period of the target passenger and the boarding point corresponding to the second period of the target passenger is determined to be the alighting point corresponding to the first period of the target passenger.
In one embodiment, to further determine whether the target passenger has a round trip behavior of taking the target bus route on the same day, a shortest linear distance between a boarding point corresponding to the first period and a positioning track of the second period of the target passenger may be calculated, and the shortest linear distance between the boarding point corresponding to the second period and the positioning track of the first period of the target passenger may be calculated to be smaller than a fourth predetermined distance threshold.
When the shortest linear distance between the boarding point corresponding to the first time period and the positioning track of the second time period of the target passenger is smaller than the fourth preset distance threshold value and the shortest linear distance between the boarding point corresponding to the second time period and the positioning track of the first time period of the target passenger is smaller than the fourth preset distance threshold value, the condition that the passenger has the round-trip behavior of taking the target bus route on the same day, such as the round-trip behavior of going to and off duty, can be determined. Therefore, the boarding point corresponding to the first time period of the target passenger can be determined as the alighting point corresponding to the second time period of the target passenger, and the boarding point corresponding to the second time period of the target passenger can be determined as the alighting point corresponding to the first time period of the target passenger.
The fourth predetermined distance threshold is a predetermined distance threshold, and is used for determining whether the get-off point corresponding to the second period is near the positioning track of the first period, and determining whether the get-off point corresponding to the first period is near the positioning track of the second period, where the specific value is not limited.
In step S830, the number of boarding points corresponding to the first period of time and the number of alighting points corresponding to the second period of time of the target passenger are determined.
In one embodiment, the number of boarding points corresponding to the first time period of the target passenger meeting the conditions is determined as the number of alighting points corresponding to the second time period of the target passenger; and determining the number of boarding points corresponding to the second time period of the target passengers meeting the conditions, and taking the number of boarding points corresponding to the first time period of the target passengers as the number of alighting points corresponding to the first time period of the target passengers.
In step S840, the number of passengers getting off the bus line is determined based on the number of getting-on points corresponding to the first period of time and the number of getting-off points corresponding to the second period of time.
In one embodiment, the sum of the number of departure points corresponding to the target passenger in the first period and the number of departure points corresponding to the target passenger in the second period may be used as the number of passengers' departure times of the target bus route.
Optionally, the weighted sum of the number of the departure points corresponding to the target passengers in the first period and the number of the departure points corresponding to the target passengers in the second period may be used as the number of the passengers in the target bus route.
Still referring to fig. 2, in step S250, a hot riding route is determined in the destination bus route based on the number of passengers getting on the destination bus route and the number of passengers getting off the destination bus route.
In one embodiment, after the number of passengers getting on the target bus route and the number of passengers getting off the target bus route are obtained, when determining the hot route, the target bus route with the largest sum of the number of passengers getting on and the number of passengers getting off may be determined as the hot taking route, or the target bus route with the sum of the number of passengers getting on and the number of passengers getting off higher than the predetermined number threshold may be determined as the hot taking route, and of course, a plurality of target bus routes with the sum of the number of passengers getting on and the number of passengers getting off arranged in front may be determined as the hot taking route.
As can be seen from the above, by determining the hot bus taking route in the target bus route according to the number of passengers on the target bus route and the number of passengers off the target bus route, it is achieved that each bus taking route is simultaneously analyzed according to the number of passengers on the target bus route and the number of passengers off the target bus route to determine the hot bus taking route, and the accuracy of the determined hot bus taking route can be significantly improved compared with a method in which the hot bus taking route is directly determined only by taking information contained in the code data of passengers.
Referring to fig. 9, fig. 9 shows a flowchart of a method of excavating a bus route according to an embodiment of the present application, and in the method of excavating a bus route of the present embodiment, steps S910 to S930 may be further included, as described in detail below.
In step S910, the number of passengers boarding the bus is determined based on the position information of the boarding point corresponding to the passenger in the target passenger set associated with the hot-ride route and the position information of each bus stop corresponding to the hot-ride route.
In one embodiment, for the determined hot ride route, a hot ride line segment may also be determined in the hot ride route, and in particular, a corresponding hot ride line segment may be determined in each ride line segment of the hot ride route according to the number of passengers on and the number of passengers off in each hot ride line segment. When the number of passengers on the bus corresponding to each line segment included in the hot riding route is determined, the position information of the boarding point corresponding to the passenger concentrated in the target passenger related to the hot riding route and the position information of each bus stop corresponding to the hot riding route can be determined, the bus stop closest to the boarding point corresponding to the passenger concentrated in the target passenger related to the hot riding route is determined as the boarding stop corresponding to the passenger concentrated in the target passenger, and the number of passengers on the bus corresponding to each line segment included in the hot riding route is further determined according to the boarding stop corresponding to the passenger concentrated in the target passenger concentrated in the hot riding route and the line segment where the boarding stop is located.
In step S920, the number of passengers getting off corresponding to each line segment included in the hot riding route is determined based on the getting off stations corresponding to the target passengers collected in the hot riding route.
In one embodiment, when determining the number of passengers getting off corresponding to each line segment included in the hot riding route based on the getting-off station corresponding to the target passenger set passenger associated with the hot riding route, the number of passengers getting off corresponding to each line segment included in the hot riding route may be determined specifically according to the getting-off station corresponding to the target passenger set passenger associated with the hot riding route and the line segment where the getting-off station is located.
In step S930, a hot line segment is determined from the line segments included in the hot line segment according to the number of passengers getting on and the number of passengers getting off corresponding to the line segments included in the hot line segment.
In one embodiment, after the number of times of getting on and off the passenger corresponding to each line segment of the hot riding route is obtained, when determining the hot line segment corresponding to the hot riding route, a line segment with the largest sum of the number of times of getting on and off the passenger may be determined as the hot line segment, a line segment with the sum of the number of times of getting on and off the passenger higher than a predetermined number of times threshold may be determined as the hot line segment, and of course, a plurality of lines with the sum of the number of times of getting on and off the passenger arranged in front may be determined as the hot line segment.
In the technical scheme of the embodiment shown in fig. 9, by further excavating the hot line segments in the hot riding route, passengers can reasonably select travel tools according to the determined hot riding route and the hot line segments in the hot riding route, and travel experience is improved.
The following describes an embodiment of the apparatus of the present application, which can be used to perform the method of mining a riding route in the above-described embodiment of the present application. For details not disclosed in the embodiments of the apparatus of the present application, please refer to the above-described embodiments of the method for excavating a riding route.
Fig. 10 shows a block diagram of an excavating apparatus of a riding route according to an embodiment of the present application.
Referring to fig. 10, an excavating apparatus 1000 of a riding route according to an embodiment of the present application includes: matching unit 1010, association unit 1020, first execution unit 1030, second execution unit 1040, and third execution unit 1050. The matching unit 1010 is configured to determine, according to the passenger code information corresponding to the passengers in the passenger set and the line information corresponding to the bus routes, a matching degree between each bus route and each passenger set, where the passenger code information corresponding to the passengers in the passenger set is generated by the same card swiping device; an association unit 1020, configured to associate a target passenger set with a target bus route, where the matching degree is higher than a predetermined matching degree threshold; a first execution unit 1030, configured to determine the number of passengers boarding the target bus route according to the passenger code information corresponding to the passengers in the target passenger set; the second execution unit 1040 is configured to determine a number of passengers getting off the target bus line according to position information of positioning points corresponding to the passengers in the target passenger set and line information corresponding to the target bus line; and a third execution unit 1050 configured to determine a hot riding route in the target bus route based on the number of passengers getting on the target bus route and the number of passengers getting off the target bus route.
In some embodiments of the present application, based on the foregoing aspect, the ride code information includes position information of a boarding point, and the matching unit 1010 is configured to: according to the position information of the boarding points corresponding to the passengers in the passenger sets and the line information corresponding to the public transportation lines, respectively determining a first shortest straight line distance between each public transportation line and the boarding points corresponding to the passengers in the passenger sets; determining the number of boarding points, of which the first shortest straight line distance is smaller than a first preset distance threshold, as the number of boarding points matched between each bus route and each passenger set respectively; and generating the matching degree between each bus line and each passenger set based on the number of boarding points matched between each bus line and each passenger set and the total number of boarding points corresponding to passengers in each passenger set.
In some embodiments of the present application, based on the foregoing scheme, the association unit 1020 is configured to: if the number of the target bus routes with the matching degree higher than the preset matching degree threshold is more than one, selecting the target bus route with the largest number of boarding points matched with the target passenger set from the target bus routes; and associating the selected target bus route with the target passenger set.
In some embodiments of the present application, based on the foregoing scheme, the association unit 1020 is configured to: if the number of the target bus routes with the matching degree higher than the preset matching degree threshold value with the target passenger sets is more than one, and the number of the target bus routes with the matching degree higher than the preset matching degree threshold value with the target passenger sets is smaller than the preset number threshold value, selecting the target bus route with the largest number of the bus boarding points matched with the target passenger sets from the target bus routes.
In some embodiments of the present application, based on the foregoing, the second execution unit 1040 is configured to: determining a second shortest linear distance from the locating point corresponding to the passenger in the target passenger set to the target bus route and a third shortest linear distance from the locating point corresponding to the passenger in the target passenger set to the bus stop corresponding to the target bus route according to the position information of the locating point corresponding to the passenger in the target passenger set and the route information corresponding to the target bus route; selecting a target positioning point with the second shortest linear distance larger than a second preset distance threshold and the third shortest linear distance smaller than a third preset distance threshold from positioning points corresponding to passengers in the target passenger set; and determining the number of passengers getting off the target bus line based on the selected target positioning point.
In some embodiments of the present application, based on the foregoing aspect, the ride code information includes a boarding time of a boarding point, and the second execution unit 1040 is configured to: selecting a positioning point with a positioning time after the boarding time and with a time difference between the positioning time and the boarding time smaller than a preset time threshold value from the positioning points corresponding to the passengers in the target passenger set based on the boarding time of the boarding point corresponding to the passengers in the target passenger set and the positioning time of the positioning point corresponding to the passengers in the target passenger set; and determining a second shortest linear distance between the selected locating point and the target bus line and a third shortest linear distance between the selected locating point and each bus stop corresponding to the target bus line according to the position information of the selected locating point and the line information corresponding to the target bus line.
In some embodiments of the present application, based on the foregoing, the second execution unit 1040 is configured to: selecting a bus stop with the shortest linear distance between the bus stop and the selected target positioning point from bus stops corresponding to the target bus route as a get-off stop corresponding to the concentrated passengers of the target passengers; and determining the number of passengers getting off the bus on the target bus route based on the number of getting off stations corresponding to the passengers in the target passenger set.
In some embodiments of the present application, based on the foregoing aspect, the ride code information includes a boarding time of a boarding point, and the second execution unit 1040 is configured to: selecting a target passenger with only one boarding point in a first time period and a second time period of the same day from the target passenger set based on boarding times of boarding points corresponding to passengers in the target passenger set, and acquiring a positioning track of the target passenger in the first time period and a positioning track of the target passenger in the second time period; if the shortest linear distance between the boarding point corresponding to the first time period and the positioning track of the second time period of the target passenger is smaller than a fourth preset distance threshold value and the shortest linear distance between the boarding point corresponding to the second time period and the positioning track of the first time period of the target passenger is smaller than a fourth preset distance threshold value, determining the boarding point corresponding to the first time period of the target passenger as the alighting point corresponding to the second time period of the target passenger and determining the boarding point corresponding to the second time period of the target passenger as the alighting point corresponding to the first time period of the target passenger; determining the number of get-off points corresponding to the first time period of the target passengers and the number of get-off points corresponding to the second time period of the target passengers; and determining the number of passengers getting off the bus line of the target based on the number of getting off points of the target passengers corresponding to the first time period and the number of getting off points of the target passengers corresponding to the second time period.
In some embodiments of the present application, based on the foregoing, the excavating device for the riding route includes: a fourth execution unit, configured to determine the number of passengers boarding the bus corresponding to each line segment included in the hot riding route, based on position information of boarding points corresponding to the concentrated passengers of the target passengers associated with the hot riding route and position information of each bus stop corresponding to the hot riding route; a fifth execution unit, configured to determine a number of passengers getting off corresponding to each line segment included in the hot riding route based on a get-off station corresponding to a concentrated passenger of the target passengers associated with the hot riding route; and the sixth execution unit is used for determining the hot line segment from the line segments contained in the hot line segment according to the number of passengers on the vehicle and the number of passengers off the vehicle corresponding to the line segments contained in the hot line segment.
Fig. 11 shows a schematic diagram of a computer system suitable for use in implementing an embodiment of the application.
It should be noted that, the computer system 1100 of the electronic device shown in fig. 11 is only an example, and should not impose any limitation on the functions and the application scope of the embodiments of the present application.
As shown in fig. 11, the computer system 1100 includes a central processing unit (Central Processing Unit, CPU) 1101 that can perform various appropriate actions and processes, such as performing the methods described in the above embodiments, according to a program stored in a Read-Only Memory (ROM) 1102 or a program loaded from a storage section 1108 into a random access Memory (Random Access Memory, RAM) 1103. In the RAM 1103, various programs and data required for system operation are also stored. The CPU 1101, ROM 1102, and RAM 1103 are connected to each other by a bus 1104. An Input/Output (I/O) interface 1105 is also connected to bus 1104.
The following components are connected to the I/O interface 1105: an input section 1106 including a keyboard, a mouse, and the like; an output portion 1107 including a Cathode Ray Tube (CRT), a Liquid crystal display (Liquid CRYSTAL DISPLAY, LCD), and a speaker, etc.; a storage section 1108 including a hard disk or the like; and a communication section 1109 including a network interface card such as a LAN (Local Area Network ) card, a modem, or the like. The communication section 1109 performs communication processing via a network such as the internet. The drive 1110 is also connected to the I/O interface 1105 as needed. Removable media 1111, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is installed as needed on drive 1110, so that a computer program read therefrom is installed as needed into storage section 1108.
In particular, according to embodiments of the present application, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present application include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising a computer program for performing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network via the communication portion 1109, and/or installed from the removable media 1111. When executed by a Central Processing Unit (CPU) 1101, performs the various functions defined in the system of the present application.
It should be noted that, the computer readable medium shown in the embodiments of the present application may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-Only Memory (ROM), an erasable programmable read-Only Memory (Erasable Programmable Read Only Memory, EPROM), a flash Memory, an optical fiber, a portable compact disc read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present application, however, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with a computer-readable computer program embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. A computer program embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. Where each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units involved in the embodiments of the present application may be implemented by software, or may be implemented by hardware, and the described units may also be provided in a processor. Wherein the names of the units do not constitute a limitation of the units themselves in some cases.
As another aspect, the present application also provides a computer-readable medium that may be contained in the electronic device described in the above embodiment; or may exist alone without being incorporated into the electronic device. The computer-readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to implement the methods described in the above embodiments.
It should be noted that although in the above detailed description several modules or units of a device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functions of two or more modules or units described above may be embodied in one module or unit in accordance with embodiments of the application. Conversely, the features and functions of one module or unit described above may be further divided into a plurality of modules or units to be embodied.
From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present application may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, and includes several instructions to cause a computing device (may be a personal computer, a server, a touch terminal, or a network device, etc.) to perform the method according to the embodiments of the present application.
Other embodiments of the application will be apparent to those skilled in the art from consideration of the specification and practice of the embodiments disclosed herein. This application is intended to cover any variations, uses, or adaptations of the application following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the application pertains.
It is to be understood that the application is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the application is limited only by the appended claims.

Claims (9)

1. A method of excavating a ride route, comprising:
According to the information of the bus taking codes corresponding to the passengers in the passenger sets and the line information corresponding to the bus lines, the matching degree between the bus lines and the passenger sets is respectively determined, and the information of the bus taking codes corresponding to the passengers in the passenger sets is the information of the bus taking codes generated by the same card swiping equipment;
Associating a target passenger set with a target bus route, wherein the matching degree of the target passenger set is higher than a preset matching degree threshold value;
Determining the number of passengers on the target bus route according to the riding code information corresponding to the passengers in the target passenger set;
Determining a second shortest linear distance from the locating point corresponding to the passenger in the target passenger set to the target bus route and a third shortest linear distance from the locating point corresponding to the passenger in the target passenger set to the bus stop corresponding to the target bus route according to the position information of the locating point corresponding to the passenger in the target passenger set and the route information corresponding to the target bus route; the position information of the positioning point refers to geographic position information determined when the terminal equipment held by the passenger is positioned;
selecting a target positioning point with the second shortest linear distance larger than a second preset distance threshold and the third shortest linear distance smaller than a third preset distance threshold from positioning points corresponding to passengers in the target passenger set;
selecting a bus stop with the shortest linear distance between the bus stop and the selected target positioning point from bus stops corresponding to the target bus route as a get-off stop corresponding to the concentrated passengers of the target passengers;
determining the number of passengers getting off the bus line based on the number of getting off stations corresponding to the passengers in the target passenger set;
Determining a hot riding route in the target bus route based on the number of passengers on the target bus route and the number of passengers off the target bus route;
Determining the number of passengers on bus corresponding to each line segment included in the hot riding route based on the position information of the on bus corresponding to the target passenger set passenger and the position information of each bus station corresponding to the hot riding route;
Based on the get-off stations corresponding to the concentrated passengers of the target passengers related to the hot riding route, determining the number of get-off times of the passengers corresponding to each line segment contained in the hot riding route;
And determining a hot line segment from the line segments contained in the hot line segment according to the number of passengers getting on and the number of passengers getting off corresponding to the line segments contained in the hot line segment.
2. The method according to claim 1, wherein the ride code information includes position information of a boarding point, and the determining the matching degree between each bus line and each passenger set according to the ride code information corresponding to each passenger in each passenger set and the line information corresponding to each bus line includes:
According to the position information of the boarding points corresponding to the passengers in the passenger sets and the line information corresponding to the public transportation lines, respectively determining a first shortest straight line distance between each public transportation line and the boarding points corresponding to the passengers in the passenger sets;
Determining the number of boarding points, of which the first shortest straight line distance is smaller than a first preset distance threshold, as the number of boarding points matched between each bus route and each passenger set respectively;
And generating the matching degree between each bus line and each passenger set based on the number of boarding points matched between each bus line and each passenger set and the total number of boarding points corresponding to passengers in each passenger set.
3. The method of mining a bus route according to claim 2, wherein the associating the target passenger set having a degree of matching higher than a predetermined degree of matching threshold with the target bus route includes:
If the number of the target bus routes with the matching degree higher than the preset matching degree threshold is more than one, selecting the target bus route with the largest number of boarding points matched with the target passenger set from the target bus routes;
And associating the selected target bus route with the target passenger set.
4. The method for mining a bus route according to claim 3, wherein if the number of target bus routes having a degree of matching with the target passenger set higher than a predetermined degree of matching threshold is plural, selecting a target bus route having the largest number of boarding points matching with the target passenger set from among the plural target bus routes, comprising:
If the number of the target bus routes with the matching degree higher than the preset matching degree threshold value with the target passenger sets is more than one, and the number of the target bus routes with the matching degree higher than the preset matching degree threshold value with the target passenger sets is smaller than the preset number threshold value, selecting the target bus route with the largest number of the bus boarding points matched with the target passenger sets from the target bus routes.
5. The method according to claim 1, wherein the ride code information includes a boarding time of a boarding point, and the determining a second shortest straight line distance between the locating point corresponding to the passenger in the target passenger set and the target bus line and a third shortest straight line distance between the locating point corresponding to the passenger in the target passenger set and the bus stop corresponding to the target bus line according to the location information of the locating point corresponding to the passenger in the target passenger set and the line information corresponding to the target bus line includes:
Selecting a positioning point with a positioning time after the boarding time and with a time difference between the positioning time and the boarding time smaller than a preset time threshold value from the positioning points corresponding to the passengers in the target passenger set based on the boarding time of the boarding point corresponding to the passengers in the target passenger set and the positioning time of the positioning point corresponding to the passengers in the target passenger set;
And determining a second shortest linear distance between the selected locating point and the target bus line and a third shortest linear distance between the selected locating point and each bus stop corresponding to the target bus line according to the position information of the selected locating point and the line information corresponding to the target bus line.
6. The method of mining a ride route according to claim 1, wherein the ride code information includes a boarding time of a boarding point, the method further comprising:
selecting a target passenger with only one boarding point in a first time period and a second time period of the same day from the target passenger set based on boarding times of boarding points corresponding to passengers in the target passenger set, and acquiring a positioning track of the target passenger in the first time period and a positioning track of the target passenger in the second time period;
if the shortest linear distance between the boarding point corresponding to the first time period and the positioning track of the second time period of the target passenger is smaller than a fourth preset distance threshold value and the shortest linear distance between the boarding point corresponding to the second time period and the positioning track of the first time period of the target passenger is smaller than a fourth preset distance threshold value, determining the boarding point corresponding to the first time period of the target passenger as the alighting point corresponding to the second time period of the target passenger and determining the boarding point corresponding to the second time period of the target passenger as the alighting point corresponding to the first time period of the target passenger;
determining the number of get-off points corresponding to the first time period of the target passengers and the number of get-off points corresponding to the second time period of the target passengers;
And determining the number of passengers getting off the bus line of the target based on the number of getting off points of the target passengers corresponding to the first time period and the number of getting off points of the target passengers corresponding to the second time period.
7. An excavating device for a riding route, comprising:
The matching unit is used for respectively determining the matching degree between each bus line and each passenger set according to the bus code information corresponding to the passengers in each passenger set and the line information corresponding to each bus line, wherein the bus code information corresponding to the passengers in the passenger set is generated by the same card swiping equipment;
The association unit is used for associating the target passenger set with the target bus route, wherein the matching degree of the target passenger set is higher than a preset matching degree threshold value;
The first execution unit is used for determining the number of passengers on the target bus line according to the riding code information corresponding to the passengers in the target passenger set;
The second execution unit is used for determining a second shortest linear distance between the locating point corresponding to the passenger in the target passenger set and the target bus route and a third shortest linear distance between the locating point corresponding to the passenger in the target passenger set and the bus stop corresponding to the target bus route according to the location information of the locating point corresponding to the passenger in the target passenger set and the route information corresponding to the target bus route, wherein the location information of the locating point refers to geographic location information determined when the terminal equipment held by the passenger is located; selecting a target positioning point with the second shortest linear distance larger than a second preset distance threshold and the third shortest linear distance smaller than a third preset distance threshold from positioning points corresponding to passengers in the target passenger set; selecting a bus stop with the shortest linear distance between the bus stop and the selected target positioning point from bus stops corresponding to the target bus route as a get-off stop corresponding to the concentrated passengers of the target passengers; determining the number of passengers getting off the bus line based on the number of getting off stations corresponding to the passengers in the target passenger set;
The third execution unit is used for determining a hot bus taking route in the target bus line based on the number of passengers getting on the target bus line and the number of passengers getting off the target bus line; determining the number of passengers on bus corresponding to each line segment included in the hot riding route based on the position information of the on bus corresponding to the target passenger set passenger and the position information of each bus station corresponding to the hot riding route; based on the get-off stations corresponding to the concentrated passengers of the target passengers related to the hot riding route, determining the number of get-off times of the passengers corresponding to each line segment contained in the hot riding route; and determining a hot line segment from the line segments contained in the hot line segment according to the number of passengers getting on and the number of passengers getting off corresponding to the line segments contained in the hot line segment.
8. A computer readable medium having stored thereon a computer program which, when executed by a processor, implements the method of mining a ride route as claimed in any one of claims 1 to 6.
9. An electronic device, comprising:
one or more processors;
Storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method of mining a ride route as claimed in any one of claims 1 to 6.
CN202010837671.9A 2020-08-19 2020-08-19 Mining method and device for riding route Active CN112052276B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010837671.9A CN112052276B (en) 2020-08-19 2020-08-19 Mining method and device for riding route

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010837671.9A CN112052276B (en) 2020-08-19 2020-08-19 Mining method and device for riding route

Publications (2)

Publication Number Publication Date
CN112052276A CN112052276A (en) 2020-12-08
CN112052276B true CN112052276B (en) 2024-04-30

Family

ID=73600728

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010837671.9A Active CN112052276B (en) 2020-08-19 2020-08-19 Mining method and device for riding route

Country Status (1)

Country Link
CN (1) CN112052276B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113758496B (en) * 2021-11-09 2022-02-22 腾讯科技(深圳)有限公司 Path planning method and device, electronic equipment and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104809344A (en) * 2015-04-23 2015-07-29 中山大学 IC (Integrated Circuit) card data-based estimation method for passenger flow in bus station interval
CN107240289A (en) * 2017-07-24 2017-10-10 济南博图信息技术有限公司 A kind of bus routes optimum management method and system
CN109102114A (en) * 2018-08-02 2018-12-28 中南大学 A kind of bus trip get-off stop estimation method based on data fusion
CN111311467A (en) * 2020-02-11 2020-06-19 罗普特科技集团股份有限公司 Bus route prediction method and system based on face recognition

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104809344A (en) * 2015-04-23 2015-07-29 中山大学 IC (Integrated Circuit) card data-based estimation method for passenger flow in bus station interval
CN107240289A (en) * 2017-07-24 2017-10-10 济南博图信息技术有限公司 A kind of bus routes optimum management method and system
CN109102114A (en) * 2018-08-02 2018-12-28 中南大学 A kind of bus trip get-off stop estimation method based on data fusion
CN111311467A (en) * 2020-02-11 2020-06-19 罗普特科技集团股份有限公司 Bus route prediction method and system based on face recognition

Also Published As

Publication number Publication date
CN112052276A (en) 2020-12-08

Similar Documents

Publication Publication Date Title
US20160048777A1 (en) Reservation management method and reservation management apparatus
RU2595551C1 (en) Navigator for public transport
CN111832788B (en) Service information generation method, device, computer equipment and storage medium
CN104615788A (en) Information notifying method, equipment and system
CN110689804A (en) Method and apparatus for outputting information
CN111898042B (en) Riding point recommendation method, riding point recommendation device, riding point recommendation equipment and storage medium
CN110647929A (en) Method for predicting travel destination and method for training classifier
CN112052276B (en) Mining method and device for riding route
CN114820264A (en) Public transport vehicle transfer data processing method, device, equipment and storage medium
US20140213296A1 (en) Wristwatch notification for late trains
CN114500428B (en) Navigation sharing method and device, electronic equipment and storage medium
Hargunani et al. Integrated bus system using QR code
CN112685531B (en) Vehicle matching method and device, computing device and computer-readable storage medium
CN115423360A (en) Public charging station planning method and device
CN114862491A (en) Vehicle position determining method, order dispatching method, device, server and storage medium
US10971009B2 (en) Extracting events and assessing their impact on a transportation network
CN102110374B (en) System and method for providing traffic information
CN112396081A (en) Data fusion method and device
CN107346457B (en) Bus route grading method, method and device for planning travel route
CN105741152A (en) Identity information verification method and device based on taxi taking
CN108777062A (en) Method and apparatus for output information
CN108509635B (en) Method and apparatus for generating information
CN114358408A (en) Line generation method and device, electronic equipment and storage medium
CN116308604A (en) Travel service method and device, electronic equipment and storage medium
JP2022138664A (en) Riding-together support device, riding-together support system, riding-together support metho, and program

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant