CN113063431A - Intelligent recommendation method for sharing bicycle riding route - Google Patents
Intelligent recommendation method for sharing bicycle riding route Download PDFInfo
- Publication number
- CN113063431A CN113063431A CN202110366935.1A CN202110366935A CN113063431A CN 113063431 A CN113063431 A CN 113063431A CN 202110366935 A CN202110366935 A CN 202110366935A CN 113063431 A CN113063431 A CN 113063431A
- Authority
- CN
- China
- Prior art keywords
- path
- riding
- user
- formula
- probability
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/20—Instruments for performing navigational calculations
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses an intelligent recommendation method for sharing a bicycle riding route, which comprises the following steps: collecting historical riding data of a plurality of shared bicycle users, and establishing an original data set; generating an optional path set according to historical riding data; constructing a path utility function; determining the probability of each path in the selectable path set being selected; and constructing a correction matrix according to the user history evaluation, the safety coefficient and the riding continuity degree, wherein the correction matrix is used for correcting the probability value and determining the final probability of each path being selected. The invention can push a route which is relatively satisfied with the user and has higher safety factor for the shared bicycle user, and improves the riding experience of the user so as to achieve the aim of smooth travel of the shared bicycle.
Description
Technical Field
The invention relates to the field of intelligent transportation, in particular to an intelligent recommendation method for sharing a single-vehicle riding route.
Background
The shared bicycle is a time-sharing rental mode with public bicycles as a main body, and the main content of the shared bicycle is to provide services for placing a large number of public bicycles and a small number of electric vehicles in areas with people flowing in surge, such as campuses, subway stations, bus stations, residential areas, commercial areas, public service areas and the like. The shared bicycle is taken as a new trip mode, is favored by more and more people due to the characteristics of convenient, rapid and low-cost public transportation and the advantages of green, energy conservation and health, is vividly called as the last jigsaw in the transportation industry, and is the best trip selection in short distance of many people. Meanwhile, the problem of the last kilometer of the bus traffic can be effectively solved, the important function of relieving urban traffic jam is achieved, and the overall service level of the urban traffic is improved.
However, while bringing convenience to travel of the majority of citizens and tourists, there are some limitations, for example, it is difficult for a user to plan a route when riding on a completely unfamiliar road, and even an optimal route does not need to be provided, and unreasonable route selection may cause delay of the user time and reduction of riding satisfaction. In terms of considerations, navigation on the market today relies heavily on a single variable-ride time or ride distance-for recommendations of a user's ride route. Although some researches are conducted at home and abroad to discuss related problems, the consideration of some road environment factors such as the number of traffic lights, road gradient and the like on the route selection of a rider is increased, the influence of factors influencing the riding safety of the user such as the type of a non-motor vehicle lane, the parking section in the road, the road grade and the like on the route selection of the rider is considered less in relation to the actual traffic condition in China. In the research process, a researcher usually selects a traditional multi-item location model, but the shared bicycle is used for solving the problem of short trip in a city, namely, the trip range of a user during riding is not large, the phenomenon of repeated road sections of an actual path and an optional path set exists, and the traditional multi-item location model cannot recommend a more accurate path for the user due to lack of consideration of the path overlapping condition.
Disclosure of Invention
The invention aims to overcome the defects in the prior art, provides an intelligent recommendation method for sharing a bicycle riding route, aims to push a route which enables users to be relatively satisfied and has a high safety factor for sharing bicycle users, and improves the riding experience of the users so as to achieve the aim of smooth traveling of the sharing bicycle.
In order to achieve the purpose, the invention adopts the following technical scheme:
the invention discloses an intelligent recommendation method for sharing a bicycle riding route, which is characterized by comprising the following steps:
step 1, collecting historical riding data of a plurality of shared bicycle users, and establishing an original data set; the data types in the raw data set include a non-motorway type X1Parking section X in road2Traffic lights quantity X3And riding distance X4Road grade X5And road surface gradient X6;
Step 2, generating an optional path set C with k optional paths according to the historical riding data of the user nnAnd calculating the user n from the alternative path set C by using the formula (1)nThe repetition coefficient PS of the selected path ini:
In the formula (1), ζiIs the set of all road segments in the path i; laIs the length of segment a in path i; l isiIs the length of path i; if the road section a is in the optional path set CnLet σ be on the path j not selected by the user najIf not, let σaj=0;Is an alternative path set CnLength of shortest path on; l isjIs an alternative path set CnThe length of the medium path j;
step 3, according to the historical riding data of the user n, assuming that the user n selects a path according to the principle of path utility maximization, constructing a utility function U of the path i by using the formula (2)ni:
Uni=Vni+εni (2)
In the formula (2), VniSelecting a path utility value after the riding path i for the user n; epsilonniSelecting a random utility error of a path i for a user n, and obeying mutually independent Gumbel distribution; and comprises the following components:
in the formula (3), beta0Is a constant term, XmData representing an mth data type in the original data set; beta is amRepresenting the influence coefficient of the mth data type on the user riding route selection; beta is aPSRepresenting the influence coefficient of the path repetition coefficient on the user riding route selection;
step 4, obtaining the user n selection selectable path set C according to the formula (4)nProbability value P (i | C) of medium path in) Thus, the alternative path set C can be determinednThe probability of each path in the set being selected;
step 5, constructing a correction matrix according to the user history evaluation, the safety coefficient and the riding continuity degree, and using the correction matrix to correct the probability value so as to determine the selectable path set CnThe final probability of each path in the set being selected;
step 5.1, obtaining the optional path set C of other usersnThe evaluation data of each path or road section in the system is normalized after being averaged to obtain an optional path set CnAverage rating score of each route or section in (1):
step 5.2, calculating a safety factor Sni:
Constructing a danger rate function h (t | X) sharing the riding time t of the riding path i of the bicycle user n by using the formula (5):
h(t|X)=h0(t)g(X) (5)
in the formula (5), h0(t) reference Risk of riding time t, g(X) represents the effect of factor X on the risk and has:
g(X)=exp(β′1X1+β′2X2+β′3X3) (6)
in the formula (6),. beta.'1-β′3Alternative path sets C respectively representing users nnType X of non-motor vehicle lane in each path1Parking section X in road2And the number of traffic lights X3Influence coefficient on riding hazard rate;
obtaining a safety factor S of the user n selection path i after the riding time t by using the formula (7)niThereby obtaining an alternative path set CnSafety factor of all paths in (1):
step 5.3, calculating the riding continuity Con:
obtaining the optional path set C by using the formula (8)nThe riding continuity Con of each path:
logCon=β″0+β″3X3+β″5X5+β″6X6+ε (8)
in formula (8), β ″)0Is a constant term; beta ″)3、β″5And beta ″)6Alternative path sets C respectively representing users nnNumber of traffic lights in each path X3Road grade X5And road surface gradient X6Influence coefficient on the user riding continuity Con; epsilon is a random utility error of the riding continuity Con;
step 5.4, constructing a correction matrix:
the average evaluation score, the safety factor and the riding continuity degree of each path and the probability of each path being selected form a correction matrixr1kRepresenting the probability of the k-th path being selected; r is2kTo representThe user evaluation score of the kth path; r is3kRepresenting the safety factor of the k path; r is4kRepresenting the riding continuity degree of the k-th path;
step 5.5, calculating the final probability of each path being selected;
determining alternate path set C using equation (9)nSelecting the final probability of each path, and recommending the probability maximum value as the optimal path to the user;
[p1 p2 … pk]=[ω1 ω2 ω3 ω4]·R (9)
in the formula (9), pkA final probability of being selected for the kth path; omega1The probability of each path being selected determined before correction is weighted; omega2Evaluating the occupied weight for the user; omega3The safety coefficient is the weight; omega4Weight of riding continuity, and omega1+ω2+ω3+ω4=1。
Compared with the prior art, the invention has the beneficial effects that:
1. the influence of seven significant factors, namely riding distance, the number of traffic lights, types of non-motor vehicles, road grades, parking sections in roads, road surface gradients and path repetition coefficients, on the riding path selection of the shared bicycle user is considered, the riding efficiency, riding safety and riding continuity of the user are considered, and finally a route with the highest pushing probability is pushed for the user to navigate and assist the user in riding, so that the riding experience of the user is improved, the traveling efficiency and riding safety are improved, the traveling mode of the shared bicycle is facilitated, and the shared bicycle can be accepted, used and loved by the public, and the riding method responds to the call of the low-carbon life of the whole population.
2. The invention increases the consideration of more users on the safety of the users by combining the actual conditions of domestic roads, such as the influence of other vehicles on riders in a mixed running state. According to the utility maximization theory, a path utility function is constructed by using a Logit model (PSL) considering the path length, so that a path selection model considering the path overlapping factor is obtained. The model can predict the probability of each route set provided by the user selection system, the attention degree of different users to the user history evaluation, the riding safety factor and the riding continuity degree is considered, a correction matrix is constructed to obtain the final probability of selecting each route set by the user, and finally, the route with the highest probability is pushed for the user to navigate to assist the user in riding. Due to wide and comprehensive consideration factors, the accuracy of the recommended path obtained by the method is higher, and the constructed correction matrix enables the final recommended path to have the characteristic of individuation and enables users to be satisfied better, so that the riding experience of the users is improved.
Drawings
FIG. 1 is a schematic flow chart of an intelligent recommendation method of the present invention;
FIG. 2 is a flow chart illustrating the process of determining the final probability of each path being selected according to the present invention.
Detailed Description
In this embodiment, as shown in fig. 1, an intelligent recommendation method for shared bicycle riding routes includes the following steps:
step 1, collecting historical riding data of a plurality of shared bicycle users, and establishing an original data set; the data types in the raw data set include a non-motorway type X1Parking section X in road2Traffic lights quantity X3And riding distance X4Road grade X5And road surface gradient X6(ii) a Because the explained variables belong to the actual road conditions encountered during riding and have little correlation with personal factors and social factors of riders, the problem of deviation of omitted variables can be avoided.
Wherein the non-motor vehicle lane type X1The system comprises four types of vehicles and vehicles, namely a vehicle-non-mixed vehicle, a marked line non-motor vehicle lane, a fence isolation non-motor vehicle lane and a greening isolation non-motor vehicle lane, wherein the difference of the types can influence the subjective safety of users. Wherein the non-motor vehicle mixed running means that the non-motor vehicle running in the motor vehicle lane is not divided into non-motor vehicle lanes, but is mostly present on the road surface with narrower road width, and the marked lines, fences and greening are three different isolation devices which are adopted in China and separate the non-motor vehicle lanes from the motor vehicle lanesApplying; in-road parking section X2The motor vehicle parking facility is a road section with motor vehicle parking facilities, and the motor vehicles in the area generally provided with the motor vehicle parking facilities need to pass through a non-motor lane for parking, sometimes the condition that the vehicles are parked in the non-motor lane occurs, so that dangerous factors can be added to riding; number of traffic lights X3The number of intersections which the user needs to pass through when riding is strongly positively correlated, and the value indirectly reflects the continuity of the user when riding; riding distance X4The actual riding path length from the starting point to the returning point is taken as the user; road grade X5The method comprises the following steps of considering roads allowing non-motor vehicles to pass in a city and considering the characteristic that shared single-vehicle parking points are mostly located outside residential areas or industrial areas, classifying the roads into three types of main roads, secondary main roads and branch roads, wherein the main roads are main roads connecting all subareas of the city, mainly take traffic functions as the main roads, have more and dense motor vehicles, and have the average driving speed of 50 km/h; the secondary trunk road and the main trunk road are combined to form a trunk network, the trunk network has two functions of distributed traffic and service, and the average driving speed of the motor vehicle is 40 km/h; the branch road is connected with the secondary main road and the internal roads of residential areas, industrial areas and the like, is used for solving the problem of roads in local areas, and usually has a service function as a main part, although the number of motor vehicles is less, the number of pedestrians is more, and the average number of motor vehicle traveling elements is 30 km/h; road surface gradient X6Reflecting the riding difficulty of the road surface, most of users using the shared bicycle are not professional riders, and tend to select a path with a smooth road surface and easiness in riding. The user riding history data X1-X6Available from shared bicycle companies, third party apps, or a number of practical investigations.
Step 2, generating an optional path set C with k optional paths according to the historical riding data of the user nn;
Optional Path set CnA path in (1) generally refers to a path that a user may select without unreasonable detour behavior. The accuracy of the generated alternative path set is directly related to the calculation of the subsequent path repetition coefficient and the prediction of the user riding path selection probability. The Dijkstra algorithm, A, can be generally adopted for constructing the path selection set*And path generation algorithms such as an algorithm and a branch and bound algorithm. It should be noted that the method can select a set of pathsThe determination of (a) needs to be modified based on the algorithms to meet the requirement of generating k optional paths. If the shortest path is found, a certain edge may be deleted, and after the new graph is obtained, the shortest path in the new graph, that is, the secondary short path in the original graph, is continuously found. The repeated operation can obtain a series of secondary short paths to form the optional path set of the user n. The route selection range is defaulted to 4km, but if the shortest route in the selectable route set is still larger than 4km, the route selection range can be reasonably expanded, and the total number of the routes in the selectable route set is not more than 7.
Step 3, calculating the optional path set C of the user nnThe repetition coefficient PS of the selected path ini:
The path repetition coefficient is a variable for measuring the repetition condition between the actual selected path and the selectable path set of the user, and is expressed as the behavior of the user facing the audience or the evasion of a large number of riders, and the method utilizes the formula (1) to calculate:
in the formula (1), ζiIs the set of all road segments in the path i; laIs the length of segment a in path i; l isiIs the length of path i; if the road section a is in the optional path set CnLet σ be on the path j not selected by the user najIf not, let σaj=0;Is an alternative path set CnLength of shortest path on; l isjIs an alternative path set CnThe length of the medium path j;
step 4, according to the historical riding data of the user n, assuming that the user n selects a path according to the principle of path utility maximization, constructing a utility function U of the path i by using the formula (2)ni:
Uni=Vni+εni (2)
In the formula (2), VniSelecting a path utility value after the riding path i for the user n; epsilonniSelecting random utility error of path i for user n, and obeying Gumbel distribution independent from each other, comparing with normal distribution or uniform distribution, adding epsilon obeying Gumbel distributionniCan make path utility function UniThe fitting of (2) is closer to the real situation, is favorable to improving the prediction precision of the later stage, and has:
in the formula (3), beta0Is a constant term, XmData representing an mth data type in the original data set; beta is amRepresenting the influence coefficient of the mth data type on the user riding route selection; beta is aPSRepresenting the influence coefficient of the path repetition coefficient on the user riding route selection; log (PS)ni) Indicating path overlap, i.e. path i and alternative path set CnThe degree of overlap of other paths;
according to the raw data collected in the step 1, dividing the raw data set into different data sets according to the number k of the selectable path sets by using Excel. And then utilizing stata statistical analysis software to obtain 7 interpretation variables of the riding distance, the number of traffic lights, the types of non-motor vehicles, the road grade, the parking sections in the road, the road surface gradient and the path repetition coefficient, wherein the P values are all less than the significance level 0.05, namely the variables have a correlation with the selection of the riding route of the user with the interpreted variables. The parameter value beta can also be estimated by a maximum likelihood function estimation method0,β1-β6,βPS. Taking the first path as a basic selection item, k functions, namely path utility functions of k paths in the path selection set, can be constructed.
Step 5, obtaining the user n selection selectable path set C according to the formula (4)nProbability value P (i | C) of medium path in) Thus, the alternative path set C can be determinednThe probability of each path in the set being selected;
step 6, constructing a correction matrix according to the user history evaluation, the safety coefficient and the riding continuity degree, and using the correction matrix to correct the probability value so as to determine the selectable path set CnThe final probability of each path being selected, the steps of which are shown in fig. 2;
step 6.1, obtaining the optional path set C of other usersnAnd averaging the evaluation data of each path or section and then normalizing. The evaluation scores of other paths in the path set are replaced by the evaluation scores of the road sections related to the paths, if the path lacks the evaluation scores of the related road sections, the path is fully scored, and the selectable path set C is obtainednAverage rating score for each path in (1):
step 6.2, calculating the safety factor Sni:
Let t be a continuous time variable representing the riding time of the user n selecting the path i, selecting the non-motor lane type X1Parking section X in road2And the number of traffic lights X3As covariates, a hazard rate function h (t | X) sharing the riding time t of the bicycle user n riding path i is constructed using equation (5):
h(t|X)=h0(t)g(X) (5)
in the formula (5), h0(t) is the reference risk of riding time t, g (X) represents the influence of factor X on the risk, namely neglecting X1-X3The risk when g (x) is 1; reference Cox proportional hazards model construction g (x) satisfies formula (6):
g(X)=exp(β′1X1+β′2X2+β′3X3) (6)
in the formula (6),. beta.'1-β′3Alternative path sets C respectively representing users nnType X of non-motor vehicle lane in each path1Parking section X in road2And the number of traffic lights X3Influence coefficient on riding hazard rate;
the safety factor is in a descending trend along with the increase of the riding time, and the safety factor S of the user n after the riding time t is obtained by utilizing the relational construction formula (7)niThereby obtaining the alternative pathDiameter set CnSafety factor of all paths in (1):
step 6.3, calculating the riding continuity Con:
obtaining the optional path set C by using the formula (8)nThe riding continuity Con of each path:
logCon=β″0+β″3X3+β″5X5+β″6X6+ε (8)
in formula (8), β ″)0Is a constant term; beta ″)3、β″5And beta ″)6Alternative path sets C respectively representing users nnNumber of traffic lights in each path X3Road grade X5And road surface gradient X6Influence coefficient on the user riding continuity Con; epsilon is a random utility error of the riding continuity Con;
step 6.4, constructing a correction matrix:
the average evaluation score, the safety factor and the riding continuity degree of each path and the probability of each path being selected form a correction matrixr1kRepresenting the probability of the k-th path being selected; r is2kA user rating score representing a kth path; r is3kRepresenting the safety factor of the k path; r is4kRepresenting the riding continuity degree of the k-th path;
6.5, calculating the final probability of each path being selected;
determining alternate path set C using equation (9)nSelecting the final probability of each path, and recommending the probability maximum value as the optimal path to the user;
[p1 p2 … pk]=[ω1 ω2 ω3 ω4]·R (9)
in the formula (9),pkA final probability of being selected for the kth path; omega1The probability of each path being selected determined before correction is weighted; omega2Evaluating the occupied weight for the user; omega3The safety coefficient is the weight; omega4Weight of riding continuity, where ω1+ω2+ω3+ω4=1。
Step 7, optimizing the method;
it is contemplated that users who are partially familiar with roads may not require path recommendations and some special cases such as the user temporarily changing destinations, the user interrupting the ride, etc. After the method is implemented, the evaluation of the user on the pushing path or the related road section of the method needs to be collected, so that the construction of the later-period correction matrix is facilitated. And comparing the actual selected path of the user with the recommended path of the system, and estimating the accuracy of the method. And meanwhile, the actual riding data of the user is named and filed, and a training set is added, so that the use and analysis of the future optimization method are facilitated.
Claims (1)
1. An intelligent recommendation method for sharing bicycle riding routes is characterized by comprising the following steps:
step 1, collecting historical riding data of a plurality of shared bicycle users, and establishing an original data set; the data types in the raw data set include a non-motorway type X1Parking section X in road2Traffic lights quantity X3And riding distance X4Road grade X5And road surface gradient X6;
Step 2, generating an optional path set C with k optional paths according to the historical riding data of the user nnAnd calculating the user n from the alternative path set C by using the formula (1)nThe repetition coefficient PS of the selected path ini:
In the formula (1), ζiIs the set of all road segments in the path i; laIs path i middle wayThe length of segment a; l isiIs the length of path i; if the road section a is in the optional path set CnLet σ be on the path j not selected by the user najIf not, let σaj=0;Is an alternative path set CnLength of shortest path on; l isjIs an alternative path set CnThe length of the medium path j;
step 3, according to the historical riding data of the user n, assuming that the user n selects a path according to the principle of path utility maximization, constructing a utility function U of the path i by using the formula (2)ni:
Uni=Vni+εni (2)
In the formula (2), VniSelecting a path utility value after the riding path i for the user n; epsilonniSelecting a random utility error of a path i for a user n, and obeying mutually independent Gumbel distribution; and comprises the following components:
in the formula (3), beta0Is a constant term, XmData representing an mth data type in the original data set; beta is amRepresenting the influence coefficient of the mth data type on the user riding route selection; beta is aPSRepresenting the influence coefficient of the path repetition coefficient on the user riding route selection;
step 4, obtaining the user n selection selectable path set C according to the formula (4)nProbability value P (i | C) of medium path in) Thus, the alternative path set C can be determinednThe probability of each path in the set being selected;
step 5, constructing a correction moment according to the historical evaluation of the user, the safety coefficient and the riding continuity degreeArray for modifying probability values to determine alternative path sets CnThe final probability of each path in the set being selected;
step 5.1, obtaining the optional path set C of other usersnThe evaluation data of each path or road section in the system is normalized after being averaged to obtain an optional path set CnAverage rating score of each route or section in (1):
step 5.2, calculating a safety factor Sni:
Constructing a danger rate function h (t | X) sharing the riding time t of the riding path i of the bicycle user n by using the formula (5):
h(t|X)=h0(t)g(X) (5)
in the formula (5), h0(t) is the reference risk for riding time t, g (X) represents the effect of factor X on the risk and has:
g(X)=exp(β′1X1+β′2X2+β′3X3) (6)
in the formula (6),. beta.'1-β′3Alternative path sets C respectively representing users nnType X of non-motor vehicle lane in each path1Parking section X in road2And the number of traffic lights X3Influence coefficient on riding hazard rate;
obtaining a safety factor S of the user n selection path i after the riding time t by using the formula (7)niThereby obtaining an alternative path set CnSafety factor of all paths in (1):
step 5.3, calculating the riding continuity Con:
obtaining the optional path set C by using the formula (8)nThe riding continuity Con of each path:
logCon=β″0+β″3X3+β″5X5+β″6X6+ε (8)
in formula (8), β ″)0Is a constant term;β″3、β″5And beta ″)6Alternative path sets C respectively representing users nnNumber of traffic lights in each path X3Road grade X5And road surface gradient X6Influence coefficient on the user riding continuity Con; epsilon is a random utility error of the riding continuity Con;
step 5.4, constructing a correction matrix:
the average evaluation score, the safety factor and the riding continuity degree of each path and the probability of each path being selected form a correction matrixr1kRepresenting the probability of the k-th path being selected; r is2kA user rating score representing a kth path; r is3kRepresenting the safety factor of the k path; r is4kRepresenting the riding continuity degree of the k-th path;
step 5.5, calculating the final probability of each path being selected;
determining alternate path set C using equation (9)nSelecting the final probability of each path, and recommending the probability maximum value as the optimal path to the user;
[p1 p2 … pk]=[ω1 ω2 ω3 ω4]·R (9)
in the formula (9), pkA final probability of being selected for the kth path; omega1The probability of each path being selected determined before correction is weighted; omega2Evaluating the occupied weight for the user; omega3The safety coefficient is the weight; omega4Weight of riding continuity, and omega1+ω2+ω3+ω4=1。
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110366935.1A CN113063431B (en) | 2021-04-06 | 2021-04-06 | Intelligent recommendation method for sharing riding route of bicycle |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110366935.1A CN113063431B (en) | 2021-04-06 | 2021-04-06 | Intelligent recommendation method for sharing riding route of bicycle |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113063431A true CN113063431A (en) | 2021-07-02 |
CN113063431B CN113063431B (en) | 2023-06-30 |
Family
ID=76565953
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110366935.1A Active CN113063431B (en) | 2021-04-06 | 2021-04-06 | Intelligent recommendation method for sharing riding route of bicycle |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113063431B (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113688274A (en) * | 2021-08-26 | 2021-11-23 | 平安国际智慧城市科技股份有限公司 | Riding route generation method, device, equipment and storage medium |
CN114323027A (en) * | 2022-03-12 | 2022-04-12 | 广州市企通信息科技有限公司 | Data analysis system and method based on multi-source heterogeneous data processing |
WO2023106305A1 (en) * | 2021-12-08 | 2023-06-15 | Nec Corporation | Path finding apparatus, control method, and non-transitory computer-readable storage medium |
CN117952690A (en) * | 2024-03-22 | 2024-04-30 | 北京阿帕科蓝科技有限公司 | Vehicle recommendation method, device, computer equipment and storage medium |
CN113688274B (en) * | 2021-08-26 | 2024-07-16 | 平安国际智慧城市科技股份有限公司 | Riding route generation method, device, equipment and storage medium |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2008292237A (en) * | 2007-05-23 | 2008-12-04 | Denso It Laboratory Inc | Navigation device, navigation method and program |
CN102288193A (en) * | 2011-07-06 | 2011-12-21 | 东南大学 | Motor vehicle travel route determination method based on historical data |
CN108303108A (en) * | 2017-12-05 | 2018-07-20 | 华南理工大学 | A kind of personalized route recommendation method based on vehicle historical track |
CN110288849A (en) * | 2019-07-29 | 2019-09-27 | 电子科技大学 | A kind of traffic path recommended method based on mixed traffic mode |
-
2021
- 2021-04-06 CN CN202110366935.1A patent/CN113063431B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2008292237A (en) * | 2007-05-23 | 2008-12-04 | Denso It Laboratory Inc | Navigation device, navigation method and program |
CN102288193A (en) * | 2011-07-06 | 2011-12-21 | 东南大学 | Motor vehicle travel route determination method based on historical data |
CN108303108A (en) * | 2017-12-05 | 2018-07-20 | 华南理工大学 | A kind of personalized route recommendation method based on vehicle historical track |
CN110288849A (en) * | 2019-07-29 | 2019-09-27 | 电子科技大学 | A kind of traffic path recommended method based on mixed traffic mode |
Non-Patent Citations (1)
Title |
---|
王秋平;王凯;: "道路环境对历史街区自行车骑行速度的影响分析", 重庆交通大学学报(自然科学版), no. 10 * |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113688274A (en) * | 2021-08-26 | 2021-11-23 | 平安国际智慧城市科技股份有限公司 | Riding route generation method, device, equipment and storage medium |
CN113688274B (en) * | 2021-08-26 | 2024-07-16 | 平安国际智慧城市科技股份有限公司 | Riding route generation method, device, equipment and storage medium |
WO2023106305A1 (en) * | 2021-12-08 | 2023-06-15 | Nec Corporation | Path finding apparatus, control method, and non-transitory computer-readable storage medium |
CN114323027A (en) * | 2022-03-12 | 2022-04-12 | 广州市企通信息科技有限公司 | Data analysis system and method based on multi-source heterogeneous data processing |
CN114323027B (en) * | 2022-03-12 | 2022-05-27 | 广州市企通信息科技有限公司 | Data analysis system and method based on multi-source heterogeneous data processing |
CN117952690A (en) * | 2024-03-22 | 2024-04-30 | 北京阿帕科蓝科技有限公司 | Vehicle recommendation method, device, computer equipment and storage medium |
Also Published As
Publication number | Publication date |
---|---|
CN113063431B (en) | 2023-06-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN113063431A (en) | Intelligent recommendation method for sharing bicycle riding route | |
CN104157139B (en) | A kind of traffic congestion Forecasting Methodology and method for visualizing | |
CN102288193B (en) | Motor vehicle travel route determination method based on historical data | |
Klobucar et al. | Network evaluation tool to improve real and perceived bicycle safety | |
CN104299442B (en) | A kind of city Route Travel Time Estimation Method based on pattern match | |
CN104851309B (en) | A kind of implementation method of traffic guidance strategy | |
CN109190813B (en) | Shared bicycle region putting planning method based on double-layer planning | |
CN103020435B (en) | Rail transit trip path estimation method and system | |
CN103971530B (en) | A kind of real-time route planing method | |
CN112216130B (en) | Emergency vehicle guidance method under cooperative vehicle and road environment | |
CN102436466A (en) | Bus transfer inquiry method based on geographic information system (GIS) classification | |
CN104575050B (en) | A kind of fast road ramp intellectual inducing method and device based on Floating Car | |
CN111063208A (en) | Lane-level traffic guidance method and system based on Internet of vehicles | |
CN113283762A (en) | Device for evaluating parking lot road planning | |
CN103761589A (en) | Distribution method for urban rail transit | |
CN114117700A (en) | Urban public transport network optimization research method based on complex network theory | |
CN107798867A (en) | A kind of congested traffic network equalization methods based on electric automobile and diesel locomotive mixed flow | |
CN104484514A (en) | Flexible bus route design method capable of evading jammed road segments | |
CN107833459A (en) | A kind of city bus operation conditions evaluation method based on gps data | |
CN114925483A (en) | Carbon emission measuring method for urban traffic network | |
CN110009131A (en) | A kind of net about vehicle worksheet processing method considering multifactor impact | |
Hsu et al. | A model for planning a bicycle network with multi-criteria suitability evaluation using GIS | |
Chalumuri et al. | Development and evaluation of an integrated transportation system: A case study of Delhi | |
CN108985616A (en) | A kind of public transportation lane evaluation of layout method | |
CN113724495B (en) | Traffic prediction method for city shared trip |
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 | ||
GR01 | Patent grant |