CN114819413A - Recommendation system and method for customizing passenger transport route by network booking vehicle - Google Patents

Recommendation system and method for customizing passenger transport route by network booking vehicle Download PDF

Info

Publication number
CN114819413A
CN114819413A CN202210720331.7A CN202210720331A CN114819413A CN 114819413 A CN114819413 A CN 114819413A CN 202210720331 A CN202210720331 A CN 202210720331A CN 114819413 A CN114819413 A CN 114819413A
Authority
CN
China
Prior art keywords
order
module
power consumption
ideal
historical
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
Application number
CN202210720331.7A
Other languages
Chinese (zh)
Other versions
CN114819413B (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.)
China Transport Technology Co ltd
Original Assignee
China Transport Technology 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 China Transport Technology Co ltd filed Critical China Transport Technology Co ltd
Priority to CN202210720331.7A priority Critical patent/CN114819413B/en
Publication of CN114819413A publication Critical patent/CN114819413A/en
Application granted granted Critical
Publication of CN114819413B publication Critical patent/CN114819413B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/0601Electronic shopping [e-shopping]
    • G06Q30/0633Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635Processing of requisition or of purchase orders
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40Business processes related to the transportation industry

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Development Economics (AREA)
  • Finance (AREA)
  • Accounting & Taxation (AREA)
  • Tourism & Hospitality (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a recommendation system and a method for customizing a passenger transport route by network taxi appointment, which comprises a historical order data acquisition module, an average power consumption value estimation module, an optimal route set making module and a passenger transport route limiting module; a historical order data acquisition module acquires historical order data, an urban charging pile distribution circuit diagram and a hot site distribution circuit diagram; the average power consumption value estimation module is used for estimating the average power consumption value of the network appointment vehicle and setting a critical return power consumption residual threshold; the optimal route set formulating module formulates passenger transport routes which are not beyond the critical return journey power consumption residual threshold and are beyond the critical return journey power consumption residual threshold; the passenger transport route defining module is used for defining the time requirement and the distance requirement in the optimal route set; the invention solves the problem of how to move the net appointment vehicle under the condition that the order is not received or the mileage of the order is unreasonable, reduces the judgment cost of a driver, and improves the utilization rate of the electric quantity of the net appointment vehicle so as to greatly reduce the empty time.

Description

Recommendation system and method for customizing passenger transport route by network booking vehicle
Technical Field
The invention relates to the technical field of passenger transport route recommendation systems, in particular to a recommendation system and method for customizing a passenger transport route by network appointment.
Background
In recent years, with the gradual maturity of intelligent equipment and an internet platform, the online appointment car attracts users who use public transport to a certain extent by virtue of the advantages of convenience and comfort; in the using process of the network car booking, a network car booking driver serves as a main body of the network car booking, and how to maximally utilize the driving cost of the network car booking is a necessary road for each network car booking owner, but at present, due to randomness and uncertainty of orders, the network car booking driver can have the problem that no orders exist under some conditions or the orders are too far away to cause overhigh cost, the driver needs to determine the forward direction of the network car booking by self judgment to obtain the proper orders at the fastest speed, and waste of time cost and power consumption cost or wrong judgment is often caused;
meanwhile, the current network car-booking is mainly an electric car, and the electric quantity of the network car-booking and the distribution of urban charging piles also need to be included in the planning of a reasonable route, so that the possibility that the electric quantity is exhausted before the charging piles are reached due to the problem of improper route planning which may exist at present is solved.
Disclosure of Invention
The invention aims to provide a recommendation system and a method for customizing a passenger transport route by a network appointment, which aim to solve the problems in the background technology.
In order to solve the technical problems, the invention provides the following technical scheme: a recommendation method for customizing a passenger transport route by a network appointment comprises the following specific steps:
acquiring historical order data, wherein the historical order data comprises time points of historical orders, positions and distances of starting and ending points of the historical orders, total mileage from the start of order taking to the end of order taking every day and total power consumption; the historical order data is stored in a passenger transport route recommendation system, and an urban charging pile distribution circuit diagram and a hot station distribution circuit diagram recorded in the passenger transport route recommendation system are obtained;
estimating average power consumption value of each order of network car booking based on historical order data in recommendation system
Figure 948274DEST_PATH_IMAGE002
Wherein
Figure 508568DEST_PATH_IMAGE004
Represents the total electricity consumption from the beginning to the end of the order taking of the 1 st, 2 nd, and k network appointment cars,
Figure 749057DEST_PATH_IMAGE006
representing the total order receiving quantity from the beginning to the end of the order receiving of the 1 st, 2 nd,. Setting critical return power consumption residual threshold
Figure 43903DEST_PATH_IMAGE008
Said critical return power consumption residual threshold
Figure 129671DEST_PATH_IMAGE008
Greater than the average electricity consumption per order
Figure 75630DEST_PATH_IMAGE010
Optimal route set in passenger transport route recommendation system
Figure 487020DEST_PATH_IMAGE012
Said
Figure 770627DEST_PATH_IMAGE014
Representing a passenger traffic route before a critical return power consumption residual threshold is not exceeded, said
Figure 784719DEST_PATH_IMAGE016
Representing the passenger transport route after the critical return electricity consumption residual threshold value is exceeded;
and recording the terminal point and the next passenger in the average adjacent order in the historical order data of different network appointment carsThe actual distance and the actual time length between the starting points of the passengers are respectively marked as L1 and T1, and the optimal route set A
Figure 460551DEST_PATH_IMAGE014
And
Figure 918208DEST_PATH_IMAGE016
in the formulation process, it is desirable that the predicted distance between the last passenger's destination and the next passenger's starting point, L2, is less than L1, and the predicted duration, T2, is less than T1.
In a further aspect of the present invention,
Figure 312281DEST_PATH_IMAGE014
the passenger transport route planning comprises the following steps:
recording the driving data of the first order of the taxi appointment in the day network, wherein the driving data of the first order comprises the position of an order terminal and the power consumption of the order
Figure 864485DEST_PATH_IMAGE018
Judging the power consumption of the order
Figure 660402DEST_PATH_IMAGE018
And average power consumption value
Figure 256338DEST_PATH_IMAGE020
The magnitude of (1), current power consumption
Figure 262340DEST_PATH_IMAGE018
Greater than the average power consumption value
Figure 759180DEST_PATH_IMAGE020
And judging whether the position distance between the starting point of the next order and the end point of the first order meets the following requirements:
Figure 284971DEST_PATH_IMAGE022
and is
Figure 943485DEST_PATH_IMAGE024
(ii) a Because of dividing intoThe power consumption analysis is to ensure that the electric quantity can be reasonably and uniformly arranged in each turn of the order of the network appointment vehicle, and the monitoring is carried out under the condition of abnormal power consumption;
if not satisfied
Figure 171204DEST_PATH_IMAGE022
And is
Figure 206156DEST_PATH_IMAGE024
Or L2=0 and T2=0, the network appointment vehicle goes to a hot station within the ideal radius of the terminal point of the order when the order is carried out to receive the order; the premise of going to the hot station is that the estimated arrival of the starting point of the next order exceeds the average driving time in the historical order data or no new order is generated after the order is finished, the network taxi appointment driver is required to judge the driving direction, and the system analysis is introduced to assist the judgment of the network taxi appointment driver
Figure 82059DEST_PATH_IMAGE022
And is
Figure 301687DEST_PATH_IMAGE024
The online taxi appointment driver receives the order and goes to the starting point position of the order;
current consumption of electricity
Figure 892069DEST_PATH_IMAGE018
Less than or equal to the average power consumption value
Figure 340499DEST_PATH_IMAGE020
Then, selecting the corresponding order starting point position in the next order L2 when the order starting point position is the minimum value to drive; and if no next order is available, selecting the hot station within the ideal radius of the end point of the order when the distance is increased according to the recommendation system.
Further, the network appointment vehicle goes to a hot station within the ideal radius of the terminal point of the order when the distance is carried out to receive the order, and the method comprises the following steps:
connecting the boarding points in the historical order data, wherein the connection standard is that the straight line distance between the boarding points of each order is smaller than a, and the boarding points meeting the requirement that the distance is smaller than a form a circular domain taking b as the radius, the circular domain comprises all the boarding points of the connection, and b is larger than a;
the passenger transport route recommendation system obtains the number m of the formed circle areas and the number p of all boarding points in the historical order data, and calculates the average number of the boarding points in the circle areas in the historical order data as
Figure 965515DEST_PATH_IMAGE026
Recording the circle area with the number of the upper vehicle points in the actual circle area larger than the number of the upper vehicle points in the average circle area as the hot station;
recording the position of the hot station, and acquiring the actual distance set of the order end point when the hot station distance in the historical order data is carried out
Figure 356045DEST_PATH_IMAGE028
And set of actual durations
Figure 433723DEST_PATH_IMAGE030
(ii) a Aggregating actual routes
Figure 184379DEST_PATH_IMAGE028
Sorting according to the order from small to large, and selecting the sorted set
Figure 663902DEST_PATH_IMAGE028
The actual routes of the corresponding hot stations with the median value of more than or equal to L2 and less than L1 are taken as target route sets
Figure 225333DEST_PATH_IMAGE032
Obtaining a target range set
Figure 400093DEST_PATH_IMAGE034
Corresponding target duration set
Figure 580539DEST_PATH_IMAGE036
Set of target durations
Figure 773623DEST_PATH_IMAGE036
The actual time length from the historical order end point to the hot station existing in the range with the order end point as the center of a circle and a as the radius in the historical order data is taken as a target time length set;
determining a target duration set
Figure 381322DEST_PATH_IMAGE036
And analyzing the ideal radius priority of the hot station of the network taxi appointment according to the accuracy of the target duration set and the corresponding target distance set.
Further, a target duration set is judged
Figure 544843DEST_PATH_IMAGE036
According to the accuracy of the target duration set and the accuracy of the corresponding target distance set, the ideal radius priority of the hot station of the network taxi appointment advance is analyzed, and the method comprises the following steps:
obtaining a target duration set
Figure 653614DEST_PATH_IMAGE036
Time length ordering n1 in (1), and target time length set
Figure 842149DEST_PATH_IMAGE036
Calculating a target time length set in a sequence n2 from small to large
Figure 230537DEST_PATH_IMAGE036
Is measured with respect to the accuracy of
Figure 770102DEST_PATH_IMAGE038
Degree of similarity
Figure 416984DEST_PATH_IMAGE040
When the accuracy is high
Figure 725606DEST_PATH_IMAGE042
Selecting the actual time length of the hot site corresponding to the time length less than T1 in the target time length set as an ideal time length set
Figure 100002_DEST_PATH_IMAGE044
The priority order of the ideal radius is the ideal duration set
Figure 376905DEST_PATH_IMAGE044
Corresponding ideal course set
Figure 100002_DEST_PATH_IMAGE046
The order of (a); the accuracy =1 indicates that the sequence in the target time length set is from large to small, that is, the distance from the hot station is in direct proportion to the travel time of the network appointment vehicle, so that the travel station with the length greater than the time length L1 can be directly removed, that is, the network appointment vehicle can be selected according to the situation in an ideal radius according to the priority sequence, and the time judged by a driver is saved;
when the accuracy is high
Figure 100002_DEST_PATH_IMAGE048
Selecting the actual time length of the hot station corresponding to the sequence n2 and smaller than T1 in the target time length set as an ideal time length set
Figure 100002_DEST_PATH_IMAGE050
And
Figure 100002_DEST_PATH_IMAGE052
the hot station analysis data comprises the distance between the hot station and the end point of the order when the hot station is carried out, or the distance in the range taking the end point of the order as the circle center and a as the radius when the hot station is carried out corresponds to the braking times in the total distance of the 1 st, 2 nd,
Figure 100002_DEST_PATH_IMAGE054
the hot station analysis data further comprises driving to the 1 st, 2 nd,length of travel of network appointment vehicle
Figure 100002_DEST_PATH_IMAGE056
And calculating the braking frequency of the 1 st, 2 nd, and c th hot stations in the historical order data
Figure 181263DEST_PATH_IMAGE058
(ii) a The number of times of obtaining the brakes is to analyze whether the distance from the hot station is not in proportion to the driving time of the networked taxi appointment or not, and whether the distance is close but long time is easily consumed due to the congestion of road conditions, because the probability that some hot stations are congested relative to ordinary road sections is high.
Will be provided with
Figure 241623DEST_PATH_IMAGE060
The formed sets are sorted from small to large, if the sorted sets
Figure 280117DEST_PATH_IMAGE060
Corresponding time length sequence and ideal time length set
Figure 400520DEST_PATH_IMAGE062
If the ideal radius is the same, the priority order of the ideal radius is the ideal duration set
Figure 773732DEST_PATH_IMAGE064
Corresponding ideal course set
Figure 746105DEST_PATH_IMAGE066
The order of (a).
Further, in the above-mentioned case,
Figure 29319DEST_PATH_IMAGE068
the passenger transport route planning comprises the following steps:
recording the residual electric quantity of the network appointment car to reach the threshold value equal to the critical return journey power consumption residual electric quantity
Figure 445257DEST_PATH_IMAGE070
Temporal order locationAnd obtaining the distance between the order end point and the charging piles of the 1 st, 2 nd, the
Figure 181132DEST_PATH_IMAGE072
Calculating the kilometer electricity consumption value of the network appointment car in the historical order data
Figure 458661DEST_PATH_IMAGE074
Wherein
Figure 596381DEST_PATH_IMAGE076
Representing the total mileage from the beginning to the end of the order taking of the 1 st, 2 nd, and k network appointment cars; acquiring actual electricity consumption values of charging pile positions of 1 st, 2 nd, s th cities in a preset range
Figure 183220DEST_PATH_IMAGE078
And corresponding ideal power consumption value
Figure 406391DEST_PATH_IMAGE080
Calculating the actual power consumption value
Figure 723496DEST_PATH_IMAGE078
Corresponding ideal power consumption value
Figure 840357DEST_PATH_IMAGE080
Deviation value therebetween
Figure 739043DEST_PATH_IMAGE082
Will deviate from the value
Figure 324876DEST_PATH_IMAGE084
Sorting from small to large, then
Figure 68841DEST_PATH_IMAGE086
Is defined as deviation value
Figure 40208DEST_PATH_IMAGE084
And (4) the driving route of the charging pile in the s-th city corresponding to the minimum time in the historical database.
A recommendation system for customizing a passenger transport route by network taxi appointment comprises a historical order data acquisition module, an average power consumption value estimation module, an optimal route set making module and a passenger transport route limiting module;
the historical order data acquisition module is used for acquiring historical order data recorded in the passenger transport route recommendation system, wherein the historical order data comprises time points of historical orders, positions and distances of starting and ending points of the historical orders, and total mileage and total power consumption from starting to ending of taking orders every day; acquiring an urban charging pile distribution circuit diagram and a hot station distribution circuit diagram recorded in a passenger transport route recommendation system;
the average power consumption value estimation module is used for estimating an average power consumption value of the network appointment according to historical order data and setting a critical return power consumption residual threshold value, wherein the critical return power consumption residual threshold value is larger than the average power consumption value of each order;
the optimal route set formulation module is used for formulating passenger transport routes which do not exceed the critical return journey electricity consumption residual threshold value
Figure 952538DEST_PATH_IMAGE088
And the passenger transport route after the critical return power consumption residual threshold value is exceeded
Figure 150301DEST_PATH_IMAGE090
The optimal route set is
Figure 822591DEST_PATH_IMAGE092
The passenger transport route definition module is used for defining time duration requirements and distance requirements in the optimal route set.
Further, the optimal route set formulation module comprises
Figure 523831DEST_PATH_IMAGE088
Passenger transport route planning module and
Figure 639686DEST_PATH_IMAGE090
a passenger transport route making module;
Figure 59166DEST_PATH_IMAGE088
the passenger transport route formulating module comprises a power consumption preliminary judging module, a route analyzing module and an ideal radius planning module;
the power consumption preliminary judgment module is used for judging the magnitude relation between the power consumption of the first order and the average power consumption value; the route analysis module is used for analyzing and judging whether the estimated time length and the estimated distance between the position of the first order and the position of the next order are both smaller than the corresponding actual time length and actual distance in the historical order; the ideal radius planning module is used for planning hot stations with ideal radius when the conditions that the ideal radius is smaller than the preset radius are not met;
the ideal radius planning module comprises a circle domain formulation module, a hot site analysis module, a target set formulation module and an accuracy judgment module; the circle domain making module is used for connecting the boarding points in the historical order data and setting the boarding points meeting the distance requirement as a circle domain; the hot station analysis module is used for planning a circular domain meeting the requirement of the journey time as a hot station; the target set formulation module is used for analyzing the positions of popular stations and correspondingly acquiring the actual duration and the actual distance in the historical order data for analysis; and the accuracy judging module is used for analyzing the ideal radius priority of the hot station before the network appointment according to the accuracy of the target time length set.
Furthermore, the accuracy judgment module comprises an accuracy calculation module and an accuracy analysis module; the accuracy analysis module comprises a brake data acquisition module and a brake frequency calculation module;
the accuracy calculation module is used for acquiring time length sequencing and sequencing from small to large of the target time length set, and comparing the similarity of the sequences of the time length sequencing and the sequencing from small to large to obtain a calculation value of accuracy;
the accuracy analysis module analyzes the ideal radius priority sequence when the accuracy is equal to 1 and the ideal radius priority when the accuracy is not equal to 1 according to the calculated value of the accuracy;
the brake data acquisition module is used for acquiring the corresponding brake times of the network appointment car when the accuracy is not equal to 1; and the braking frequency calculation module is used for analyzing the relation between the braking frequency and the running time of the corresponding network appointment vehicle and formulating an ideal time priority sequence with the accuracy not equal to 1 according to the corresponding relation.
Further, in the above-mentioned case,
Figure 535146DEST_PATH_IMAGE090
the passenger transport route formulating module comprises a critical data acquiring module, a kilometer electricity consumption value calculating module and a deviation value analyzing module;
the critical data acquisition module is used for acquiring an order end point position when the power consumption value of the network appointment vehicle is larger than or equal to a critical return power consumption residual threshold value, and an urban charging pile position within a preset range from the order end point position in historical order data, and acquiring the distance between the order end point and the urban charging pile within the preset range;
the kilometer electricity consumption value calculating module is used for calculating a kilometer electricity consumption value according to the total mileage from the start of order receiving to the end of order receiving of the network appointment car and the total electricity consumption;
the deviation value analysis module is used for acquiring an actual power consumption value and a corresponding ideal power consumption value of the urban charging pile position within a preset range, and calculating an absolute value of the difference between the actual power consumption value and the ideal power consumption value as a deviation value; sorting the deviation values from small to large, and then obtaining the deviation values
Figure 461864DEST_PATH_IMAGE094
The minimum corresponding city charging pile driving route in the historical database is
Figure 873254DEST_PATH_IMAGE090
Passenger transport route.
Compared with the prior art, the invention has the following beneficial effects: the method comprises the steps of planning a driving route of the online taxi appointment into two parts by taking the power consumption of an order in historical order data as a basis, and respectively carrying out time length limitation, route limitation and power quantity limitation on the two parts so as to plan an optimal route which accords with the actual condition of the online taxi appointment; the problem of how to move ahead under the circumstances that net car reservation driver does not receive the order or order mileage is unreasonable is solved, greatly reduced driver's judgement cost, improved the rate of utilization of net car reservation electric quantity and made the time of empty car reduce greatly, when reaching the remaining threshold value of critical return journey power consumption simultaneously, the return journey route of choosing the minimum corresponding net car reservation position of deviation value at this moment returns the journey, has increased net car reservation and has gone to the feasibility and the security of filling electric pile distance.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention. In the drawings:
FIG. 1 is a schematic structural diagram of a recommendation system for ordering a passenger transportation route by network appointment according to the invention;
fig. 2 is a flow chart of steps of a method for recommending a customized passenger transport route by network appointment.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1-2, the present invention provides a technical solution: a recommendation method for customizing a passenger transport route by a network appointment comprises the following specific steps:
acquiring historical order data, wherein the historical order data comprises time points of historical orders, positions and distances of starting and ending points of the historical orders, total mileage from the start of order taking to the end of order taking every day and total power consumption; the historical order data is stored in a passenger transport route recommendation system, and an urban charging pile distribution circuit diagram and a hot station distribution circuit diagram recorded in the passenger transport route recommendation system are obtained;
estimating average power consumption value of each order of network car booking based on historical order data in recommendation system
Figure 639085DEST_PATH_IMAGE096
Wherein
Figure 528543DEST_PATH_IMAGE098
Represents the total electricity consumption from the beginning to the end of the order taking of the 1 st, 2 nd, and k network appointment cars,
Figure 345321DEST_PATH_IMAGE100
representing the total order receiving quantity from the beginning to the end of the order receiving of the 1 st, 2 nd,. Setting critical return power consumption residual threshold
Figure DEST_PATH_IMAGE102
Said critical return power consumption residual threshold
Figure 255508DEST_PATH_IMAGE102
Greater than the average electricity consumption per order
Figure DEST_PATH_IMAGE103
Optimal route set in passenger transport route recommendation system
Figure DEST_PATH_IMAGE105
Said
Figure DEST_PATH_IMAGE107
Representing a passenger traffic route before a critical return power consumption residual threshold is not exceeded, said
Figure DEST_PATH_IMAGE109
Representing the passenger transport route after the critical return electricity consumption residual threshold value is exceeded;
and recording the actual distance and the actual time length between the terminal of the last passenger and the starting point of the next passenger in the average adjacent orders in historical order data of different networked appointments as L1 and T1 respectively, and the optimal route set A
Figure 367689DEST_PATH_IMAGE107
And
Figure 185472DEST_PATH_IMAGE109
in the formulation process, it is desirable that the predicted distance between the last passenger's destination and the next passenger's starting point, L2, is less than L1, and the predicted duration, T2, is less than T1.
Figure 715811DEST_PATH_IMAGE107
The passenger transport route planning comprises the following steps:
recording the driving data of the first order of the taxi appointment in the day network, wherein the driving data of the first order comprises the position of an order terminal and the power consumption of the order
Figure DEST_PATH_IMAGE111
Judging the power consumption of the order
Figure 49097DEST_PATH_IMAGE111
And average power consumption value
Figure DEST_PATH_IMAGE113
The magnitude of (1), current power consumption
Figure 523940DEST_PATH_IMAGE111
Greater than the average power consumption value
Figure 896147DEST_PATH_IMAGE113
And judging whether the position distance between the starting point of the next order and the end point of the first order meets the following requirements:
Figure DEST_PATH_IMAGE115
and is
Figure DEST_PATH_IMAGE117
(ii) a The power consumption is analyzed so that the power consumption can be reasonably and uniformly arranged in each order of the network appointment vehicle, and the monitoring is carried out under the condition of abnormal power consumption;
if not satisfied with
Figure 717210DEST_PATH_IMAGE115
And is
Figure 375725DEST_PATH_IMAGE117
Or L2=0 and T2=0, the network appointment vehicle goes to a hot station within the ideal radius of the terminal point of the order when the order is carried out to receive the order; the premise of going to the hot station is that the estimated arrival of the starting point of the next order exceeds the average driving time in the historical order data or no new order is generated after the order is finished, the network taxi appointment driver is required to judge the driving direction, and the system analysis is introduced to assist the judgment of the network taxi appointment driver
Figure 603444DEST_PATH_IMAGE115
And is
Figure 638396DEST_PATH_IMAGE117
The online taxi appointment driver receives the order and goes to the starting point position of the order;
current consumption of electricity
Figure DEST_PATH_IMAGE119
Less than or equal to the average power consumption value
Figure DEST_PATH_IMAGE121
Then, selecting the corresponding order starting point position in the next order L2 when the order starting point position is the minimum value to drive; and if no next order is available, selecting the hot station within the ideal radius of the end point of the order when the distance is increased according to the recommendation system.
The method for receiving the order by the hot station within the ideal radius of the terminal point of the order when the network appointment vehicle goes to the distance is carried out comprises the following steps:
connecting the boarding points in the historical order data according to the standard that the straight-line distance between the boarding points of each order is smaller than
Figure DEST_PATH_IMAGE123
And will satisfy the distance less than
Figure 815430DEST_PATH_IMAGE123
The upper vehicle points form a circle area with b as the radius, the circle area comprises all the upper vehicle points of the connecting line, and b is larger than
Figure 773676DEST_PATH_IMAGE123
The passenger transport route recommendation system obtains the number m of the formed circle areas and the number p of all boarding points in the historical order data, and calculates the average number of the boarding points in the circle areas in the historical order data as
Figure DEST_PATH_IMAGE125
Recording the circle area with the number of the upper vehicle points in the actual circle area larger than the number of the upper vehicle points in the average circle area as the hot station;
recording the position of the hot station, and acquiring the actual distance set of the order end point when the hot station distance in the historical order data is carried out
Figure DEST_PATH_IMAGE127
And set of actual durations
Figure DEST_PATH_IMAGE129
(ii) a Aggregating actual routes
Figure 770582DEST_PATH_IMAGE127
Sorting according to the order from small to large, and selecting the sorted set
Figure 733859DEST_PATH_IMAGE127
The actual routes of the corresponding hot stations with the median value of more than or equal to L2 and less than L1 are taken as target route sets
Figure DEST_PATH_IMAGE131
Obtaining a target range set
Figure 936039DEST_PATH_IMAGE131
Corresponding target duration set
Figure DEST_PATH_IMAGE133
Set of target durations
Figure 529831DEST_PATH_IMAGE133
Expressed as the center of a circle with the end point of the order as the center of the circle in the historical order data,
Figure 482875DEST_PATH_IMAGE123
Setting the actual time length from the historical order end point to the hot site in the radius range as a target time length set;
determining a target duration set
Figure 125209DEST_PATH_IMAGE133
And analyzing the ideal radius priority of the hot station of the network taxi appointment according to the accuracy of the target duration set and the corresponding target distance set.
Determining a target duration set
Figure 463786DEST_PATH_IMAGE133
According to the accuracy of the target duration set and the accuracy of the corresponding target distance set, the ideal radius priority of the hot station of the network taxi appointment advance is analyzed, and the method comprises the following steps:
obtaining a target duration set
Figure DEST_PATH_IMAGE135
Time length ordering n1 in (1), and target time length set
Figure 480677DEST_PATH_IMAGE135
Calculating a target duration set in the order n2 from small to large
Figure 170285DEST_PATH_IMAGE135
Is measured with respect to the accuracy of
Figure DEST_PATH_IMAGE137
Degree of similarity
Figure DEST_PATH_IMAGE139
When the accuracy is high
Figure DEST_PATH_IMAGE141
Selecting the actual time length of the hot site corresponding to the time length less than T1 in the target time length set as an ideal time length set
Figure DEST_PATH_IMAGE143
The priority order of the ideal radius is the ideal duration set
Figure DEST_PATH_IMAGE145
Corresponding ideal course set
Figure DEST_PATH_IMAGE147
The order of (a); the accuracy =1 indicates that the sequence in the target time length set is from large to small, that is, the distance from the hot station is in direct proportion to the travel time of the network appointment vehicle, so that the travel station with the length greater than the time length L1 can be directly removed, that is, the network appointment vehicle can be selected according to the situation in an ideal radius according to the priority sequence, and the time judged by a driver is saved;
for example: target duration set
Figure DEST_PATH_IMAGE149
The order of n1 is
Figure DEST_PATH_IMAGE151
And the order of n2 is
Figure DEST_PATH_IMAGE153
And target duration set
Figure DEST_PATH_IMAGE155
Corresponding target course set
Figure DEST_PATH_IMAGE157
Target duration set
Figure DEST_PATH_IMAGE159
Is measured with respect to the accuracy of
Figure DEST_PATH_IMAGE161
Degree of similarity
Figure DEST_PATH_IMAGE163
=
Figure DEST_PATH_IMAGE165
At this time
Figure DEST_PATH_IMAGE167
If, if
Figure DEST_PATH_IMAGE169
Then, then
Figure DEST_PATH_IMAGE171
And is arranged at
Figure DEST_PATH_IMAGE173
Corresponding brake times {4, 10}, at the moment
Figure DEST_PATH_IMAGE175
Figure DEST_PATH_IMAGE177
Then
Figure DEST_PATH_IMAGE179
The sequence from small to big is
Figure DEST_PATH_IMAGE181
And
Figure DEST_PATH_IMAGE183
the same;
the priority order of the ideal radius is the ideal duration set
Figure DEST_PATH_IMAGE185
Corresponding ideal course set
Figure DEST_PATH_IMAGE187
In the order of (1), i.e.
Figure DEST_PATH_IMAGE189
When the accuracy is high
Figure DEST_PATH_IMAGE191
Selecting the actual time length of the hot station corresponding to the sequence n2 and smaller than T1 in the target time length set as an ideal time length set
Figure DEST_PATH_IMAGE193
And
Figure DEST_PATH_IMAGE195
the hot site analysis data corresponding to the sequence number value which does not meet the time length from big to small in the middle comprises the distance from the hot site to the end point of the order when the order is carried out or the distance between the hot site and the end point of the order when the order is carried out as the circle center,
Figure DEST_PATH_IMAGE197
The routes within the radius range correspond to the braking times in the total routes of the 1 st, 2 nd, and c th hot stop network appointment vehicles in the historical order data
Figure DEST_PATH_IMAGE199
The hot station analysis data also comprises the taxi appointment travel time length of the 1 st, 2 nd, c th hot station network
Figure DEST_PATH_IMAGE201
And calculating the braking frequency of the 1 st, 2 nd, and c th hot stations in the historical order data
Figure DEST_PATH_IMAGE203
(ii) a The number of times of obtaining the brake is to analyze whether the distance from a hot station is not in direct proportion to the driving time of the network appointment car or not, the distance is close but easy to be caused by the congestion of road conditionsIt takes a long time because some popular sites have a high probability of being congested with respect to ordinary road segments.
Will be provided with
Figure DEST_PATH_IMAGE205
The formed sets are sorted from small to large, if the sorted sets
Figure 862647DEST_PATH_IMAGE205
Corresponding time length sequence and ideal time length set
Figure DEST_PATH_IMAGE207
If the ideal radius is the same, the priority order of the ideal radius is the ideal duration set
Figure 540884DEST_PATH_IMAGE207
Corresponding ideal course set
Figure DEST_PATH_IMAGE209
The order of (a).
Figure DEST_PATH_IMAGE211
The passenger transport route planning comprises the following steps:
recording the residual electric quantity of the network appointment car to reach the threshold value equal to the critical return journey power consumption residual electric quantity
Figure DEST_PATH_IMAGE213
The position of a temporal order and the urban charging pile position in historical order data within a preset range from the end position of the order are obtained, and the distance between the end position of the order and the 1 st, 2 nd, so, s urban charging piles within the preset range is obtained
Figure DEST_PATH_IMAGE215
Calculating the kilometer electricity consumption value of the network appointment car in the historical order data
Figure DEST_PATH_IMAGE217
Wherein
Figure DEST_PATH_IMAGE219
Representing the total mileage from the beginning to the end of the order taking of the 1 st, 2 nd, and k network appointment cars; acquiring actual electricity consumption values of charging pile positions of 1 st, 2 nd, so s cities in a preset range
Figure DEST_PATH_IMAGE221
And corresponding ideal power consumption value
Figure DEST_PATH_IMAGE223
Calculating the actual power consumption value
Figure 988397DEST_PATH_IMAGE221
Corresponding ideal power consumption value
Figure 148988DEST_PATH_IMAGE223
Deviation value therebetween
Figure DEST_PATH_IMAGE225
Will deviate from the value
Figure DEST_PATH_IMAGE227
Sorting from small to large, then
Figure DEST_PATH_IMAGE229
Is defined as deviation value
Figure 8491DEST_PATH_IMAGE227
And (4) the driving route of the charging pile in the s-th city corresponding to the minimum time in the historical database.
A recommendation system for customizing a passenger transport route by network taxi appointment comprises a historical order data acquisition module, an average power consumption value estimation module, an optimal route set making module and a passenger transport route limiting module;
the historical order data acquisition module is used for acquiring historical order data recorded in the passenger transport route recommendation system, wherein the historical order data comprises time points of historical orders, positions and distances of starting points and ending points of the historical orders, total mileage from the start of order taking to the end of order taking every day and total electricity consumption; acquiring an urban charging pile distribution circuit diagram and a hot station distribution circuit diagram recorded in a passenger transport route recommendation system;
the average power consumption value estimation module is used for estimating an average power consumption value of the network appointment according to historical order data and setting a critical return power consumption residual threshold value, wherein the critical return power consumption residual threshold value is larger than the average power consumption value of each order;
the optimal route set formulation module is used for formulating passenger transport routes which do not exceed the critical return journey electricity consumption residual threshold value
Figure DEST_PATH_IMAGE231
And the passenger transport route after the critical return power consumption residual threshold value is exceeded
Figure DEST_PATH_IMAGE233
The optimal route set is
Figure DEST_PATH_IMAGE235
The passenger transport route definition module is used for defining time duration requirements and distance requirements in the optimal route set.
The optimal route set making module comprises
Figure 839437DEST_PATH_IMAGE231
Passenger transport route making module and method
Figure 742671DEST_PATH_IMAGE233
A passenger transport route making module;
Figure 282237DEST_PATH_IMAGE231
the passenger transport route formulating module comprises a power consumption preliminary judging module, a route analyzing module and an ideal radius planning module;
the power consumption preliminary judgment module is used for judging the magnitude relation between the power consumption of the first order and the average power consumption value; the route analysis module is used for analyzing and judging whether the estimated time length and the estimated distance between the position of the first order and the position of the next order are both smaller than the corresponding actual time length and actual distance in the historical order; the ideal radius planning module is used for planning hot stations with ideal radius when the conditions that the ideal radius is smaller than the preset radius are not met;
the ideal radius planning module comprises a circle domain formulation module, a hot site analysis module, a target set formulation module and an accuracy judgment module; the circle domain making module is used for connecting the boarding points in the historical order data and setting the boarding points meeting the distance requirement as a circle domain; the hot station analysis module is used for planning a circular area meeting the requirement of the journey time as a hot station; the target set formulation module is used for analyzing the positions of popular stations and correspondingly acquiring the actual duration and the actual distance in the historical order data for analysis; and the accuracy judging module is used for analyzing the ideal radius priority of the hot station before the network appointment according to the accuracy of the target time length set.
The accuracy judging module comprises an accuracy calculating module and an accuracy analyzing module; the accuracy analysis module comprises a brake data acquisition module and a brake frequency calculation module;
the accuracy calculation module is used for acquiring time length sequencing and sequencing from small to large of the target time length set, and comparing the similarity of the sequences of the time length sequencing and the sequencing from small to large to obtain a calculation value of accuracy;
the accuracy analysis module analyzes the ideal radius priority sequence when the accuracy is equal to 1 and the ideal radius priority when the accuracy is not equal to 1 according to the calculated value of the accuracy;
the brake data acquisition module is used for acquiring the corresponding brake times of the network appointment car when the accuracy is not equal to 1; and the braking frequency calculation module is used for analyzing the relation between the braking frequency and the running time of the corresponding network appointment vehicle and formulating an ideal time priority sequence with the accuracy not equal to 1 according to the corresponding relation.
Figure DEST_PATH_IMAGE237
The passenger transport route formulating module comprises a critical data acquiring module, a kilometer electricity consumption value calculating module and a deviation value analyzing module;
the critical data acquisition module is used for acquiring an order end point position when the power consumption value of the network appointment vehicle is larger than or equal to a critical return power consumption residual threshold value, and an urban charging pile position within a preset range from the order end point position in historical order data, and acquiring the distance between the order end point and the urban charging pile within the preset range;
the kilometer electricity consumption value calculating module is used for calculating a kilometer electricity consumption value according to the total mileage from the start of order receiving to the end of order receiving of the network appointment car and the total electricity consumption;
the deviation value analysis module is used for acquiring an actual power consumption value and a corresponding ideal power consumption value of the urban charging pile position within a preset range, and calculating an absolute value of the difference between the actual power consumption value and the ideal power consumption value as a deviation value; sorting the deviation values from small to large, and then obtaining the deviation values
Figure DEST_PATH_IMAGE239
The minimum corresponding city charging pile driving route in the historical database is
Figure 476589DEST_PATH_IMAGE237
Passenger transport route.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus.
Finally, it should be noted that: although the present invention has been described in detail with reference to the foregoing embodiments, it will be apparent to those skilled in the art that changes may be made in the embodiments and/or equivalents thereof without departing from the spirit and scope of the invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (9)

1. A recommendation method for customizing a passenger transport route by a network appointment car is characterized by comprising the following specific steps:
acquiring historical order data, wherein the historical order data comprises time points of historical orders, positions and distances of starting and ending points of the historical orders, total mileage from the start of order taking to the end of order taking every day and total power consumption; the historical order data is stored in a passenger transport route recommendation system, and an urban charging pile distribution circuit diagram and a hot station distribution circuit diagram recorded in the passenger transport route recommendation system are obtained;
estimating average power consumption value of each order of network car booking based on historical order data in recommendation system
Figure 758985DEST_PATH_IMAGE002
Wherein
Figure 788121DEST_PATH_IMAGE004
Represents the total electricity consumption from the beginning to the end of the order taking of the 1 st, 2 nd, and k network appointment cars,
Figure 825347DEST_PATH_IMAGE006
representing the total order receiving quantity from the beginning to the end of the order receiving of the 1 st, 2 nd,. Setting critical return power consumption residual threshold
Figure 369461DEST_PATH_IMAGE008
Said critical return power consumption residual threshold
Figure 783124DEST_PATH_IMAGE008
Greater than the average electricity consumption per order
Figure 666767DEST_PATH_IMAGE010
Optimal route set in passenger transport route recommendation system
Figure 609315DEST_PATH_IMAGE012
Said
Figure 578408DEST_PATH_IMAGE014
Representing a passenger traffic route before a critical return power consumption residual threshold is not exceeded, said
Figure 795763DEST_PATH_IMAGE016
Representing the passenger transport route after the critical return electricity consumption residual threshold value is exceeded;
and recording the actual distance and the actual time length between the terminal of the last passenger and the starting point of the next passenger in the average adjacent orders in historical order data of different networked appointments as L1 and T1 respectively, and the optimal route set A
Figure 327720DEST_PATH_IMAGE014
And
Figure 972328DEST_PATH_IMAGE016
in the formulation process, it is desirable that the predicted distance between the last passenger's destination and the next passenger's starting point, L2, is less than L1, and the predicted duration, T2, is less than T1.
2. The method for recommending a customized passenger transport route by online booking, according to claim 1, wherein: the above-mentioned
Figure 428717DEST_PATH_IMAGE014
The passenger transport route planning comprises the following steps:
recording the driving data of a first order of the taxi appointment in the network of the day, wherein the driving data of the first order comprises the position of an order terminal and the power consumption of the order
Figure 918604DEST_PATH_IMAGE018
Judging the power consumption of the order
Figure 573576DEST_PATH_IMAGE018
And average power consumption value
Figure 389085DEST_PATH_IMAGE020
The magnitude of (1), current power consumption
Figure 67191DEST_PATH_IMAGE018
Greater than the average power consumption value
Figure 626349DEST_PATH_IMAGE020
And judging whether the position distance between the starting point of the next order and the end point of the first order meets the following requirements:
Figure 73511DEST_PATH_IMAGE022
and is
Figure 59921DEST_PATH_IMAGE024
If not satisfied with
Figure 490902DEST_PATH_IMAGE022
1 and
Figure 384909DEST_PATH_IMAGE024
or L2=0 and T2=0, the network appointment vehicle goes to a hot station within the ideal radius of the terminal point of the order when the order is carried out to receive the order; if it satisfies
Figure 952157DEST_PATH_IMAGE022
And is
Figure 846819DEST_PATH_IMAGE024
The online taxi appointment driver receives the order and goes to the starting point position of the order;
current consumption of electricity
Figure 499517DEST_PATH_IMAGE018
Less than or equal to the average power consumption value
Figure 400477DEST_PATH_IMAGE020
Then, selecting the corresponding order starting point position in the next order L2 when the order starting point position is the minimum value to drive; and if no next order is available, selecting the hot station within the ideal radius of the end point of the order when the order is carried out according to the recommendation system.
3. The method of claim 2, wherein the step of recommending the customized passenger transportation route by means of network appointment comprises the following steps: the network appointment vehicle goes to a hot station within the ideal radius of the terminal point of the order for order taking when the distance is carried out, and the method comprises the following steps:
connecting the boarding points in the historical order data, wherein the connection standard is that the straight line distance between the boarding points of each order is smaller than a, and the boarding points meeting the requirement that the distance is smaller than a form a circular domain with the radius of b, the circular domain comprises all the boarding points of the connection, and b is larger than a;
the passenger transport route recommendation system obtains the number m of the formed circle areas and the number p of all boarding points in the historical order data, and calculates the average number of the boarding points in the circle areas in the historical order data as
Figure 884548DEST_PATH_IMAGE026
Recording the circle area with the number of the upper vehicle points in the actual circle area larger than the number of the upper vehicle points in the average circle area as the hot station;
recording the position of the hot station, and acquiring the actual distance set of the order end point when the hot station distance in the historical order data is carried out
Figure 212761DEST_PATH_IMAGE028
And set of actual durations
Figure 352756DEST_PATH_IMAGE030
(ii) a Aggregating actual routes
Figure 526248DEST_PATH_IMAGE028
Sorting according to the order from small to large, and selecting the sorted set
Figure 68088DEST_PATH_IMAGE028
The actual routes of the corresponding hot stations with the median value of more than or equal to L2 and less than L1 are taken as target route sets
Figure 567202DEST_PATH_IMAGE032
Obtaining a target range set
Figure 991230DEST_PATH_IMAGE032
Corresponding target duration set
Figure 233993DEST_PATH_IMAGE034
The target duration set
Figure 895918DEST_PATH_IMAGE034
The actual time length from the historical order end point to the hot station existing in the range with the order end point as the center of a circle and a as the radius in the historical order data is taken as a target time length set;
determining a target duration set
Figure 300355DEST_PATH_IMAGE034
And analyzing the ideal radius priority of the hot station of the network taxi appointment according to the accuracy of the target duration set and the corresponding target distance set.
4. The method for recommending customized passenger transport routes by network appointment as claimed in claim 3, wherein: the set of judgment target durations
Figure 149362DEST_PATH_IMAGE034
According to the accuracy of the target duration set and the accuracy of the corresponding target distance set, the ideal radius priority of the hot station of the network taxi appointment advance is analyzed, and the method comprises the following steps:
obtaining a target duration set
Figure 989624DEST_PATH_IMAGE034
Time length ordering n1 in (1), and target time length set
Figure 506056DEST_PATH_IMAGE034
Calculating a target time length set in a sequence n2 from small to large
Figure 346973DEST_PATH_IMAGE034
Is measured with respect to the accuracy of
Figure 683276DEST_PATH_IMAGE036
Degree of similarity
Figure 2262DEST_PATH_IMAGE038
When the accuracy is high
Figure 373200DEST_PATH_IMAGE040
Selecting the actual time length of the hot site corresponding to the time length less than T1 in the target time length set as an ideal time length set
Figure 181756DEST_PATH_IMAGE042
The priority order of the ideal radius is the ideal duration set
Figure 270935DEST_PATH_IMAGE042
Corresponding ideal course set
Figure DEST_PATH_IMAGE044
The order of (a);
when the accuracy is high
Figure DEST_PATH_IMAGE046
Selecting the actual time length of the hot station corresponding to the sequence n2 and smaller than T1 in the target time length set as an ideal time length set
Figure DEST_PATH_IMAGE048
And
Figure DEST_PATH_IMAGE050
the hot station analysis data comprises a distance between the hot station and an order end point when the hot station is carried out, or a distance in a range with the order end point as a circle center and a as a radius when the hot station is carried out corresponds to the braking times in the 1 st, 2 nd,
Figure DEST_PATH_IMAGE052
the hot station analysis data further comprises the length of the car appointment journey when the car is driven to the 1 st, 2 nd, e
Figure DEST_PATH_IMAGE054
And calculating the braking frequency of the 1 st, 2 nd, and c th hot stations in the historical order data
Figure DEST_PATH_IMAGE056
Will be provided with
Figure 380230DEST_PATH_IMAGE058
The formed sets are sorted from small to large, if the sorted sets
Figure 871254DEST_PATH_IMAGE058
Corresponding time length sequence and ideal time length set
Figure 53974DEST_PATH_IMAGE060
If the ideal radius is the same, the priority order of the ideal radius is the ideal duration set
Figure 161607DEST_PATH_IMAGE060
Corresponding ideal course set
Figure 87975DEST_PATH_IMAGE062
The order of (a).
5. The method for recommending a customized passenger transport route by online booking, according to claim 2, wherein: the above-mentioned
Figure 167926DEST_PATH_IMAGE064
The passenger transport route planning comprises the following steps:
recording the residual electric quantity of the network appointment vehicle to reach the threshold value equal to the critical return power consumption residual electric quantity
Figure 521547DEST_PATH_IMAGE066
The position of a temporal order and the urban charging pile position in historical order data within a preset range from the end position of the order are obtained, and the distance between the end position of the order and the 1 st, 2 nd, so, s urban charging piles within the preset range is obtained
Figure 319739DEST_PATH_IMAGE068
Calculating the kilometer electricity consumption value of the network appointment car in the historical order data
Figure 846535DEST_PATH_IMAGE070
Wherein
Figure 46572DEST_PATH_IMAGE072
Representing the total mileage from the beginning to the end of the order taking of the 1 st, 2 nd, and k network appointment cars; acquiring actual electricity consumption values of charging pile positions of 1 st, 2 nd, so s cities in a preset range
Figure DEST_PATH_IMAGE074
And corresponding ideal power consumption value
Figure DEST_PATH_IMAGE076
Calculating the actual power consumption value
Figure 364903DEST_PATH_IMAGE074
Corresponding ideal power consumption value
Figure 650390DEST_PATH_IMAGE076
Deviation value therebetween
Figure 184140DEST_PATH_IMAGE078
The deviation value
Figure DEST_PATH_IMAGE080
Sorting from small to large, then
Figure DEST_PATH_IMAGE082
Is defined as deviation value
Figure 97738DEST_PATH_IMAGE080
And (4) the driving route of the charging pile in the s-th city corresponding to the minimum time in the historical database.
6. A recommendation system for customizing a passenger transportation route by a networked car appointment applied to the method of any one of claims 1 to 5 is characterized by comprising a historical order data acquisition module, an average electricity consumption value estimation module, an optimal route set making module and a passenger transportation route limiting module;
the historical order data acquisition module is used for acquiring historical order data recorded in the passenger transport route recommendation system, wherein the historical order data comprises time points of historical orders, positions and distances of starting and ending points of the historical orders, and total mileage and total power consumption from starting to ending of receiving the orders every day; acquiring an urban charging pile distribution circuit diagram and a hot station distribution circuit diagram recorded in a passenger transport route recommendation system;
the average power consumption value estimation module is used for estimating an average power consumption value of the network appointment according to historical order data and setting a critical return power consumption residual threshold value, wherein the critical return power consumption residual threshold value is larger than the average power consumption value of each order;
the optimal route set formulation module is used for formulatingPassenger transport route including the passenger transport route before the critical return trip electricity consumption residual threshold value is not exceeded
Figure DEST_PATH_IMAGE084
And the passenger transport route after the critical return power consumption residual threshold value is exceeded
Figure DEST_PATH_IMAGE086
The optimal route set is
Figure DEST_PATH_IMAGE088
The passenger transport route defining module is used for defining time duration requirements and distance requirements in the optimal route set.
7. The system of claim 6, wherein the vehicle-ordering passenger route recommendation system comprises: the optimal route set formulation module comprises
Figure 121058DEST_PATH_IMAGE084
Passenger transport route planning module and
Figure 690579DEST_PATH_IMAGE086
a passenger transport route making module; the above-mentioned
Figure 762441DEST_PATH_IMAGE084
The passenger transport route formulating module comprises a power consumption preliminary judging module, a route analyzing module and an ideal radius planning module;
the power consumption preliminary judgment module is used for judging the magnitude relation between the power consumption of the first order and the average power consumption value; the route analysis module is used for analyzing and judging whether the estimated time length and the estimated distance between the position of the first order and the position of the next order are both smaller than the corresponding actual time length and actual distance in the historical order; the ideal radius planning module is used for planning hot stations with ideal radius when the conditions that the ideal radius is smaller than the preset radius are not met;
the ideal radius planning module comprises a circle domain formulation module, a hot site analysis module, a target set formulation module and an accuracy judgment module; the circle domain making module is used for connecting the boarding points in the historical order data and setting the boarding points meeting the distance requirement as a circle domain; the hot site analysis module is used for planning a circular domain meeting the requirement of the journey time to be a hot site; the target set formulation module is used for analyzing the positions of popular stations and correspondingly acquiring the actual duration and the actual distance in the historical order data for analysis; the accuracy judging module is used for analyzing the ideal radius priority of the hot station before the network appointment according to the accuracy of the target time length set.
8. The system of claim 7, wherein the vehicle-ordering passenger route recommendation system comprises: the accuracy judging module comprises an accuracy calculating module and an accuracy analyzing module; the accuracy analysis module comprises a brake data acquisition module and a brake frequency calculation module;
the accuracy calculation module is used for acquiring time length sequencing and sequencing from small to large of the target time length set, and comparing the similarity of the sequences of the time length sequencing and the sequencing from small to large to obtain a calculation value of accuracy;
the accuracy analysis module analyzes the ideal radius priority sequence when the accuracy is equal to 1 and the ideal radius priority when the accuracy is not equal to 1 according to the calculated value of the accuracy;
the brake data acquisition module is used for acquiring the corresponding brake times of the network appointment car when the accuracy is not equal to 1; and the braking frequency calculation module is used for analyzing the relation between the braking frequency and the running time of the corresponding network appointment vehicle and formulating an ideal time priority sequence with the accuracy not equal to 1 according to the corresponding relation.
9. The system of claim 8, wherein the vehicle appointment system comprises: the above-mentioned
Figure 671491DEST_PATH_IMAGE086
The passenger transport route formulation module comprises a critical data acquisition module, a kilometer electricity consumption value calculation module and a deviationA value analysis module;
the critical data acquisition module is used for acquiring an order end point position when the power consumption value of the network appointment vehicle is larger than or equal to a critical return power consumption residual threshold value, and an urban charging pile position within a preset range from the order end point position in historical order data, and acquiring the distance between the order end point and the urban charging pile within the preset range;
the kilometer electricity consumption value calculating module is used for calculating the kilometer electricity consumption value according to the total mileage from the start of order receiving to the end of order receiving of the network appointment and the total electricity consumption;
the deviation value analysis module is used for acquiring an actual power consumption value and a corresponding ideal power consumption value of the urban charging pile position within a preset range, and calculating an absolute value of the difference between the actual power consumption value and the ideal power consumption value as a deviation value; sorting the deviation values from small to large, and then obtaining the deviation values
Figure 537816DEST_PATH_IMAGE080
The minimum corresponding city charging pile driving route in the historical database is
Figure 535246DEST_PATH_IMAGE086
Passenger transport route.
CN202210720331.7A 2022-06-24 2022-06-24 Recommendation system and method for customizing passenger transport route by network taxi appointment Active CN114819413B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210720331.7A CN114819413B (en) 2022-06-24 2022-06-24 Recommendation system and method for customizing passenger transport route by network taxi appointment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210720331.7A CN114819413B (en) 2022-06-24 2022-06-24 Recommendation system and method for customizing passenger transport route by network taxi appointment

Publications (2)

Publication Number Publication Date
CN114819413A true CN114819413A (en) 2022-07-29
CN114819413B CN114819413B (en) 2022-09-23

Family

ID=82521990

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210720331.7A Active CN114819413B (en) 2022-06-24 2022-06-24 Recommendation system and method for customizing passenger transport route by network taxi appointment

Country Status (1)

Country Link
CN (1) CN114819413B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140046595A1 (en) * 2012-08-09 2014-02-13 Honda Motor Co., Ltd. Route planning device
WO2017000487A1 (en) * 2015-06-30 2017-01-05 百度在线网络技术(北京)有限公司 Driving route matching method and apparatus and storage medium
CN107844842A (en) * 2016-09-21 2018-03-27 北京嘀嘀无限科技发展有限公司 One kind uses car order processing method and server
CN111931079A (en) * 2020-07-21 2020-11-13 欧拉信息服务有限公司 Method and system for recommending online booking getting-on points
CN112665600A (en) * 2020-12-03 2021-04-16 国网北京市电力公司 Path planning method and device, computer readable storage medium and processor
CN113761397A (en) * 2021-09-16 2021-12-07 华侨大学 Recommendation method, system, equipment and storage medium for customized passenger transport route
WO2022007689A1 (en) * 2020-07-08 2022-01-13 长城汽车股份有限公司 Charging reminding method and device for vehicle, program, storage medium, and vehicle

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140046595A1 (en) * 2012-08-09 2014-02-13 Honda Motor Co., Ltd. Route planning device
WO2017000487A1 (en) * 2015-06-30 2017-01-05 百度在线网络技术(北京)有限公司 Driving route matching method and apparatus and storage medium
CN107844842A (en) * 2016-09-21 2018-03-27 北京嘀嘀无限科技发展有限公司 One kind uses car order processing method and server
WO2022007689A1 (en) * 2020-07-08 2022-01-13 长城汽车股份有限公司 Charging reminding method and device for vehicle, program, storage medium, and vehicle
CN111931079A (en) * 2020-07-21 2020-11-13 欧拉信息服务有限公司 Method and system for recommending online booking getting-on points
CN112665600A (en) * 2020-12-03 2021-04-16 国网北京市电力公司 Path planning method and device, computer readable storage medium and processor
CN113761397A (en) * 2021-09-16 2021-12-07 华侨大学 Recommendation method, system, equipment and storage medium for customized passenger transport route

Also Published As

Publication number Publication date
CN114819413B (en) 2022-09-23

Similar Documents

Publication Publication Date Title
CN108162771B (en) Intelligent charging navigation method for electric automobile
CN112419706B (en) Real-time single processing method and server
CN107038488B (en) Parking lot real-time parking space reservation method based on parking space prediction and parking selection
CN107045783B (en) Road network accurate driving operation method and system based on appointed travel
CN108831149B (en) Method and system for customizing bus route running based on historical OD information
CN109191876B (en) Special vehicle traffic guidance system based on Internet of vehicles technology and control method thereof
CN103150762B (en) The pricing method of taxi pricing system
CN105279955B (en) A kind of share-car method and apparatus
CN110118567B (en) Travel mode recommendation method and device
CN103155012B (en) Driving evaluation system and vehicle-mounted device
CN105225472A (en) A kind of share-car method and apparatus
CN104390650A (en) Electric car route planning method and system based on cloud platform
CN103236179A (en) Method for charging and navigating electric vehicles on basis of traffic information and power grid information
CN109612488B (en) Big data micro-service-based mixed travel mode path planning system and method
CN110853378A (en) Vehicle ramp afflux management method and system
CN105224995A (en) A kind of method and system distributed in real time according to Public Resource
CN113393137B (en) Scheduling sharing system based on Internet of vehicles
CN115409295A (en) Bus scheduling method based on bottleneck analysis, electronic equipment and storage medium
CN113175939A (en) Pure electric vehicle travel planning method and system
CN111882107A (en) Driver and passenger matching method based on automatic driving shared taxi system
JP2006344006A (en) Travel time estimation system, apparatus, and method
CN106128132A (en) A kind of system of real-time road monitoring
CN105761365A (en) Internet of Things platform for emergency power supplies and intelligent transportation system
CN114819413B (en) Recommendation system and method for customizing passenger transport route by network taxi appointment
CN113379159A (en) Taxi driver passenger-searching route recommendation method based on gray model and Markov decision process

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