CN108921336A - A kind of combination traffic plan recommended method and system based on estimated cost - Google Patents

A kind of combination traffic plan recommended method and system based on estimated cost Download PDF

Info

Publication number
CN108921336A
CN108921336A CN201810624065.1A CN201810624065A CN108921336A CN 108921336 A CN108921336 A CN 108921336A CN 201810624065 A CN201810624065 A CN 201810624065A CN 108921336 A CN108921336 A CN 108921336A
Authority
CN
China
Prior art keywords
taxi
public
plan
traffic
expense
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.)
Pending
Application number
CN201810624065.1A
Other languages
Chinese (zh)
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.)
Hangzhou Houbo Technology Co Ltd
Original Assignee
Hangzhou Houbo 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 Hangzhou Houbo Technology Co Ltd filed Critical Hangzhou Houbo Technology Co Ltd
Priority to CN201810624065.1A priority Critical patent/CN108921336A/en
Publication of CN108921336A publication Critical patent/CN108921336A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315—Needs-based resource requirements planning or analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Navigation (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention discloses a kind of combination traffic plan recommended method and system based on estimated cost.Its system include calculate expense of calling a taxi and judge whether to need to combine traffic module, obtain public transit route and calculate the expense of transit trip and time module, calculating plan call a taxi mileage module, recommend combination traffic plan module.Method and system of the invention solve the technical issues of cannot recommending the combination traffic plan quickly reached as far as possible within its estimated cost for user.

Description

A kind of combination traffic plan recommended method and system based on estimated cost
Technical field
The invention belongs to technical field of electronic navigation, push away more particularly to a kind of combination traffic plan based on estimated cost Recommend method and system.
Background technique
Electronic map is based respectively on the modes such as self-driving, taxi, public transport, walking, bicycle and navigates at present.When into When the non-self-driving trip of row long range, public transport or taxi are generally selected.When using transit trip, generally require to walk Row relatively long distance and waiting vehicle, in addition, the case where also frequently transfer is changed in appearance, causes the damage in user time and physical strength It loses.When using trip of taxi, if road farther out if spend it is excessively high.There is presently no recommend within its estimated cost to the greatest extent for user The technology for the combination traffic plan that may quickly reach.A kind of combination traffic plan recommendation side based on estimated cost is proposed thus Method and system.
Summary of the invention
The technical problem to be solved by the present invention is to cannot be that user recommends quickly to reach as far as possible within its estimated cost Combination traffic plan the problem of, propose a kind of combination traffic plan recommended method and system based on estimated cost.The public affairs Traffic altogether includes but is not limited to bus, subway, light rail etc..
The present invention relies on existing electronic map, public transportation system, and user inputs destination and budget expense in the terminal With generating a plurality of public transport guidance path, taxi guidance path, walking path etc., the present invention is pushed away by being calculated as user It recommends and quickly combines traffic plan within its estimated cost as far as possible.
Position of the present invention is the position coordinates based on longitude and latitude or the relative coordinate based on electronic map.User passes through The electronic map input destination of terminal and estimated cost, the terminal include but is not limited to mobile terminal app or webpage or small Program.
Combination traffic plan recommender system based on estimated cost of the invention, including calculate expense of calling a taxi and judge whether It needs to combine traffic module, obtain public transit route and calculates the expense and time module, calculating plan of transit trip Call a taxi mileage module, recommend combination traffic plan module.
Calculating, which is called a taxi, expense and to be judged whether to need to combine traffic module：Obtain destination that user is inputted by terminal and Estimated cost, estimated cost are indicated with variable x.Mileage of calling a taxi is calculated according to user location and destination locations, with variable s table Show, according to calling a taxi mileage and local taxi charging standard (usually starting fare Gary journey expense) calculating is called a taxi expense y.If x< Y then determines that user needs to combine traffic, into the expense and time mould for obtaining public transit route and calculating transit trip Otherwise block determines that user can directly call a taxi to destination.
It obtains public transit route and calculates the expense and time module of transit trip：According to user location and purpose Ground calculates public transport navigation routine, and route number indicates with variable m, and public transit route is numbered in order as i, and 1≤i≤ m.The seating expense for calculating each public transit route, with variable kiIt indicates, the riding time variable t of each public transit routeiTable Show.
Calculating plan is called a taxi mileage module：Calculating is corresponding with public transit route to plan the expense f that calls a taxii=x-ki.According to Plan the expense f that calls a taxiiAnd local taxi charging standard calculate it is corresponding with public transit route plan mileage of calling a taxi, use variable niIt indicates.
Recommend combination traffic plan module：It identifies in calling a taxi with user distance closest to plan in every public transit route The public traffic station of journey calculates user and calls a taxi to the public traffic station and taken from the public traffic station to destination Between, with variable piIt indicates；It identifies in every public transit route and calls a taxi the public friendship of mileage with destination distance closest to plan Logical website calculates user and takes public transport to the website and the time required to calling a taxi to destination, with variable qiIt indicates；It calculates most Small time d=min { pi,qi, if d<min{ti, then recommend to select combination traffic plan corresponding to minimum time d, otherwise push away Recommend min { tiCorresponding public transit route scheme.
Combination traffic plan recommended method based on estimated cost of the invention is realized as follows：
The destination and estimated cost, estimated cost that step 1, acquisition user are inputted by terminal are indicated with variable x.According to User location and destination locations calculate mileage of calling a taxi, and are indicated with variable s, according to mileage and the local taxi charging standard of calling a taxi (usually starting fare Gary journey expense) calculates the expense y that calls a taxi.If x<Y then determines that user needs to combine traffic, enters step 2, Otherwise determine that user can directly call a taxi to destination.
Step 2 calculates public transport navigation routine according to user location and destination, and route number is indicated with variable m, will Public transit route numbers in order as i, 1≤i≤m.The seating expense for calculating each public transit route, with variable kiIt indicates, The riding time of each public transit route variable tiIt indicates.
Step 3 calculates and corresponding with public transit route plans to call a taxi expense fi=x-ki.It is called a taxi expense f according to plani And local taxi charging standard calculate it is corresponding with public transit route plan mileage of calling a taxi, with variable niIt indicates.
It calls a taxi the public transport station of mileage with user distance closest to plan in every step 4, identification public transit route Point, calculating user calls a taxi to the public traffic station and the required time from the public traffic station to destination, with variable piTable Show；It identifies in every public transit route and calls a taxi the public traffic station of mileage with destination distance closest to plan, calculate and use Public transport is taken to the website and the time required to calling a taxi to destination in family, with variable qiIt indicates；Calculate minimum time d=min {pi,qi, if d<min{ti, then recommend to select combination traffic plan corresponding to minimum time d, otherwise recommends min { tiRight The public transit route scheme answered.
Method and system of the invention this have the advantage that：According to the estimated cost of user, it is shortest public to calculate the time Traffic combines traffic plan with calling a taxi, selected under certain transport cost for user travel plan as quick as possible provide according to According to.
Detailed description of the invention
Fig. 1 is the combination traffic plan recommender system block diagram based on estimated cost of the embodiment of the present invention；
Fig. 2 is the combination traffic plan recommended method flow chart based on estimated cost of the embodiment of the present invention.
Specific embodiment
It elaborates below to the preferred embodiment of the present invention.
The present invention relies on existing electronic map, public transportation system, and user inputs destination and budget expense in the terminal With generating a plurality of public transport guidance path, taxi guidance path, walking path etc., the present invention is pushed away by being calculated as user It recommends and quickly combines traffic plan within its estimated cost as far as possible.
Position of the present invention is the position coordinates based on longitude and latitude or the relative coordinate based on electronic map.User passes through The electronic map input destination of terminal and estimated cost, the terminal include but is not limited to mobile terminal app or webpage or small Program.In the present embodiment, user location and public traffic station position are all made of the expression of the relative position based on electronic map.With Destination is inputted in the electronic map that family passes through mobile terminal app and can bear transport cost.
The combination traffic plan recommender system based on estimated cost of the embodiment of the present invention, including calculate expense of calling a taxi and sentence It is disconnected whether to need to combine traffic module, obtain public transit route and calculate the expense and time module, meter of transit trip Calculate and draws mileage module of calling a taxi, recommends combination traffic plan module.Each sequence of modules executes, the combination traffic based on estimated cost Scheme recommender system block diagram is as shown in Figure 1.
Calculating, which is called a taxi, expense and to be judged whether to need to combine traffic module：Obtain destination that user is inputted by terminal and Estimated cost, estimated cost are indicated with variable x.Mileage of calling a taxi is calculated according to user location and destination locations, with variable s table Show, according to calling a taxi mileage and local taxi charging standard (usually starting fare Gary journey expense) calculating is called a taxi expense y.If x< Y then determines that user needs to combine traffic, into the expense and time mould for obtaining public transit route and calculating transit trip Otherwise block determines that user can directly call a taxi to destination.In the present embodiment, user by mobile terminal app input destination and Estimated cost, destination are " the East Hangzhou railway station ", and estimated cost x=20 member, user current location is " Zhejiang Outcome of Scientific Researches ", out It hires a car s=14 kilometers of mileage of trip, it is contemplated that the used time is 33 minutes.Local taxi charging standard is：Starting fare in 3 kilometers It is 11 yuan, 3 kilometers to 10 kilometers of mileage expense is 2.5 yuan every kilometer, and 10 kilometers the above are 3.75 yuan every kilometer.To calculate Expense of calling a taxi y=43.5 member.X=20 at this time<Y=43.5 then determines that user needs to combine traffic, into acquisition public transport road Line and the expense and time module for calculating transit trip.
It obtains public transit route and calculates the expense and time module of transit trip：According to user location and purpose Ground calculates public transport navigation routine, and route number indicates with variable m, and public transit route is numbered in order as i, and 1≤i≤ m.The seating expense for calculating each public transit route, with variable kiIt indicates, the riding time variable t of each public transit routeiTable Show.In the present embodiment, calculated according to existing electronic navigation technology from " Zhejiang Outcome of Scientific Researches " to the public of " the East Hangzhou railway station " Communication navigation route, totally 5 public transport navigation routines, i.e. m=5.Public transit route is respectively " 113 tunnels-subway in order No. 4 lines ", " B props up the 3 tunnel roads-B4 ", " -105 tunnel of 113 tunnel ", " 107 tunnel ", " B props up 3 tunnels ", number from 1 to 5.According to public transport meter Valence mumber is according to the seating expense k for calculating public transit route1=6.5 yuan, k2=3 yuan, k3=4.5 yuan, k4=3 yuan, k5=3 yuan, root The riding time t of each public transit route is calculated according to existing airmanship1=54 minutes, t2=75 minutes, t3=75 minutes, t4 =67 minutes, t5=70 minutes.
Calculating plan is called a taxi mileage module：Calculating is corresponding with public transit route to plan the expense f that calls a taxii=x-ki.According to Plan the expense f that calls a taxiiAnd local taxi charging standard calculate it is corresponding with public transit route plan mileage of calling a taxi, use variable niIt indicates.In the present embodiment, calculating is corresponding with each public transit route to plan the expense f that calls a taxi1=x-k1=20-6.5=13.5 Member, f2=x-k2=20-3=17 member, f3=x-k3=20-4.5=15.5 member, f4=x-k4=20-3=17 member, f5=x-k5= 20-3=17 member calculates separately the taxi mileage n that can be born according to charging standard is hired out1=4 kilometers, n2=5.4 kilometers, n3= 4.8 kilometers, n4=5.4 kilometers, n5=5.4 kilometers.
Recommend combination traffic plan module：It identifies in calling a taxi with user distance closest to plan in every public transit route The public traffic station of journey calculates user and calls a taxi to the public traffic station and taken from the public traffic station to destination Between, with variable piIt indicates；It identifies in every public transit route and calls a taxi the public friendship of mileage with destination distance closest to plan Logical website calculates user and takes public transport to the website and the time required to calling a taxi to destination, with variable qiIt indicates；It calculates most Small time d=min { pi,qi, if d<min{ti, then recommend to select combination traffic plan corresponding to minimum time d, otherwise push away Recommend min { tiCorresponding public transit route scheme.In the present embodiment, to call a taxi as the combination traffic of starting point：Identiflication number 1 is public Closest to the call a taxi public traffic station of mileage of plan it is altogether " Southern Star bridge subway station " with user distance in traffic route, then numbers The combination traffic plan of 1 public transit route is：It calls a taxi to " Southern Star bridge subway station ", sits " No. 4 lines of subway " to " the East Hangzhou railway station ", Required time p1=13+27=40 minutes；The combination traffic plan of 2 public transit route of number is：It calls a taxi to " San Langmiao ", multiplies Seat " B props up 3 tunnels " arrives " Village Zha Nongkou station " transfer " road B4 " and arrives " the East Hangzhou railway station ", required time p2=16+40=56 minutes；It compiles The combination traffic plan of number 3 public transit routes is：It calls a taxi to " reviving bridge transfer stop ", takes " 113 tunnel " and arrive " Feng Leqiao South " transfer " 105 tunnel " is arrived " the East Hangzhou railway station ", required time p3=7+60=67 minutes；The combination of 4 public transit route of number is handed over Logical scheme is：It calls a taxi to " bus station of the village Xing Min ", takes " 107 tunnel " and arrive " the East Hangzhou railway station ", required time p4=16+31=47 points Clock；The combination traffic plan of 5 public transit route of number is：It calls a taxi to " San Langmiao ", takes " B props up 3 tunnels " and arrive " village Gao Tang station " It gets off and walks to " the East Hangzhou railway station ", required time p5=16+60=76 minutes.
To call a taxi as the combination traffic of terminal：It calculates in 1 public transit route of number with destination apart from closest plan Call a taxi mileage public traffic station be " scape virtue subway station ", user take " No. 4 lines of 113 tunnels-subway " arrive " scape virtue subway station " It calls a taxi to " the East Hangzhou railway station ", required time q1=52+12=64 minutes；Similarly, 2 public transit route of number and group of calling a taxi are calculated Closing traffic plan is：" B props up the 3 tunnel roads-B4 " is taken to call a taxi to " Village Zha Nongkou station " to " the East Hangzhou railway station ", required time q2=60 + 12=72 minutes；It calculates 3 public transit route of number and combines traffic plan and be with calling a taxi：" -105 tunnel of 113 tunnel " is taken to " building It calls a taxi to " the East Hangzhou railway station ", required time q at north bridge station "3=66+14=80 minutes；It calculates 4 public transit route of number and calls a taxi Combining traffic plan is：" 107 tunnel " is taken to call a taxi to " Village Cai He station " to " the East Hangzhou railway station ", required time q4=44+14= 58 minutes；It calculates 5 public transit route of number and combines traffic plan and be with calling a taxi：It takes " B props up 3 tunnels " and arrives " Village Zha Nongkou station " It calls a taxi to " the East Hangzhou railway station ", required time q5=54+12=66 minutes.
To calculate minimum time d=min { p1,p2,p3,p4,p5,q1,q2,q3,q4,q5}=40 minute, min { ti}=54 Minute, d<min{ti, then recommend to select combination traffic plan corresponding to minimum time d, i.e., to call a taxi as starting point, number 1 The assembled scheme of public transit route：User calls a taxi to " Southern Star bridge subway station ", sits " No. 4 lines of subway " to " the East Hangzhou railway station ", in advance The meter used time 40 minutes, 7 minutes when only calling a taxi multi-purpose than whole process.
The combination traffic plan recommended method based on estimated cost of the embodiment of the present invention, is realized as follows：
The destination and estimated cost, estimated cost that step 1, acquisition user are inputted by terminal are indicated with variable x.According to User location and destination locations calculate mileage of calling a taxi, and are indicated with variable s, according to mileage and the local taxi charging standard of calling a taxi (usually starting fare Gary journey expense) calculates the expense y that calls a taxi.If x<Y then determines that user needs to combine traffic, enters step 2, Otherwise determine that user can directly call a taxi to destination.In the present embodiment, user inputs destination and budget by mobile terminal app Expense, destination are " the East Hangzhou railway station ", and estimated cost x=20 member, user current location is " Zhejiang Outcome of Scientific Researches ", taxi S=14 kilometers of the mileage of trip.Local taxi charging standard is：Starting fare is 11 yuan, 3 kilometers to 10 kilometers in 3 kilometers Mileage expense be 2.5 yuan every kilometer, 10 kilometers the above are 3.75 yuan every kilometer.To calculate expense y=43.5 member of calling a taxi.This When x=20<Y=43.5 then determines that user needs to combine traffic, enters step 2.
Step 2 calculates public transport navigation routine according to user location and destination, and route number is indicated with variable m, will Public transit route numbers in order as i, 1≤i≤m.The seating expense for calculating each public transit route, with variable kiIt indicates, The riding time of each public transit route variable tiIt indicates.In the present embodiment, according to existing electronic navigation technology calculate from " Zhejiang Outcome of Scientific Researches " arrives the public transport navigation routine of " the East Hangzhou railway station ", totally 5 public transport navigation routines, i.e. m=5. Public transit route is respectively " No. 4 lines of 113 tunnels-subway ", " B props up the 3 tunnel roads-B4 ", " -105 tunnel of 113 tunnel ", " 107 in order Road ", " B props up 3 tunnels ", are numbered from 1 to 5.The seating expense k of public transit route is calculated according to public transport valuation data1=6.5 Member, k2=3 yuan, k3=4.5 yuan, k4=3 yuan, k5=3 yuan, the seating of each public transit route is calculated according to existing airmanship Time t1=54 minutes, t2=75 minutes, t3=75 minutes, t4=67 minutes, t5=70 minutes.
Step 3 calculates and corresponding with public transit route plans to call a taxi expense fi=x-ki.It is called a taxi expense f according to plani And local taxi charging standard calculate it is corresponding with public transit route plan mileage of calling a taxi, with variable niIt indicates.This implementation In example, calculating is corresponding with each public transit route to plan the expense f that calls a taxi1=x-k1=20-6.5=13.5 member, f2=x-k2= 20-3=17 member, f3=x-k3=20-4.5=15.5 member,
f4=x-k4=20-3=17 member, f5=x-k5=20-3=17 member is calculated separately and can be held according to charging standard is hired out The taxi mileage n received1=4 kilometers, n2=5.4 kilometers, n3=4.8 kilometers, n4=5.4 kilometers, n5=5.4 kilometers.
It calls a taxi the public transport station of mileage with user distance closest to plan in every step 4, identification public transit route Point, calculating user calls a taxi to the public traffic station and the required time from the public traffic station to destination, with variable piTable Show；It identifies in every public transit route and calls a taxi the public traffic station of mileage with destination distance closest to plan, calculate and use Public transport is taken to the website and the time required to calling a taxi to destination in family, with variable qiIt indicates；Calculate minimum time d=min {pi,qi, if d<min{ti, then recommend to select combination traffic plan corresponding to minimum time d, otherwise recommends min { tiRight The public transit route scheme answered.In the present embodiment, to call a taxi as the combination traffic of starting point：1 public transit route of identiflication number In with user distance closest to the call a taxi public traffic station of mileage of plan be " Southern Star bridge subway station ", then 1 public transport of number The combination traffic plan of route is：It calls a taxi to " Southern Star bridge subway station ", sits " No. 4 lines of subway " to " the East Hangzhou railway station ", required time p1=13+27=40 minutes；The combination traffic plan of 2 public transit route of number is：It calls a taxi to " San Langmiao ", takes " B branch 3 Road " is arrived " Village Zha Nongkou station " transfer " road B4 " and is arrived " the East Hangzhou railway station ", required time p2=16+40=56 minutes；Number 3 is public The combination traffic plan of traffic route is：It calls a taxi to " reviving bridge transfer stop ", takes " 113 tunnel " and arrive " Feng Le bridge south " transfer " 105 tunnel " is arrived " the East Hangzhou railway station ", required time p3=7+60=67 minutes；The combination traffic plan of 4 public transit route of number For：It calls a taxi to " bus station of the village Xing Min ", takes " 107 tunnel " and arrive " the East Hangzhou railway station ", required time p4=16+31=47 minutes；It compiles The combination traffic plan of number 5 public transit routes is：It calls a taxi to " San Langmiao ", takes " B props up 3 tunnels " to " village Gao Tang station " step of getting off Row arrives " the East Hangzhou railway station ", required time p5=16+60=76 minutes.It can directly exclude what needs were changed in combination traffic plan Public transit route, public transport needs to change in the combination traffic plan of number 2 and 3 public transit route of number at this time, because This directly excludes the two combination traffic plans.
To call a taxi as the combination traffic of terminal：It calculates in 1 public transit route of number with destination apart from closest plan Call a taxi mileage public traffic station be " scape virtue subway station ", user take " No. 4 lines of 113 tunnels-subway " arrive " scape virtue subway station " It calls a taxi to " the East Hangzhou railway station ", required time q1=52+12=64 minutes；Similarly, 2 public transit route of number and group of calling a taxi are calculated Closing traffic plan is：" B props up the 3 tunnel roads-B4 " is taken to call a taxi to " Village Zha Nongkou station " to " the East Hangzhou railway station ", required time q2=60 + 12=72 minutes；It calculates 3 public transit route of number and combines traffic plan and be with calling a taxi：" -105 tunnel of 113 tunnel " is taken to " building It calls a taxi to " the East Hangzhou railway station ", required time q at north bridge station "3=66+14=80 minutes；It calculates 4 public transit route of number and calls a taxi Combining traffic plan is：" 107 tunnel " is taken to call a taxi to " Village Cai He station " to " the East Hangzhou railway station ", required time q4=44+14= 58 minutes；It calculates 5 public transit route of number and combines traffic plan and be with calling a taxi：It takes " B props up 3 tunnels " and arrives " Village Zha Nongkou station " It calls a taxi to " the East Hangzhou railway station ", required time q5=54+12=66 minutes.It can directly exclude to need to change in combination traffic plan Public transit route, public transport needs to change in the combination traffic plan of number 1,2 and 3 public transit routes at this time, because This directly excludes these three combination traffic plans.
To calculate minimum time d=min { p1,p4,p5,q4,q5}=40 minute, min { ti}=54 minute, d<min {ti, then recommend to select combination traffic plan corresponding to minimum time d, i.e., to call a taxi as starting point, the public transport road of number 1 The assembled scheme of line：User calls a taxi to " Southern Star bridge subway station ", sits " No. 4 lines of subway " to " the East Hangzhou railway station ", it is contemplated that the used time 40 divides Clock, 7 minutes when only calling a taxi multi-purpose than whole process.
The combination traffic plan recommended method flow chart based on estimated cost of the present embodiment is as shown in Figure 2.
Certainly, those of ordinary skill in the art is it should be appreciated that above embodiments are intended merely to illustrate this hair It is bright, and be not intended as limitation of the invention, as long as within the scope of the invention, all to the variations of above embodiments, modification Protection scope of the present invention will be fallen into.

Claims (8)

1. a kind of combination traffic plan recommender system based on estimated cost, it is characterised in that including calculating call a taxi expense and judgement Whether need to combine traffic module, obtain public transit route and calculates the expense and time module, calculating of transit trip Plan call a taxi mileage module, recommendation combination traffic plan module；
It is described to calculate expense of calling a taxi and judge whether to need to combine traffic module：Obtain destination that user is inputted by terminal and Estimated cost, estimated cost are indicated with variable x；Mileage of calling a taxi is calculated according to user location and destination locations, in calling a taxi Journey and local taxi charging standard calculate the expense y that calls a taxi；If x<Y then determines that user needs to combine traffic, public into obtaining Otherwise traffic route and the expense and time module for calculating transit trip determine that user can directly call a taxi to destination；
The expense and time module for obtaining public transit route and calculating transit trip：According to user location and purpose Ground calculates public transport navigation routine, and route number indicates with variable m, and public transit route is numbered in order as i, and 1≤i≤ m；The seating expense for calculating each public transit route, with variable kiIt indicates, the riding time variable t of each public transit routeiTable Show；
The calculating plan is called a taxi mileage module：Calculating is corresponding with public transit route to plan the expense f that calls a taxii=x-ki；According to Plan the expense f that calls a taxiiAnd local taxi charging standard calculate it is corresponding with public transit route plan mileage of calling a taxi, use variable niIt indicates；
Traffic plan module is combined in the recommendation：It identifies in calling a taxi with user distance closest to plan in every public transit route The public traffic station of journey calculates user and calls a taxi to the public traffic station and taken from the public traffic station to destination Between, with variable piIt indicates；It identifies in every public transit route and calls a taxi the public friendship of mileage with destination distance closest to plan Logical website calculates user and takes public transport to the website and the time required to calling a taxi to destination, with variable qiIt indicates；It calculates most Small time d=min { pi,qi, if d<min{ti, then recommend to select combination traffic plan corresponding to minimum time d, otherwise push away Recommend min { tiCorresponding public transit route scheme.
2. the combination traffic plan recommender system according to claim 1 based on estimated cost, which is characterized in that the end End refers to any one or multinomial of mobile terminal app or webpage or small routine.
3. the combination traffic plan recommender system according to claim 1 based on estimated cost, which is characterized in that institute's rheme It is set to any one of the position coordinates based on longitude and latitude or the relative coordinate based on electronic map.
4. the combination traffic plan recommender system according to claim 1 based on estimated cost recommends combination traffic side Case module is characterized in that, combines the public transit route for directly excluding to need to change in traffic plan.
5. a kind of combination traffic plan recommended method based on estimated cost, it is characterised in that include the following steps：
The destination and estimated cost, estimated cost that step 1, acquisition user are inputted by terminal are indicated with variable x；According to user Position and destination locations calculating are called a taxi mileage, according to calling a taxi mileage and local taxi charging standard calculating is called a taxi expense y；If x<Y then determines that user needs to combine traffic, enters step 2, otherwise determines that user can directly call a taxi to destination；
Step 2 calculates public transport navigation routine according to user location and destination, and route number is indicated with variable m, will be public Traffic route numbers in order as i, 1≤i≤m；The seating expense for calculating each public transit route, with variable kiIt indicates, each public affairs The riding time variable t of traffic route altogetheriIt indicates；
Step 3 calculates and corresponding with public transit route plans to call a taxi expense fi=x-ki；It is called a taxi expense f according to planiAnd work as Taxi charging standard calculating in ground is corresponding with public transit route to plan mileage of calling a taxi, with variable niIt indicates；
It calls a taxi the public traffic station of mileage with user distance closest to plan in every step 4, identification public transit route, meter Calculation user calls a taxi to the public traffic station and the required time from the public traffic station to destination, with variable piIt indicates；Know It calls a taxi the public traffic station of mileage with destination distance closest to plan in not every public transit route, calculates user and take Public transport is to the website and the time required to calling a taxi to destination, with variable qiIt indicates；Calculate minimum time d=min { pi,qi, If d<min{ti, then recommend to select combination traffic plan corresponding to minimum time d, otherwise recommends min { tiCorresponding public Traffic route scheme.
6. the combination traffic plan recommended method according to claim 5 based on estimated cost, which is characterized in that the end End refers to any one or multinomial of mobile terminal app or webpage or small routine.
7. the combination traffic plan recommended method according to claim 5 based on estimated cost, which is characterized in that institute's rheme It is set to any one of the position coordinates based on longitude and latitude or the relative coordinate based on electronic map.
8. the combination traffic plan recommended method according to claim 5 based on estimated cost, the feature of step 4 exist In combining and directly exclude to need the public transit route changed in traffic plan.
CN201810624065.1A 2018-06-15 2018-06-15 A kind of combination traffic plan recommended method and system based on estimated cost Pending CN108921336A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810624065.1A CN108921336A (en) 2018-06-15 2018-06-15 A kind of combination traffic plan recommended method and system based on estimated cost

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810624065.1A CN108921336A (en) 2018-06-15 2018-06-15 A kind of combination traffic plan recommended method and system based on estimated cost

Publications (1)

Publication Number Publication Date
CN108921336A true CN108921336A (en) 2018-11-30

Family

ID=64421749

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810624065.1A Pending CN108921336A (en) 2018-06-15 2018-06-15 A kind of combination traffic plan recommended method and system based on estimated cost

Country Status (1)

Country Link
CN (1) CN108921336A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114596664A (en) * 2020-11-19 2022-06-07 上海擎感智能科技有限公司 Vehicle leasing method and device, electronic equipment and computer storage medium

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101692271A (en) * 2009-09-30 2010-04-07 青岛海信网络科技股份有限公司 Comprehensive guidance method of multiple means of transportation
CN102073696A (en) * 2010-12-28 2011-05-25 刘志 Auxiliary system and method for travel journey plan
CN105067000A (en) * 2015-07-15 2015-11-18 上海市政工程设计研究总院（集团）有限公司 Navigation method and system for accurate transfer of public transport
CN107085620A (en) * 2017-06-05 2017-08-22 中南大学 A kind of taxi and subway are plugged into the querying method and system of travel route
CN107123260A (en) * 2017-06-26 2017-09-01 上海交通大学 Method of traffic assignment based on traveler budget limit
CN107256632A (en) * 2017-08-11 2017-10-17 上海交通大学 A kind of method of traffic assignment based on the heterogeneous time value of user Yu congestion expense budget
US20180075559A1 (en) * 2016-09-13 2018-03-15 Intergraph Corporation Computer-Aided Dispatch Including Automatic Diversions
US20180158153A1 (en) * 2016-12-07 2018-06-07 Akif EKIN Fully automatic pizza, flatbread, lahmacun etc. preparation and distribution system

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101692271A (en) * 2009-09-30 2010-04-07 青岛海信网络科技股份有限公司 Comprehensive guidance method of multiple means of transportation
CN102073696A (en) * 2010-12-28 2011-05-25 刘志 Auxiliary system and method for travel journey plan
CN105067000A (en) * 2015-07-15 2015-11-18 上海市政工程设计研究总院（集团）有限公司 Navigation method and system for accurate transfer of public transport
US20180075559A1 (en) * 2016-09-13 2018-03-15 Intergraph Corporation Computer-Aided Dispatch Including Automatic Diversions
US20180158153A1 (en) * 2016-12-07 2018-06-07 Akif EKIN Fully automatic pizza, flatbread, lahmacun etc. preparation and distribution system
CN107085620A (en) * 2017-06-05 2017-08-22 中南大学 A kind of taxi and subway are plugged into the querying method and system of travel route
CN107123260A (en) * 2017-06-26 2017-09-01 上海交通大学 Method of traffic assignment based on traveler budget limit
CN107256632A (en) * 2017-08-11 2017-10-17 上海交通大学 A kind of method of traffic assignment based on the heterogeneous time value of user Yu congestion expense budget

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
王懿雯: "基于热点空间网络建模的个性化旅游行程规划", 《中国优秀硕士学位论文全文数据库 经济与管理科学辑》 *
靳文舟，巫威眺: "预算限制下的单线公交车辆组合调度模型", 《吉林大学学报（工学版）》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114596664A (en) * 2020-11-19 2022-06-07 上海擎感智能科技有限公司 Vehicle leasing method and device, electronic equipment and computer storage medium

Similar Documents

Publication Publication Date Title
US11821737B2 (en) Public and ordered transportation trip planning
JP3969735B2 (en) Route search device, route search method and program
CN105489002B (en) A kind of share-car method and system based on intelligent Matching and path optimization
CN106969777A (en) Path prediction meanss and path Forecasting Methodology
US8335648B2 (en) Route searching system, route searching server and route searching method
JP6851402B2 (en) Methods and systems for providing transportation services
TWI735292B (en) A method for providing a route for a journey from a source location to a target location
US8200432B2 (en) Route guidance system, route search server, route guidance method, and terminal
CN104884900A (en) Travel time information providing apparatus and travel time information providing method
US20120010816A1 (en) Navigation system, route search server, route search agent server, and navigation method
WO2013063480A4 (en) Method and system for fleet navigation, dispatching and multi-vehicle, multi-destination routing
EP2617599A2 (en) Reservation system, navigation device, battery charger and server
US8682583B2 (en) Route search system
US8467957B2 (en) Method and apparatus for generating routes using real-time public transportation information
CN105632230A (en) Method and apparatus for dynamically assigning parking lot
WO2013014612A1 (en) Multi-modal journey planner
Zhang et al. Traveler information tool with integrated real-time transit information and multimodal trip planning: Design and implementation
KR101255029B1 (en) RouteInformation providing system of complex public transport using public transportation schedules
CN107944611A (en) Towards the cross-module formula combined travel planing method of personalized trip requirements
CN103426139A (en) System and method for matching and pairing co-passengers
CN109000657A (en) A kind of Passenger Traveling Choice method and system based on navigation
JP2009216500A (en) Navigation system, route searching server, and route searching method
CN112185580B (en) Travel risk information processing method based on cloud
US8855920B2 (en) Automatic assistance for route planning
CN101807348B (en) Dynamic network navigation system and method

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