Nothing Special   »   [go: up one dir, main page]

WO2013072729A1 - System and method for ride sharing - Google Patents

System and method for ride sharing Download PDF

Info

Publication number
WO2013072729A1
WO2013072729A1 PCT/IB2012/002255 IB2012002255W WO2013072729A1 WO 2013072729 A1 WO2013072729 A1 WO 2013072729A1 IB 2012002255 W IB2012002255 W IB 2012002255W WO 2013072729 A1 WO2013072729 A1 WO 2013072729A1
Authority
WO
WIPO (PCT)
Prior art keywords
ride
riders
locations
service
shared
Prior art date
Application number
PCT/IB2012/002255
Other languages
French (fr)
Inventor
Zeev Zohar
Shay Shafranek
Yehonatan Aumann
Original Assignee
Way Better 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 Way Better Ltd filed Critical Way Better Ltd
Publication of WO2013072729A1 publication Critical patent/WO2013072729A1/en

Links

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
    • 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
    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07BTICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
    • G07B15/00Arrangements or apparatus for collecting fares, tolls or entrance fees at one or more control points
    • G07B15/02Arrangements or apparatus for collecting fares, tolls or entrance fees at one or more control points taking into account a variable factor such as distance or time, e.g. for passenger transport, parking systems or car rental systems

Definitions

  • Embodiments of the present invention relate generally to systems and methods for coordinated ride sharing.
  • An aspect of the invention provides for a method for introducing a shared-ride service comprising steps of: a. providing a shared-ride service adapted to increase occupancy of ride providers and decrease cost to riders;
  • said first set of locations is selected from the group consisting of: hot-spots, hotels, motels, concert venues, sporting events, theatres, squares, train terminals, bus terminals, airports, sea ports.
  • said first set of locations is not limited to a particular set of locations.
  • said second set of locations is selected from the group consisting of: hot-spots, hotels, motels, concert venues, sporting events, theatres, squares, train terminals, bus terminals, airports, sea ports.
  • said second set of locations is not limited to a particular set of locations.
  • said ride-provider price per ride N is determined by factors selected from the group consisting of: areas travelled, route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance.
  • a system for introduction of a shared-ride service comprising: c. a shared-ride service adapted to increase occupancy of ride providers and decrease cost to riders;
  • said first set of locations is selected from the group consisting of: hot-spots, hotels, motels, concert venues, sporting events, theatres, squares, train terminals, bus terminals, airports, sea ports.
  • said first set of locations is not limited to a particular set of locations.
  • said second set of locations is selected from the group consisting of: hot-spots, hotels, motels, concert venues, sporting events, theatres, squares, train terminals, bus terminals, airports, sea ports.
  • said second set of locations is not limited to a particular set of locations.
  • said ride-provider price per ride N is determined by factors selected from the group consisting of: areas travelled, route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance.
  • said ride-provider price per ride N is determined by factors selected from the group consisting of: areas travelled, route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance.
  • FIG. 1 illustrates a system diagram consistent with an implementation of the invention
  • FIG. 2 illustrates a comparison of the invention with two alternate methods; and, FIG. 3 illustrates a ride-ordering interface of the invention.
  • the invention utilizes communication and information technologies based on cloud computing platforms and GIS services to provide shared rides having multiple stops and optimized routes, where the stops are optionally at riders' doors.
  • the inventive algorithm is able to analyze ride orders, preferably in real-time or pre defined time intervals, producing an optimal solution taking into account such metrics as ride price and service level.
  • the invention comprises a system and method for an alternative in transportation, namely a cost-effective, dynamic and intelligent transportation service.
  • the invention offers a door to door transportation service for the price of a bus-ride or less than full fare taxi by means of (inter alia) an algorithm that matches rides ordered by different passengers into a single shared route, calculating the most efficient transportation route based upon any of number of metrics such as total cost, total time elapsed, total distance travelled, and the like.
  • the existing taxi market is addressed which is currently extremely wasteful and expensive.
  • the invention buys taxi rides from taxi stations at a fixed price, and sells them to users who share taxis for a lowered and much more attractive price.
  • This model allows the invention to be profitable (since more than one rider may share the taxi, generating more than one user fare, while the system has bought only one rider). This is a system thus offering a 'win-win' to all parties.
  • a. Ride-provider price per ride This may be a fixed predetermined price, or may be variable with various parameters including ride duration, length, number of stops, and the like.
  • b. Average occupancy at a given time As described above the price for a given passenger depends on the ratio of the number of vehicles to the number of passengers. This value may be recalculated continuously, or as an average value over a minute, hour, day, week, or the like.
  • c. Historical data Since the current price may not be known due to fluctuations in ride prices, rider price may be based on projections from historical data as to the price of their ride given the time of day, total occupancy, average occupancy, number of vehicles, time of day, season, and the like.
  • d. Advertising budget Since price for a given rider drops as the number of riders increases, it behooves both system operator and rider to advertise so as to bring more riders into the system. Thus the system operator may also provide incentives to riders such as coupons, discounts, or the like for recruiting new riders into the system. e. Desired price. Fixing a relatively low price may serve to attract potential riders to the system. f. Underwriting and partnerships. It is possible o collaborate with other groups in covering operational costs with financial and/or environmental interest in the success of the system, to aid in reducing the costs of rides. g. Profitability for the system operator h. Profitability of the system. i. Quality of service j. Different prices for different riders, based on ride distance, time, etc.
  • the novel aspects of the invention are the pricing algorithms for public or shared transport.
  • Extant methods of pricing include fixing a price beforehand as in most standard forms of public transportation, determining a price based on distance and time (as in taxis), or taking a given price and dividing equally as in a shared taxi ride, the price determined by the inventive method involves the average system-wide ride price.
  • This ride price is determined by the price the system operator must pay to provide the transport, as explained above, consisting of (for example) a number M of taxis hired, for a number K of riders.
  • the price to the operator will be, in an artificially simplified example, M times the average taxi price N.
  • the cost per rider will then be MN/K, which will decrease as K increases.
  • the average price per rider MN/K will decrease.
  • the system buys a set of rides at a fixed price and sells them to a larger number of riders for a fee determined by the number of riders, such that individual riders pay less than they would if each rider took a ride alone.
  • a price is agreed upon beforehand with some set of taxi drivers, ride services, or other ride providers.
  • This price N may be dependent upon distance, time elapsed, with a premium S charged for each stop above the minimum two necessary for a given ride.
  • S the price for the system operator will be N, and if the average number of riders is X then the average cost per rider will be computed as S(X - l)+ N
  • a key element of the invention is an optimization algorithm adapted to group riders based on their routes. Riders who order rides by means of the internet (e.g. through a dedicated site) agree to shared rides such that there is no expectation that the service provides standard lone taxi rides.
  • the algorithm may be adapted to minimize ride costs and/or to adapted to maximize the occupancy while maintaining a certain standard of service.
  • ride costs There are obviously tradeoffs involved between the average occupancy, average ride time, and average ride distance which may be treated as dependent variables in an optimization problem, the independent 'variable' being the set of routes chosen.
  • Taxis are expensive, and therefore it may be worthwhile to offer taxi riders a considerable sum for the first phase of operation.
  • the system attempts to maximize occupancy rates, which generally will be easier to achieve in locales of higher population density.
  • the invention first focuses on hotspots, these being hubs of activity such as train stations, universities, events and the like, and will offer the service from/to these hot-spots.
  • the invention brings public transportation to the information age, enabling for the first time a real and dynamic match of supply to demand.
  • using this approach ensures higher average car occupancy and therefore fewer vehicles, and from the passenger's perspective it provides a service that fits his/her individual needs, optimizing any combination of cost, time, and the like.
  • the inventive method comprises the following experience for passengers: they are picked up at their door step and taken all the way to their final destination. It enables them to simply order rides in a few mouse-clicks (by means of computer, smartphone, or the like using a webpage or other proxy of the service), pay automatically with an online account, enjoy a reserved seat, have all the information accessible, order rides automatically by means of a calendar, and the like.
  • the invention Being a highly efficient and sustainable transportation system, the invention reduces C02 emissions and cuts down traffic. Its approach to the user experience and personalization results in great service so that people may in fact elite the private car, and use the inventive method to get around.
  • the invention exploits the existence of social networks for public transportation, in effect offering a social transportation system.
  • the invention turns urban density from a problem into an opportunity: the more people that use the service, the better and cheaper it is for everyone.
  • the rider perspective may be presented attractively by pointing out that all riders share costs and increase occupancy rates in order to achieve reduced overall prices for rides.
  • the system operator may profit in a number of ways, including: a. charging per customer (either flat rate, based on distance/time, or the like) b. charging customers a percentage of their calculated savings c. Advertising d. Purchases of ride services from venue operators, hotels, etc. e. Information sales (to riders, or to others concerning rider information such as distribution, frequency, etc.)
  • the ride optimization algorithm is presented in Fig. 1.
  • the route calculation algorithm has a number of inputs including historical information, fleet data, geospatial data, traffic data, and real time taxi (or other ride provider) data, in addition to the current rider requests which form the most recent historical data.
  • An optimization algorithm calculates a set of routes serving the current requests, and a comparison algorithm scores the routes using one or more metrics and/or directly compares routes in a binary fashion (comparing two sets of routes and deciding which is better and which is worse). If the metric is poor (has a low metric) and/or is worse than previously generated routes, the comparison function returns to the route calculation block which generates another possible set of routes.
  • Fig. 2 displays a flowchart comparing current and inventive methods.
  • the top block depicts the current situation; a passenger pays some 50NIS cash to the driver.
  • the middle block depicts a 'voucher rider' such as is often provided by businesses; the passenger is given ride privileges by his business, for example for free.
  • the business pays a ride-provider (such as a taxi station, transport service or the like) a monthly fee of 45NIS for a seat, of which the station keeps 5 and forwards 40 to the driver.
  • the inventive method is shown in the last block; here three passengers all share a 23NIS fee.
  • the system operator takes from the combined 69NIS a 7NIS surcharge, leaving 62NIS.
  • the ride provider (such as taxi station or like) similarly takes another 7NIS leaving 55NIS. This the driver takes as his fee for transporting the three passengers.
  • Fig. 3 discloses a possible user interface 300 for booking rides from a hotspot. This may be implemented as a web page, app window, or the like.
  • the system offers a list menu 301 of possible starting points (which generally will be limited due to the finite number of hotspots) and another list menu 302 of possible start times.
  • a free text field 303 may be used for the end point (since generally the possible endpoints will be unlimited in number), although it is within provision of the invention to use list menus for both start and end points, free text fields for either or both, or any other information input method as will be clear to one skilled in the art including voice input, guesses based on current location (as determined e.g. by GPS), historical requests, or the like.
  • a price 304 is generated and displayed, as is an estimated ride time 305.
  • the system operator has agreements with ride providers, which include (inter alia) an agreed-upon ride pricelist (by means of route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance, and combinations of these) b.
  • ride providers include (inter alia) an agreed-upon ride pricelist (by means of route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance, and combinations of these)
  • ride providers which include (inter alia) an agreed-upon ride pricelist (by means of route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance, and combinations of these)
  • ride providers which include (inter alia) an agreed-upon ride pricelist (by means of route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance, and combinations of these)
  • ride providers which include (inter alia) an agreed-upon ride pricelist (by means of route, areas travelled, pickup fee, dropoff fee
  • the system operator sends the ride provider a ride order including start, pickup points, dropoff points, pickup times, and endpoint.
  • Users sign into the computer server of the system by means of a secure connection such as that provided by https. Fees are paid to the system operators' account.
  • the system operator pays the ride provider a payment for the ordered route (once executed) in keeping with the agreements concerning such.
  • the rider does not pay the driver; riders cannot choose their driver, and the driver cannot directly receive payment from any passenger.
  • the passenger is listed by the system operator's server, and pays the system operator via a web service.
  • Each month riders are sent itemized bills for the rides they have taken and paid for using the system.

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)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Game Theory and Decision Science (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Time Recorders, Dirve Recorders, Access Control (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention utilizes network services to provide shared rides having multiple stops and optimized routes, where the stops are optionally at riders' doors. Methods for introducing the system such that rapid acceptance and minimal starting costs are ensured are provided, by providing rides from a set of hotspots, and providing rides at artificially low prices based on predicted future average ride cost.

Description

SYSTEM AND METHOD FOR RIDE SHARING
BACKGROUND Technical Field
[0001] Embodiments of the present invention relate generally to systems and methods for coordinated ride sharing.
Description of Related Art
[0002] Various ride-sharing implementations exist at present. However the various implementations of this relatively simple idea make clear that in fact a wide field of possible embodiments exists. The current state of the art all suffer from some set of drawbacks, including allowing for ridesharing only with friends, being an invitation- only service, based the service on recurring schedule fixed-endpoint rides (carpools), lacking provision for fleet vehicles (thereby stranding passengers who happen not to be on a route), and others.
[0003] Hence, an improved method for ride sharing is still a long felt need.
BRIEF SUMMARY
[0004] An aspect of the invention provides for a method for introducing a shared-ride service comprising steps of: a. providing a shared-ride service adapted to increase occupancy of ride providers and decrease cost to riders;
b. offering rides from a first set of locations to a second set of locations to a set of riders; whereby a shared-ride service is introduced requiring service from and to a controlled set of locations, thereby facilitating introduction of said service. [0005] It is further within provision of the invention wherein said shared-ride service allows multiple riders to order shared rides having independent endpoints.
[0006] It is further within provision of the invention wherein said shared-ride service allows multiple riders to order shared rides having independent starting points.
[0007] It is further within provision of the invention wherein said first set of locations is selected from the group consisting of: hot-spots, hotels, motels, concert venues, sporting events, theatres, squares, train terminals, bus terminals, airports, sea ports.
[0008] It is further within provision of the invention wherein said first set of locations is not limited to a particular set of locations.
[0009] It is further within provision of the invention wherein said second set of locations is selected from the group consisting of: hot-spots, hotels, motels, concert venues, sporting events, theatres, squares, train terminals, bus terminals, airports, sea ports.
[0010] It is further within provision of the invention wherein said second set of locations is not limited to a particular set of locations.
[0011] The method of claim 2 wherein said cost C to riders is determined in terms of ride-provider price per ride N, premium S charged for each stop above two, and
S(X - l) + N
average number of riders per ride X by the formula X
[0012] The method of claim 8 wherein said ride-provider price per ride N is determined by factors selected from the group consisting of: areas travelled, route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance.
[0013] The method of claim 2 wherein said cost C to riders is determined in terms of ride-provider price N, premium S charged for each stop above two, and average
S{X - l)+ N
C≤
number of riders per ride X by the formula X
[0014] It is further within provision of the invention wherein said ride-provider price per ride N is determined by factors selected from the group consisting of: areas travelled, route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance.
[0015] It is within provision of the invention to disclose a system for introduction of a shared-ride service comprising: c. a shared-ride service adapted to increase occupancy of ride providers and decrease cost to riders;
d. a offer of a set of rides from a first set of locations to a second set of locations to a set of riders; whereby a shared-ride service is implemented requiring service only from and to a controlled set of locations, thereby facilitating introduction of said service.
[0016] It is further within provision of the invention wherein said shared-ride service allows multiple riders to order shared rides having independent endpoints.
[0017] It is further within provision of the invention wherein said shared-ride service allows multiple riders to order shared rides having independent starting points.
[0018] It is further within provision of the invention wherein said first set of locations is selected from the group consisting of: hot-spots, hotels, motels, concert venues, sporting events, theatres, squares, train terminals, bus terminals, airports, sea ports.
[0019] It is further within provision of the invention wherein said first set of locations is not limited to a particular set of locations.
[0020] It is further within provision of the invention wherein said second set of locations is selected from the group consisting of: hot-spots, hotels, motels, concert venues, sporting events, theatres, squares, train terminals, bus terminals, airports, sea ports.
[0021] It is further within provision of the invention wherein said second set of locations is not limited to a particular set of locations.
[0022] It is further within provision of the invention wherein said cost C to riders is determined in terms of ride-provider price per ride N, premium S charged for each stop above two, and average number of riders per ride X by the formula c = S{X - l) + N
X
[0023] It is further within provision of the invention wherein said ride-provider price per ride N is determined by factors selected from the group consisting of: areas travelled, route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance.
[0024] It is further within provision of the invention wherein said cost C to riders is determined in terms of ride-provider price N, premium S charged for each stop above c S{X -l)+ N
two, and average number of riders per ride X by the formula X
[0025] It is further within provision of the invention wherein said ride-provider price per ride N is determined by factors selected from the group consisting of: areas travelled, route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance.
[0026] These, additional, and/or other aspects and/or advantages of the present invention are: set forth in the detailed description which follows; possibly inferable from the detailed description; and/or learnable by practice of the present invention.
BRIEF DESCRIPTION OF THE DRAWINGS
[0027] In order to understand the invention and to see how it may be implemented in practice, a plurality of embodiments will now be described, by way of non-limiting example only, with reference to the accompanying drawings, in which:
FIG. 1 illustrates a system diagram consistent with an implementation of the invention; and
FIG. 2 illustrates a comparison of the invention with two alternate methods; and, FIG. 3 illustrates a ride-ordering interface of the invention.
DETAILED DESCRIPTION
[0028] The following description is provided, alongside all chapters of the present invention, so as to enable any person skilled in the art to make use of said invention and sets forth the best modes contemplated by the inventor of carrying out this invention. Various modifications, however, will remain apparent to those skilled in the art, since the generic principles of the present invention have been defined specifically to provide a means and method for providing a system and method for ride sharing.
[0029] In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of embodiments of the present invention. However, those skilled in the art will understand that such embodiments may be practiced without these specific details. Reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the invention.
[0030] The term 'plurality' refers hereinafter to any positive integer (e.g, 1,5, or 10).
[0031] The invention utilizes communication and information technologies based on cloud computing platforms and GIS services to provide shared rides having multiple stops and optimized routes, where the stops are optionally at riders' doors. The inventive algorithm is able to analyze ride orders, preferably in real-time or pre defined time intervals, producing an optimal solution taking into account such metrics as ride price and service level.
[0032] The invention comprises a system and method for an alternative in transportation, namely a cost-effective, dynamic and intelligent transportation service. The invention offers a door to door transportation service for the price of a bus-ride or less than full fare taxi by means of (inter alia) an algorithm that matches rides ordered by different passengers into a single shared route, calculating the most efficient transportation route based upon any of number of metrics such as total cost, total time elapsed, total distance travelled, and the like.
[0033] In one embodiment consistent with the invention, the existing taxi market is addressed which is currently extremely wasteful and expensive. The invention buys taxi rides from taxi stations at a fixed price, and sells them to users who share taxis for a lowered and much more attractive price. This model allows the invention to be profitable (since more than one rider may share the taxi, generating more than one user fare, while the system has bought only one rider). This is a system thus offering a 'win-win' to all parties.
[0034] Factors affecting the ride pricing include the following: a. Ride-provider price per ride. This may be a fixed predetermined price, or may be variable with various parameters including ride duration, length, number of stops, and the like. b. Average occupancy at a given time. As described above the price for a given passenger depends on the ratio of the number of vehicles to the number of passengers. This value may be recalculated continuously, or as an average value over a minute, hour, day, week, or the like. c. Historical data. Since the current price may not be known due to fluctuations in ride prices, rider price may be based on projections from historical data as to the price of their ride given the time of day, total occupancy, average occupancy, number of vehicles, time of day, season, and the like. d. Advertising budget. Since price for a given rider drops as the number of riders increases, it behooves both system operator and rider to advertise so as to bring more riders into the system. Thus the system operator may also provide incentives to riders such as coupons, discounts, or the like for recruiting new riders into the system. e. Desired price. Fixing a relatively low price may serve to attract potential riders to the system. f. Underwriting and partnerships. It is possible o collaborate with other groups in covering operational costs with financial and/or environmental interest in the success of the system, to aid in reducing the costs of rides. g. Profitability for the system operator h. Profitability of the system. i. Quality of service j. Different prices for different riders, based on ride distance, time, etc.
[0035] Amongst the novel aspects of the invention are the pricing algorithms for public or shared transport. Extant methods of pricing include fixing a price beforehand as in most standard forms of public transportation, determining a price based on distance and time (as in taxis), or taking a given price and dividing equally as in a shared taxi ride, the price determined by the inventive method involves the average system-wide ride price. This ride price is determined by the price the system operator must pay to provide the transport, as explained above, consisting of (for example) a number M of taxis hired, for a number K of riders. The price to the operator will be, in an artificially simplified example, M times the average taxi price N. The cost per rider will then be MN/K, which will decrease as K increases. Thus as the number of riders (or actually occupancy K M) increases, the average price per rider MN/K will decrease.
[0036] In simple terms the system buys a set of rides at a fixed price and sells them to a larger number of riders for a fee determined by the number of riders, such that individual riders pay less than they would if each rider took a ride alone.
[0037] As mentioned before, a price is agreed upon beforehand with some set of taxi drivers, ride services, or other ride providers. This price N may be dependent upon distance, time elapsed, with a premium S charged for each stop above the minimum two necessary for a given ride. Thus for a given ride the price for the system operator will be N, and if the average number of riders is X then the average cost per rider will be computed as S(X - l)+ N
X
[0038] This is a base price with no provision for profit of the system operator; to this base price a given fixed or percentage premium may be added for to provide a profit to the system operator.
[0039] As an example of the operation of the system consider the following scenarios: An average ride in Tel Aviv costs 35NIS under a certain set of circumstances. If two riders are found to share this ride, their cost will be 35/2 or 17.5N1S each. If two rides are employed and three passengers served, the price will be 35X2/3=23.3NIS. Thus the cost of a ride (for the rider) is determined not by the number of riders in a given vehicle but rather by the average occupancy over the entire system.
[0040] A key element of the invention is an optimization algorithm adapted to group riders based on their routes. Riders who order rides by means of the internet (e.g. through a dedicated site) agree to shared rides such that there is no expectation that the service provides standard lone taxi rides.
[0041] The algorithm may be adapted to minimize ride costs and/or to adapted to maximize the occupancy while maintaining a certain standard of service. There are obviously tradeoffs involved between the average occupancy, average ride time, and average ride distance which may be treated as dependent variables in an optimization problem, the independent 'variable' being the set of routes chosen.
[0042] We note that prior to introduction of this service, each passenger faced the world alone. With the aid of the inventive system, those riders willing to share a ride face the taxi operators as a group, allowing economies of scale and more efficient operation from the perspective both of the riders and the ride providers.
Operation of the system
In order to kick start the system, making it attractive for riders even when there are few riders participating and various steps may be taken. These include but are not limited to: a. Limiting area of coverage. The area covered may be limited to certain hotspots having a known high density of riders, such as transport hubs, entertainment districts, business centers, and the like. Likewise, hours of operation may be restricted to known hours of high transport demand.
b. Fixing an attractive price artificially intended to attract riders, until such time as enough riders use the system that the price is naturally attractive. For example, to enable a 10NIS ride economically, one needs (for example) 100 riders. 100 people would be happy to ride for this price; therefore it is worthwhile to offer rides for 10NIS even before there are 100 riders, in an attempt to attract at least this number of riders.
c. Use of taxis. Taxis are expensive, and therefore it may be worthwhile to offer taxi riders a considerable sum for the first phase of operation.
[0043] Simulations using various scenarios and data sources have been carried out with remarkable results. Compared to a private taxi service, the simulations show a drastic reduction in ride prices (up to 80%), and with an average increase of ride time of only 15%.
[0044] To achieve profitable operation, the system attempts to maximize occupancy rates, which generally will be easier to achieve in locales of higher population density. To overcome the difficulty of reaching critical mass of users the invention first focuses on hotspots, these being hubs of activity such as train stations, universities, events and the like, and will offer the service from/to these hot-spots.
[0045] The invention brings public transportation to the information age, enabling for the first time a real and dynamic match of supply to demand. At the system level, using this approach ensures higher average car occupancy and therefore fewer vehicles, and from the passenger's perspective it provides a service that fits his/her individual needs, optimizing any combination of cost, time, and the like.
[0046] The inventive method comprises the following experience for passengers: they are picked up at their door step and taken all the way to their final destination. It enables them to simply order rides in a few mouse-clicks (by means of computer, smartphone, or the like using a webpage or other proxy of the service), pay automatically with an online account, enjoy a reserved seat, have all the information accessible, order rides automatically by means of a calendar, and the like.
[0047] Being a highly efficient and sustainable transportation system, the invention reduces C02 emissions and cuts down traffic. Its approach to the user experience and personalization results in great service so that people may in fact elite the private car, and use the inventive method to get around.
[0048] The invention exploits the existence of social networks for public transportation, in effect offering a social transportation system. The invention turns urban density from a problem into an opportunity: the more people that use the service, the better and cheaper it is for everyone.
Business advantages
[0049] As opposed to a conventional shared ride in which the service cost depends on the number of riders, in the present inventive method it is possible to offer riders willing to share rides a reduced price even if they are not in fact sharing a ride for a given leg, or are sharing a ride but one having less than the average occupancy.
[0050] It is possible to reduce the cost of rides and 'kick start' the system while maintaining profit by means of an initial investment covering the losses expected during the phase of recruiting enough riders to maintain the initial artificially low price.
[0051] Furthermore, introduction of the system into hotspots initially will serve to attract customers while minimizing costs.
[0052] The rider perspective may be presented attractively by pointing out that all riders share costs and increase occupancy rates in order to achieve reduced overall prices for rides.
[0053] The system operator may profit in a number of ways, including: a. charging per customer (either flat rate, based on distance/time, or the like) b. charging customers a percentage of their calculated savings c. Advertising d. Purchases of ride services from venue operators, hotels, etc. e. Information sales (to riders, or to others concerning rider information such as distribution, frequency, etc.)
[0054] The ride optimization algorithm is presented in Fig. 1. Here the route calculation algorithm has a number of inputs including historical information, fleet data, geospatial data, traffic data, and real time taxi (or other ride provider) data, in addition to the current rider requests which form the most recent historical data. An optimization algorithm calculates a set of routes serving the current requests, and a comparison algorithm scores the routes using one or more metrics and/or directly compares routes in a binary fashion (comparing two sets of routes and deciding which is better and which is worse). If the metric is poor (has a low metric) and/or is worse than previously generated routes, the comparison function returns to the route calculation block which generates another possible set of routes.
[0055] Fig. 2 displays a flowchart comparing current and inventive methods. The top block depicts the current situation; a passenger pays some 50NIS cash to the driver. The middle block depicts a 'voucher rider' such as is often provided by businesses; the passenger is given ride privileges by his business, for example for free. The business pays a ride-provider (such as a taxi station, transport service or the like) a monthly fee of 45NIS for a seat, of which the station keeps 5 and forwards 40 to the driver. The inventive method is shown in the last block; here three passengers all share a 23NIS fee. The system operator takes from the combined 69NIS a 7NIS surcharge, leaving 62NIS. The ride provider (such as taxi station or like) similarly takes another 7NIS leaving 55NIS. This the driver takes as his fee for transporting the three passengers.
[0056] Fig. 3 discloses a possible user interface 300 for booking rides from a hotspot. This may be implemented as a web page, app window, or the like. The system offers a list menu 301 of possible starting points (which generally will be limited due to the finite number of hotspots) and another list menu 302 of possible start times. A free text field 303 may be used for the end point (since generally the possible endpoints will be unlimited in number), although it is within provision of the invention to use list menus for both start and end points, free text fields for either or both, or any other information input method as will be clear to one skilled in the art including voice input, guesses based on current location (as determined e.g. by GPS), historical requests, or the like. Once these fields have been filled (or conceivable beforehand simply given the current average occupancy) a price 304 is generated and displayed, as is an estimated ride time 305.
[0057] A concise outline of the method of operation is presented below: a. The system operator has agreements with ride providers, which include (inter alia) an agreed-upon ride pricelist (by means of route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance, and combinations of these) b. The system operator offers customers the possibility of ordering rides by means of the computerized system of the invention, paying by any suitable means such as credit card, online means such as paypal, or the like. Fee is determined by rates settled with the ride provider aforehand or in realtime. Members of the riding community may order rides in a shared vehicle, and thereby enjoy saving as described above. c. The system operator sends the ride provider a ride order including start, pickup points, dropoff points, pickup times, and endpoint. d. Users sign into the computer server of the system by means of a secure connection such as that provided by https. Fees are paid to the system operators' account. e. The system operator pays the ride provider a payment for the ordered route (once executed) in keeping with the agreements concerning such. The rider does not pay the driver; riders cannot choose their driver, and the driver cannot directly receive payment from any passenger. The passenger is listed by the system operator's server, and pays the system operator via a web service. f. Each month, riders are sent itemized bills for the rides they have taken and paid for using the system.
[0058] Although selected embodiments of the present invention have been shown and described, it is to be understood the present invention is not limited to the described embodiments. Instead, it is to be appreciated that changes may be made to these embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and the equivalents thereof.

Claims

CLAIMS What is claimed is:
1. A method for introducing a shared-ride service comprising steps of:
a. providing a shared-ride service adapted to increase occupancy of ride providers and decrease cost to riders;
b. offering rides from a first set of locations to a second set of locations to a set of riders; whereby a shared-ride service is introduced requiring service from and to a controlled set of locations, thereby facilitating introduction of said service.
2. The method of claim 1 wherein said shared-ride service allows multiple riders to order shared rides having independent endpoints.
3. The method of claim 1 wherein said shared-ride service allows multiple riders to order shared rides having independent starting points.
4. The method of claim 2 wherein said first set of locations is selected from the group consisting of: hot-spots, hotels, motels, concert venues, sporting events, theatres, squares, train terminals, bus terminals, airports, sea ports.
5. The method of claim 1 wherein said first set of locations is not limited to a particular set of locations.
6. The method of claim 1 wherein said second set of locations is selected from the group consisting of: hot-spots, hotels, motels, concert venues, sporting events, theatres, squares, train terminals, bus terminals, airports, sea ports.
7. The method of claim 1 wherein said second set of locations is not limited to a particular set of locations.
8. The method of claim 1 wherein said cost C to riders is determined in terms of ride-provider price per ride N, premium S charged for each stop above two, and average number of riders per ride X by a predetermined formula.
9. The method of claim 8 wherein said formula is C = — l) + N
X
10. The method of claim 8 wherein said ride-provider price per ride N is determined by factors selected from the group consisting of: areas travelled, route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance.
11. The method of claim 1 wherein said cost C to riders is determined in terms of ride-provider price N, premium S charged for each stop above two, and average number of riders per ride X by the formula < χ^+^
12. The method of claim 11 wherein said ride-provider price per ride N is determined by factors selected from the group consisting of: areas travelled, route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance.
13. A system for introduction of a shared-ride service comprising:
a. a shared-ride service adapted to increase occupancy of ride providers • and decrease cost to riders;
b. a offer of a set of rides from a first set of locations to a second set of locations to a set of riders; whereby a shared-ride service is implemented requiring service only from and to a controlled set of locations, thereby facilitating introduction of said service.
14. The system of claim 13 wherein said shared-ride service allows multiple riders to order shared rides having independent endpoints.
15. The system of claim 13 wherein said shared-ride service allows multiple riders to order shared rides having independent starting points.
16. The system of claim 13 wherein said first set of locations is selected from the group consisting of: hot-spots, hotels, motels, concert venues, sporting events, theatres, squares, train terminals, bus terminals, airports, sea ports.
17. The system of claim 13 wherein said first set of locations is not limited to a particular set of locations.
18. The system of claim 13 wherein said second set of locations is selected from the group consisting of: hot-spots, hotels, motels, concert venues, sporting events, theatres, squares, train terminals, bus terminals, airports, sea ports.
19. The system of claim 13 wherein said second set of locations is not limited to a particular set of locations.
20. The system of claim 13 wherein said cost C to riders is determined in terms of ride-provider price per ride N, premium S charged for each stop above two, and average number of riders per ride X by a predetermined formula.
21. The system of claim 13 wherein said formula is C = — ^+ ^
X
22. The system of claim 20 wherein said ride-provider price per ride N is determined by factors selected from the group consisting of: areas travelled, route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance.
23. The system of claim 13 wherein said cost C to riders is determined in terms of ride-provider price N, premium S charged for each stop above two, and average number of riders per ride X by the formula C≤ χ ^+^
24. The system of claim 22 wherein said ride-provider price per ride N is determined by factors selected from the group consisting of: areas travelled, route, areas travelled, pickup fee, dropoff fee, elapsed time, elapsed distance.
25. The method of claim 1 wherein said service uses an optimization algorithm, adapted to calculate a set of routes serving the current requests, which parameters are selected from the group consisting of: location of riders, historical information, fleet data, geospatial data, traffic data, real time ride provider data, rider requests.
26. The system of claim 13 wherein said service uses an optimization algorithm, adapted to calculate a set of routes serving the current requests, which parameters are selected from the group consisting of: location of riders, historical information, fleet data, geospatial data, traffic data, real time ride provider data, rider requests.
PCT/IB2012/002255 2011-11-14 2012-11-07 System and method for ride sharing WO2013072729A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201161559158P 2011-11-14 2011-11-14
US61/559,158 2011-11-14

Publications (1)

Publication Number Publication Date
WO2013072729A1 true WO2013072729A1 (en) 2013-05-23

Family

ID=48429046

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2012/002255 WO2013072729A1 (en) 2011-11-14 2012-11-07 System and method for ride sharing

Country Status (1)

Country Link
WO (1) WO2013072729A1 (en)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10458806B2 (en) 2015-01-27 2019-10-29 Beijing Didi Infinity Technology And Development Co., Ltd. Methods and systems for providing information for an on-demand service
WO2019232693A1 (en) * 2018-06-05 2019-12-12 Beijing Didi Infinity Technology And Development Co., Ltd. System and method for ride order dispatching
US20200090235A1 (en) * 2018-09-19 2020-03-19 Toyota Jidosha Kabushiki Kaisha Information providing device, information providing method, and non-transitory storage medium
WO2020174739A1 (en) * 2019-02-25 2020-09-03 Mitsubishi Electric Corporation System and method for scheduling of early rider and late rider
WO2021031637A1 (en) * 2019-08-20 2021-02-25 南京领行科技股份有限公司 Method and device for dispatching booked trip orders on basis of idle travel vehicles
WO2021031635A1 (en) * 2019-08-20 2021-02-25 南京领行科技股份有限公司 Non-idle travel vehicle-based booked order hybrid chain dispatching method and device
WO2021031634A1 (en) * 2019-08-20 2021-02-25 南京领行科技股份有限公司 Continuous order dispatching method and apparatus for advance order based on real-time one-way vehicle
US11062237B2 (en) 2018-02-06 2021-07-13 ANI Technologies Private Limited Method and system for maximizing share-ride bookings
US11151489B2 (en) 2015-02-26 2021-10-19 Uber Technologies, Inc. Computing system implementing multiple driver selection processes based on device locations
US11379761B2 (en) 2014-03-13 2022-07-05 Uber Technologies, Inc. Configurable push notifications for a transport service
US11429910B1 (en) 2021-08-05 2022-08-30 Transit Labs Inc. Dynamic scheduling of driver breaks in a ride-sharing service
US11537977B1 (en) * 2022-02-16 2022-12-27 Pandocorp Private Limited Method and system for optimizing delivery of consignments
US11671791B2 (en) 2015-07-10 2023-06-06 Uber Technologies, Inc. Selecting a messaging protocol for transmitting data in connection with a location-based service

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004295576A (en) * 2003-03-27 2004-10-21 Kureo:Kk Taxi dispatching program, taxi dispatching method, and taxi dispatching device
US20110059693A1 (en) * 2007-02-12 2011-03-10 O'sullivan Sean Shared transport system and service network
WO2011125059A2 (en) * 2010-04-08 2011-10-13 Way Better Ltd Public transport optimization

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004295576A (en) * 2003-03-27 2004-10-21 Kureo:Kk Taxi dispatching program, taxi dispatching method, and taxi dispatching device
US20110059693A1 (en) * 2007-02-12 2011-03-10 O'sullivan Sean Shared transport system and service network
WO2011125059A2 (en) * 2010-04-08 2011-10-13 Way Better Ltd Public transport optimization

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11379761B2 (en) 2014-03-13 2022-07-05 Uber Technologies, Inc. Configurable push notifications for a transport service
US11892312B2 (en) 2015-01-27 2024-02-06 Beijing Didi Infinity Technology And Development Co., Ltd. Methods and systems for providing information for an on-demand service
US10458806B2 (en) 2015-01-27 2019-10-29 Beijing Didi Infinity Technology And Development Co., Ltd. Methods and systems for providing information for an on-demand service
US11156470B2 (en) 2015-01-27 2021-10-26 Beijing Didi Infinity Technology And Development Co., Ltd. Methods and systems for providing information for an on-demand service
US11151489B2 (en) 2015-02-26 2021-10-19 Uber Technologies, Inc. Computing system implementing multiple driver selection processes based on device locations
US12051018B2 (en) 2015-02-26 2024-07-30 Uber Technologies, Inc. Computing system implementing a driver selection process based on device location
US11687851B2 (en) 2015-02-26 2023-06-27 Uber Technologies, Inc. Computing system implementing a driver selection process based on device location
US11671791B2 (en) 2015-07-10 2023-06-06 Uber Technologies, Inc. Selecting a messaging protocol for transmitting data in connection with a location-based service
US11062237B2 (en) 2018-02-06 2021-07-13 ANI Technologies Private Limited Method and system for maximizing share-ride bookings
US11514543B2 (en) 2018-06-05 2022-11-29 Beijing Didi Infinity Technology And Development Co., Ltd. System and method for ride order dispatching
WO2019232693A1 (en) * 2018-06-05 2019-12-12 Beijing Didi Infinity Technology And Development Co., Ltd. System and method for ride order dispatching
US20200090235A1 (en) * 2018-09-19 2020-03-19 Toyota Jidosha Kabushiki Kaisha Information providing device, information providing method, and non-transitory storage medium
US11900425B2 (en) * 2018-09-19 2024-02-13 Toyota Jidosha Kabushiki Kaisha Information providing device, information providing method, and non-transitory storage medium
CN113474797A (en) * 2019-02-25 2021-10-01 三菱电机株式会社 System and method for early and late rider dispatch
WO2020174739A1 (en) * 2019-02-25 2020-09-03 Mitsubishi Electric Corporation System and method for scheduling of early rider and late rider
WO2021031634A1 (en) * 2019-08-20 2021-02-25 南京领行科技股份有限公司 Continuous order dispatching method and apparatus for advance order based on real-time one-way vehicle
WO2021031635A1 (en) * 2019-08-20 2021-02-25 南京领行科技股份有限公司 Non-idle travel vehicle-based booked order hybrid chain dispatching method and device
WO2021031637A1 (en) * 2019-08-20 2021-02-25 南京领行科技股份有限公司 Method and device for dispatching booked trip orders on basis of idle travel vehicles
US11429910B1 (en) 2021-08-05 2022-08-30 Transit Labs Inc. Dynamic scheduling of driver breaks in a ride-sharing service
US11537977B1 (en) * 2022-02-16 2022-12-27 Pandocorp Private Limited Method and system for optimizing delivery of consignments

Similar Documents

Publication Publication Date Title
WO2013072729A1 (en) System and method for ride sharing
Agatz et al. Optimization for dynamic ride-sharing: A review
Cetin et al. Regulation of taxis and the rise of ridesharing
US11907869B2 (en) System and method for a transportation or freight capacity exchange for one or more transportation or freight capacity units
US20120116789A1 (en) Optimizing queue loading through variable admittance fees
JP7340652B2 (en) Shared vehicle management device, shared vehicle management system, and shared vehicle management method
US20150120453A1 (en) Real-time local offer targeting and delivery system
US20130246207A1 (en) System and method for dynamically adjusting prices for services
US20120209636A1 (en) System and method for facilitating and arranging air travel
US20210090199A1 (en) System for arranging transportation services and associated methods
Sant et al. A novel green IoT-based pay-as-you-go smart parking system
Spitadakis et al. WISETRIP-International multimodal journey planning and delivery of personalized trip information
Vij et al. The commercial viability of Mobility-as-a-Service (MaaS): What’s in it for existing transport operators, and why should governments intervene?
Yao et al. A new ride‐sharing model incorporating the passengers' efforts
Tafreshian et al. A traveler incentive program for promoting community-based ridesharing
US20140324620A1 (en) Increasing the utility of opportunistic and time critical goods and services
KR102590862B1 (en) Expense Payment Apparatus and Method for group purchase
WO2020142706A1 (en) Market Layer Price Queue Map Routing in Transportation Capacity and Space
Kaiser et al. An overview of different business models for public Wi-Fi and their implications on indirect revenue
Grous Sky high economics
US11562387B2 (en) System and method for managing inventory and distribution of hotel rooms by multiple brokers using an online interface
Masoud et al. Design and operation of efficient and budget-balanced shared-use mobility systems
JP2004341969A (en) Ticket reservation and sales system
Oliveri Martínez-Pardo Principles of Revenue Management and their applications
US20130173318A1 (en) Method, Apparatus and System for Perpetual Cyber Value Add Discount Process

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12848942

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205N DATED 22/07/2014)

122 Ep: pct application non-entry in european phase

Ref document number: 12848942

Country of ref document: EP

Kind code of ref document: A1