COMPUTER IMPLEMENTED METHOD FOR ALLOCATING DRIVERS AND PASSENGERS SHARING A TRIP

• US 20110153629A1
• Filed: 12/21/2009
• Published: 06/23/2011
• Est. Priority Date: 12/21/2009
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Lehmann, Jens, Sommer, David
• Granted Patent: US 8,126,903 B2
• Time in Patent Office: Days
• US Class Current: 707/758
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 30/06 Buying, selling or leasing transactions
• CPC Class Codes: G06Q 50/40 Business processes related to the transportation industry shipping G06Q10/083

Abstract

A computer implemented method for allocating drivers and passengers sharing a trip, the method being executed by a trip sharing service, the method comprising:

• • receiving a first service request;
  • specifying a first potential trip data object by the trip sharing service;
  • executing a matching method, the matching method checking the first potential trip data object against at least a second potential trip data object, the matching method comprising for each checking of the first against the second potential trip data objects the steps of:
    • comparing the specifications of the first potential trip data object with the specifications of the at least one second potential trip data object,
    • determining the degree of congruency of the specifications of the compared potential trip data objects,
    • assigning one role to the first and the second user;
    • adding the second potential trip data object to a result list in case the determined degree of congruency between the first and the second potential trip data object exceeds a predefined threshold.

Claims

1. A computer implemented method for allocating drivers and passengers sharing a trip, the method being executed by a trip sharing service, the method comprising:

receiving, by the trip sharing service, a first service request, the first service request being submitted from a first client device belonging to a first user, wherein the first service request comprises sufficient data to specify at least;

a starting time,

a place of departure and

a destination;

specifying, by the trip sharing service, a first potential trip data object by the trip sharing service, the specification being initiated upon receiving the first service request, the first potential trip data object being the result of processing the first service request, the specifications of the first potential trip data object comprising the starting time, an arrival time, the place of departure and the destination, the specifications of the first potential trip data object further comprising user related specifications;

executing, by the trip sharing service, a matching method, the matching method checking the first potential trip data object against at least a second potential trip data object, the second potential trip data object having been created by the trip sharing service upon receipt of a service request of a second user, the matching method comprising for each checking of the first against the second potential trip data objects the steps of;

comparing the specifications of the first potential trip data object with the specifications of the at least one second potential trip data object,

determining the degree of congruency of the specifications of the compared potential trip data objects,

assigning one role to the first and the second user, the role being taken from the group consisting of a driver role and a passenger role, wherein the assigned roles of the two users are distinct from each other and are determined upon comparison of at least the driver/passenger preferences specified in the first and in the second potential trip data object, wherein the user having been assigned the driver role is referred to as driver and the user having been assigned the passenger role is referred to as passenger;

adding the second potential trip data object to a result list in case the determined degree of congruency between the first and the second potential trip data object exceeds a predefined threshold, wherein the matching method has been executed successfully in case the result list comprises at least one second potential trip data objects after having checked the first potential trip data object against all second potential trip data objects available to the trip sharing service,

allocating the first user to a best matching user as trip accompany in case of a successful execution of the matching method, wherein the best matching user is the user corresponding to the trip data object in the result list having the highest degree of congruency with the first potential trip data object and wherein the matching method is executed successfully in case the result list comprises at least one matching potential trip data object.

2. The computer implemented method according to claim 1 further comprising:

determining, by the trip sharing service, in case of a successful execution of the matching method, the role of the first user and the role of a best matching user, wherein the potential trip data objects of the result list having the highest degree of congruency with the first potential trip data object is the best matching potential trip data object and wherein the best matching user is the user corresponding to the best matching potential trip data object,

sending, by the trip sharing service, a first matching result message to the client device belonging to the driver determined in the role determination step, the first matching result message comprising;

data specifying the passenger,

data specifying pick-up time, pick-up place of the passenger;

Sending, by the trip sharing service, a second matching result message to the client device belonging to the passenger determined in the role determination step, the second matching result message comprising;

data specifying the driver;

3. The computer implemented method according to claim 1 further comprising:

determining, by the trip sharing service, in case of a successful execution of the matching method, the role of the first user and the role of a best matching user, wherein the potential trip data objects of the result list having the highest degree of congruency with the first potential trip data object is the best matching potential trip data object and wherein the best matching user is the user corresponding to the best matching potential trip data object,

sending, by the trip sharing service, in case of a successful execution of the matching method, a first matching result message to the client device belonging to the driver determined in the role determination step, the first matching result message comprising;

data specifying the passenger,

data specifying pick-up time, pick-up place of the passenger;

receiving, by the trip sharing service, a driver'"'"'s acceptance message from the client device belonging to the driver in case the driver accepted the passenger as trip accompany, the passenger having been specified in the first matching result message;

sending, by the trip sharing service, in case of receiving a driver'"'"'s acceptance message, a second matching result message to the client device belonging to the passenger determined in the role determination step, the second result message comprising;

data specifying the driver;

receiving a passenger'"'"'s acceptance message from the client device belonging to the passenger in case the passenger accepted the driver as trip accompany, the driver having been specified in the second matching result message;

receiving by the trip sharing service, a driver'"'"'s rejection message from the client device belonging to the driver in case the driver rejected the passenger as trip accompany, the passenger having been specified in the first matching result message;

receiving by the trip sharing service, a passenger'"'"'s rejection message from the client device belonging to the passenger in case the passenger rejected the driver as trip accompany, the driver having been specified in the second matching result message;

evaluating, by the trip sharing service, in case of receiving a driver'"'"'s rejection message, in a first evaluation step, if at least one further potential trip data object and corresponding user was found by the matching method for the driver, the evaluation resulting in a termination of the method in case no further user matched, the evaluation resulting in the initiation of a new trip accompany allocation process in case at least one further user matched the driver, the allocation process beginning with the determination of the role of the former driver and the further matching user;

evaluating, by the trip sharing service, in case of receiving a passenger'"'"'s rejection message, in a second evaluation step, if at least one further potential trip data object and corresponding user was found by the matching method for the passenger, the evaluation resulting in a termination of the method in case no further user matched, the evaluation resulting in the initiation of a new trip accompany allocation process in case at least one further user matched the passenger, the allocation process beginning with the determination of the role of the former passenger and the further matching user;

sending, by the trip sharing service, in case of receiving a passenger'"'"'s acceptance message, a first notification message to the device belonging to the driver and sending a second notification message to the device belonging to the passenger, the first and second notification messages comprising a notification on the arrangement of the trip;

4. The computer implemented method according to claim 1,

wherein the starting time specified in the first potential trip data object is the earliest acceptable starting time for the first user,

wherein an arrival time is specified in the first potential trip data object, the arrival time being the latest acceptable arrival time for the first user,

wherein the starting time specified in the second potential trip data object is the earliest acceptable starting time for the second user,

wherein an arrival time is specified in the second potential trip data object, the arrival time being the latest acceptable arrival time for the second user.

5. The computer implemented method according to claim 1, wherein the matching method comprises a permissive location matching method, the location matching method comprising:

comparing, by the trip sharing service, the pick-up radius specified by the first user with the pick-up radius specified by the second user, the first pick-up radius determining the maximum acceptable detour for picking-up passengers for the first user, the second pick-up radius determining the maximum acceptable detour for picking-up passengers for the second user;

comparing, by the trip sharing service, the drop-off radius specified by the first user with the pick drop-off radius specified by the second user, the first drop-off radius determining the maximum acceptable detour for dropping-off passengers for the first user, the second drop-off radius determining the maximum acceptable detour for dropping-off passengers for the second user;

determining, by the trip sharing service, the larger of the two pick-up radiuses and the larger of the two drop-off radiuses;

calculating, by the trip sharing service, a pick-up area, the pick-up area being a circle around the place of departure of the user having assigned the larger pick-up radius, the circle having as radius the larger of the two pick-up radiuses;

calculating, by the trip sharing service, a drop-off area, the drop-off area being a circle around the destination location of the user having assigned the larger drop-off radius, the circle having as radius the larger of the two drop-off radiuses;

determining, by the trip sharing service, in a first determination step, if the place of departure of the user having assigned the smaller pick-up radius lies within the pick-up area;

determining, by the trip sharing service, in a second determination step, if the destination location of the user having assigned the smaller drip-off radius lies within the drop-off area;

determining, by the trip sharing service, the matching score of the potential trip data objects corresponding to the first and the second user according to the results of the first and the second determination steps, wherein the matching score is highest if the place of departure of the user having assigned the smaller pick-up radius lies within the pick-up area and the destination location of the user having assigned the smaller drip-off radius lies within the drop-off area.

6. The computer implemented method according to claim 1, wherein the step of comparing the specifications of the first potential trip data object with the specifications of the at least one second potential trip data object is implemented as a comparison of vectors, wherein

a first vector represents the first potential trip data object,

a second vector represents the second potential trip data object,

the first and the second vector each comprise multiple dimensions, wherein each dimension represents one specification of the represented potential trip data object, wherein each dimension has associated a weight,

wherein the comparison of the first and the second vector comprises a comparison of the angle of both vectors in a multi-dimensional space and wherein the weight of each dimension determines the impact of the corresponding dimension on the result of the comparison.

7. The computer implemented method according to claim 1, wherein the step of comparing the specifications of the first potential trip data object with the specifications of the at least one second potential trip data object to calculate a matching score comprises:

determining the distance of the places of departure of the first and the second potential trip data objects,

determining the distance of the destinations of the first and the second potential trip data objects,

determining the temporal proximity of the starting times of first and the second potential trip data objects, and

determining the temporal proximity of the arrival times of first and the second potential trip data objects,

wherein the matching score raises with the determined degree of similarity regarding the compared starting times, arrival times, places of departures and destinations.

8. The computer implemented method according to claim 1, wherein specifications of the first and the at least one second potential trip data object in addition each comprise:

a specification of the price a driver expects to receive from each passenger and of the amount of money a passenger is willing to pay to the driver for being carried.

9. The computer implemented method according to claim 1, wherein specifications of the first and the at least one second potential trip data object in addition each comprise:

a specification of smoker/non-smoker preferences of a user;

a specification of the taste in music of a user;

a specification of the preferred age of a trip accompany;

a specification of the preferred gender of a trip accompany;

a specification of the preferred minimum acquaintance of the first user with the second user, the acquaintance being calculated from the number of trips shared by both users in the past;

a specification of the preferred minimum social proximity of one user to another user, the social proximity being determined by the consideration of social groups both users are member of, the social groups being taken from the group consisting of social online-communities, employee lists of companies and social groups being defined within the trip sharing service.

10. The computer implemented method according to claim 1,

wherein the specifications of the first and the at least one second potential trip data object each comprise a user'"'"'s preference to act as driver, the preference to act as driver being specified as a value of a scale, the scale comprising at least three different values, the value indicating the degree of the user'"'"'s willingness to act as driver,

wherein the driver role is never allocated to a user who'"'"'s preference to act as driver is zero,

wherein the driver role is always allocated to a user who'"'"'s preference to act as driver is the maximum possible according to the scale,

wherein the probability of a user to be allocated the driver role raises with the specified degree of preference of a user to act as driver.

11. The computer implemented method according to claim 1, wherein the starting location and the destination location of each potential trip data object is determined by mapping tags to unequivocal addresses, the tags being taken from the group of general tags, user specific tags, group specific tags, location tags and route tags.

12. The computer implemented method according to claim 1,

wherein assigning one role to each of the users comprises assigning the driver role to that user who'"'"'s starting point is the most distant starting point from the destination location of the first user and who'"'"'s preference to act as driver is greater than zero.

13. The computer implemented method according to claim 1, wherein the trip sharing service receives a request from an event managing service hosted on a remote server, the event managing service providing via a graphical user interface its customers the option to book tickets, the graphical user interface providing the customer in addition with the option to select the trip sharing service for traveling to the booked event, wherein the selection of this trip sharing service option results in the submission of a trip sharing service request to the trip sharing service, the trip sharing service request comprising at least the e-mail address of the customer and the starting time and location of the booked event, and wherein at least one result generated during the execution of the trip sharing service is sent as meeting request e-mail to the customers e-mail address.

14. A computer readable storage medium containing instructions that when executed by a processor cause the processor to perform a trip sharing service method, the trip sharing service method allocating drivers and passengers sharing a trip, the method comprising:

receiving, by the trip sharing service, a first service request, the first service request being submitted from a first client device belonging to a first user, wherein the first service request comprises sufficient data to specify at least;

a starting time,

a place of departure and

a destination;

specifying, by the trip sharing service, a first potential trip data object by the trip sharing service, the specification being initiated upon receiving the first service request, the first potential trip data object being the result of processing the first service request, the specifications of the first potential trip data object comprising the starting time, an arrival time, the place of departure and the destination, the specifications of the first potential trip data object further comprising user related specifications;

executing, by the trip sharing service, a matching method, the matching method checking the first potential trip data object against at least a second potential trip data object, the second potential trip data object having been created by the trip sharing service upon receipt of a service request of a second user, the matching method comprising for each checking of the first against the second potential trip data objects the steps of;

comparing the specifications of the first potential trip data object with the specifications of the at least one second potential trip data object,

determining the degree of congruency of the specifications of the compared potential trip data objects,

assigning one role to the first and the second user, the role being taken from the group consisting of a driver role and a passenger role, wherein the assigned roles of the two users are distinct from each other and are determined upon comparison of at least the driver/passenger preferences specified in the first and in the second potential trip data object, wherein the user having been assigned the driver role is referred to as driver and the user having been assigned the passenger role is referred to as passenger;

adding the second potential trip data object to a result list in case the determined degree of congruency between the first and the second potential trip data object exceeds a predefined threshold, wherein the matching method has been executed successfully in case the result list comprises at least one second potential trip data objects after having checked the first potential trip data object against all second potential trip data objects available to the trip sharing service,

allocating the first user to a best matching user as trip accompany in case of a successful execution of the matching method, wherein the best matching user is the user corresponding to the trip data object in the result list having the highest degree of congruency with the first potential trip data object and wherein the matching method is executed successfully in case the result list comprises at least one matching potential trip data object.

15. A data processing system comprising a server and at least a first client device, the server and the first client device being capable of communicating with one another, the first client device being capable to submit a first service request to the service, the server being capable to generate a result in response to the first service request and to return the result to the first client device,

the server including:

processing means for executing the instructions;

a network interface for connecting the computer system to a network;

a computer readable storage medium containing instructions that when executed by a processor cause the processor to perform a trip sharing service for allocating drivers and passengers sharing a trip, the trip sharing service being a computer-implemented method comprising the steps of;

receiving a first service request by the trip sharing service, the first service request being submitted from a first client device belonging to a first user, wherein the first service request comprises sufficient data to specify at least;

a starting time,

a place of departure and

a destination;

specifying a first potential trip data object by the trip sharing service, the specification being initiated upon receiving the first service request, the first potential trip data object being the result of processing the first service request, the specifications of the first potential trip data object comprising the starting time, an arrival time, the place of departure and the destination, the specifications of the first potential trip data object further comprising user related specifications;

executing a matching method, the matching method checking the first potential trip data object against at least a second potential trip data object, the second potential trip data object having been created by the trip sharing service upon receipt of a service request of a second user, the matching method comprising for each checking of the first against the second potential trip data objects the steps of;

comparing the specifications of the first potential trip data object with the specifications of the at least one second potential trip data object,

determining the degree of congruency of the specifications of the compared potential trip data objects,

assigning one role to the first and the second user, the role being taken from the group consisting of a driver role and a passenger role, wherein the assigned roles of the two users are distinct from each other and are determined upon comparison of at least the driver/passenger preferences specified in the first and in the second potential trip data object, wherein the user having been assigned the driver role is referred to as driver and the user having been assigned the passenger role is referred to as passenger;

adding the second potential trip data object to a result list in case the determined degree of congruency between the first and the second potential trip data object exceeds a predefined threshold, wherein the matching method has been executed successfully in case the result list comprises at least one second potential trip data objects after having checked the first potential trip data object against all second potential trip data objects available to the trip sharing service,

allocating the first user to a best matching user as trip accompany in case of a successful execution of the matching method, wherein the best matching user is the user corresponding to the trip data object in the result list having the highest degree of congruency with the first potential trip data object and wherein the matching method is executed successfully in case the result list comprises at least one matching potential trip data object.

16. The data processing system according to claim 15, the first client device comprising:

a storage medium having installed a calendar application and a service integration module, the service integration module having read and write access to a calendar application installed on the first client device, the service integration module comprising instructions, the instructions when executed by a processor cause the processor to perform a method for integrating the trip sharing service in the calendar application, the method comprising;

submitting a service request to the trip sharing service by the service integration module, the service integration module having read and write access to the calendar application, the service request being a call of a first web service interface of the trip sharing service, the call of the first web service interface initiating the execution of the trip sharing service and the generation of at least one result;

receiving the at least one result by the service integration module via a web service interface provided by the trip sharing service, the web service interface being taken from the group consisting of the first web service interface and a second web service interface;

processing the result by the service integration module, the processing comprising extracting data required for specifying an event in an electronic calendar of the calendar application from the result, the event being taken from the group consisting of singular events and recurring events, the recurring events being events with a particular recurrence pattern, the event being a data object in an electronic calendar of the calendar application; and

updating the electronic calendar of the calendar application, the updating comprising the execution of updating steps, the updating steps being taken from the group consisting of creating, deleting and modifying an event in the electronic calendar of the calendar application by the service integration module in response to receiving the at least one result;

means for displaying the graphical user interface of the electronic calendar application and the updates introduced to the calendar application;

processing means for executing instructions;

input means for specifying via a graphical user interface provided by the service integration module a service request to the trip sharing service, the input being provided by the user;

a network interface for connecting the computer system to a network.

17. The data processing system according to claim 16, wherein the service integration module is in addition operable to automatically predict a required calendar event by:

analyzing events within the electronic calendar;

predicting and specifying at least one required event;

assigning the at least one predicted required event additional data required by the service for execution;

submitting a service request to the first web service interface of the trip sharing service, the service request comprising the data of the predicted required event, the call of the first web service interface initiating the execution of the trip sharing service and the generation of at least one result;

and wherein the service integration module is a software program being interoperable with the calendar program and being selected from the group consisting of;

a software implemented as ‘

plug-in’

for the calendar application,

an independent service program being registered as event listener with a calendar event, and

an independent service program searching the calendar application for new calendar entries on a regular basis.

18. The data processing system according to claim 15, the storage medium of the at least one client having installed a trip manager program, the trip manager program comprising instructions, the instructions when executed by a processor cause the processor to perform a method for managing trips arranged by the trip sharing service, the method comprising:

managing predicted trip data objects in a first list of trip data objects, the first list residing solely on the first client device;

managing published trip data objects in a second list of trip data objects, the second list residing on the first client device, each published trip data object corresponding to a service request submitted to the trip sharing service from the first client device, wherein moving a predicted trip data object from the first list to the second list results in a submission of a service request to the trip sharing service,

managing arranged trip data objects in a third list of trip data objects, each arranged trip data object corresponding to a trip in the future having been successfully organized by the trip sharing service in response to receiving a service request, the third list residing on the first client device and on the server,

managing past trip data objects in a fourth list of trip data objects, each past trip data object corresponding to a past trip having been successfully organized by the trip sharing service, the fourth list residing on the first client device and on the server.

19. The data processing system according to claim 15, the first client device including:

a computer-readable storage medium containing instructions that when executed by a processor cause the processor to perform a method for integrating the trip sharing service into an calendar application, the calendar application being installed on the computer-readable storage medium, the method comprising;

submitting, by the calendar application, a service request to the trip sharing service, the service request comprising the specification of a trip event, the service request being sent in the form of a first meeting request email to a service e-mail address by the calendar application, wherein the service e-mail address represents the trip sharing service, wherein the receipt of the service request initiates the execution of the trip sharing service;

receiving, by the calendar application of the first client device, a result returned by the trip sharing service hosted on the server, the result having the form of an update request by the service, the update request being an update request e-mail sent to the e-mail address used by the calendar application for sending the service request, the update request e-mail being taken from the group consisting of a meeting request response e-mail and a second meeting request e-mail; and

executing the received update request by the calendar application, resulting in an automatic update of the electronic calendar of the calendar application;

means for displaying the graphical user interface of the electronic calendar application and the updates introduced to the calendar application;

processing means for executing the instructions;

input means for specifying via a graphical user interface provided by the service integration module a service request to the service to be integrated in the calendar application, the input being provided by the user;

a network interface for connecting the computer system to a network.

20. The data processing system according to claim 15, wherein the client is a mobile processing device, and wherein the network interface is an interface of the mobile processing device providing ongoing or transient means to exchange data with other processing devices.