Physical distribution management device, physical distribution management method, and physical distribution management program
The logistics management device optimizes delivery routes between group companies by calculating cost-effective shipping paths and companies, reducing overall logistics costs.
Patent Information
- Application Number
- JP2024039237
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2024-03-13
- Publication Date
- 2025-09-29
AI Technical Summary
Existing systems do not optimize delivery routes to reduce logistics costs between group companies, leading to increased shipping and transportation expenses.
A logistics management device that optimizes delivery routes by using a control unit to access databases storing company distances and shipping information, calculating the most cost-effective routes and companies for delivering or collecting goods between group companies.
This approach reduces logistics costs by selecting the most efficient delivery routes and companies, thereby minimizing fuel and shipping company arrangement costs.
Smart Images

Figure 2025140071000001_ABST
Abstract
Description
[Technical Field]
[0001] The present invention relates to a logistics management device, a logistics management method, and a logistics management program. [Background technology]
[0002] Recently, the number of group companies (enterprises) has been increasing. Conventionally, a system for delivering between group companies is disclosed in, for example, Patent Document 1. [Prior art documents] [Patent documents]
[0003] [Patent Document 1] Patent No. 7203265 Summary of the Invention [Problem to be solved by the invention]
[0004] However, the above-mentioned Patent Document 1 does not state anything about reducing logistics costs by optimizing delivery routes when delivering products between group companies.
[0005] The present invention has been made in consideration of the above, and aims to provide a logistics management device, a logistics management method, and a logistics management program that can reduce logistics costs when delivering goods between group companies by optimizing delivery routes. [Means for solving the problem]
[0006] In order to solve the above-mentioned problems and achieve the object, the present invention provides a logistics management device that includes a control unit and manages logistics between group companies, wherein the control unit is configured to be able to access a storage area that stores a first master that associates and registers the origins and destinations of group companies and the distance between the origins and destinations of the group companies, a second master that associates and registers the delivery company, the shipper company, the distance from the shipper company, and the transportation fee, and shipping instruction data that includes the shipping instruction number, the shipper company, the destination company, the shipping date, the product, and the number of products to be shipped, and the control unit extracts the shipping instruction data as shipping target data using the shipping date and the destination company as keys, and for the extracted shipping target data, (1) in the case of a first delivery route in which a delivery company delivers products from the shipper company to each destination company, (2) in the case of a second delivery route in which the delivery company collects goods from all shipper companies and then delivers them to the destination company, calculates a combination of delivery routes, refers to the first master to calculate the distance, selects the one with the shortest distance as the delivery route, refers to the second master to calculate the delivery company with the smallest delivery cost for the selected delivery route, and (3) is provided with a shipment input means that compares the minimum delivery cost calculated for the first delivery route with the minimum delivery cost for the second delivery route, and selects the delivery route and delivery company with the smallest delivery cost.
[0007] According to another aspect of the present invention, the transportation fee for the second master may be made up of a basic fee and an additional fee added for each distance.
[0008] According to another aspect of the present invention, the shipment input means may create shipping data including a shipping number, a line number, a shipping destination company, a shipping date, a shipping instruction number, a shipping company, a delivery order, a shipping company, a product, and a shipping quantity based on the extracted shipping target data and the selected delivery route and delivery company.
[0009] In order to solve the above-mentioned problems and achieve the object, the present invention provides a logistics management method executed by an information processing device having a control unit, wherein the control unit is configured to be able to access a storage area storing a first master that associates and registers a departure point of a group company, a destination point of the group company, and a distance between the departure point and the destination point, a second master that associates and registers a delivery company, a shipper company, a distance from the shipper company, and a shipping fee, and shipping instruction data including a shipping instruction number, a shipper company, a destination company, a shipping date, a product, and a shipping quantity, and the control unit executes the method to extract the shipping instruction data as shipping target data using the shipping date and the destination company as keys, and for the extracted shipping target data, (1) in the case of a first delivery route in which a delivery company delivers products from the shipper company to each destination company, The method includes a shipment input process that refers to the first master for each shipping company, obtains the distance to the shipping destination company, refers to the second master, calculates the shipping cost for each shipping company, calculates the total of the shipping costs, and calculates the shipping company with the lowest shipping cost; (2) in the case of a second shipping route in which the shipping company collects goods from all shipping companies and then delivers them to the shipping destination company, calculates a combination of shipping routes, refers to the first master for each calculated combination of shipping routes, calculates the distance, selects the one with the shortest distance as the shipping route, and refers to the second master to calculate the shipping company with the lowest shipping cost for the selected shipping route; and (3) compares the minimum shipping cost calculated for the first shipping route with that of the second shipping route, and selects the shipping route and shipping company with the lowest shipping cost.
[0010] In order to solve the above-mentioned problems and achieve the object, the present invention provides a logistics management program to be executed by an information processing device having a control unit, the control unit being configured to be able to access a storage area storing a first master that associates and registers a departure point of a group company, a destination point of the group company, and a distance between the departure point and the destination point, a second master that associates and registers a delivery company, a shipper company, a distance from the shipper company, and a transportation fee, and shipping instruction data including a shipping instruction number, a shipper company, a destination company, a shipping date, a product, and a shipping quantity, the control unit extracts the shipping instruction data as shipping target data using the shipping date and the destination company as keys, and for the extracted shipping target data, (1) in the case of a first delivery route in which a delivery company delivers products from the shipper company to each destination company, the control unit extracts the shipping instruction data as shipping target data for each shipper company, and The logistics management program is characterized by executing a shipment input process that (1) refers to a first master to obtain the distance to the destination company, (2) refers to the second master to calculate the shipping cost for each shipping company, calculates the total of those shipping costs, and calculates the shipping company with the lowest shipping cost, (3) in the case of a second shipping route in which the shipping company collects goods from all shipping companies and then delivers them to the destination company, calculates a combination of shipping routes, refers to the first master to calculate the distance for each calculated combination of shipping routes, selects the one with the shortest distance as the shipping route, and refers to the second master to calculate the shipping company with the lowest shipping cost for the selected shipping route, and (4) compares the minimum shipping cost calculated for the first shipping route with that of the second shipping route, and selects the shipping route and shipping company with the lowest shipping cost. [Effects of the Invention]
[0011] According to the present invention, when delivering goods between group companies, the delivery route can be optimized, thereby making it possible to reduce logistics costs. [Brief explanation of the drawings]
[0012] [Figure 1] FIG. 1 is a block diagram showing an example of the configuration of a logistics management device. [Figure 2]FIG. 2 is a diagram showing an example of the configuration of the actual vehicle Km master. [Figure 3] FIG. 3 is a diagram showing an example of the configuration of the tariff information master. [Figure 4] FIG. 4 is a diagram illustrating an example of the configuration of the delivery company master data. [Figure 5] FIG. 5 is a flowchart illustrating an example of the overall processing of the delivery management device according to the present embodiment. [Figure 6] FIG. 6 is a diagram showing an example of shipping instruction data. [Figure 7] FIG. 7 is a diagram showing a display example of the shipping instruction input screen. [Figure 8] FIG. 8 is a diagram illustrating an example of shipping data. DETAILED DESCRIPTION OF THE INVENTION
[0013] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described in detail with reference to the accompanying drawings. However, the present invention is not limited to this embodiment.
[0014] [1. Overview] The outline of the present invention will be explained in the following order: [1-1. Background], [1-2. Problems], [1-3. Solution], [1-4. Effects], and [1-5. Overview of the mechanism].
[0015] [1-1. Background] For example, in recent years, the number of group companies has been increasing due to active M&A. Also, in the retail industry, multiple sales companies within a group may handle the same product, resulting in frequent movement of goods between groups. For this reason, group companies are required to select the optimal delivery route in order to minimize logistics costs.
[0016] [1-2. Issues] However, when moving goods between group companies, each company often has to arrange for a shipping company, which creates the issue of increased logistics costs.
[0017] [1-3. Solution] Therefore, in this embodiment, when transporting goods between group companies, the destination company arranges shipments for the same shipping company together and optimizes the delivery route, thereby solving the above problem.
[0018] [1-4.Effects] According to this embodiment, it is possible to transport goods efficiently, reduce logistics costs, and reduce fuel costs for transportation and costs for arranging for a shipping company.
[0019] [1-5. Overview of the system] In the present invention, (1) the distances between group companies are stored in a first master, and the minimum charges and distance fees for each delivery company are registered in a second master, and (2) shipping instruction information is compiled and the optimal delivery route is determined by referring to the first master and the second master.
[0020] The outline of the processing flow of the present invention is as follows. 1. Extract data with the same shipping date and shipping destination company from the shipping instruction data. 2. For the extracted data, calculate the shipping costs when the delivery company delivers the products from the shipping company to each of the shipping destination companies (first delivery route) and when the delivery company collects the products from the shipping company and delivers them to the shipping destination company (second delivery route). 3.2 Compare the shipping costs calculated in step 2 and determine the least costly delivery route and delivery company. 4. Reflect the results of step 3 in the shipping data.
[0021] The logistics management device of the present invention can be widely applied to the delivery of goods (products, raw materials before products, etc.) within a group of companies in the machinery, steel, food, chemical, trading, distribution and retail industries.
[0022] [2. Configuration] An example of the configuration of a logistics management device 100 according to this embodiment will be described with reference to Fig. 1. Fig. 1 is a block diagram showing an example of the configuration of the logistics management device 100.
[0023] The logistics management device 100 is a commercially available desktop personal computer. Note that the logistics management device 100 is not limited to a stationary information processing device such as a desktop personal computer, but may also be a portable information processing device such as a commercially available notebook personal computer, a PDA (Personal Digital Assistant), a smartphone, or a tablet personal computer.
[0024] The logistics management device 100 includes a control unit 102, a communication interface unit 104, a storage unit 106, and an input / output interface unit 108. The units included in the logistics management device 100 are connected to each other so as to be able to communicate with each other via any communication path.
[0025] The communication interface unit 104 communicatively connects the logistics management device 100 to the network 300 via a communication device such as a router and a wired or wireless communication line such as a dedicated line. The communication interface unit 104 has a function of communicating data with other devices via the communication line. Here, the network 300 has a function of connecting the logistics management device 100 and the server 200 so that they can communicate with each other, and is, for example, the Internet or a LAN (Local Area Network).
[0026] An input device 112 and an output device 114 are connected to the input / output interface unit 108. The output device 114 may be a monitor (including a touch panel), a speaker, or a printer. The input device 112 may be a keyboard, a mouse, a microphone, or a monitor that cooperates with a mouse to achieve a pointing device function. In the following, the output device 114 may be referred to as the monitor 114 or the printer 114, and the input device 112 may be referred to as the keyboard 112 or the mouse 112.
[0027] Various databases, tables, files, etc. are stored in the storage unit 106. Computer programs that work in conjunction with an OS (Operating System) to issue commands to a CPU (Central Processing Unit) to perform various processes are recorded in the storage unit 106. The storage unit 106 can be, for example, a memory device such as a RAM (Random Access Memory) or a ROM (Read Only Memory), a fixed disk device such as a hard disk, a flexible disk, an optical disk, etc.
[0028] The storage unit 106 also stores an actual vehicle Km master 106a, a tariff information master 106b, a delivery company master 106c, shipping instruction data, shipping data, etc. Fig. 2 is a diagram showing an example of the configuration of the actual vehicle Km master 106a. Fig. 3 is a diagram showing an example of the configuration of the tariff information master 106b. Fig. 4 is a diagram showing an example of the configuration of the delivery company master 106c.
[0029] The actual vehicle km master 106a is a master for defining the distance between companies within a group company, and can be configured as a table or the like in which the origin (code and / or name) of the group company, the destination (code and / or name) of the group company, and the actual vehicle km are registered in association with each other, as shown in Fig. 2. In the example shown in the figure, the first line has the origin code "S0001", the destination code "S0002", and the actual vehicle km "30", the second line has the origin code "S0001", the destination code "S0003", and the actual vehicle km "20", and the third line has the origin code "S0001", the destination code "S0004", and the actual vehicle km "50".
[0030] The tariff information master 106b is a master that specifies the shipping charges for each transport distance for each delivery company when each company within a group company is the shipping origin, and as shown in Figure 3, it can be composed of a table that associates and registers the delivery company (delivery company code and / or delivery company name), shipping company (shipping origin company code and / or shipping origin company name), distance (km), and shipping charges (basic charge (minimum charge), additional charge added for each distance (distance charge)). In the example shown in the same figure, the first line has the delivery company "HA0001", the shipper "S0002", the basic charge "5,000", the distance or less "10 (if = 0 < distance ≦ 10)", and the additional charge "1,000". The second line has the delivery company "HA0001", the shipper "S0002", the basic charge "5,000", the distance or less "20 (if = 10 < distance ≦ 20)", and the additional charge "2,000". The third line has the delivery company "HA0001", the shipper "S0002", the basic charge "5,000", the distance or less "30 (if = 20 < distance ≦ 30)", and the additional charge "3,000".
[0031] As shown in Fig. 4, the delivery company master 106c can be configured as a table in which delivery company codes and delivery company names are registered in association with each other. The delivery company master 106c is referenced when converting delivery company codes and delivery company names. In the example shown in the figure, the first line has the delivery company code "HA0001" and the delivery company name "Delivery Company A," and the second line has the delivery company "HA0002" and the delivery company name "Delivery Company B."
[0032] The shipping instruction data may include the invoice number (shipping instruction number), the shipping company (shipping company code and / or shipping company name), the shipping destination company (shipping destination company code and / or shipping destination company name), the shipping date, the product (product code and / or product name), and the quantity shipped.
[0033] The shipping data may include a document number (shipping number), a line number, a shipping destination company, a shipping date, a shipping instruction number, a shipping company (a shipping company code and / or a shipping company name), a delivery order, a delivery company (a shipping destination company code and / or a shipping destination company name), a product (a product code and / or a product name), and a quantity shipped.
[0034] 1, the control unit 102 is a CPU or the like that performs overall control of the logistics management device 100. The control unit 102 has an internal memory for storing control programs such as an OS, programs that define various processing procedures, required data, etc., and executes various information processing operations based on these stored programs.
[0035] The control unit 102 is configured to be able to access the actual vehicle Km master 106a (first master), tariff information master 106b (second master), delivery company master 106c, shipping instruction data, shipping data, etc. stored in the storage unit 106. Note that the actual vehicle Km master 106a, tariff information master 106b, delivery company master 106c, shipping instruction data, shipping data, etc. may be provided in another location (for example, server 200) as long as the control unit 102 is able to access them.
[0036] The control unit 102 conceptually includes a shipping instruction input unit 102a, a shipping input unit 102b, a master maintenance unit 102c, and a screen display control unit 102d.
[0037] The shipping instruction input unit 102a inputs shipping instruction data including the shipping instruction number, the shipping company, the shipping destination company, the shipping date, the product, and the number of shipments in response to operations by an operator or the like on a shipping instruction input screen (not shown) displayed on the monitor 114, and stores the data in the memory unit 106.
[0038] For example, in response to an operation by an operator or the like on a shipment input screen (see FIG. 7) displayed on the monitor 114, the shipment input unit 102b extracts the shipping instruction data stored in the storage unit 106 as shipping target data using the shipping date and the shipping destination company as keys, and for the extracted shipping target data, (1) in the case of a first delivery route in which a delivery company delivers goods from a shipper company to each of the shipper companies, refers to the actual vehicle km master 106a for each shipper company to obtain the distance to the shipper company, refers to the tariff information master 106b to calculate the transportation costs for each delivery company, and calculates the total of the transportation costs, (2) In the case of a second delivery route in which the delivery company collects goods from all shipping companies and then delivers them to the shipping destination companies, a combination of delivery routes is calculated, and for each combination of calculated delivery routes, the actual vehicle Km master 106a is referenced to calculate the distance, the one with the shortest distance is selected as the delivery route, and the tariff information master 106b is referenced to calculate the delivery company with the lowest shipping cost for the selected delivery route, and (3) the minimum shipping cost calculated for the first delivery route and the second delivery route is compared, and the delivery route and delivery company with the lowest shipping cost are selected.
[0039] The shipment input unit 102b creates shipping data including the slip number (shipment number), line number, shipping destination, shipping date, shipping instruction number, shipper, delivery order, delivery company, product code, and shipment quantity based on the extracted shipping target data and the selected delivery route and delivery company, and registers the data in the memory unit 106.
[0040] The master maintenance section 102c is used to perform editing such as inputting, adding, and changing data to the actual vehicle Km master 106a and the tariff information master 106b in response to operations by an operator or the like on a master maintenance screen (not shown) displayed on the monitor 112.
[0041] The screen display control unit 102d controls the display of various screens (for example, a shipping instruction input screen, a shipping input screen, a master maintenance screen, etc.) displayed on the monitor 114 and the inputs thereto.
[0042] [3. Specific examples of processing] A specific example of the processing of the logistics management device 100 in this embodiment will be described with reference to Figures 1 to 8. Figures 5 to 8 are diagrams for explaining a specific example of the processing of the logistics management device 100 in this embodiment.
[0043] [3-1. Overall processing] An overview of the overall processing of the control unit 102 of the logistics management device 100 in this embodiment will be described with reference to Fig. 5. Fig. 5 is a diagram showing a flow for explaining an example of the overall processing of the control unit 102 of the logistics management device 100 in this embodiment.
[0044] The shipping instruction input unit 102a executes a shipping instruction input process (step S1). Specifically, in the shipping instruction input process, the shipping instruction input unit 102a inputs shipping instruction data including a shipping instruction number, a shipper company, a ship-to company, a shipping date, a product, and a shipping quantity in response to an operation by an operator or the like on a shipping instruction input screen (not shown) displayed on the monitor 114, and stores the data in the storage unit 106.
[0045] The shipment input unit 102b executes a shipment input process (delivery route calculation, shipping data creation) (step S2). Specifically, in the delivery route calculation, the shipment input unit 102b extracts the shipping instruction data stored in the storage unit 106 as shipping target data using the shipping date and the shipping destination company as keys in response to an operation by an operator or the like on the shipment input screen (see FIG. 7) displayed on the monitor 114, and for the extracted shipping target data, (1) in the case of a first delivery route in which a delivery company delivers goods from a shipper company to each shipper company, references the actual vehicle Km master 106a for each shipper company to obtain the distance to the shipper company, references the tariff information master 106b to calculate the transportation cost for each delivery company, and then calculates the transportation cost for each delivery company. (2) in the case of a second delivery route in which the delivery company collects the goods from all shipping companies and then delivers them to the shipping destination companies, a combination of delivery routes is calculated, and for each combination of calculated delivery routes, the actual vehicle Km master 106a is referenced to calculate the distance, the one with the shortest distance is selected as the delivery route, and the tariff information master 106b is referenced to calculate the delivery company with the lowest transportation cost for the selected delivery route, and (3) the minimum transportation cost calculated for the first delivery route and the second delivery route are compared, and the delivery route and delivery company with the lowest transportation cost are selected.
[0046] In addition, when creating shipping data, the shipping input unit 102b creates shipping data including the slip number (shipping number), line number, shipping destination, shipping date, shipping instruction number, shipper, delivery order, shipping company, product code, and shipping quantity based on the extracted shipping target and the selected delivery route and delivery company, and registers it in the memory unit 106.
[0047] [3-2. Sample data] 6 to 8 are diagrams showing sample data for explaining a specific example of the processing by the control unit 102 of the logistics management device 100 in this embodiment. A specific example of the processing by the control unit 102 of the logistics management device 100 in this embodiment will be described with reference to FIGS. 6 to 8. In the following example, a case will be described in which the data examples of the actual vehicle Km master 106a, tariff information master 106b, and delivery company master 106c shown in FIGS. 2 to 4 above are used.
[0048] (S1: Shipping instruction input process) A specific example of the shipping instruction input process will be described with reference to Fig. 6. The shipping instruction input unit 102a inputs shipping instruction data including a shipping instruction number, a shipper company, a ship-to company, a shipping date, a product, and a shipping quantity in response to an operation by an operator or the like on a shipping instruction input screen (not shown) displayed on the monitor 114, and stores the data in the storage unit 106.
[0049] Figure 6 is a diagram showing an example of shipping instruction data. The shipping instruction data has fields for the slip number (shipping instruction number), shipper company, ship-to company, shipping date, product code, and shipment quantity. In the example shown in the figure, the first line contains the slip number "SUSI00000001," shipper company "S0002," ship-to company "S0001," shipping date "2024 / 1 / 10," product code "SH00001," and shipment quantity "10."
[0050] (S2: Shipping input processing) A specific example of the shipment input process will be described with reference to Figures 7 and 8. In the shipment input process, the shipping date and the shipping destination company are specified on the shipment input screen, and the shipping instruction data is extracted as shipping target data using the specified shipping date and shipping destination company as keys. After the data is extracted, by pressing the register button, the optimum delivery route is automatically calculated and automatically set in the shipping data.
[0051] 7 is a diagram showing a display example of the shipment input screen 500. The shipment input screen 500 has fields for specifying the shipping date and the shipping destination company, a shipping target display area (having items of row number, shipping date, shipping destination company, shipping instruction number, shipper company, product code, and shipment quantity) in which the shipping instruction data stored in the storage unit 106 is extracted and displayed as shipping target data using the specified shipping date and shipping destination company as keys, a display button, and a registration button.
[0052] When the operator specifies the shipping date and the shipping destination company and presses the display button, the shipping input unit 102b uses the specified shipping date and shipping destination company as keys to extract shipping target data from the shipping instruction data stored in the memory unit 106 and displays it in the shipping target display area.
[0053] Then, when the operator presses the registration button, the shipment input unit 102b performs (calculation of delivery route) and (creation of shipping data) for the shipping target data.
[0054] In the example shown in the same figure, the shipping date "2024 / 1 / 10" and the shipping destination company "S0001" are specified, the display button is pressed, and using the shipping date "2024 / 1 / 10" and the shipping destination company "S0001" as keys, the shipping target data as shown in the same figure is extracted from the shipping instruction data shown in the same figure and displayed in the shipping target display area, and then the registration button is pressed.
[0055] (Delivery route calculation) The delivery route is calculated as follows.
[0056] (1) Extract the shipping instruction data using the following acquisition conditions to obtain the shipping target data. Acquisition conditions: "Shipping destination company on the shipping input screen = Shipping destination company on the shipping instruction data" and "Shipping date on the shipping input screen = Shipping date on the shipping instruction data"
[0057] In this example, shipping instruction numbers "SUSI00000001" to "SUSI00000004" are acquired, but "SUSI00000005" and "SUSI00000006" are not acquired.
[0058] (2) In the case of a second delivery route in which the shipping companies of the shipping target data obtained in (1) are aggregated and the goods are collected from all shipping companies and then delivered to the destination company, the number of possible combinations of delivery routes (route patterns) is calculated as the number of shipping companies! In this example, the destination company is "S0001", and the shipping companies are "S0002", "S0003", and "S0003", and there are 3 x 2 x 1 = 6 route patterns (route pattern 1: S0002 → S0003 → S0004 → S0001, route pattern 2: S0002 → S0004 → S0003 → S0001, route pattern 3: S0003 → S0002 → S0004 → S0001, route pattern 4: S0003 → S0004 → S0002 → S0001, route pattern 5: S0004 → S0002 → S0003 → S0001, route pattern 6: S0004 → S0003 → S0002 → S0001).
[0059] (3) For all delivery routes (route patterns) calculated in (2), the distance is calculated by referring to the actual vehicle Km master 106a, and the shortest route is determined. In this example, route pattern 5 is the shortest at 110 km.
[0060] (4) A list of target delivery companies is obtained from the tariff information master 106b. In this example, two delivery companies, "HA0001" and "HA0002", are targeted. The following loop processing is performed for the delivery companies obtained in (4).
[0061] (5) Calculate the total shipping costs when shipping from the shipping company to the shipping destination company (first shipping pattern), and find the shipping company that will minimize the total shipping costs. In this example, the shipping cost for shipping company "HA0001" is 28,000 yen, and the shipping cost for shipping company "HA0002" is 30,000 yen, with shipping company "HA0001" being the smallest at 28,000 yen.
[0062] (6) For the route with the shortest distance calculated in (3), the tariff information master 106b is referenced to determine the delivery company with the lowest shipping cost. In this example, the delivery company "HA0001" has the lowest shipping cost of 18,000 yen.
[0063] (7) Compare (5) and (6), adopt the one with the smaller shipping cost, and update the delivery order and delivery company in the shipping data. If (6) is smaller, update the order obtained in (3). If (5) is smaller, do not update (set the delivery order to NULL).
[0064] Next, the details of the delivery route calculation will be explained.
[0065] The calculation of the delivery fee when delivering from each of the sender companies to the destination company (first delivery route) in (5) above will be explained in detail. In this example, the shipping fee for S0002 → S0001, S0003 → S0001, and S0004 → S0001 will be calculated respectively.
[0066] (For shipping company "S0002") In the case of shipping company "S0002", the distance from "S0002" to "S0001" is 30 km according to the actual vehicle km master 106a. When calculated by delivery company "HA0001" according to the tariff information master 106b, the minimum charge is 5,000, the distance charge is 3,000, and the total is 8,000. When calculated by delivery company "HA0002", the minimum charge is 4,000, the distance charge is 4,500, and the total is 8,500.
[0067] (For shipping company "S0003") In the case of shipping company "S0003", the distance from "S0003" to "S0001" is 20 km according to the actual vehicle km master 106a. When calculated using delivery company "HA0001" according to the tariff information master 106b, the minimum charge is 6,000, the distance charge is 2,000, and the total is 8,000. When calculated using delivery company "HA0002", the minimum charge is 5,000, the distance charge is 3,000, and the total is 8,000.
[0068] (For shipping company "S0004") In the case of shipper company "S0004," the distance from "S0004" to "S0001" is 50 km according to the actual vehicle km master 106a. When calculated using delivery company "HA0001" according to the tariff information master 106b, the minimum charge is 7,000, the distance charge is 5,000, and the total is 12,000. When calculated using delivery company "HA0002," the minimum charge is 6,000, the distance charge is 7,500, and the total is 13,500.
[0069] From the above, if we calculate the total shipping costs when each shipping company delivers to the shipping destination company, when calculating using shipping company "HA0001", it is 8000 + 8000 + 12000 = 28000 yen, and when calculating using shipping company "HA0002", it is 8500 + 8000 + 13500 = 30000 yen. When calculating using shipping company "HA0001", it is the smallest at 28000 yen.
[0070] In the case where the goods are collected from all the shipping companies (2), (3), and (6) above and then delivered to the shipping destination company (second delivery route), a combination of delivery routes is calculated, and for each calculated combination of delivery routes (route pattern), the actual vehicle Km master 106a is referenced to calculate the distance, the one with the shortest distance is selected as the delivery route, and the tariff information master 106b is referenced to calculate the delivery company that will have the lowest delivery fee for the selected delivery route.This will be described in detail.
[0071] The travel distance for each route pattern is as follows: Route pattern 1 (S0002 → S0003 → S0004 → S0001): Distance = 10 + 70 + 50 = 130 km Route pattern 2 (S0002 → S0004 → S0003 → S0001): Distance = 80 + 70 + 20 = 170 km Route pattern 3 (S0003 → S0002 → S0004 → S0001): Distance = 10 + 80 + 50 = 140 km Route pattern 4 (S0003 → S0004 → S0002 → S0001): Distance = 70 + 80 + 30 = 180 km Route pattern 5 (S0004 → S0002 → S0003 → S0001): Distance = 80 + 10 + 20 = 110 km Route pattern 6 (S0004 → S0003 → S0002 → S0001): Distance = 70 + 10 + 30 = 110 km
[0072] From the above, the shipping cost is calculated using route pattern 5, which has the shortest distance. When calculating using delivery company "HA0001", the minimum charge is 7,000, the distance charge is 11,000, and the total is 18,000. When calculating using delivery company "HA0002", the minimum charge is 6,000, the distance charge is 16,500, and the total is 21,500. When calculating using delivery company "HA0001", the minimum charge is 16,500 yen.
[0073] The route pattern 5 of the second delivery route, with delivery company "HA0001" and shipping cost "16,500 yen", is lower than the delivery company "HA0001" and shipping cost "28,000 yen" of the first delivery route, and is therefore the delivery route with the lowest shipping costs, so this delivery route and delivery company are decided upon.
[0074] (Creating shipping data) The shipment input unit 102b creates shipping data including the slip number (shipment number), line number, shipping destination, shipping date, shipping instruction number, shipper, delivery order, delivery company, product code, and shipment quantity based on the extracted shipping target data and the determined delivery route and delivery company, and registers the data in the memory unit 106.
[0075] 8 is a diagram showing an example of the shipping data to be created. The shipping data includes the following items: slip number (shipping number), line number, shipping destination, shipping date, shipping instruction number, shipper, delivery order, shipping company, product code, and number of shipments.
[0076] In the example shown in the figure, the first line has the following: slip number "SUKA00000001," line number "1," shipping destination "S0001," shipping date "2024 / 1 / 10," shipping instruction number "SUSI00000001," shipper "S0002," delivery order "3," delivery company "HA0001," product code "SH00001," and quantity shipped "10." Note that when using the first delivery route, the delivery order is set to "NULL."
[0077] As described above, according to this embodiment, the actual vehicle Km master 106a is used to register the origins of group companies, the destinations of group companies, and the distances between the origins and destinations in association with each other; the tariff information master 106b is used to register the delivery companies, shipper companies, distances from the shipper companies, and transportation charges in association with each other; and the shipping instruction data includes the shipping instruction number, shipper company, destination company, shipping date, products, and number of products shipped. The shipping instruction data is extracted as shipping target data using the shipping date and destination company as keys. Regarding the extracted shipping target data, (1) in the case of a first delivery route in which delivery companies deliver products from the shipper company to each destination company, the actual vehicle Km master 106a is referenced for each delivery company to obtain the distance to the destination company, and the tariff information master 106b is referenced to calculate the transportation costs for each delivery company. (2) in the case of a second delivery route in which the delivery company collects goods from all shipping companies and then delivers them to the shipping destination company, a combination of delivery routes is calculated, and for each combination of calculated delivery routes, the actual vehicle Km master 106a is referenced to calculate the distance, the route with the shortest distance is selected as the delivery route, and the tariff information master 106b is referenced to calculate the delivery company with the lowest delivery cost for the selected delivery route; and (3) a shipping input unit 102b is provided which compares the minimum delivery cost calculated for the first delivery route with that for the second delivery route, and selects the delivery route and delivery company with the lowest delivery cost.Therefore, when delivering goods between group companies, it is possible to reduce logistics costs by optimizing the delivery route.
[0078] 4. Other Embodiments The present invention may be implemented in various different embodiments other than those described above within the scope of the technical concept set forth in the claims.
[0079] For example, among the processes described in the embodiments, all or part of the processes described as being performed automatically can be performed manually, or all or part of the processes described as being performed manually can be performed automatically using known methods.
[0080] Furthermore, the processing procedures, control procedures, specific names, information including parameters such as registered data and search conditions for each process, screen examples, and database configurations shown in this specification and drawings can be changed as desired unless otherwise specified.
[0081] Furthermore, with regard to the logistics management device 100, the components shown in the figures are functional concepts, and do not necessarily have to be physically configured as shown in the figures.
[0082] For example, all or any part of the processing functions of the logistics management device 100, particularly the processing functions performed by the control unit 102, may be implemented by a CPU and a program interpreted and executed by the CPU, or may be implemented as hardware using wired logic. The program is recorded on a non-transitory, computer-readable recording medium containing programmed instructions for causing the information processing device to execute the processes described in this embodiment, and is mechanically read by the logistics management device 100 as needed. That is, a computer program for providing instructions to the CPU in cooperation with the OS and performing various processes is recorded in a storage unit such as a ROM or HDD (Hard Disk Drive). The computer program is executed by being loaded into RAM, and cooperates with the CPU to form the control unit.
[0083] This computer program may be stored in an application program server connected to the logistics management device 100 via any network, and all or part of it may be downloaded as needed.
[0084] Furthermore, the program for executing the processes described in this embodiment may be stored in a non-transitory computer-readable recording medium or configured as a program product. Here, the term "recording medium" includes any "portable physical medium" such as a memory card, a Universal Serial Bus (USB) memory, a Secure Digital (SD) card, a flexible disk, a magneto-optical disk, a ROM, an Erasable Programmable Read Only Memory (EPROM), an Electrically Erasable and Programmable Read Only Memory (EEPROM (registered trademark)), a Compact Disk Read Only Memory (CD-ROM), a Magneto-Optical disk (MO), a Digital Versatile Disk (DVD), and a Blu-ray (registered trademark) disc.
[0085] Furthermore, a "program" is a data processing method written in any language or description method, and does not matter whether it is in the form of source code or binary code. Note that a "program" is not necessarily limited to a single structure, but also includes a structure that is distributed as multiple modules or libraries, or a structure that achieves its function by cooperating with a separate program, such as an OS. Note that the specific configuration and reading procedure for reading a recording medium in each device shown in this embodiment, as well as the installation procedure after reading, can use well-known configurations and procedures.
[0086] The various databases stored in the memory unit 106 are storage means such as memory devices such as RAM and ROM, fixed disk devices such as hard disks, flexible disks, and optical disks, and store various programs, tables, databases, and web page files used for various processes and providing websites.
[0087] The logistics management device 100 may be configured as an information processing device such as a known personal computer or workstation, or may be configured as the information processing device connected to any peripheral device. The logistics management device 100 may be realized by installing software (including programs, data, etc.) that causes the device to perform the processes described in this embodiment.
[0088] Furthermore, the specific form of distribution and integration of the devices is not limited to that shown in the drawings, and all or part of them can be configured by functionally or physically distributing and integrating them in any unit depending on various additions or functional loads. In other words, the above-described embodiments can be implemented in any combination, or embodiments can be implemented selectively. [Explanation of symbols]
[0089] 100 Logistics management equipment 102 Control section 102a Shipping instruction input section 102b Shipping Input Section 102c Master Maintenance Department 102d Screen display control unit 104 Communication interface unit 106 Storage section 106a Actual vehicle Km master 106b Tariff information master 106c Shipping company master 108 Input / Output Interface Section 112 Input Device 114 Output Device 200 servers 300 Network
Claims
1. A logistics management device for managing logistics between group companies, the device comprising: The control unit a first master in which the departure points of group companies, the destination points of group companies, and the distances between the departure points and the destination points are registered in association with each other; a second master in which a delivery company, a shipping company, a distance from the shipping company, and a shipping fee are associated and registered; Shipping instruction data including shipping instruction number, shipping origin company, shipping destination company, shipping date, product, and shipping quantity; The memory area in which the following is stored is accessible: The shipping instruction data is extracted as shipping target data using the shipping date and the shipping destination company as keys, and the extracted shipping target data is (1) In the case of a first delivery route in which a delivery company delivers products from a shipper company to each of the destination companies, the first master is referenced for each shipper company to obtain the distance to the destination company, the second master is referenced to calculate the shipping costs for each delivery company, the total of the shipping costs is calculated, and the delivery company with the lowest shipping costs is determined; (2) In the case of a second delivery route in which a delivery company collects goods from all shipping companies and then delivers them to shipping destination companies, a combination of delivery routes is calculated, and for each calculated combination of delivery routes, the first master is referenced to calculate the distance, and the route with the shortest distance is selected as the delivery route. The second master is referenced to calculate the delivery company that will have the lowest transportation costs for the selected delivery route. (3) A logistics management device characterized by comprising a shipping input means for comparing the minimum transportation costs calculated for the first delivery route and the second delivery route, and selecting the delivery route and delivery company with the lower transportation costs.
2. 2. The physical distribution management device according to claim 1, wherein the transportation fee in the second master is made up of a basic fee and an additional fee added for each distance.
3. The logistics management device according to claim 1 or 2, characterized in that the shipment input means creates shipping data including a shipping number, a line number, a shipping destination company, a shipping date, a shipping instruction number, a shipping company, a delivery order, a delivery company, a product, and a number of shipments based on the extracted shipping target data and the selected delivery route and delivery company.
4. A logistics management method executed by an information processing device having a control unit, The control unit a first master in which the departure points of group companies, the destination points of group companies, and the distances between the departure points and the destination points are registered in association with each other; a second master in which a delivery company, a shipping company, a distance from the shipping company, and a shipping fee are associated and registered; Shipping instruction data including shipping instruction number, shipping origin company, shipping destination company, shipping date, product, and shipping quantity; The memory area in which the following is stored is accessible: Executed in the control unit: The shipping instruction data is extracted as shipping target data using the shipping date and the shipping destination company as keys, and the extracted shipping target data is (1) In the case of a first delivery route in which a delivery company delivers products from a shipper company to each of the destination companies, the first master is referenced for each shipper company to obtain the distance to the destination company, the second master is referenced to calculate the shipping costs for each delivery company, the total of the shipping costs is calculated, and the delivery company with the lowest shipping costs is determined; (2) In the case of a second delivery route in which a delivery company collects goods from all shipping companies and then delivers them to shipping destination companies, a combination of delivery routes is calculated, and for each calculated combination of delivery routes, the first master is referenced to calculate the distance, and the route with the shortest distance is selected as the delivery route. The second master is referenced to calculate the delivery company that will have the lowest transportation costs for the selected delivery route. (3) A logistics management method characterized by including a shipping input step of comparing the minimum transportation costs calculated for the first delivery route and the second delivery route, and selecting the delivery route and delivery company with the lower transportation costs.
5. A logistics management program to be executed by an information processing device having a control unit, The control unit a first master in which the departure points of group companies, the destination points of group companies, and the distances between the departure points and the destination points are registered in association with each other; a second master in which a delivery company, a shipping company, a distance from the shipping company, and a shipping fee are associated and registered; Shipping instruction data including shipping instruction number, shipping origin company, shipping destination company, shipping date, product, and shipping quantity; The memory area in which the following is stored is accessible: The control unit The shipping instruction data is extracted as shipping target data using the shipping date and the shipping destination company as keys, and the extracted shipping target data is (1) In the case of a first delivery route in which a delivery company delivers products from a shipper company to each of the destination companies, the first master is referenced for each shipper company to obtain the distance to the destination company, the second master is referenced to calculate the shipping costs for each delivery company, the total of the shipping costs is calculated, and the delivery company with the lowest shipping costs is determined; (2) In the case of a second delivery route in which a delivery company collects goods from all shipping companies and then delivers them to shipping destination companies, a combination of delivery routes is calculated, and for each calculated combination of delivery routes, the first master is referenced to calculate the distance, and the route with the shortest distance is selected as the delivery route. The second master is referenced to calculate the delivery company that will have the lowest transportation costs for the selected delivery route. (3) A logistics management program for executing a shipment input process that compares the minimum transportation costs calculated for the first delivery route and the second delivery route, and selects the delivery route and delivery company with the lower transportation costs.
Citation Information
Patent Citations
Delivery program, delivery system, information processing device
JP7203265B1