TRANSPORTATION SCHEDULE PLANNING SUPPORT SYSTEM AND TRANSPORTATION SCHEDULE PLANNING SUPPORT METHOD

• US 20110071955A1
• Filed: 03/18/2010
• Published: 03/24/2011
• Est. Priority Date: 05/19/2009
• Status: Abandoned Application

• Current Assignee: Hitachi, Ltd.
• Original Assignee: Hitachi, Ltd.
• Inventors: Kurata, Takeshi, Nakamura, Isao, Tateishi, Jun, Hanawa, Shinichirou, Ikezawa, Katsunari, Nemoto, Yasuhiro
• Application Number:
  US12/726,620
• Publication Number:
  US 20110071955A1
• Time in Patent Office: Days
• US Class Current: 705/338
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/08 Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
• CPC Class Codes: G06Q 10/08355 Routing methods

Abstract

A transportation schedule planning support system receives an order of one or more types of products which requires a use-by date control, and transports the products from one or more stock-carrying bases to one or more delivery destinations. In the system, a user previously registers a transportation route candidate from a stock-carrying base to each delivery destination adoptable as a solution, as a base group. A necessary use-by date for a product to be delivered next is determined based on an actual delivery to each delivery destination. The number of vehicles allocatable to a transportation at each base according to a vehicle type, and a vehicle type not used in each base group are added to a restriction condition. A mixed integer programming is applied using an expected obtainable profit obtained by delivering each product as an objective function.

Claims

1. A transportation schedule planning support system receiving an order of one or more types of products which requires a use-by date control, and transporting the product from one or more stock-carrying bases to one or more delivery destinations, comprising:

a base group storage part that stores therein a transportation route candidate from one or more stock-carrying bases to each delivery destination adoptable as a solution, as a base group;

a necessary amount calculation part that determines a necessary use-by date for a product to be delivered next, based on an actual delivery to each delivery destination and calculates a necessary amount of the product;

a restriction condition creation part that creates a restriction condition concerning at least;

a necessary amount according to a delivery destination, a type of a product, and a necessary use-by date;

the number of vehicles allocatable to a transportation at each base according to a vehicle type; and

a vehicle type not available in each base group;

an objective function creation part that creates an objective function for calculating an expected obtainable profit from a transportation amount of each product and from a transportation cost determined corresponding to a transportation route of each vehicle; and

a transportation schedule creation part that creates a transportation schedule using the restriction condition and the objective function with a mixed integer programming.

2. The transportation schedule planning support system according to claim 1, further comprising

a necessary amount input part that revises, deletes, or newly adds a necessary amount of a product according to a delivery destination, a type of a product, and a necessary use-by date which are calculated by the necessary amount calculation part, from a screen or a file.

3. The transportation schedule planning support system according to claim 2,

wherein the restriction condition includes:

that a transportation amount of each product according to a type of the product to a delivery destination based on the created transportation schedule is not more than a necessary amount of the product according to a type of the product at the delivery destination;

that a transportation amount of each product according to a type of the product from a stock-carrying base, based on the created transportation schedule is not more than a suppliable amount of each product according to a type of a product at the stock-carrying base;

or that the number of vehicles according to a vehicle type allocated based on the created transportation schedule is not more than the number of vehicles according to a vehicle type allocatable at each base; and

wherein the restriction condition includes a restriction concerning a vehicle type available at each base group.

4. The transportation schedule planning support system according to claim 3,

wherein the transportation schedule created by the transportation schedule creation part can be outputted in a form selected from a form with respect to a type of a product to be transported and a form with respect to a vehicle used for a transportation.

5. The transportation schedule planning support system according to claim 4,

wherein the transportation schedule created by the transportation schedule creation part includes a type of a product to be transported, a use-by date and a numerical amount of the product, a transportation source and a transportation destination, and information on a vehicle used for the transportation,

the transportation schedule planning support system further comprises a transportation schedule revision part that additionally stores, revises, or deletes a transportation schedule form at least one of a screen and a file.

6. A transportation schedule planning support method receiving an order of one or more types of products which requires a use-by date control, and transporting the product from one or more stock-carrying bases to one or more delivery destinations, comprising:

a base group register processing in which a user previously registers a base group in a base group storage part in which a transportation route candidate from one or more stock-carrying bases to each delivery destination adoptable as a solution is stored as a base group;

a necessary amount calculation processing in which a necessary use-by date for a product to be delivered next is determined based on an actual delivery to each delivery destination, and a necessary amount of the product is calculated;

a restriction condition creation processing in which a restriction condition concerning at least;

a necessary amount according to a delivery destination, a type of a product, and a necessary use-by date;

the number of vehicles allocatable to a transportation at each base according to a vehicle type; and

a vehicle type not available in each base group;

an objective function creation processing in which an objective function for calculating an expected obtainable profit from a transportation amount of each product and from a transportation cost determined corresponding to a transportation route of each vehicle is created; and

a transportation schedule creation processing in which a transportation schedule using the restriction condition and the objective function with a mixed integer programming is created.