FLEET DISPATCH PLAN OPTIMIZATION

• US 20120158608A1
• Filed: 06/03/2011
• Published: 06/21/2012
• Est. Priority Date: 12/17/2010
• Status: Abandoned Application

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: ROBERTS, Marybeth, WANG, Yun, ARUNAPURAM, Sundar
• Application Number:
  US13/152,512
• Publication Number:
  US 20120158608A1
• Time in Patent Office: Days
• US Class Current: 705/334
• CPC Class Codes: G06Q 10/00 Administration; Management
• CPC Class Codes: G06Q 10/0834 Choice of carriers

Abstract

One embodiment is a fleet dispatch plan optimization system and method that provides a planning and assignment mechanism for assigning shipments of goods, supplies, cargo, or any other type of delivery to a driver and equipment. The method may include, for example, receiving as an input a plurality of shipments of items or goods that need to be assigned and a plurality of drivers available to handle the shipments. The drivers can include those from the private fleet or from a common carrier. The method may then include determining, using a simulation engine for example, the most cost effective assignment of one of the drivers to at least one of the shipments.

Claims

1. A computer program, embodied on a computer readable medium, the computer program configured to control a processor to perform a process, comprising:

retrieving a list of available drivers and shipments;

determining feasibility of assigning one of the drivers to one of the shipments;

determining a cost of assigning each of the drivers to each of the shipments; and

selecting a lowest cost assignment of a driver to the shipments based on a result of the determining.

2. The computer program according to claim 1, wherein the drivers comprise private fleet drivers and common carrier drivers.

3. The computer program according to claim 1, wherein the determining the feasibility comprises simulating, by a simulation engine, delivery of the one of the shipments by the one of the drivers.

4. The computer program according to claim 1, wherein the determining the cost comprises formulating a set partitioning mixed integer programming (MIP) problem using each of the shipments.

5. The computer program according to claim 4, wherein the determining the cost further comprises solving linear programming (LP) relaxation of the MIP.

6. The computer program according to claim 5, wherein the determining the cost further comprises generating additional profitable routes of shipments for each of the drivers.

7. The computer program according to claim 6, wherein the generating comprises:

creating a shortest path network with one of the drivers and each of the shipments as nodes in the network;

creating a start label as the driver node and adding the label to an unprocessed label set;

retrieving a label with a lowest time stamp from the unprocessed label set;

determining the nodes for the shipments that can be reached from the retrieved label and creating a label for the determined nodes;

adding the created label to the unprocessed label set;

removing a current label from the unprocessed label set;

when unprocessed label set is empty, returning at least one route between the nodes having negative reduced costs.

11. The apparatus according to claim 1, wherein the determining the cost comprises formulating a set partitioning mixed integer programming (MIP) problem using each of the shipments.

12. The apparatus according to claim 11, wherein the determining the cost further comprises solving linear programming (LP) relaxation of the MIP.

13. The apparatus according to claim 12, wherein the determining the cost further comprises generating additional profitable routes of shipments for each of the drivers.

8. An apparatus, comprising:

at least one processor; and

at least one memory including computer program code,

the at least one memory including the computer program code is configured, with the at least one processor, to cause the apparatus to

retrieve a list of available drivers and shipments;

determine feasibility of assigning one of the drivers to one of the shipments;

determine a cost of assigning each of the drivers to each of the shipments; and

select a lowest cost assignment of a driver to the shipments based on a result of the determining.

9. The apparatus according to claim 8, wherein the drivers comprise private fleet drivers and common carrier drivers.

10. The apparatus according to claim 8, wherein the determining the feasibility comprises simulating, by a simulation engine, delivery of the one of the shipments by the one of the drivers.

14. A method, comprising:

retrieving a list of available drivers and shipments;

determining feasibility of assigning one of the drivers to one of the shipments;

determining a cost of assigning each of the drivers to each of the shipments; and

selecting a lowest cost assignment of a driver to the shipments based on a result of the determining.

15. The method according to claim 14, wherein the drivers comprise private fleet drivers and common carrier drivers.

16. The method according to claim 14, wherein the determining the feasibility comprises simulating, by a simulation engine, delivery of the one of the shipments by the one of the drivers.

17. The method according to claim 14, wherein the determining the cost comprises formulating a set partitioning mixed integer programming (MIP) problem using each of the shipments.