WO2009038482A2 - Distribution system - Google Patents

Distribution system Download PDF

Info

Publication number
WO2009038482A2
WO2009038482A2 PCT/NZ2008/000243 NZ2008000243W WO2009038482A2 WO 2009038482 A2 WO2009038482 A2 WO 2009038482A2 NZ 2008000243 W NZ2008000243 W NZ 2008000243W WO 2009038482 A2 WO2009038482 A2 WO 2009038482A2
Authority
WO
WIPO (PCT)
Prior art keywords
carriers
carrier
freight
determining
pickup
Prior art date
Application number
PCT/NZ2008/000243
Other languages
French (fr)
Other versions
WO2009038482A3 (en
Inventor
Alan David Jay Walpole
Original Assignee
Flnz Limited
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 Flnz Limited filed Critical Flnz Limited
Publication of WO2009038482A2 publication Critical patent/WO2009038482A2/en
Publication of WO2009038482A3 publication Critical patent/WO2009038482A3/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
    • G06Q30/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/08Auctions
    • 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
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management

Definitions

  • This invention relates generally to freight transport. More particularly, embodiments of the invention provide for pricing and/or scheduling of freight carriers based on their projected routes.
  • Freight companies have historically provided their customers with fixed freight rates unrelated to their available spare capacity on any specific day. For example, a customer will be given a freight rate of $100 per tonne from Carrier 1 and $110 per tonne from Carrier 2, for freight between point A and point B. Customers have therefore historically chosen their carriers based on these fixed prices.
  • Carrier 1 or Carrier 2 In reality however, the cost for Carrier 1 or Carrier 2 to service the customer is not fixed, and will vary depending on the spare capacity available and intended routes of each of their trucks. For example, if Carrier 2 has a truck already going within close proximity of the customer's pickup location, and that is then travelling to a point within close proximity of the customer's delivery location, it would be most efficient for this truck to carry the customer's freight.
  • the information gap results in a significant under utilisation of the available freight capacity, because customers have no information about which carriers have available capacity on the route on which the customer is intending to send freight, and they do not, therefore, book their freight with the freight carrier that would be most efficient from a network point of view.
  • customers have no information about which carriers have available capacity on the route on which the customer is intending to send freight, and they do not, therefore, book their freight with the freight carrier that would be most efficient from a network point of view.
  • the customer would probably send their freight with Carrier 1 because their fixed rate is lower, even though Carrier 2 would be more efficient.
  • US Patent No. 5,835,716 describes a system which acts as an intermediary between the shipper/user of carrier space and the carrier that has listed the space.
  • the carriers enter available capacity, destination, times, rates, routes, and modes of transport into the system.
  • the users enter a request in which details of parameters are provided, such as the amount of space required, start and end points, dates and times, rates, and mode of transport.
  • the system then utilises data processing means for determining whether a match can be found between the request for available capacity and what has actually been entered into the transportation database.
  • the system displays matches and the user makes a selection from the available options. If a match is not found, the system will continue to query the transportation database until the date and time of the requested route has exceeded the date and time on the clock of the data processing system, or until the query is terminated by the system operator.
  • a system for pricing and/or scheduling a freight carrier from a plurality of freight carriers including:
  • the intended route data may be manually provided via user input means by each carrier.
  • a database of all deliveries may be provided with an identifier of the actual individual and/or vehicle used to deliver a package included therein.
  • the intended route data may be provided directly by a carrier vehicle driver and/or via one or more databases.
  • the intended route data may include historical data from previous routes, such as historical GPS data and/or a record of previous pickup and/or delivery addresses. For example, it may be given that a particular carrier has to visit a particular address on any given day. In such cases, the step of entering details of this address may be omitted although knowledge of this address may be used in the scheduling algorithm. This reduces the data entry burden on carrier vehicle drivers and/or their administrative staff.
  • the system includes computational means for calculating the additional distance to be travelled by at least a subset of the carriers based on the carriers' intended route data and the customer's pickup and delivery data.
  • the additional distance is calculated by an insertion heuristic algorithm or by an integer optimisation program.
  • straight line distances between the various points may be determined.
  • account is taken of actual distance to be driven, such as through the use of road map data.
  • one or more look up tables may store the straight line and/or actual additional distance data such that it may be retrieved on entry of the pick up and delivery data.
  • the system includes communication means for receiving data, preferably from freight carriers, which may include one or more of spare capacity, cost information, intended routes, pickup times and/or delivery times, and/or for receiving data from customers which may include pickup and/or delivery details.
  • data preferably from freight carriers, which may include one or more of spare capacity, cost information, intended routes, pickup times and/or delivery times, and/or for receiving data from customers which may include pickup and/or delivery details.
  • the computational means is configured to calculate a cost for each carrier.
  • the freight rates may then be calculated based on this data and the cost information.
  • the computational means is configured to calculate the cost for each carrier based, at least in part, on the additional distance for each carrier.
  • the computational means is configured to calculate the freight rates based at least in part on supply / demand data whereby the freight rates may be lowered when supply exceeds demand and may be raised when supply approaches demand.
  • the means for selecting is configured to select one or more carriers based, at least in part, on the additional distances and/or the freight rates.
  • the system includes means for displaying one or more of the selected one or more carriers and/or the freight rates.
  • the system includes input means for enabling customers to select which one or more of the displayed carriers they wish to use.
  • the system may be configured to automatically select one particular carrier, for example, this may be the carrier offering the cheapest freight rate. Other constraints such as pickup and/or delivery times may also be considered in such selections.
  • the communication means is configured to communicate the freight rates to a customer.
  • the communication means is configured to communicate the customer's pick up and delivery data to the carriers.
  • Any known communication means may be used to effect communication between various entities in the system.
  • computing devices are used. These may include but are not limited to personal computers, laptops, dedicated terminals and suitably enabled telephones or PDAs.
  • the use of text messaging or email is also within the scope of the invention.
  • a method of scheduling a freight carrier from a plurality of freight carriers including:
  • the method includes calculating the additional distance to be travelled by at least a subset of the carriers based on the carriers' intended route information and the customer's pickup and delivery information.
  • the additional distance is calculated by an insertion heuristic algorithm or by an integer optimisation program.
  • the method includes receiving information from freight carriers which may include one or more of spare capacity, cost information, intended routes, pickup times and/or delivery times, and/or for receiving information from customers which may include pickup and/or delivery details.
  • the method includes calculating a cost for each carrier.
  • the freight rates may then be calculated based on this information and the cost information.
  • the method includes calculating the cost for each carrier based, at least in part, on the additional distance for each carrier.
  • the method includes calculating the freight rates based at least partly on the supply / demand balance whereby the freight rates may be lowered when supply exceeds demand and may be raised when supply approaches demand.
  • the method includes selecting one or more carriers based, at least in part, on the additional distances and/or the freight rates.
  • the method includes displaying one or more of the selected one or more carriers and/or the freight rates.
  • the method includes the customers selecting which one or more of the displayed carriers they wish to use.
  • the method may comprise automatic selection of a carrier.
  • this may be the carrier offering the cheapest freight rate.
  • Other constraints such as pickup and/or delivery times may also be considered in such selections.
  • the method includes communicating the freight rates to a customer.
  • the method includes communicating the customer's pick up and delivery data to the carriers.
  • a controller for scheduling a freight carrier from a plurality of freight carriers including:
  • the controller includes computational means for calculating the additional distance to be travelled by at least a subset of the carriers based on the carriers' intended route data and the customer's pickup and delivery data.
  • the additional distance is calculated by an insertion heuristic algorithm or by an integer optimisation program.
  • the controller includes communication means for receiving data from freight carriers which may include one or more of spare capacity, cost information, intended routes, pickup times and/or delivery times, and/or for receiving data from customers which may include pickup and/or delivery details.
  • the computational means is configured to calculate a cost for each carrier.
  • the freight rates may then be calculated based on this data and the cost information data.
  • the computational means is configured to calculate the cost for each carrier based, at least in part, on the additional distance for each carrier.
  • the computational means is configured to calculate the freight rates based on supply / demand data whereby the freight rates may be lowered when supply exceeds demand and may be raised when supply approaches demand.
  • the means for selecting is configured to select one or more carriers based, at least in part, on the additional distances and/or the freight rates.
  • the controller includes means for displaying one or more of the selected one or more carriers and/or the freight rates.
  • the means for displaying may be located locally to or remotely from the controller.
  • the controller includes input means for receiving data regarding a customer's selection of one or more of the displayed carriers (i.e. the carriers they wish to use).
  • the controller may be configured to automatically select one particular carrier, for example, this may be the carrier offering the cheapest freight rate. Other constraints such as pickup and/or delivery times may also be considered in such selections.
  • the communication means is configured to communicate the freight rates to a customer.
  • the communication means is configured to communicate the customer's pick up and delivery data to the carriers.
  • the controller acts as an intermediary between customers and freight carriers.
  • the controller may be located anywhere within the system, as would be apparent to one of skill in the art. Inclusion of the controller within a customer or freight carrier terminal is also within the scope of the invention.
  • a user terminal for a carrier including:
  • a user terminal for a customer including:
  • the carrier data includes one or more details of one or more carriers, freight rates, pickup times and delivery times.
  • the user terminal is embodied in a computer, PDA and/or phone but the invention is not limited thereto.
  • the user terminal of the fourth and/or fifth aspect communicates via any known means, such as the internet, text messaging, phone and/or email.
  • the user terminal of the fourth and/or fifth aspect is for use in the system of the first aspect and/or the method of the second aspect.
  • an apparatus for determining an available capacity within a carrier vehicle including:
  • the apparatus includes and/or is communicatively coupled to means for determining the acceleration.
  • the means for determining the acceleration may include an accelerometer and/or means for determining the speed of the vehicle at different points in time. Any means known in the art may be used for such purposes.
  • the apparatus preferably includes and/or is communicatively coupled to a location determination means, such as a GPS receiver, whereby the position or location of the vehicle is determined at different points in time, preferably corresponding to the times at which acceleration is determined.
  • a location determination means such as a GPS receiver
  • the apparatus includes and/or is communicatively coupled to a look up table containing acceleration data for the vehicle when carrying different weights, preferably across a range of expected possible carrier weights.
  • the means for determining the available capacity is configured to:
  • the look up table may be configured to directly determine available capacity without the need for the subtracting step to be performed repeatedly.
  • fuel level may be assessed and/or the weight of the driver and/or any crew may be considered, the latter preferably enabled via user input means.
  • an indication of the available capacity of a carrier vehicle is determined based on its acceleration, this being enabled due to the fact that the weight being carried by the vehicle will affect the acceleration thereof.
  • the apparatus of the sixth aspect is preferably configured for use with the system of the first aspect and/or the method of the second aspect and/or controller of the third aspect, whereby scheduling of a carrier is determined in part based on the determined available capacity of one or more freight carrier vehicles.
  • scheduling of a carrier is determined in part based on the determined available capacity of one or more freight carrier vehicles.
  • a method of determining an available capacity within a carrier vehicle including:
  • Figures 1A and 1B illustrate steps in embodiments of the method of the invention
  • Figure 2 is a schematic view of an embodiment of the system of the invention.
  • Figure 1A shows details of a request received from a customer with pickup location 11 and delivery location 12.
  • customers have chosen a carrier based on cost and/or pickup/delivery times without consideration of the efficiency of a particular carrier in making a delivery.
  • Preferred embodiments of the invention calculate the additional distance to be travelled by each carrier in making a particular delivery. Rates for the delivery may be calculated based on this data. For example, in Figure 1A, Carrier A's intended route 13 (solid line) is entered showing Carrier A's start and finish point 15, and Carrier B's route 14 (dashed line) is entered showing Carrier B's start and finish point 16. The additional distance to be travelled by each carrier is calculated as represented in Figure 1 B which shows Carrier A's altered route 17 (solid line) and Carrier B's altered route 18 (dashed line) to service the customer's pickup and delivery request. As can be seen the price for Carrier A to deliver the customer's goods is likely to be less than that of Carrier B because the extra distance to be travelled by Carrier A in making the delivery is less than that for Carrier B.
  • FIG. 2 is a schematic representation of an embodiment of the system of the invention.
  • a controller 21 is provided for receiving data from carrier terminals 22 and the customer terminal 23.
  • the example in Figure 2 shows only one customer terminal and three carrier terminals but it will be appreciated that the system is suitable for other numbers of customers and carriers.
  • the freight carriers send data, with their user terminals 22, which may include spare capacity, intended route information, cost information, pickup times and delivery times.
  • the customer sends data to the controller 21 , with their user terminal 23, which may include pickup and delivery locations and may include times or an indication of urgency.
  • the carrier terminals 22 and the customer terminal 23 may be a device such as a computer, PDA, phone or any other means known to one skilled in the art.
  • the signals may be sent directly to the controller or may pass through a relay station or may be stored on the device and uploaded to a remote station as required.
  • the controller 21 includes computational means, such as a computer, PDA, phone or any other suitable means known to one skilled in the art.
  • the computational means calculates the additional distance to be travelled by carriers to service the customers pickup and delivery locations.
  • the additional distance may be calculated by an insertion heuristic algorithm or by an integer optimisation program or any other means known to one skilled in the art.
  • the additional distance figures are preferably used alongside cost information to calculate the freight rates for servicing the request.
  • the freight rates may additionally be calculated based on the supply / demand balance whereby the freight rates may be lowered when supply exceeds demand and may be raised when supply approaches demand. Rates for particular carriers may be obtained on demand.
  • rates are stored local to the controller in a memory. Preferably, such stored rates may be updated.
  • the computational means is preferably configured to select the carrier or carriers which match or best match the customer's criteria. The determination may be based on additional distances and/or freight rates, and the controller 21 may display the matched carriers to the customer, such as on customer terminal 23. The customer can then select a particular carrier from those displayed and schedule the delivery through transmission of the selection from customer terminal 23.
  • Varying degrees of automation may be provided for in the selection of carriers.
  • the computational means may be configured to automatically select one particular carrier, such as the one offering the cheapest freight rate.
  • Other constraints such as pickup and/or delivery times may also be considered in such selections. For example, according to one embodiment, only those carriers with sufficient capacity and/or those able to meet the customer's desired pickup and/or delivery times may be displayed to and/or selectable by a customer.
  • the controller 21 sends the information regarding pickup and delivery locations to the selected carrier or carriers' user terminal.

Abstract

The invention provides for the pricing and/or scheduling of freight carriers based on their projected routes, more particularly based on additional distances required by individual carriers to service a particular pickup and delivery. The invention also provides for the determination of an available capacity of a carrier vehicle.

Description

DISTRIBUTION SYSTEM
Field of Invention
This invention relates generally to freight transport. More particularly, embodiments of the invention provide for pricing and/or scheduling of freight carriers based on their projected routes.
Background to the Invention
Freight companies have historically provided their customers with fixed freight rates unrelated to their available spare capacity on any specific day. For example, a customer will be given a freight rate of $100 per tonne from Carrier 1 and $110 per tonne from Carrier 2, for freight between point A and point B. Customers have therefore historically chosen their carriers based on these fixed prices.
In reality however, the cost for Carrier 1 or Carrier 2 to service the customer is not fixed, and will vary depending on the spare capacity available and intended routes of each of their trucks. For example, if Carrier 2 has a truck already going within close proximity of the customer's pickup location, and that is then travelling to a point within close proximity of the customer's delivery location, it would be most efficient for this truck to carry the customer's freight.
The information gap results in a significant under utilisation of the available freight capacity, because customers have no information about which carriers have available capacity on the route on which the customer is intending to send freight, and they do not, therefore, book their freight with the freight carrier that would be most efficient from a network point of view. By way of illustration, in the above example the customer would probably send their freight with Carrier 1 because their fixed rate is lower, even though Carrier 2 would be more efficient.
US Patent No. 5,835,716 describes a system which acts as an intermediary between the shipper/user of carrier space and the carrier that has listed the space. The carriers enter available capacity, destination, times, rates, routes, and modes of transport into the system. The users enter a request in which details of parameters are provided, such as the amount of space required, start and end points, dates and times, rates, and mode of transport. The system then utilises data processing means for determining whether a match can be found between the request for available capacity and what has actually been entered into the transportation database. The system then displays matches and the user makes a selection from the available options. If a match is not found, the system will continue to query the transportation database until the date and time of the requested route has exceeded the date and time on the clock of the data processing system, or until the query is terminated by the system operator.
One problem with the system of US 5,835,716 is that if the pick up or delivery address is not on the route entered by the carrier, the system would not find a match and the customer will have to wait until a route is entered which matches their requirements. If no route is entered that matches their requirements, the customer would have to wait until such time as a carrier enters the route or the customer has to cancel their request. The system does not allow for the routes of the carriers to be altered.
Summary of the Invention
It is an object of the invention to provide a method and/or system for pricing of freight services which mitigates at least some of the aforementioned problems.
Alternatively, it is an object of the invention to provide at least a useful choice to the public.
According to a first aspect of the invention, there is provided a system for pricing and/or scheduling a freight carrier from a plurality of freight carriers, the system including:
• means for receiving intended route data for a plurality of carriers,
• means for receiving customer pickup and delivery data, and
• means for selecting one or more of the carriers based on the intended route data and the pickup and delivery data.
The intended route data may be manually provided via user input means by each carrier. Alternatively, a database of all deliveries (including pickup addresses) may be provided with an identifier of the actual individual and/or vehicle used to deliver a package included therein. Thus, the intended route data may be provided directly by a carrier vehicle driver and/or via one or more databases. Furthermore, the intended route data may include historical data from previous routes, such as historical GPS data and/or a record of previous pickup and/or delivery addresses. For example, it may be given that a particular carrier has to visit a particular address on any given day. In such cases, the step of entering details of this address may be omitted although knowledge of this address may be used in the scheduling algorithm. This reduces the data entry burden on carrier vehicle drivers and/or their administrative staff.
Preferably, the system includes computational means for calculating the additional distance to be travelled by at least a subset of the carriers based on the carriers' intended route data and the customer's pickup and delivery data.
Preferably, the additional distance is calculated by an insertion heuristic algorithm or by an integer optimisation program.
Various algorithms may be used to determine the additional distance and the invention is not limited to any particular one. According to one embodiment, straight line distances between the various points may be determined. However, according to an alternative embodiment, account is taken of actual distance to be driven, such as through the use of road map data. As a further alternative, one or more look up tables may store the straight line and/or actual additional distance data such that it may be retrieved on entry of the pick up and delivery data.
Preferably, the system includes communication means for receiving data, preferably from freight carriers, which may include one or more of spare capacity, cost information, intended routes, pickup times and/or delivery times, and/or for receiving data from customers which may include pickup and/or delivery details.
Preferably, the computational means is configured to calculate a cost for each carrier. The freight rates may then be calculated based on this data and the cost information.
Preferably, the computational means is configured to calculate the cost for each carrier based, at least in part, on the additional distance for each carrier.
Preferably, the computational means is configured to calculate the freight rates based at least in part on supply / demand data whereby the freight rates may be lowered when supply exceeds demand and may be raised when supply approaches demand.
Preferably, the means for selecting is configured to select one or more carriers based, at least in part, on the additional distances and/or the freight rates.
Preferably, the system includes means for displaying one or more of the selected one or more carriers and/or the freight rates.
Preferably, the system includes input means for enabling customers to select which one or more of the displayed carriers they wish to use. Alternatively, the system may be configured to automatically select one particular carrier, for example, this may be the carrier offering the cheapest freight rate. Other constraints such as pickup and/or delivery times may also be considered in such selections.
Preferably, the communication means is configured to communicate the freight rates to a customer.
Preferably, the communication means is configured to communicate the customer's pick up and delivery data to the carriers.
Any known communication means may be used to effect communication between various entities in the system. However, according to preferred embodiments, computing devices are used. These may include but are not limited to personal computers, laptops, dedicated terminals and suitably enabled telephones or PDAs. The use of text messaging or email is also within the scope of the invention.
According to a second aspect of the invention, there is provided a method of scheduling a freight carrier from a plurality of freight carriers, the method including:
• receiving intended route information for a plurality of carriers,
• receiving customer pickup and delivery information, and
• selecting one or more of the carriers based on the intended route information and the pickup and delivery information.
Preferably, the method includes calculating the additional distance to be travelled by at least a subset of the carriers based on the carriers' intended route information and the customer's pickup and delivery information.
Preferably, the additional distance is calculated by an insertion heuristic algorithm or by an integer optimisation program.
Preferably, the method includes receiving information from freight carriers which may include one or more of spare capacity, cost information, intended routes, pickup times and/or delivery times, and/or for receiving information from customers which may include pickup and/or delivery details.
Preferably, the method includes calculating a cost for each carrier. The freight rates may then be calculated based on this information and the cost information.
Preferably, the method includes calculating the cost for each carrier based, at least in part, on the additional distance for each carrier.
Preferably, the method includes calculating the freight rates based at least partly on the supply / demand balance whereby the freight rates may be lowered when supply exceeds demand and may be raised when supply approaches demand.
Preferably, the method includes selecting one or more carriers based, at least in part, on the additional distances and/or the freight rates.
Preferably, the method includes displaying one or more of the selected one or more carriers and/or the freight rates.
Preferably, the method includes the customers selecting which one or more of the displayed carriers they wish to use. Alternatively, the method may comprise automatic selection of a carrier. For example, this may be the carrier offering the cheapest freight rate. Other constraints such as pickup and/or delivery times may also be considered in such selections.
Preferably, the method includes communicating the freight rates to a customer.
Preferably, the method includes communicating the customer's pick up and delivery data to the carriers. According to a third aspect of the invention, there is provided a controller for scheduling a freight carrier from a plurality of freight carriers, the controller including:
• means for receiving intended route data for a plurality of carriers,
• means for receiving customer pickup and delivery data, and
• means for selecting one or more of the carriers based on the intended route data and the pickup and delivery data.
Preferably, the controller includes computational means for calculating the additional distance to be travelled by at least a subset of the carriers based on the carriers' intended route data and the customer's pickup and delivery data.
Preferably, the additional distance is calculated by an insertion heuristic algorithm or by an integer optimisation program.
Preferably, the controller includes communication means for receiving data from freight carriers which may include one or more of spare capacity, cost information, intended routes, pickup times and/or delivery times, and/or for receiving data from customers which may include pickup and/or delivery details.
Preferably, the computational means is configured to calculate a cost for each carrier. The freight rates may then be calculated based on this data and the cost information data.
Preferably, the computational means is configured to calculate the cost for each carrier based, at least in part, on the additional distance for each carrier.
Preferably, the computational means is configured to calculate the freight rates based on supply / demand data whereby the freight rates may be lowered when supply exceeds demand and may be raised when supply approaches demand.
Preferably, the means for selecting is configured to select one or more carriers based, at least in part, on the additional distances and/or the freight rates.
Preferably, the controller includes means for displaying one or more of the selected one or more carriers and/or the freight rates. The means for displaying may be located locally to or remotely from the controller.
Preferably, the controller includes input means for receiving data regarding a customer's selection of one or more of the displayed carriers (i.e. the carriers they wish to use). Alternatively, the controller may be configured to automatically select one particular carrier, for example, this may be the carrier offering the cheapest freight rate. Other constraints such as pickup and/or delivery times may also be considered in such selections.
Preferably, the communication means is configured to communicate the freight rates to a customer.
Preferably, the communication means is configured to communicate the customer's pick up and delivery data to the carriers.
Thus, according to the third aspect, the controller acts as an intermediary between customers and freight carriers. Note that through use of appropriate communication means, the controller may be located anywhere within the system, as would be apparent to one of skill in the art. Inclusion of the controller within a customer or freight carrier terminal is also within the scope of the invention.
According to a fourth aspect of the invention, there is provided a user terminal for a carrier, the user terminal including:
• means for sending intended route data and/or spare capacity data, and
• means for receiving pickup and/or delivery data.
According to a fifth aspect of the invention, there is provided a user terminal for a customer, the user terminal including:
• means for sending pick up and delivery data, and
• means for receiving carrier data.
Preferably, the carrier data includes one or more details of one or more carriers, freight rates, pickup times and delivery times.
Preferably, the user terminal is embodied in a computer, PDA and/or phone but the invention is not limited thereto. The user terminal of the fourth and/or fifth aspect communicates via any known means, such as the internet, text messaging, phone and/or email.
Preferably, the user terminal of the fourth and/or fifth aspect is for use in the system of the first aspect and/or the method of the second aspect.
According to a sixth aspect, there is provided an apparatus for determining an available capacity within a carrier vehicle, the apparatus including:
• means for receiving a measure of acceleration of the vehicle; and
• means for determining the available capacity therefrom.
Preferably, the apparatus includes and/or is communicatively coupled to means for determining the acceleration.
The means for determining the acceleration may include an accelerometer and/or means for determining the speed of the vehicle at different points in time. Any means known in the art may be used for such purposes.
The apparatus preferably includes and/or is communicatively coupled to a location determination means, such as a GPS receiver, whereby the position or location of the vehicle is determined at different points in time, preferably corresponding to the times at which acceleration is determined.
According to one embodiment, the apparatus includes and/or is communicatively coupled to a look up table containing acceleration data for the vehicle when carrying different weights, preferably across a range of expected possible carrier weights.
According to this embodiment, the means for determining the available capacity is configured to:
• compare the measured acceleration with the stored values in the look up table;
• determine the actual weight being carried by the vehicle based on the corresponding weight in the lookup table and/or by interpolating between the closest accelerations in the look up table above and below the measured acceleration; and
• determine the available capacity by subtracting the determined weight from the maximum capacity, in weight, of the vehicle.
As would be apparent to those skilled in the art, the look up table may be configured to directly determine available capacity without the need for the subtracting step to be performed repeatedly.
Other factors which affect weight may also be taken into consideration. For example, fuel level may be assessed and/or the weight of the driver and/or any crew may be considered, the latter preferably enabled via user input means.
Thus, according to the sixth aspect, an indication of the available capacity of a carrier vehicle is determined based on its acceleration, this being enabled due to the fact that the weight being carried by the vehicle will affect the acceleration thereof.
The apparatus of the sixth aspect is preferably configured for use with the system of the first aspect and/or the method of the second aspect and/or controller of the third aspect, whereby scheduling of a carrier is determined in part based on the determined available capacity of one or more freight carrier vehicles. As would be apparent to those skilled in the art, the level of integration of the components of the apparatus of the sixth aspect with components of the other aspects may be varied as desired.
According to a seventh aspect, there is provided a method of determining an available capacity within a carrier vehicle, the method including:
• receiving a measure of acceleration of the vehicle; and
• determining the available capacity therefrom.
Other features of the method of the seventh aspect are analogous to those of the apparatus of the sixth aspect.
As would be apparent to those skilled in the art, while certain components of the invention must be mounted on or coupled to the freight carrier vehicle, other components may be positioned elsewhere, with data being communicated therebetween via any known communication means.
Further aspects of the invention, which should be considered in all its novel aspects, will become apparent to those skilled in the art upon reading of the following description which provides at least one example of a practical application of the invention.
Brief Description of the Drawings
One or more embodiments of the invention will now be described, by way of example only and without intending to be limiting, with reference to the accompanying drawings in which:
Figures 1A and 1B illustrate steps in embodiments of the method of the invention; and Figure 2 is a schematic view of an embodiment of the system of the invention.
Detailed Description of Preferred Embodiments
Figure 1A shows details of a request received from a customer with pickup location 11 and delivery location 12. Conventionally, customers have chosen a carrier based on cost and/or pickup/delivery times without consideration of the efficiency of a particular carrier in making a delivery.
Preferred embodiments of the invention calculate the additional distance to be travelled by each carrier in making a particular delivery. Rates for the delivery may be calculated based on this data. For example, in Figure 1A, Carrier A's intended route 13 (solid line) is entered showing Carrier A's start and finish point 15, and Carrier B's route 14 (dashed line) is entered showing Carrier B's start and finish point 16. The additional distance to be travelled by each carrier is calculated as represented in Figure 1 B which shows Carrier A's altered route 17 (solid line) and Carrier B's altered route 18 (dashed line) to service the customer's pickup and delivery request. As can be seen the price for Carrier A to deliver the customer's goods is likely to be less than that of Carrier B because the extra distance to be travelled by Carrier A in making the delivery is less than that for Carrier B.
The example above shows only one customer and two carriers, but it will be appreciated that the system can accommodate multiple carriers and customers.
Figure 2 is a schematic representation of an embodiment of the system of the invention. A controller 21 is provided for receiving data from carrier terminals 22 and the customer terminal 23. The example in Figure 2 shows only one customer terminal and three carrier terminals but it will be appreciated that the system is suitable for other numbers of customers and carriers.
The freight carriers send data, with their user terminals 22, which may include spare capacity, intended route information, cost information, pickup times and delivery times. The customer sends data to the controller 21 , with their user terminal 23, which may include pickup and delivery locations and may include times or an indication of urgency.
The carrier terminals 22 and the customer terminal 23 may be a device such as a computer, PDA, phone or any other means known to one skilled in the art. The signals may be sent directly to the controller or may pass through a relay station or may be stored on the device and uploaded to a remote station as required.
The controller 21 includes computational means, such as a computer, PDA, phone or any other suitable means known to one skilled in the art. After the data is received from the carrier terminals 22 and the customer terminal 23, the computational means calculates the additional distance to be travelled by carriers to service the customers pickup and delivery locations. The additional distance may be calculated by an insertion heuristic algorithm or by an integer optimisation program or any other means known to one skilled in the art. The additional distance figures are preferably used alongside cost information to calculate the freight rates for servicing the request. The freight rates may additionally be calculated based on the supply / demand balance whereby the freight rates may be lowered when supply exceeds demand and may be raised when supply approaches demand. Rates for particular carriers may be obtained on demand. However, according to preferred embodiments, rates are stored local to the controller in a memory. Preferably, such stored rates may be updated.
The computational means is preferably configured to select the carrier or carriers which match or best match the customer's criteria. The determination may be based on additional distances and/or freight rates, and the controller 21 may display the matched carriers to the customer, such as on customer terminal 23. The customer can then select a particular carrier from those displayed and schedule the delivery through transmission of the selection from customer terminal 23.
Varying degrees of automation may be provided for in the selection of carriers. The computational means may be configured to automatically select one particular carrier, such as the one offering the cheapest freight rate. Other constraints such as pickup and/or delivery times may also be considered in such selections. For example, according to one embodiment, only those carriers with sufficient capacity and/or those able to meet the customer's desired pickup and/or delivery times may be displayed to and/or selectable by a customer.
After the customer selects the carrier, or the carrier is automatically selected, the controller 21 sends the information regarding pickup and delivery locations to the selected carrier or carriers' user terminal.
It should be further noted that various changes and modifications to the presently preferred embodiments described herein will be apparent to those skilled in the art. Such changes and modifications may be made without departing from the spirit and scope of the invention and without diminishing its attendant advantages. It is therefore intended that such changes and modifications be included within the scope of the invention. Moreover, while customer and/or carrier terminals may be embodied in computing devices, other more conventional communication means may be used such that, for example, information is exchanged between two or more parties to the system in person, in telephone discussions or by facsimile. Other communication means will also be apparent to one of skill in the art.

Claims

1. An apparatus for pricing and/or scheduling a freight carrier from a plurality of freight carriers, the apparatus including:
• means for receiving intended route data for a plurality of carriers,
• means for receiving customer pickup and delivery data,
• means for calculating the additional distance to be travelled by at least a subset of the carriers based on the carriers' intended route data and the customer's pickup and delivery data, and
• means for selecting one or more of the carriers based at least in part on the determined additional distances.
2. The apparatus of claim 1 , wherein the means for calculating includes or is adapted to use an insertion heuristic algorithm or an integer optimisation program.
3. The apparatus of claim 1 or claim 2, including means for determining a cost for the one or more carriers, the costs being based at least in part on the additional distance for each carrier.
4. The apparatus of claim 3, wherein the means for determining a cost is configured to base said costs, at least in part, on a measure of present supply and demand data.
5. The apparatus of any one of the preceding claims, including means for receiving and/or determining an available capacity of at least a subset of the plurality of carriers, wherein the means for selecting is configured to select the one or more carriers based at least in part on the available capacities.
6. The apparatus of claim 5, wherein the available capacity is determined at least in part on measure of acceleration of the corresponding carrier.
7. The apparatus of any one of the preceding claims, wherein the pickup and delivery data includes a pickup time and/or a delivery time, wherein the means for selecting is configured to select the one or more carriers based at least in part on the pickup time and/or delivery time.
8. The apparatus of any one of the preceding claims, including means for transmitting and/or displaying the selected one or more carriers.
9. The apparatus of claim 8, including and/or communicatively coupled to user input means to receive an indication of the or one of the selected one or more carriers.
10. The apparatus of any one of the preceding claims, wherein the means for calculating is configured to automatically calculate and/or the means for selecting is configured to automatically select.
11. An apparatus for determining an available capacity within a carrier vehicle, the apparatus including:
• means for receiving a measure of acceleration of the vehicle; and
• means for determining the available capacity therefrom.
12. The apparatus of claim 11 , wherein the means for determining the available capacity is configured to:
• compare the measure of acceleration with the stored values in a look up table, each value of acceleration in the lookup table corresponding to the carrier vehicle holding a different load;
• determine a current vehicle load based on the corresponding weight in the lookup table and/or by interpolating between the closest accelerations in the lookup table above and below the measured acceleration; and
• determine the available capacity by subtracting the current vehicle load from a maximum capacity of the vehicle.
13. A system for pricing and/or scheduling a freight carrier from a plurality of freight carriers, the system including the apparatus of any one of claims 1 to 10.
14. The system of claim 13, including a carrier terminal integral to or communicatively coupled to the apparatus to enable exchange of information between a carrier and the apparatus.
15. The system of claim 13 or claim 14, including a customer terminal integral to or communicatively coupled to the apparatus to enable exchange of information between a customer and the apparatus.
16. The system of any one of claims 13 to 15, including the apparatus of claim 11 or claim 12.
17. A method of determining an available capacity within a carrier vehicle, the method including:
• receiving a measure of acceleration of the vehicle; and
• determining the available capacity therefrom.
18. The method of claim 17, wherein the step of determining the available capacity includes:
• comparing the measure of acceleration with the stored values in a look up table, each value of acceleration in the lookup table corresponding to the carrier vehicle holding a different load;
• determining a current vehicle load based on the corresponding weight in the lookup table and/or by interpolating between the closest accelerations in the lookup table above and below the measured acceleration; and
• determining the available capacity by subtracting the current vehicle load from a maximum capacity of the vehicle.
19. A method of pricing and/or scheduling a freight carrier from a plurality of freight carriers, the method including:
• receiving intended route data for a plurality of carriers,
• receiving customer pickup and delivery data,
• calculating the additional distance to be travelled by at least a subset of the carriers based on the carriers' intended route data and the customer's pickup and delivery data, and
• selecting one or more of the carriers based at least in part on the determined additional distances.
20. The method of claim 19, wherein the step of calculating includes using an insertion heuristic algorithm or an integer optimisation program.
21 The method of claim 19 or claim 20, including determining a cost for the one or more carriers, the costs being based at least in part on the additional distance for each carrier.
22. The method of claim 21 , wherein the step of determining a cost is configured to base said costs, at least in part, on a measure of present supply and demand data.
23. The method of any one of claims 19 to 22, including receiving and/or determining an available capacity of at least a subset of the plurality of carriers, wherein the step of selecting includes selecting the one or more carriers based at least in part on the available capacities.
24. The method of claim 23, wherein the available capacity is determined at least in part on a measure of acceleration of the corresponding carrier.
25. The method of any one of claims 19 to 24, wherein the pickup and delivery data includes a pickup time and/or a delivery time, wherein the step of selecting includes selecting the one or more carriers based at least in part on the pickup time and/or delivery time.
26. The method of any one of claims 19 to 25, including transmitting and/or displaying the selected one or more carriers.
27. The method of claim 26, including receiving an indication of the or one of the selected one or more carriers.
28. The method of any one of claims 19 to 27, wherein the step of calculating and/or the step of selecting is performed automatically.
29. The method of any one of claims 19 to 28, including the steps of claim 17 or claim 18.
30. The method of claim 29, wherein the determining an available capacity is performed automatically.
31. An apparatus for pricing and/or scheduling a freight carrier from a plurality of freight carriers substantially as herein described with reference to Figure 2.
32. A system for pricing and/or scheduling a freight carrier from a plurality of freight carriers substantially as herein described with reference to Figure 2.
33. A carrier terminal or a customer terminal substantially as herein described with reference to Figure 2.
34. A method of pricing and/or scheduling a freight carrier from a plurality of freight carriers substantially as herein described with reference to Figure 2.
PCT/NZ2008/000243 2007-09-18 2008-09-17 Distribution system WO2009038482A2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
NZ561621 2007-09-18
NZ56162107 2007-09-18

Publications (2)

Publication Number Publication Date
WO2009038482A2 true WO2009038482A2 (en) 2009-03-26
WO2009038482A3 WO2009038482A3 (en) 2009-05-22

Family

ID=40468664

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/NZ2008/000243 WO2009038482A2 (en) 2007-09-18 2008-09-17 Distribution system

Country Status (1)

Country Link
WO (1) WO2009038482A2 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021174328A1 (en) * 2020-03-06 2021-09-10 Braskem S.A. Method and system for intelligent load optimization for vehicles
CN113610291A (en) * 2021-07-31 2021-11-05 杭州拼便宜网络科技有限公司 Logistics route regeneration method and device, electronic equipment and computer readable medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5265006A (en) * 1990-12-14 1993-11-23 Andersen Consulting Demand scheduled partial carrier load planning system for the transportation industry
US5724524A (en) * 1995-12-15 1998-03-03 Pitney Bowes, Inc. Method and system for listing, brokering, and exchanging carrier capacity
KR20030044350A (en) * 2001-11-29 2003-06-09 (주)한국정밀전자 System and method for servicing material circulation information on demand, and computer-readable recording medium on which a program relating thereto is recorded
US20050278063A1 (en) * 2004-06-14 2005-12-15 Richard Hersh Dynamic and predictive information system and method for shipping assets and transport
US20070103342A1 (en) * 2005-07-06 2007-05-10 Milleville Dan P Dynamic Modification And Communication Of Routes For Transportation Vehicles

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5265006A (en) * 1990-12-14 1993-11-23 Andersen Consulting Demand scheduled partial carrier load planning system for the transportation industry
US5724524A (en) * 1995-12-15 1998-03-03 Pitney Bowes, Inc. Method and system for listing, brokering, and exchanging carrier capacity
KR20030044350A (en) * 2001-11-29 2003-06-09 (주)한국정밀전자 System and method for servicing material circulation information on demand, and computer-readable recording medium on which a program relating thereto is recorded
US20050278063A1 (en) * 2004-06-14 2005-12-15 Richard Hersh Dynamic and predictive information system and method for shipping assets and transport
US20070103342A1 (en) * 2005-07-06 2007-05-10 Milleville Dan P Dynamic Modification And Communication Of Routes For Transportation Vehicles

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021174328A1 (en) * 2020-03-06 2021-09-10 Braskem S.A. Method and system for intelligent load optimization for vehicles
CN113610291A (en) * 2021-07-31 2021-11-05 杭州拼便宜网络科技有限公司 Logistics route regeneration method and device, electronic equipment and computer readable medium
CN113610291B (en) * 2021-07-31 2024-01-30 杭州拼便宜网络科技有限公司 Logistics route regeneration method, device, electronic equipment and computer readable medium

Also Published As

Publication number Publication date
WO2009038482A3 (en) 2009-05-22

Similar Documents

Publication Publication Date Title
US8812188B2 (en) Vehicle electric power management apparatus, vehicle electric power management system, and vehicle electric power management program
US9026454B2 (en) System for procuring services
US9395202B2 (en) Method and system for providing information in a vehicle
KR101594395B1 (en) Mediation Method for Goods Deliverer in Network, and Mediation Server Used Therein
EP0859346A1 (en) System and method for coordinating personal transportation
CN109155016A (en) For the method and apparatus to electric vehicle charging
KR20000063909A (en) System For Processing Transportation Information Using Communication Network And Method Thereof
CN109195828A (en) For the method and apparatus to electric vehicle charging
AU2004200430A1 (en) Transportation ordering system
KR101818212B1 (en) Server for providing call service, taxi calling method thereof, and application
WO2020241002A1 (en) Operation assistance method, operation assistance system, and electric vehicle
JP2003002444A (en) Delivery schedule supporting device
CN106575403A (en) Information-providing system, information apparatus, and information-providing method
JP5538252B2 (en) Navigation system, center server, in-vehicle device
JP5016458B2 (en) Daily work report creation program
JP4432287B2 (en) Energy supply system for vehicles
JP2001307279A (en) System for commodity distribution
WO2009038482A2 (en) Distribution system
JP6986529B2 (en) Delivery arrangement system and delivery arrangement method
JP2002334241A (en) Sales support system linked with navigation system and method therefor
JP2002308439A (en) Commodities delivery system
KR20200016314A (en) Visit parcel delivery service system and method of providing visit parcel delivery service
WO2022085362A1 (en) Charging reservation system
JP2002139334A (en) Vehicular navigation device and method
CN113632151A (en) Information providing system and information providing method

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: 08832077

Country of ref document: EP

Kind code of ref document: A2

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08832077

Country of ref document: EP

Kind code of ref document: A2