US20180073878A1 - Determining a travel route - Google Patents

Abstract

An approach for determining a route is provided. A rule is retrieved which indicates a number of recommended routes passing through a constrained area is not permitted to exceed a threshold. N+1 recommended routes passing through the constrained area are determined. Based in part on a determination that N+1 does not exceed the threshold, an (N+2)-th route passing through the constrained area is determined. It is determined that (N+2) is greater than the threshold. Responsive to determining that N+2 is greater than the threshold, the constrained area is identified as having congested traffic, the (N+2)-th route is determined to pass through the constrained area having congested traffic, and a fee is determined to charge a vendor whose location is included in the (N+2)-th route. The fee promotes a reduction in additional vehicles entering the constrained area.

Description

• This application is a continuation application claiming priority to Ser. No. 14/799,662 filed Jul. 15, 2015 which is a divisional application claiming priority to Ser. No. 12/578,780 filed Oct. 14, 2009 which has been abandoned.
FIELD
• The present invention relates to a data processing method and system for providing a location preference in a routing algorithm, and more particularly to technique for determining travel routes that include locations as a result of auctions.
BACKGROUND
• With an increased use of Global Positioning System (GPS) units to determine travel routes, travelers are following routes recommended to them, rather than using maps or following familiar paths. Conventional route planning systems determine optimal routes based on different preferred conditions, including minimizing travel time or minimizing the distance traveled. By focusing on optimal route determination, known route planning systems fail to consider non-optimal routes whose presentation to travelers may have value to other parties. Further, the conventional route planning systems fail to account for a dynamic market value associated with presenting a route to a traveler. Thus, there exists a need to overcome at least one of the preceding deficiencies and limitations of the related art.
SUMMARY
• In one or more embodiments, the present invention provides a computer-implemented method of determining a route that includes a location as a result of an auction. The method comprises:
• receiving a request from a user for a determination of a route from a first point to a second point;
• selecting a plurality of locations capable of being included along a plurality of routes from the first point to the second point, wherein the selecting the plurality of locations is based on the request;
• initiating an auction among a plurality of vendors that submits a plurality of bids in the auction, wherein the vendors and the bids are associated in a one-to-one correspondence;
• determining that a vendor of the plurality of vendors wins the auction based on a bid of the plurality of bids, wherein the bid is associated with the vendor;
• a processor of a computer system determining the route so that a location of the plurality of locations is included along the route, wherein the location is associated with the vendor that wins the auction based on the bid; and
• presenting the determined route to the user as the recommended route.
• A system, program product and process for supporting computing infrastructure corresponding to the above-summarized method is also described and claimed herein.
• The present invention provides a technique for presenting travel routes to travelers, where the routes are generated so as to include locations associated with vendors that submit winning bids in auctions.
BRIEF DESCRIPTION OF THE DRAWINGS
• FIG. 1 is a block diagram of a system for determining a travel route that includes a location based on an auction, in accordance with embodiments of the present invention.
• FIG. 2 is a flowchart of a process for determining a travel route in the system ofFIG. 1, where the travel route includes a location as a result of a real-time auction, in accordance with embodiments of the present invention.
• FIG. 3 is a flowchart of a process for determining a travel route in the system ofFIG. 1, where the travel route includes a location as a result of an auction initiated prior to a request for the travel route, in accordance with embodiments of the present invention.
• FIG. 4 is a flowchart of a process that determines a route according to the process ofFIG. 2 orFIG. 3 and that determines additional fee(s) for auction winner(s) based on an actual route taken, in accordance with embodiments of the present invention.
• FIG. 5 is a flowchart of a process that determines a travel route according to the process ofFIG. 2 orFIG. 3 and based on a rule that limits distance, in accordance with embodiments of the present invention.
• FIG. 6 is a flowchart of a process that determines a travel route according to the process ofFIG. 2 orFIG. 3 and based on a rule that limits the number of recommended routes that pass through a constrained area, in accordance with embodiments of the present invention.
• FIG. 7 is a block diagram of a computer system included in the system ofFIG. 1 and that implements the process ofFIG. 2 and/or the process ofFIG. 3, in accordance with embodiments of the present invention.
DETAILED DESCRIPTIONOverview
• Embodiments of the present invention provide a preference for a given route to pass by a particular location, based on an auction. Multiple vendors and/or other entities bid in an auction to ensure that a route recommended to a user (i.e., traveler) passes by a particular location associated with the winning bidder (i.e., the vendor or other entity that submits the winning bid). In one embodiment, a route calculation service utilizes an algorithm that takes into account a user's profile information to determine the particular vendors and/or other entities that are permitted to bid in an auction to determine a travel route. In another embodiment, additional route generation rules may be applied to determine whether the route determined by the auction is actually presented to a user as a recommended route.
System for Determining a Route by Using an Auction-Based Location Preference
• FIG. 1 is a block diagram of a system for determining a travel route that includes a location as a result of an auction won by a bid submitted by a vendor associated with the location, in accordance with embodiments of the present invention. As used herein, an auction has multiple vendors and/or other entities submitting bids for determining a route that includes a location associated with the winning bidder. The vendor or other entity submitting a winning bid (e.g., the highest bid) ensures that a travel route recommended to a user passes by a location associated with the vendor or other entity that submitted the winning bid.System100 includes acentral computer system102, computer systems104-1 . . .104-N ofauction participants 1 . . . N (i.e., vendors and/or other entities), anetwork106, and avehicle108 that includes a software-implemented route calculation service (RCS)110 and optionally a global positioning system (GPS)112.System100 may also include optionaluser profile data114 and one or more optionalroute calculation rules116.User profile data114 androute calculation rules116 may be stored in one or more computer data storage units coupled tocentral computer system102 or coupled to a data processing unit (e.g., GPS112) residing invehicle108.
• Computer systems104-1 . . .104-N are managed byauction participants 1 . . . N, respectively, where N≧1. Theauction participants 1 . . . N are herein also referred to asvendors 1 . . . N. The present invention contemplates that thevendors 1 . . . N may include one or more businesses and/or one or more other types of organizational entities. Via a network (not shown), computer systems104-1 . . .104-N send identifications ofvendors 1 . . . N and identifications of multiple locations tocentral computer system102 to indicate thatvendors 1 . . . N may participate in an auction-based location preference system managed bycentral computer system102. Each vendor invendors 1 . . . N is associated with one or more locations of the aforementioned multiple locations. For example, ifVendor 1 is associated withLocation 1 andVendor 1 is the owner of a grocery store, thenLocation 1 may be the site of the grocery store.
• RCS110 receives the identifications of thevendors 1 . . . N and the identifications of the multiple locations fromcentral computer system102 vianetwork106. RCS110 determines a travel route that includes a location associated with a vendor included invendors 1 . . . N, where the vendor submitted a winning bid in an auction. In one embodiment, thecentral computer system102 receives indications from multiple route calculation services in multiple vehicles (e.g.,route calculation service110 invehicle108 and other route calculation services in other vehicles not shown inFIG. 1) of which vendors have submitted winning bids in auctions and notifies the vendor computer systems of computer systems104-1 . . .104-N that are managed by the vendors who submitted winning bids. The determination of the travel route may also be based onuser profile data114 and/orroute calculation rules116. Further descriptions of the functionality of components ofsystem100 are found in the discussions below relative toFIGS. 2-6.
Processes for Determining a Route by Using an Auction-Based Location Preference
• FIG. 2 is a flowchart of a process for determining a travel route in the system ofFIG. 1, where the process includes a location in the travel route as a result of a real-time auction won by a bid submitted by a vendor associated with the location, in accordance with embodiments of the present invention. The process of determining a travel route by using a real-time auction in the system ofFIG. 1 starts atstep200. Instep202, RCS110 (seeFIG. 1) receives identifications of vendor(s) and location(s) associated with the vendor(s), where the vendor(s) are potential participants in a real-time auction to determine a travel route. That is, RCS110 (seeFIG. 1) receives an identification of each vendor who may bid in a real-time auction to ensure that a location associated with the vendor is included in a travel route determined by the RCS. The location(s) are associated with the vendor(s) in a one-to-one correspondence. In one embodiment, the location associated with the vendor is a site (e.g., identified by address or geographic coordinates) at which the vendor conducts business.
• Instep204, RCS110 (seeFIG. 1) receives a request issued by a user of GPS112 (seeFIG. 1) for a travel route for vehicle108 (seeFIG. 1) to travel from a first geographic location (a.k.a. point A, first point or starting point) to a second geographic location (a.k.a. point B, second point or ending point). The request received instep204 may include, for example, the addresses or geographic coordinates of point A and point B.
• Instep206, RCS110 (seeFIG. 1) optionally retrieves user profile data from a computer data storage unit, where the user profile data describes the user who issued the request instep204. The user profile data includes data describing the user's past behavior and may also include predicted future behavior of the user. The user profile data may include one or more preferences that a user has for purchasing one or more particular goods and/or one or more particular services, where the preference(s) may be based on, for example, past purchases made by the user and/or user-specified selections of goods and/or services.
• Instep208, based on the request received instep204 and based on user profile data if user profile data is retrieved instep206, RCS110 (seeFIG. 1) selects a plurality of locations of the locations whose identifications are received instep202. A routing algorithm implemented by RCS110 (seeFIG. 1) can include one or more locations of the plurality of locations selected instep208 along a route that conforms to the request received instep204. As used herein, a location included along a route is defined as a location that is located at an address on a segment of the route or is located at a nearest distance to the route where the nearest distance does not exceed a predefined distance or a user-specified distance. A location included along a route is further defined to be not the starting point of the route and not the ending point of the route.
• Instep210, for vendors associated with the locations selected instep208, RCS110 (seeFIG. 1) initiates an auction. The auction is conducted by central computer system102 (seeFIG. 1) to determine winning bid(s) and the vendor(s) (i.e., winning vendor(s)) that submit the winning bid(s). The winning bid(s) by winning vendor(s) ensure that a route from point A to point B that is to be presented to the user includes location(s) associated with the winning vendor(s). In one embodiment, the central computer system determines a winning bid as being the highest-valued bid in the auction. In another embodiment, the central computer system determines multiple winning bids from multiple vendors, where the multiple vendors do not compete with each other in terms of the goods and/or services they offer according to predefined criteria.
• Instep212, RCS110 (seeFIG. 1) determines a route from point A to point B that conforms to the request received instep204 and that includes the location(s) associated with the winning vendor(s). The determination of the route instep212 may also be based on user profile data optionally retrieved instep206.
• In one embodiment, RCS110 (seeFIG. 1) notifies the user if user profile data is a basis for the route determined instep212. In another embodiment, the user is not notified if user profile data is a basis for the route determined instep212.
• Instep214, RCS110 (seeFIG. 1) instructs a data processing system (e.g.,GPS112 inFIG. 1) residing in vehicle108 (seeFIG. 1) that the route determined instep212 is to be presented to the user as a recommended route. In response, the data processing system (e.g.,GPS112 inFIG. 1) presents (e.g., displays) the route determined instep212 to the user as a recommended route. After the recommended route is presented and in response to the user traveling the recommended route and actually driving past a location associated with a winning vendor, an entity controlling the RCS, the user, and/or another party (e.g., a charitable organization) are compensated for their participation based on the amount bid by the winning vendor. The process ofFIG. 2 ends atstep216.
• In one embodiment, step214 also includes the RCS notifying the user that the recommended route passes by the aforementioned location(s) and that the winning vendor(s) are associated with the location(s). The notification to the user may also include an identification of a category of goods and/or services provided by a winning vendor.
• As an example of a portion of the process ofFIG. 2, RCS110 (seeFIG. 1) receives a user's request for determining a route from point A to point B (see step204). The RCS retrieves the user's profile data (see step206), which indicates that the user likes luxury automobiles. Based on the user's request and the retrieved profile data that indicates that user likes luxury automobiles, the RCS selects Location 1 (i.e., the location of Dealer X) and Location 2 (i.e., the location of Dealer Y), where Dealer X and Dealer Y are luxury automobile dealers (see step208).Location 1 or Location 2 may be included along a route from point A to point B, where the route is to be determined by the RCS. The RCS invites Dealer X and Dealer Y to participate in an auction (e.g., via web services) to ensure that the route to be determined passes byLocation 1 if Dealer X wins the auction or Location 2 if Dealer Y wins the auction (see step210). In the auction, Dealer X bids $1.10 to ensure that the route passes byLocation 1 and Dealer Y bids $1.05 to ensure that the route passes by Location 2. Since Dealer X's bid amount is greater than Dealer Y's bid amount, Dealer X wins the auction and RCS determines a route from point A to point B that passes byLocation 1. The RCS directs a system in the vehicle of the user to display the determined route from point A to point B as a recommended route (see step214). The RCS notifies the user that the recommended route passes byLocation 1 and thatLocation 1 is associated with Dealer X. After the user takes the recommended route and actually drivespast Location 1, an entity controlling the RCS and the user are paid for their participation based on the amount bid by Dealer X in the auction.
• In a variation of the example presented above with Dealer X and Dealer Y participating in an auction, multiple routes from point A to point B (including the recommended route) are presented to the user and the user is compensated (e.g., with a credit to an account) in response to the user selecting the recommended route instead of the other presented routes.
• In another example, a user requests a route from point A to point B (see step204) and the user's profile data indicates a preference for luxury automobiles and for visiting coffee shops (see step206). The auction (see step210) accepts bids from a first set of luxury automobile dealer vendors and bids from a second set of coffee shop vendors. The result of the auction is that Luxury Automobile Dealer 1 (i.e., the luxury automobile dealer that submitted the highest bid among the first set of vendors) is a first winning vendor and Coffee Shop 1 (i.e., the coffee shop vendor that submitted the highest bid among the second set of vendors) is a second winning vendor. The RCS determines a route from point A to point B (see step212) that includesLocation 1 and Location 2, whereLocation 1 is the site at whichLuxury Automobile Dealer 1 conducts business and where Location 2 is the site ofCoffee Shop 1.
• FIG. 3 is a flowchart of a process for determining a travel route in the system ofFIG. 1, where the process includes a location in the travel route as a result of an auction initiated prior to receiving a request for determining the route (a.k.a. an ahead-of-time auction), in accordance with embodiments of the present invention. The process of determining a travel route by using an ahead-of-time auction in the system ofFIG. 1 starts atstep300. Instep302, RCS110 (seeFIG. 1) receives parameters from vendors and bids from vendors for an auction in which the winning bid(s) submitted by winning vendor(s) ensure that a route to be presented to a user includes location(s) associated with the winning vendor(s). The location(s) are associated with the vendor(s) in a one-to-one correspondence. In one embodiment, the location associated with the vendor is a site (e.g., identified by an address or geographic coordinates) at which the vendor conducts business.
• One or more parameters received instep302 may specify how a particular vendor's bid in the auction varies based on predefined criteria. For example, parameters may specify how a vendor's bid varies by: the time of day at which the route is requested, the value of a particular customer based on the customer's past behavior (e.g., past purchases) or predicted future behavior in the user profile data, and/or events that occurred (or will occur) within a specified time period in an area through which a requested route passes.
• One or more parameters received instep302 may specify a pre-cached auction bid. Multiple vendors may submit pre-cached auction bids that allow the auction to be conducted instantaneously (see step310) in response to receiving the user's request for a route from point A to point B (see step304) and selecting locations that can be included along routes from point A to point B (see step308). In one embodiment, the parameter(s) specifying a pre-cached auction bid by a vendor includes the vendor's maximum bid amount for auctions to be conducted. In another embodiment, the parameters include X and N, where the vendor's maximum pre-cached auction bid amount X is submitted for N auctions. In still another embodiment, the parameters include X, N and T, where the vendor's maximum pre-cached auction bid amount X is submitted for N auctions, where there is not less than T time units between successive auctions. For example, a vendor may specify parameters that indicate the vendor is willing to bid up to $1.20 20 times for auctions where successive auctions are not less than 20 minutes apart.
• Instep304, RCS110 (seeFIG. 1) receives a request issued by a user of GPS112 (seeFIG. 1) for a travel route for vehicle108 (seeFIG. 1) to travel from a first geographic location (a.k.a. point A, first point or starting point) to a second geographic location (a.k.a. point B, second point or ending point). The request received instep304 may include, for example, the addresses or geographic coordinates of point A and point B.
• Instep306, RCS110 (seeFIG. 1) optionally retrieves user profile data from a computer data storage unit, where the user profile data describes the user who issued the request instep304. The user profile data includes data describing the user's past behavior and may also include predicted future behavior of the user. The user profile data may include one or more preferences that a user has for purchasing one or more particular goods and/or one or more particular services, where the preference(s) may be based on, for example, past purchases made by the user and/or user-specified selections of goods and/or services.
• Instep308, based on the request received instep304, the parameters received instep302, and the user profile data if the user profile data is retrieved instep306, RCS110 (seeFIG. 1) selects a plurality of locations of the locations associated with the vendors whose bids are received instep302. A routing algorithm implemented by RCS110 (seeFIG. 1) can include one or more locations of the plurality of locations selected instep308 along a route that conforms to the request received instep304.
• Instep310, for vendors associated with the locations selected instep308, RCS110 (seeFIG. 1) completes the auction by determining the winning bid(s) and the winning vendor(s) that submit the winning bid(s) in the auction. The winning bid(s) by winning vendor(s) ensure that a route from point A to point B that is to be presented to the user includes location(s) associated with the winning vendor(s).
• Instep312, RCS110 (seeFIG. 1) determines a route from point A to point B that conforms to the request received instep304 and that includes the location(s) associated with the winning vendor(s). The determination of the route instep312 may also be based on user profile data optionally retrieved instep306.
• In one embodiment, RCS110 (seeFIG. 1) notifies the user if user profile data is a basis for the route determined instep312. In another embodiment, the user is not notified if user profile data is a basis for the route determined instep312.
• Instep314, RCS110 (seeFIG. 1) instructs a data processing system (e.g.,GPS112 inFIG. 1) residing in vehicle108 (seeFIG. 1) that the route determined instep312 is to be presented to the user as a recommended route. In response, the data processing system (e.g.,GPS112 inFIG. 1) presents (e.g., displays) the route determined instep312 to the user as a recommended route. After the recommended route is presented and in response to the user traveling the recommended route and actually driving past a location associated with a winning vendor, an entity controlling the RCS, the user, and/or another party (e.g., a charitable organization) are compensated for their participation based on the amount bid by the winning vendor. The process ofFIG. 3 ends atstep316.
• In one embodiment, step314 also includes the RCS notifying the user that the recommended route passes by the aforementioned location(s) and that the winning vendor(s) are associated with the location(s). The notification to the user may also include an identification of a category of goods and/or services provided by a winning vendor.
• In an alternate embodiment, instead of having the RCS110 (seeFIG. 1) push a route, a user may pull a route based on explicit user profile data items being specified for a particular trip event that requires a travel route to be determined and recommended. For example, the user may specify a distance over and above the length of the shortest route that the user is willing to travel. As another example, the user may specify service(s) and/or product(s) (e.g., grocery store) the user would like to travel near during a given trip. The route determined in step212 (seeFIG. 2) or instep312 may include location(s) selected in step208 (seeFIG. 2) or step308, respectively, where the location(s) are selected because they provide the service(s) and/or product(s) specified by the user.
• Possible methods for funding and providing incentives for the processes inFIG. 2 andFIG. 3 may include:
• 1. Based on the winning bid, a fee is charged to the winning vendor whose location is included in the recommended route and the user who is a customer of the vendor is not compensated.
• 2. The user (i.e., the customer of the winning vendor whose location is included in the recommended route) is compensated directly (e.g., with cash, reimbursements for tolls incurred along the route, credits for spending at the vendor's store, etc.).
• 3. Compensation may optionally be given to nonprofit causes, including charities or green initiatives.
Additional Fee Based on Actual Route Taken
• FIG. 4 is a flowchart of a process for determining a surcharge based on an actual route taken subsequent to a presentation of a recommended route in the process ofFIG. 2 orFIG. 3, in accordance with embodiments of the present invention. The surcharge determination process ofFIG. 4 starts atstep400. Instep402, by performing the steps of the process ofFIG. 2 orFIG. 3, RCS110 (seeFIG. 1) determines a travel route that includes location(s) associated with winning vendor(s) and the determined travel route is presented to the user as a recommended route.
• Instep404, GPS112 (seeFIG. 1) located in the user's vehicle108 (seeFIG. 1) tracks the actual route taken by the user's vehicle.
• Instep406, RCS110 (seeFIG. 1) determines whether one or more locations that are included in the recommended route and that are associated with one or more winning vendor(s) are included in the actual route traveled by the user in vehicle108 (seeFIG. 1). In one embodiment,step406 includes RCS110 (seeFIG. 1) determining whether the actual route traveled by vehicle108 (seeFIG. 1) is the recommended route determined instep402.
• Ifstep406 determines that location(s) associated with winning vendor(s) are located along the actual route taken by vehicle108 (seeFIG. 1), then instep408 RCS110 (seeFIG. 1) determines surcharge(s) to be charged to the winning vendor(s) associated with the location(s) that are along the actual route taken by the user's vehicle. For example, ifVendor 1 is a winning vendor that had bid X in the auction initiated in step210 (seeFIG. 2) or step302 (seeFIG. 3) and a surcharge determined instep408 to be charged toVendor 1 is S, thenVendor 1 pays X+S as a result ofVendor 1 winning the auction and the user's vehicle traveling an actual route that includes the location associated withVendor 1.
• Different vendors may be charged the same or different surcharges, where the surcharges are determined instep408.
• Followingstep408, the process ofFIG. 4 ends atstep410. Returning to step406, if RCS110 (seeFIG. 1) determines that no location(s) associated with the winning vendor(s) are along the actual route taken by vehicle108 (seeFIG. 1), then the process ofFIG. 4 ends atstep410.
Rule-Based Route Determination
• A rule-based route determination process determines a route according to the process ofFIG. 2 throughstep212 or the process ofFIG. 3 throughstep312, and indicates whether or not the determined route is a recommended route based on the application of a predefined route calculation rule (i.e., based on whether a measurement of the determined route satisfies a predefined rule). One or more route calculation rules116 (seeFIG. 1) are received and stored in a computer data storage unit. The computer data storage unit may be coupled to GPS112 (seeFIG. 1) or computer system102 (seeFIG. 1). The received route calculation rule(s)116 (seeFIG. 1) indicate that one or more measurements of a recommended route from point A to point B presented in the process ofFIG. 2 orFIG. 3 are not permitted to differ from one or more corresponding measurements of an optimal route from point A to point B by more than one or more corresponding predefined threshold values. The difference between the measurement of a recommended route and the corresponding measurement of the optimal route, and the corresponding predefined threshold value may be expressed as a number of units of the measurement, a percentage, or a ratio.
• Onerule116 may indicate that the distance of a recommended route must not exceed a distance of a shortest-distance route from point A to point B by more than X % or by more than a distance of X units (e.g., X miles), where X is a predefined value (see the discussion ofFIG. 5 presented below). Anotherrule116 may indicate that the time for traveling the recommended route from point A to point B must not exceed a time for traveling the shortest-time route from point A to point B by more than X % or by more than a time of X units (e.g., X minutes), where X is a predefined value.
• In the rule-based route determination process, RCS110 (seeFIG. 1) retrieves arule116 from the aforementioned computer data storage unit, where the rule states that in order for a determined route to be a recommended route, the difference N between a measurement of the determined route and a corresponding measurement of an optimal route must not exceed threshold value X. The optimal route is the route that is optimized according to the corresponding measurement.
• If RCS110 (seeFIG. 1) determines the difference N is not greater than threshold value X, then the RCS designates the determined route to be a recommended route, the GPS112 (seeFIG. 1) presents (e.g., displays) the recommended route to the user, and the rule-based route determination process ends.
• If RCS110 (seeFIG. 1) determines that the difference N is greater than the threshold value X, then the RCS indicates that the determined route is not a recommended route and is not to be presented to the user and the rule-based route determination process ends.
• In one embodiment, the rule-based route determination process utilizes a distance limiting rule, as described below relative toFIG. 5.
Rule Limiting the Distance of a Recommended Route
• FIG. 5 is a flowchart of a process for determining a travel route according to the process ofFIG. 2 orFIG. 3 and based on a rule that limits the distance of the recommended route, in accordance with embodiments of the present invention. The process ofFIG. 5 begins atstep500. Instep502, one or more route calculation rules116 (seeFIG. 1) are received and stored in a computer data storage unit. The computer data storage unit may be coupled to GPS112 (seeFIG. 1) or computer system102 (seeFIG. 1). The received route calculation rule(s)116 (seeFIG. 1) include a distance-limiting rule that indicates that the length of a recommended route from point A to point B presented in the process ofFIG. 2 orFIG. 3 is not permitted to exceed the length of an optimal (i.e., shortest) route from point A to point B by more than X %.
• Instep504, steps202-212 (seeFIG. 2) or steps302-312 (seeFIG. 3) are performed by RCS110 (seeFIG. 1) to determine a route from point A to point B.
• Instep506, RCS110 (seeFIG. 1) retrieves the distance-limiting rule from the aforementioned computer data storage unit. Also instep506, RCS110 (seeFIG. 1) determines that the length of the route determined instep504 is N % more than the length of the optimal route from point A to point B.
• If RCS110 (seeFIG. 1) determines instep508 that N % is not greater than X %, then the No branch ofstep508 is taken and step510 is performed. Instep510, RCS110 (seeFIG. 1) designates the route determined instep504 as a recommended route. Instep512, the GPS112 (seeFIG. 1) presents (e.g., displays) the recommended route to the user. The process ofFIG. 5 ends atstep514.
• Returning to step508, if RCS110 (seeFIG. 1) determines that N % is greater than X %, then instep516 the RCS indicates that the route determined instep504 is not a recommended route and is not to be presented to the user. Followingstep516, the process ofFIG. 5 ends atstep514.
• In an alternate embodiment, the rule received instep502 indicates that the length of the recommended route is not permitted to exceed the length of the optimal route by more than a distance X (e.g., X miles) and step506 determines that the length of the route determined instep504 is a distance N longer than the length of the optimal route. Furthermore, in this alternate embodiment,step508 determines whether N>X.
Rule Limiting the Number of Recommended Routes
• FIG. 6 is a flowchart of a process for determining a travel route according to the process ofFIG. 2 orFIG. 3 and based on a rule that limits the number of recommended routes that pass through a constrained area. The process ofFIG. 6 starts atstep600. Instep602, one or more route calculation rules116 (seeFIG. 1) are received and stored in a computer data storage unit. The computer data storage unit may be coupled to GPS112 (seeFIG. 1) or computer system102 (seeFIG. 1). The received route calculation rule(s)116 (seeFIG. 1) include a recommended routes quantity-limiting rule that indicates that the number of recommended routes presented by multiple performances of steps204-214 (seeFIG. 2) or steps304-314 (seeFIG. 3), where the recommended routes pass through a constrained area, is not permitted to exceed a predefined number X.
• Instep604, RCS110 (seeFIG. 1) receives an indication of an area (a.k.a. constrained area) that is constrained according to predefined criteria.
• Instep606, the steps204-214 (seeFIG. 2) or steps304-314 (seeFIG. 3) are performed and may be repeated until N routes determined by step212 (seeFIG. 2) or step312 (seeFIG. 3) are recommended and presented in step214 (seeFIG. 2) or step314 (seeFIG. 3), where N≧1, and where each of the N recommended routes pass through the constrained area indicated instep604.
• Instep608, steps204-212 (seeFIG. 2) or steps304-312 (seeFIG. 3) are performed to determine an (N+1)-th route that passes through the constrained area whose indication is received instep604.
• If RCS110 (seeFIG. 1) determines instep610 that N+1 is not greater than X, then the No branch ofstep610 is taken and step612 is performed. Instep612, RCS110 (seeFIG. 1) designates the (N+1)-th route determined instep608 as the (N+1)-th recommended route. Instep614, the GPS112 (seeFIG. 1) presents (e.g., displays) the (N+1)-th recommended route to the user. The process ofFIG. 6 ends atstep616.
• Returning to step610, if RCS110 (seeFIG. 1) determines that N+1 is greater than X, then instep618 the RCS indicates that the (N+1)-th route determined instep608 is not a recommended route and is not to be presented to the user. In one embodiment,step618 indicates that the (N+1)-th route is not a recommended route and is not to be presented to the user in order to prevent a traffic jam in the constrained area. Followingstep618, the process ofFIG. 6 ends atstep616.
• In an alternate embodiment,step618 is replaced with (1) the RCS110 (seeFIG. 1) identifying the constrained area as having congested traffic based on the N recommended routes previously presented to users (or based on an indication received by the RCS in a previous step), (2) the RCS determining that the (N+1)-th route passes through the area of congested traffic, and (3) the RCS determining a fee to charge a vendor whose associated location is along the (N+1)-th route. The fee is charged for proposing routes for any additional vehicles to travel through the congested area, thereby promoting environmental stewardship by potentially reducing the number of additional vehicles entering the congested area.
Computer System
• FIG. 7 is a computer system that is included in the system ofFIG. 1 and that implements the process ofFIG. 2 and/or the process ofFIG. 3, in accordance with embodiments of the present invention.Computer system700 generally comprises a central processing unit (CPU)702, amemory704, an input/output (I/O)interface706, and abus708. Further,computer system700 is coupled to I/O devices710 and a computerdata storage unit712.CPU702 performs computation and control functions ofcomputer system700.CPU702 may comprise a single processing unit, or be distributed across one or more processing units in one or more locations (e.g., on a client and server). In one embodiment,computer system700 implements RCS110 (seeFIG. 1) and may reside in vehicle108 (seeFIG. 1). In one embodiment,computer system700 is GPS112 (seeFIG. 1).
• Memory704 may comprise any known computer readable storage medium, which is described below. In one embodiment, cache memory elements ofmemory704 provide temporary storage of at least some program code (e.g., program code714) in order to reduce the number of times code must be retrieved from bulk storage while instructions of the program code are carried out. Moreover, similar toCPU702,memory704 may reside at a single physical location, comprising one or more types of data storage, or be distributed across a plurality of physical systems in various forms. Further,memory704 can include data distributed across, for example, a local area network (LAN) or a wide area network (WAN).
• I/O interface706 comprises any system for exchanging information to or from an external source. I/O devices710 comprise any known type of external device, including a display device (e.g., monitor), keyboard, mouse, printer, speakers, handheld device, facsimile, etc.Bus708 provides a communication link between each of the components incomputer system700, and may comprise any type of transmission link, including electrical, optical, wireless, etc.
• I/O interface706 also allowscomputer system700 to store and retrieve information (e.g., data or program instructions such as program code714) from an auxiliary storage device such as computerdata storage unit712 or another computer data storage unit (not shown). Computerdata storage unit712 may comprise any known computer readable storage medium, which is described below. For example, computerdata storage unit712 may be a non-volatile data storage device, such as a magnetic disk drive (i.e., hard disk drive) or an optical disc drive (e.g., a CD-ROM drive which receives a CD-ROM disk).
• Memory704 may includecomputer program code714 that provides the logic for determining a travel route that includes a location as a result of an auction (e.g., the process ofFIG. 2 orFIG. 3). Further,memory704 may include other systems not shown inFIG. 7, such as an operating system (e.g., Linux) that runs onCPU702 and provides control of various components within and/or connected tocomputer system700.
• Memory704,storage unit712, and/or one or more other computer data storage units (not shown) that are coupled tocomputer system700 may store a database (e.g.,central database104 inFIG. 1). The database stored bystorage unit712 may include user profile data114 (seeFIG. 1) and/or route calculation rules116 (seeFIG. 1).
• As will be appreciated by one skilled in the art, the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “module” or “system” (e.g.,system100 inFIG. 1 or computer system700). Furthermore, an embodiment of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) (e.g.,memory704 or computer data storage unit712) having computer readable program code (e.g., program code714) embodied or stored thereon.
• Any combination of one or more computer readable medium(s) (e.g.,memory704 and computer data storage unit712) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, or semiconductor system, apparatus, device or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer-readable storage medium includes: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain or store a program for use by or in connection with a system, apparatus, or device for carrying out instructions. The terms “computer readable storage medium” and “computer readable storage device” do not include signal propagation media such as copper cables, optical fibers and wireless transmission media.
• A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electromagnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with a system, apparatus, or device for carrying out instructions.
• Program code (e.g., program code714) embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
• Computer program code (e.g., program code714) for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java®, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. Instructions of the program code may be carried out entirely on a user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server, where the aforementioned user's computer, remote computer and server may be, for example,computer system700 or another computer system (not shown) having components analogous to the components ofcomputer system700 included inFIG. 7. In the latter scenario, the remote computer may be connected to the user's computer through any type of network (not shown), including a LAN or a WAN, or the connection may be made to an external computer (e.g., through the Internet using an Internet Service Provider).
• Aspects of the present invention are described herein with reference to flowchart illustrations (e.g.,FIGS. 2-6) and/or block diagrams of methods, apparatus (systems) (e.g.,FIG. 1 andFIG. 7), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions (e.g., program code714). These computer program instructions may be provided to a processor (e.g., CPU702) of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which are carried out via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
• These computer program instructions may also be stored in a computer readable medium (e.g.,memory704 or computer data storage unit712) that can direct a computer (e.g., computer system700), other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
• The computer program instructions may also be loaded onto a computer (e.g., computer system700), other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus, or other devices to produce a computer implemented process such that the instructions which are carried out on the computer, other programmable apparatus, or other devices provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
• Any of the components of an embodiment of the present invention can be deployed, managed, serviced, etc. by a service provider that offers to deploy or integrate computing infrastructure with respect to the process of determining a travel route that includes a location as a result of an auction. Thus, an embodiment of the present invention discloses a process for supporting computer infrastructure, comprising integrating, hosting, maintaining and deploying computer-readable code (e.g., program code714) into a computer system (e.g., computer system700), wherein the code in combination with the computer system is capable of performing a process of determining a travel route that includes a location as a result of an auction.
• In another embodiment, the invention provides a business method that performs the process steps of the invention on a subscription, advertising and/or fee basis. That is, a service provider, such as a Solution Integrator, can offer to create, maintain, support, etc. a process of determining a travel route that includes a location as a result of an auction. In this case, the service provider can create, maintain, support, etc. a computer infrastructure that performs the process steps of the invention for one or more customers. In return, the service provider can receive payment from the customer(s) under a subscription and/or fee agreement, and/or the service provider can receive payment from the sale of advertising content to one or more third parties.
• The flowcharts inFIGS. 2-6 and the block diagrams inFIG. 1 andFIG. 7 illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code (e.g., program code714), which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be performed substantially concurrently, or the blocks may sometimes be performed in reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
• While embodiments of the present invention have been described herein for purposes of illustration, many modifications and changes will become apparent to those skilled in the art. Accordingly, the appended claims are intended to encompass all such modifications and changes as fall within the true spirit and scope of this invention.

Claims (4)

What is claimed is:

1. A method of determining a route, the method comprising the steps of:

a global positioning system (GPS) included in a vehicle and having a processor retrieving from a data storage unit coupled to the GPS a rule indicating that a first number of recommended routes passing through a constrained area is not permitted to exceed a second number, the rule limiting a number of recommended routes that pass through the constrained area;

subsequent to a receipt from N users of N respective requests for N routes, the GPS determining N recommended routes passing through the constrained area and presenting the N recommended routes to the N users;

subsequent to the step of determining the N recommended routes and based on a receipt of a request from a user for a determination of an (N+1)-th route, the GPS determining that a first vendor wins an auction for a location of the first vendor to be included in the (N+1)-th route and the GPS determining the (N+1)-th route so that the location of the first vendor is included in the (N+1)-th route;

the GPS determining that the (N+1)-th route passes through the constrained area and the GPS determining that N+1 does not exceed the second number;

based on the (N+1)-th route passing through the constrained area and (N+1) not exceeding the second number and based on a receipt from the user or another user of a request for a determination of an (N+2)-th route, the GPS determining the (N+2)-th route, which passes through the constrained area;

based on the retrieved rule and the (N+2)-th route passing through the constrained area, the GPS determining N+2 is greater than the second number; and

in response to the step of determining N+2 is greater than the second number, the GPS identifying the constrained area as having congested traffic, the GPS determining that the (N+2)-th route passes through the constrained area having congested traffic, and the GPS determining a fee to charge a second vendor whose location is included in the (N+2)-th route based on the second vendor having won a second auction, the fee promoting a reduction in additional vehicles entering the constrained area having the congested traffic.

2. The methodclaim 1, further comprising the step of:

providing at least one support service for at least one of creating, integrating, hosting, maintaining, and deploying computer-readable program code in a computer in the GPS, the program code being executed by a processor of the computer to implement the steps of retrieving the rule, determining the N recommended routes, presenting the N recommended routes, determining that the first vendor wins the auction, determining the (N+1)-th route, determining that the (N+1)-th route passes through the constrained area, determining that N+1 does not exceed the second number, determining the (N+2)-th route, determining N+2 is greater than the second number, identifying the constrained area as having congested traffic, determining that the (N+2)-th route passes through the constrained area having congested traffic, and determining the fee.

3. A computer program product, comprising:

a computer-readable storage device; and

a computer-readable program code stored in the computer-readable storage device, the computer-readable program code containing instructions that are executed by a central processing unit (CPU) of a computer system, which is a global positioning system (GPS) included in a vehicle, to implement a method of determining a route, the method comprising the steps of:

the computer system included in a vehicle and having a processor retrieving from a data storage unit coupled to the GPS a rule indicating that a first number of recommended routes passing through a constrained area is not permitted to exceed a second number, the rule limiting a number of recommended routes that pass through the constrained area;

subsequent to a receipt from N users of N respective requests for N routes, the computer system determining N recommended routes passing through the constrained area and presenting the N recommended routes to the N users;

subsequent to the step of determining the N recommended routes and based on a receipt of a request from a user for a determination of an (N+1)-th route, the computer system determining that a first vendor wins an auction for a location of the first vendor to be included in the (N+1)-th route and the computer system determining the (N+1)-th route so that the location of the first vendor is included in the (N+1)-th route;

the computer system determining that the (N+1)-th route passes through the constrained area and the computer system determining that N+1 does not exceed the second number;

based on the (N+1)-th route passing through the constrained area and (N+1) not exceeding the second number and based on a receipt from the user or another user of a request for a determination of an (N+2)-th route, the computer system determining the (N+2)-th route, which passes through the constrained area;

based on the retrieved rule and the (N+2)-th route passing through the constrained area, the computer system determining N+2 is greater than the second number; and

in response to the step of determining N+2 is greater than the second number, the computer identifying the constrained area as having congested traffic, the computer system determining that the (N+2)-th route passes through the constrained area having congested traffic, and the computer system determining a fee to charge a second vendor whose location is included in the (N+2)-th route based on the second vendor having won a second auction, the fee promoting a reduction in additional vehicles entering the constrained area having the congested traffic.

4. A computer system comprising:

a central processing unit (CPU);

a memory coupled to the CPU; and

a computer-readable storage device coupled to the CPU, the storage device containing instructions that are executed by the CPU via the memory to implement a method of determining a route, the method comprising the steps of:

the computer system included in a vehicle and having a processor retrieving from a data storage unit coupled to the GPS a rule indicating that a first number of recommended routes passing through a constrained area is not permitted to exceed a second number, the rule limiting a number of recommended routes that pass through the constrained area;

subsequent to a receipt from N users of N respective requests for N routes, the computer system determining N recommended routes passing through the constrained area and presenting the N recommended routes to the N users;

subsequent to the step of determining the N recommended routes and based on a receipt of a request from a user for a determination of an (N+1)-th route, the computer system determining that a first vendor wins an auction for a location of the first vendor to be included in the (N+1)-th route and the computer system determining the (N+1)-th route so that the location of the first vendor is included in the (N+1)-th route;

the computer system determining that the (N+1)-th route passes through the constrained area and the computer system determining that N+1 does not exceed the second number;

based on the (N+1)-th route passing through the constrained area and (N+1) not exceeding the second number and based on a receipt from the user or another user of a request for a determination of an (N+2)-th route, the computer system determining the (N+2)-th route, which passes through the constrained area;

based on the retrieved rule and the (N+2)-th route passing through the constrained area, the computer system determining N+2 is greater than the second number; and

in response to the step of determining N+2 is greater than the second number, the computer identifying the constrained area as having congested traffic, the computer system determining that the (N+2)-th route passes through the constrained area having congested traffic, and the computer system determining a fee to charge a second vendor whose location is included in the (N+2)-th route based on the second vendor having won a second auction, the fee promoting a reduction in additional vehicles entering the constrained area having the congested traffic.

Images