[go: up one dir, main page]

WO2015059750A1 - Physical distribution planning device, physical distribution planning program, and storage medium - Google Patents

Physical distribution planning device, physical distribution planning program, and storage medium Download PDF

Info

Publication number
WO2015059750A1
WO2015059750A1 PCT/JP2013/078474 JP2013078474W WO2015059750A1 WO 2015059750 A1 WO2015059750 A1 WO 2015059750A1 JP 2013078474 W JP2013078474 W JP 2013078474W WO 2015059750 A1 WO2015059750 A1 WO 2015059750A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
plan
item
base
transportation
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/JP2013/078474
Other languages
French (fr)
Japanese (ja)
Inventor
野本 多津
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Ltd
Original Assignee
Hitachi Ltd
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 Hitachi Ltd filed Critical Hitachi Ltd
Priority to JP2015543588A priority Critical patent/JPWO2015059750A1/en
Priority to PCT/JP2013/078474 priority patent/WO2015059750A1/en
Publication of WO2015059750A1 publication Critical patent/WO2015059750A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; 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

  • the present invention relates to a distribution plan generation program for storing and moving goods, a distribution plan generation program, and a storage medium.
  • Patent Document 1 states that “When the inventory management server receives the transportation request information from the shipper terminal, it sends warehousing instruction information to, for example, the distribution center system. In the distribution center, warehousing registration is performed after inspection when goods are received.
  • the warehouse terminal transmits the warehousing registration information to the inventory management server, and the inventory management server registers the received warehousing registration information in the inventory management database server.
  • the warehouse terminal After the warehouse terminal receives the delivery instruction information, the picking, sorting / inspection, and shipping registration of the product are performed, and the warehouse terminal sends the shipping registration information to the inventory management server. Register the shipping registration information in the inventory management database server, and send the corresponding inventory management information when there is a search request from the shipper terminal Logistics support systems have been described.
  • Patent Document 1 The invention described in Patent Document 1 is disclosed as background technology related to the 3PL business.
  • work instructions for warehouse and delivery are generated in correspondence with joint delivery in which a warehouse and a transport vehicle are shared by a plurality of companies.
  • the present invention has been made in view of such a point, and a logistics planning apparatus capable of generating a plan capable of evaluating the efficiency of both warehouse work and transportation and improving the efficiency of the entire logistics.
  • An object is to provide a distribution plan generation program and a storage medium.
  • the present invention provides item information that is information about an item, base information that is information about a base including a shipping location, a storage location, and an arrival location, and the stock of the item and the inventory at the base.
  • Inventory information associated with information about work information that is information about work time at the base for the item, travel route information that is information about a travel route and travel time between the bases, Transport resource information that is information related to transport resources that move between bases, warehouse processing capacity information that is information related to processing capacity at the bases, and a shipping plan in which the items and the delivery date and shipping quantity of the items are associated with each other.
  • a storage unit for storing the item information, the base information, the inventory information, the work information, and the transfer information.
  • FIG. 1 It is a figure which shows schematic structure of the physical distribution planning apparatus 100 which concerns on one Embodiment of this invention. It is a figure which shows the structural example of the hardware of the physical distribution planning apparatus. It is a figure which shows an example of item information. It is a figure which shows an example of the movement relationship of the item between base information and bases. It is a figure which shows an example of base information. It is a figure which shows an example of stock information. It is a figure which shows an example of work information. It is a figure which shows an example of movement route information. It is a figure which shows an example of transport resource information. It is a figure which shows an example of warehouse processing capacity information. It is a figure which shows an example of a shipping plan.
  • FIG. 1 is a diagram showing a schematic configuration of the physical distribution planning apparatus 100.
  • the distribution planning apparatus 100 mainly includes a storage unit 101 that stores input information, a processing unit 102, a storage unit 103 that stores output information, a display unit 104, and an input unit 105.
  • the logistics planning apparatus 100 is connected to the terminals 111, 112, 113,... Of the shippers A, B, C... Information can be transmitted to and received from the terminals 111, 112, 113.
  • the terminals 111, 112, 113... Mainly have a display unit, an input unit, and a storage unit.
  • FIG. 2 is a diagram illustrating a hardware configuration example of the physical distribution planning apparatus 100.
  • the physical distribution planning device 100 is a computer such as a personal computer, a workstation, or a server device.
  • the distribution planning apparatus 100 mainly includes an input device 201, an output device 202, an external storage device 203, an arithmetic device 204, a main storage device 205, a communication device 206, and a bus 207 that connects the devices to each other.
  • the input device 201 is a device that receives input from, for example, a keyboard, mouse, touch pen, or other pointing device.
  • the output device 202 is a device that performs display, such as a display.
  • the external storage device 203 is a nonvolatile storage device such as a hard disk device or a flash memory.
  • the computing device 204 is a computing device such as a CPU (Central Processing Unit).
  • the main storage device 205 is a memory device such as a RAM (Random Access Memory).
  • the communication device 206 is a wireless communication device that performs wireless communication via an antenna, or a wired communication device that performs wired communication via a network cable.
  • the storage unit of the distribution planning device 100 is realized by the main storage device 205 or the external storage device 203 of the distribution planning device 100.
  • the input unit, processing unit, and output unit of the distribution planning apparatus 100 are realized by a program that causes the arithmetic unit 204 of the distribution planning apparatus 100 to perform processing.
  • the physical distribution planning apparatus 100 may include a communication device 206 as necessary, and may send and receive information via the communication device 206.
  • product information and shipping plans are installed in equipment managed by the shipper
  • inventory information is installed in equipment managed by each site
  • warehouse information is installed in equipment managed by the warehouse operator
  • information related to transportation Is installed in an apparatus managed by a logistics company and a processing unit that calculates and outputs a result is mounted in an apparatus managed by a 3PL operator.
  • the storage unit 101 stores item information that stores the weight, volume, transportation conditions, and the like of items to be transported / stored, base information that stores the shipping location, storage location, and arrival location of the items, and inventory by location of each item.
  • inventory information that stores the amount of work in progress and inventory standards, work information that stores the work time of each item in the warehouse, and the route and time of movement of the item from base 1 (from) to base 2 (to) Travel route information, transport resources (cars, ships, etc.) for moving items, transport resource information storing the cost, transportable amount, etc., warehouse processing capacity information storing work capacity in the warehouse,
  • the shipment date and time and the shipment plan storing the shipment quantity for each item location are stored.
  • FIG. 3 is a diagram showing an example of item information.
  • a name for identifying the item, a weight, a packaged volume, a packaged weight, and the like are stored as information about the item.
  • the item information is associated with an item, a weight, a packing seat, and a packing weight.
  • FIG. 4 is a diagram showing an example of the movement relationship between the base information and the items between the bases.
  • FIG. 5 is a diagram illustrating an example of the base information.
  • the bases V1 that ship PARTS1, V2 that ship PARTS2, P1 that receives PARTS1 and ship PROD1, and P2 that receives PARTS1 and ship PROD2 and PARTS2 are received.
  • the movement route between bases is shown by the arrow.
  • items can be moved to the receiving / shipping locations P1, P2.
  • items can be moved from the arrival / shipment place P1 to the storage place W1 and the arrival place M1.
  • only a part of the line indicating the movement route connecting the bases is shown in order to avoid complexity.
  • FIG. 5 shows a list of information relating to the shipping location, receiving / shipping location, storage location, and receiving location shown in FIG.
  • bases V1, P1, W1, M1, etc.
  • types shipment, receiving / shipping, storage, receiving, etc.
  • FIG. 6 is a diagram showing an example of inventory information.
  • the inventory information is information relating to the base including the shipping place, the storage place, and the receiving place.
  • an item, a base, an inventory amount, an in-process amount, an inventory standard, and a cost are associated with each other.
  • the item in the inventory information corresponds to the item in the item information.
  • the base in the inventory information corresponds to the base in the base information.
  • the item PROD1 has a stock amount 200 and a work-in-progress amount 200 at the base P1, and the stock standard is “shipping plan 2 days”, that is, the shipping plan for the preceding 2 days. It is shown that it is desirable to store stock in the base P1 by the amount.
  • shipment plan 2 days that is, the shipping plan for the preceding 2 days. It is shown that it is desirable to store stock in the base P1 by the amount.
  • the definition of the inventory standard is an example.
  • FIG. 7 is a diagram showing an example of work information.
  • the work information for each item, a base and information related to inventory at the base are associated.
  • the work information is associated with items, bases, and inventory information (retransmission man-hours, transshipment costs, warehousing man-hours, warehousing costs, warehousing man-hours, shipping costs, etc.).
  • the item in the work information corresponds to the item in the item information.
  • the base in the work information corresponds to the base in the base information.
  • the cost for warehouse work can be calculated according to the number of warehousing steps, the warehousing cost, the number of warehousing steps, and the shipping cost.
  • FIG. 8 is a diagram illustrating an example of travel route information.
  • the travel route information is information related to a travel route including a travel route between bases and a travel time.
  • the travel route information includes items, information on the travel route (information (from) indicating the departure base, information (to) indicating the arrival base, transport type, transport time, cost, etc.). And are associated. The item is not specified in the travel route information.
  • Information (from) indicating the departure base and information (to) indicating the arrival base are associated with the base in the base information.
  • the first line of the travel route information shown in FIG. 8 registers that when the vehicle travels from the base P2 to the base P1, the time is 1 and the cost needs 1 / packing.
  • FIG. 9 is a diagram showing an example of transport resource information.
  • the transport resource information is information related to transport resources that move between bases.
  • the information regarding the transport resource includes the transport resource, the transport type, the loaded weight, the loaded volume, the cost, and the like, and these are associated with each other and stored in the transport resource information.
  • the transportation cost can be calculated according to what percentage of the loading weight and loading capacity is satisfied.
  • the first line of the transport resource information shown in FIG. 9 shows that the transport resource TR1 has a transport type of car, a maximum loadable weight of 1000, a maximum loadable capacity of 5, and a cost of 50 per vehicle. Is registered.
  • FIG. 10 is a diagram showing an example of warehouse processing capacity information.
  • the warehouse processing capacity information is information related to the processing capacity at the base.
  • the information on the processing capacity includes the base, the date, the information on the personnel (full-time number of persons, the number of parts, etc.), etc., and these are stored in association with the warehouse processing capacity information.
  • the base in the warehouse processing capacity information corresponds to the base in the base information.
  • the warehouse processing capacity information shown in FIG. 10 registers the work personnel for each day at each base as an example of calculating the work time by the number of people. For example, in the case of equipment such as an automatic warehouse, the number of equipment and processing capacity are registered.
  • FIG. 11 is a diagram showing an example of a shipping plan.
  • the shipping plan is a registration of the period and quantity at which an item moves from the shipping source to the receiving destination.
  • an item, its delivery date, and the shipment amount are associated with the shipment plan.
  • the shipment plan is information on which the logistics planning device 100 generates a logistics plan.
  • the shipment plan is associated with items, shipping origins, receiving destinations, information on the presence / absence of designation of the shipping department, delivery date, and shipping quantity.
  • the item in the shipping plan corresponds to the item in the item information.
  • the shipping source and the receiving destination in the shipping plan correspond to the bases in the base information.
  • the period is a day, but it may be a unit such as a week or an hour.
  • the processing unit 102 generates a logistics plan (a warehouse work plan and a transportation plan) based on the information stored in the storage unit 101.
  • the processing of the processing unit 102 will be described in detail later.
  • the storage unit 103 stores a logistics plan (a warehouse work plan and a transportation plan) generated by the processing unit 102.
  • FIG. 12 is a diagram showing an example of a warehouse work plan.
  • the warehouse work plan is a result of storing the generated warehouse work plan.
  • the warehouse work plan is information indicating when and how much work is performed on which items and how much time is required.
  • the warehouse work plan is associated with items, bases, and information (date, work type, quantity, work time, etc.) regarding work at the bases.
  • the item in the warehouse work plan corresponds to the item in the item information.
  • the base in the warehouse work plan corresponds to the base in the base information.
  • FIG. 13 is a diagram showing an example of a transportation plan.
  • the transportation plan is a result of storing the generated transportation plan.
  • the transportation plan includes information on transportation items (transportation item information) and information indicating transportation routes (transportation route information).
  • the transportation item information shown in FIG. 13 (A) is information indicating when, what item, which route, what, and how much it is carried.
  • the transportation item information the shipping date, the arrival date, the item, the route, the loading base, the unloading base, the transportation type, the car number, and the transportation amount are associated with each other.
  • the item in the transportation item information corresponds to the item in the item information.
  • the loading base and the unloading base in the transport item information correspond to the bases in the base information.
  • the transport type in the transport item information corresponds to the transport resource in the transport resource information.
  • the transportation route information shown in FIG. 13B is information indicating the item and the transportation route for transporting the item.
  • the transportation route information registers how the transportation resources are used for each transportation resource used, and the transportation items include which items are loaded on each route and how many packages are loaded (loading bases). The location at which the product was unloaded (unloading site) is registered.
  • the transport route information includes route, arrival point information (TO), departure point information (FROM), number of stops indicating the number of stops on the route, stop 1, indicating stop points on the route, stop 2 and stop-by 3 are associated with each other.
  • the display unit 104 is a device that performs display such as a display.
  • the display unit 104 constitutes a part of the output device 202.
  • the input unit 105 is a device that accepts input from a keyboard, mouse, touch pen, or other pointing device. As the input unit 105, the input device 201 can be used.
  • the distribution planning apparatus 100 stores information stored in the storage unit 101 in a memory, calculates a warehouse work plan and a transportation plan in the processing unit 102, and outputs the calculated plans from the memory to the storage unit 103.
  • the processing unit 102 performs processing using a CPU and a memory.
  • FIG. 14 is a flowchart showing a processing flow in which the processing unit 102 calculates a warehouse work plan and a transportation plan. The process illustrated in FIG. 14 is started when a process start instruction is input from the input device 201 or the like.
  • Step 1201 First, the processing unit 102 reads input information necessary for calculation from the storage unit 101 into a memory.
  • the processing unit 102 generates a transportation means candidate used to transport the item from the shipping destination to the receiving destination according to the shipping plan read from the storage unit.
  • the transportation means refers to a set of a movement route and transportation resources.
  • the transportation means candidates are extracted from the transportation resource information shown in FIG. 9 and stored in the memory as transportation means for each moving route information data (in FIG. 8, one line 1 data) with the same transportation type.
  • the travel route in the first row in FIG. 8 (referred to as “route 1” for convenience) has the transport type “car”, and therefore, from the transport resource information in FIG.
  • One transportation resource is extracted, and (route 1, T1) (route 1, T2) (route 1, T3) three transportation means are generated.
  • the simplest generation procedure is to apply transport resources to all travel routes.
  • the travel route information and the transport resource information are small, there is no problem because the transport means to be generated is small.
  • the amount of data of travel route information depends on the number of bases, the route to travel, and variations in the fee structure, and there is a lot of information. Therefore, there are a huge number of transportation means candidates that combine transportation resources with this. If many transportation means candidates are generated in the present embodiment, the amount of calculation in step 1203 to be described later increases, and the processing time becomes a problem.
  • FIG. 15 is a flowchart illustrating a processing flow in which the processing unit 102 generates a transportation means candidate.
  • FIG. 15 shows a form in which candidates for transportation means are narrowed down by effectively utilizing the previous transportation plan.
  • the processing unit 102 reads the transportation means in the candidate log as an initial candidate.
  • the candidate log is a storage area for storing transportation means candidates, and the number of candidates is zero for the first time.
  • the processing unit 102 refers to the transportation plan stored in the storage unit 103, and uses the transportation route stored in the transportation plan (ignoring transportation resources at this stage) as an initial candidate (A). And That is, the transportation route of the transportation means in the candidate log is included in the traveling route stored in the traveling route information (FIG. 8).
  • Step S12022> the processing unit 102 adds a route registered as a set of a shipping source and a receiving destination registered in the shipping plan from the travel route information (see FIG. 8) stored in the storage unit 101.
  • a search is made for From or To that matches the initial candidate (A) obtained in step S12021, and (A) and the travel route obtained by the search are designated as alternative routes (B).
  • the initial candidate (A) is from P1 to W1 (first line in FIG. 13A)
  • From or To matches the initial candidate (A)
  • the travel route information FOG. 8 3 routes from P1 to W1, P2 to W1, and P3 to W1 are searched.
  • the processing unit 102 searches the transport resource information (see FIG. 9) for transport resources whose transport type is “car”. As a result, the transport resources “TR1”, “TR2”, and “TR3” are searched.
  • the processing unit 102 adds a predetermined number of travel routes out of the routes searched in this way to the initial candidate (A) to make an alternative route (B).
  • (P1-W1, TR1), (P2-W1, TR1), (P3-W1, TR1), (P1-W1, TR2), (P2-W1, TR2) are pairs of routes and transport resources.
  • (P3-W1, TR2), (P1-W1, TR3), (P2-W1, TR3), (P3-W1, TR3) become the substitutable route (B).
  • the additional number (predetermined number) from the initial candidate (A) in the substitutable route (B) is set by a parameter, for example.
  • the processing unit 102 narrows down candidates from the substitutable route (B).
  • cost information of travel route information can be used.
  • TR3 with a low cost is set from the three types TR1, TR2, and TR3.
  • (P1-W1, TR3), (P2-W1, TR3), and (P3-W1, TR3) are narrowed down as candidates from the substitutable route (B).
  • TR3 has already been added as a candidate, it can be narrowed down as a TR1 candidate with the next lowest cost.
  • transportation item information can be used for narrowing down.
  • the processing unit 102 can obtain information that is not included in the transport item information (see FIG. 13A) and the cost of the pair of the route and the transport resource in the substitutable route (B) is low. Narrow down candidates by giving priority.
  • the candidate log is generated by the above processing.
  • the candidate log generated here becomes the initial candidate (A).
  • step S1202. The process illustrated in FIG. 15 is an example of the process of step S1202.
  • the processing unit 102 generates a warehouse work plan and a transportation plan that meet a shipping plan (see FIG. 11). Specifically, the processing unit 102 uses which means of transportation and which site to use to receive a specified amount of items registered in the shipping plan from a specified shipping source base to a specified receiving destination base. Decide whether to transport via. In that case, considering the constraint conditions such as loading weight, loading capacity, warehouse holding capacity, shipment amount of the shipping plan, the sum of the cost, the deviation from the inventory standard, and the deviation from the holding capacity of the warehouse work are minimized. Calculate so that Note that the constraint condition is included in each piece of information stored in the storage unit 101.
  • FIG. 16 shows a list of bases.
  • the lines in FIG. 16 are transportation means candidates obtained in step S1202.
  • the transportation means candidates received at the base M1 are the three routes of the base P1 to the base M1, the base P2 to the base M1, and the base W1 to the base M1. Assuming that the number of transportation of the item PROD1 from the base P1 to the base M1 is x1, the number of transportation of the item PROD1 from the base P2 to the base M1 is x2, and the transportation number of the item PROD1 from the base W1 to the base M1 is x3, the objective function is expressed by the formula (1 ).
  • numbers such as 2, 2, 1 etc., which are multiplied by x1, x2, x3, are the evaluation parameters.
  • the cost during transportation moves route information, see FIG. 8
  • x1 is multiplied by 2 in Equation (1).
  • x2 is multiplied by 2 in Equation (1).
  • x3 is multiplied by 2 in Equation (1).
  • the shipment volume of PROD1 on September 1 is 70 (restriction condition). If the number of transportation of the item PROD1 from the base P1 to the base M1 is x1, the transportation number of the item PROD1 from the base P2 to the base M1 is x2, and the transportation number of the item PROD1 from the base W1 to the base M1 is x3, the transportation number is x1, x2. , X3 is expressed by Equation (2). Note that the shipping destination and the receiving destination in the shipping plan are provisionally input by the user or the like when the shipping plan is created.
  • the transport number of the item PROD1 from the base P1 to the base W1 is y1
  • the transport number of the item PROD1 from the base P2 to the base W1 is y2
  • the transport number is y3
  • the transport numbers y1, y2, and y3 are expressed by Equation (3).
  • the inventory quantity Z in W1 and the in-process quantity in W1 are stored in the inventory information (FIG. 6) (restriction condition).
  • the transport number x3 is expressed by Equation (4).
  • T1 (number of transports in transport resource TR1) + T2 (number of transports in transport resource TR2) + T3 (number of transports in transport resource TR3)
  • the loaded weight of the transport resource TR1 is 1000 (constraint condition) from the transport resource information (see FIG. 9). Further, from the item information (FIG. 3), the packing weight of the item PROD1 is 10 (constraint condition). Therefore, the transport number T1 is expressed by Equation (5).
  • transport numbers T2 and T3 not only the loaded weight but also the loaded volume (see FIG. 9) can be expressed by a mathematical formula by the same method as the loaded weight.
  • the warehouse processing capacity information (see FIG. 10) stores information that the total number of workers at the base W1 is 30 people, that is, 30 full-time workers and 70 part-time workers (restriction condition). Further, the work information (see FIG. 7) stores information that the warehousing man-hours and the warehousing cost when the item PROD1 is handled at the base W1 are 1 (restriction condition). Therefore, the constraint condition at the site W1 is expressed by Expression (7).
  • the transport numbers x1, x2, and x3 are mixed integers so as to satisfy all the constraint conditions shown in equations (2) to (7) as the constraint conditions that satisfy the target value.
  • the number of transports x1, x2, and x3 can be obtained by a mixed integer programming so as to satisfy a part of the constraint conditions.
  • Step 1204 Returning to the description of FIG.
  • the processing unit 102 outputs the warehouse work plan and the transportation plan generated in step S1203 to the storage unit 103.
  • the item PROD3 issued on September 2 is transported from the base W1 to the base M2 via the R3 route so that the shipping plan can be executed.
  • the warehouse plan information stored in the storage unit 103 (see FIG. 12), the item PROD3 transported here was received at the base W1 on September 1 and left on September 2. I understand.
  • step S1203 a transportation plan is generated with as few vehicles as possible so that the loading rate is as high as possible. Further, in step S1203, a warehouse work for realizing leveling of work at the base W1 is generated by carrying the shipment plan for September 2 to the warehouse at the base W1 on the previous day.
  • FIG. 17 is a diagram illustrating a display example on the display unit 104.
  • the display unit 104 displays information related to the transportation plan and information related to the warehouse work plan at the same time.
  • a transport plan and a diagram showing a transport route are displayed as information related to the transport plan, but the diagram showing the transport route is not essential.
  • the warehouse work plan, the warehouse work load, and the inventory transition are displayed as information on the warehouse work plan, but the warehouse work load and the inventory transition are not essential.
  • the warehouse work plan for the base W1 is displayed, but a warehouse work plan for a base other than the base W1 may be displayed.
  • the processing unit 102 determines whether or not to adopt the plan for the warehouse work plan and the transportation plan calculated in step 1203 and displayed on the display unit 104 in step S1204.
  • the processing unit 102 may receive an input from the input unit 105 and make a determination based on the input.
  • the cost target is registered in the storage unit 101 in advance, and the processing unit 102 compares the registered cost target with the cost obtained from the calculation result, and the cost target obtained by registering the cost obtained from the calculation result. If it is lower, it may be determined that the plan is adopted.
  • the cost target includes the warehousing cost (work information (see FIG. 7)), the total cost (the cost in the movement route information (FIG.
  • the processing unit 102 When the warehouse work plan and the transportation plan calculated in step 1203 are not adopted (NG in step S1205), the processing unit 102 returns to step 1202. Based on the current candidate log, the processing unit 102 generates a new transportation means candidate in step S1202 and updates the candidate log. And the process part 102 performs the process after step 1203 again. In this way, the processing of steps 1202 to 1205 is repeated until the warehouse work plan and the transportation plan calculated in step 1203 are adopted (OK in step S1205).
  • step S1205 If the transportation means candidate has been updated, or if the warehouse work plan or transportation plan calculated in step 1203 is not adopted (NG in step S1205) has reached a certain number of times (for example, 10,000 times) or more, If the time for repeating the processing from 1202 to 1205 is equal to or longer than a certain time (for example, 1 minute), it is considered that no better plan can be found. Such a case can be dealt with by terminating the process or changing the evaluation parameter at the time of calculation in step 1203 and recalculating. Which one is adopted may be set in advance, or may be selected by receiving an input from the input unit 105.
  • the evaluation parameter indicates the degree of emphasis on transportation, warehouse, and inventory, that is, which is emphasized when evaluating the optimality of transportation, warehousing, and inventory. Evaluation parameters can be set for each item or location. Considering the shipper's position, it is better to increase the transportation efficiency for items that sell well even if the inventory increases somewhat, and it may be desirable to turn the items that do not sell well with a small inventory even if the transportation efficiency is reduced. Thus, when the evaluation scale for optimality changes due to differences in items, bases, etc., it is desirable to incorporate it into the calculation. Note that, in the mathematical formula (1) already described, the evaluation parameter that emphasizes transportation is used.
  • FIG. 18 shows a display example of the display unit 104 when the evaluation parameter is input from the input unit 105.
  • an item selection area in which an item selection button is displayed a base designation area for designating a base that handles the item, and the importance of transport, warehouse (warehouse work), and inventory are displayed as evaluation parameters.
  • an evaluation parameter display area an evaluation parameter display area.
  • the input unit 105 selects an item using the item selection area, selects a base as necessary using the base designation area, and changes the degree of emphasis on transportation, warehouse work, and inventory using the evaluation parameter display area. .
  • the item PROD1 emphasizes the optimality of inventory
  • the item PROD3 emphasizes transportation.
  • the processing unit 102 stores the evaluation parameter changed by the input unit 105 in the storage unit 103.
  • the processing unit 102 When the evaluation parameter is changed by the input unit 105, the processing unit 102 considers that the warehouse work plan and the transportation plan calculated in step 1203 are not adopted (NG in step S1205) and returns to step 1202. For example, when using mixed integer programming in step 1203, the processing unit 102 changes the coefficient of the objective function based on the changed evaluation parameter. For example, when the ratio of the importance level of transportation, warehouse work, and inventory is 1: 1: 2, the cost of transportation (see movement route information (FIG. 8)) and the cost of warehouse work (work information (FIG. 7)). See), and a value obtained by adding the inventory cost (see inventory information (see FIG. 6)) 1: 1: 2 is used as the coefficient of the objective function. Thereby, it is possible to generate a warehouse work plan and a transportation plan according to the user's request.
  • the present embodiment it is possible to generate a plan that can increase the efficiency of the entire physical distribution by creating a warehouse work plan and a transport plan in consideration of warehouse work and transportation at the same time. For example, when it is desired to reduce the cost, the total cost as a whole can be reduced in consideration of the costs of warehouse work and transportation.
  • the evaluation parameter is changed by inputting the evaluation parameter for each item (see FIG. 18), but the method of changing the evaluation parameter is not limited to this.
  • the processing unit 102 may automatically change the evaluation parameter according to the characteristics of the item. For example, in the item information (FIG. 3) stored in the storage unit 101, the characteristics of the item (release time, sales period, etc.) are stored in association with the item, and not much time has passed since the release time ( In the case of a new product or the like, the processing unit 102 may increase the importance of transportation. Further, when the sales period is a certain period or more, the importance degree of inventory may be increased. In addition, referring to the warehouse processing capacity information (FIG. 10), for items passing through a base with many parts, the increase or decrease in inventory does not affect the cost so much, so the ratio of inventory may be lowered.
  • the evaluation parameter may be changed by the input unit 105 or the evaluation parameter may be automatically changed by the processing unit 102 at any time. For example, you may perform before starting the process shown in FIG.
  • the present invention is not limited to the above-described embodiment, and includes various modifications.
  • the above-described embodiment has been described in detail for easy understanding of the present invention, and is not necessarily limited to one having all the configurations described.
  • a part of the configuration of an embodiment can be replaced with the configuration of another embodiment, and the configuration of another embodiment can be added to the configuration of an embodiment.
  • each of the above-described configurations, functions, processing units, processing means, and the like may be realized by hardware by designing a part or all of them with, for example, an integrated circuit.
  • Each of the above-described configurations, functions, and the like may be realized by software by interpreting and executing a program that realizes each function by the processor.
  • Information such as programs, tables, and files for realizing each function can be stored in a recording device such as a memory, a hard disk, an SSD (Solid State Drive), or a recording medium such as an IC card, an SD card, or a DVD.
  • control lines and information lines indicate what is considered necessary for the explanation, and not all control lines and information lines are necessarily shown. Actually, it may be considered that almost all the components are connected to each other.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Quality & Reliability (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

Efficiency of both warehouse work and transport is evaluated to generate a plan that can increase the efficiency of physical distribution as a whole. A physical distribution planning device is provided with: a storage unit that stores item information, hub information, inventory information, work information, movement route information, transport resource information, warehouse processing capability information, and a shipping plan; a processing unit that generates a warehouse work plan associating the information about the item, the hub, and work at the hub with each other, and a transport plan associating information indicating the item and a transport route for transporting the item with information about the transport route, so that constraint conditions about transport included in the item information, the hub information, the inventory information, the work information, the movement route information, the transport resource information, and the warehouse processing capability information and a constraint condition about the hub are satisfied, and so that the shipping plan can be executed; and an output unit that outputs the generated warehouse work plan and transport plan.

Description

物流計画装置、物流計画生成プログラム及び記憶媒体Distribution planning apparatus, distribution plan generation program, and storage medium

 本発明は、物品を保管、移動するための物流計画装置物流計画生成プログラム及び記憶媒体に関する。 The present invention relates to a distribution plan generation program for storing and moving goods, a distribution plan generation program, and a storage medium.

 特許文献1には、「在庫管理サーバは、荷主端末から輸送依頼情報を受信すると、例えば物流センタシステムへ入庫指示情報を送信する。物流センタでは、商品が入庫すると検査後、入庫登録が行われ、倉庫端末が入庫登録情報を在庫管理サーバへ送信する。在庫管理サーバは受信した入庫登録情報を在庫管理データベースサーバに登録する。所定の期間商品を保管した後、在庫管理サーバは物流センタシステムへ出庫指示情報を送信する。倉庫端末が出庫指示情報を受信した後、商品のピッキング、仕分け・検品、出荷登録がなされ、倉庫端末が出荷登録情報を在庫管理サーバ送信する。在庫管理サーバは受信した出荷登録情報を在庫管理データベースサーバに登録する。荷主端末から検索要求があると対応する在庫管理情報を送信する」物流業務支援システムが記載されている。 Patent Document 1 states that “When the inventory management server receives the transportation request information from the shipper terminal, it sends warehousing instruction information to, for example, the distribution center system. In the distribution center, warehousing registration is performed after inspection when goods are received. The warehouse terminal transmits the warehousing registration information to the inventory management server, and the inventory management server registers the received warehousing registration information in the inventory management database server. After the warehouse terminal receives the delivery instruction information, the picking, sorting / inspection, and shipping registration of the product are performed, and the warehouse terminal sends the shipping registration information to the inventory management server. Register the shipping registration information in the inventory management database server, and send the corresponding inventory management information when there is a search request from the shipper terminal Logistics support systems have been described.

特開2002-24349号公報JP 2002-24349 A

 1980年代より、メーカー・卸・小売などあらゆる業種業態で、物流に関する業務全体を一括してアウトソーシングする動きが進んでいる。荷主企業に代わり、効率的な物流戦略の企画立案や物流システムの構築の提案を行い、かつ、それを包括的に受託して実行する事業は、サードパーティロジスティクス(3PL)事業と呼ばれている。3PL事業を請け負う物流業者は、自社や協力会社の物流網を活用し、効率のよい倉庫管理、輸配送を行うことで、コスト低減、利益向上、環境負荷低減に努めている。近年は、効率化の施策として、複数の荷主企業からの貨物を1台のトラックやコンテナで運ぶ共同配送や、複数の荷主の荷物を同じ倉庫で保管する共同倉庫がある。これらは、コスト削減はもとより、景気や政策の影響をうけやすい物流業界において、リスク回避、物量の確保が期待できる。 Since the 1980s, there has been a movement to outsource all logistics-related operations in a variety of business categories such as manufacturers, wholesalers, and retailers. The business that performs efficient logistics strategy planning and logistics system construction on behalf of the shipper company, and comprehensively entrusts and executes it is called the third-party logistics (3PL) business. . Logistics contractors undertaking the 3PL business are making efforts to reduce costs, improve profits, and reduce the environmental burden through efficient warehouse management and transportation using their own and partner companies' logistics networks. In recent years, as a measure for improving efficiency, there are a joint delivery in which cargoes from a plurality of shipper companies are transported by one truck or container, and a joint warehouse in which the cargoes of a plurality of shippers are stored in the same warehouse. In addition to cost reduction, these can be expected to avoid risks and secure quantities in the logistics industry, which is easily affected by the economy and policies.

 3PL事業に関する背景技術として、特許文献1に記載の発明が開示されている。特許文献1に記載の発明では、倉庫や輸送車を複数社間で共同利用する共同配送に対応し、倉庫と配送との作業指示を生成している。 The invention described in Patent Document 1 is disclosed as background technology related to the 3PL business. In the invention described in Patent Document 1, work instructions for warehouse and delivery are generated in correspondence with joint delivery in which a warehouse and a transport vehicle are shared by a plurality of companies.

 しかしながら、特許文献1に記載の発明では、生成される倉庫と配送との作業指示は、単に生成処理を組み合わせたものに過ぎず、全体の効率が良くならない可能性がある。 However, in the invention described in Patent Document 1, the work instructions for the generated warehouse and delivery are merely a combination of the generation processes, and the overall efficiency may not be improved.

 また、3PL事業に関する背景技術として、共同配送の輸送作業効率を上げることが可能な発明が特開2005-075634号公報に開示されている。しかしながら、特開2005-075634号公報に記載の発明は、倉庫作業の効率を見ていないため、全体の効率が良くならない可能性がある。 In addition, as a background technique related to the 3PL business, an invention capable of improving the transportation work efficiency of joint delivery is disclosed in Japanese Patent Application Laid-Open No. 2005-075634. However, since the invention described in Japanese Patent Application Laid-Open No. 2005-075634 does not look at the efficiency of warehouse work, the overall efficiency may not be improved.

 本発明は、このような点を鑑みてなされたものであり、倉庫作業と輸送との双方の効率を評価して、物流全体の効率を上げることができる計画を生成することができる物流計画装置物流計画生成プログラム及び記憶媒体を提供することを目的とする。 The present invention has been made in view of such a point, and a logistics planning apparatus capable of generating a plan capable of evaluating the efficiency of both warehouse work and transportation and improving the efficiency of the entire logistics. An object is to provide a distribution plan generation program and a storage medium.

 上記課題を解決するために、本発明は、品目に関する情報である品目情報と、出荷場所、保管場所及び入荷場所を含む拠点に関する情報である拠点情報と、前記品目について前記拠点とその拠点における在庫に関する情報とが関連付けられた在庫情報と、前記品目について前記拠点における作業時間に関する情報である作業情報と、前記拠点間の移動ルート及び移動時間を含む移動ルートに関する情報である移動ルート情報と、前記拠点間の移動を行う輸送リソースに関する情報である輸送リソース情報と、前記拠点における処理能力に関する情報である倉庫処理能力情報と、前記品目と当該品目の納期及び出荷量とが関連付けられた出荷計画と、を記憶する記憶部と、前記品目情報、前記拠点情報、前記在庫情報、前記作業情報、前記移動ルート情報、前記輸送リソース情報、及び前記倉庫処理能力情報に含まれる輸送に関する制約条件及び拠点に関する制約条件を満たし、かつ前記出荷計画を実行できるように、前記品目と前記拠点と前記拠点での作業に関する情報が関連付けられた倉庫作業計画、及び、前記品目とその品目を輸送する輸送ルートを示す情報と、当該輸送ルートに関する情報とが関連付けられた輸送計画を生成する処理部と、前記生成された倉庫作業計画及び輸送計画を出力する出力部と、を備えることを特徴とする。 In order to solve the above-described problems, the present invention provides item information that is information about an item, base information that is information about a base including a shipping location, a storage location, and an arrival location, and the stock of the item and the inventory at the base. Inventory information associated with information about, work information that is information about work time at the base for the item, travel route information that is information about a travel route and travel time between the bases, Transport resource information that is information related to transport resources that move between bases, warehouse processing capacity information that is information related to processing capacity at the bases, and a shipping plan in which the items and the delivery date and shipping quantity of the items are associated with each other. , A storage unit for storing the item information, the base information, the inventory information, the work information, and the transfer information. Work at the items, the bases, and the bases so as to satisfy the transport-related restrictions and the base-related restrictions included in the route information, the transport resource information, and the warehouse processing capacity information, and to execute the shipping plan A warehouse operation plan associated with information about, a processing unit for generating a transportation plan in which the information related to the transportation route is associated with information indicating the transportation route for transporting the item and the item, and the generated An output unit for outputting a warehouse work plan and a transportation plan.

 本発明によれば、倉庫作業と輸送との双方の効率を評価して、物流全体の効率を上げることができる計画を生成することができる。 According to the present invention, it is possible to evaluate the efficiency of both warehousing and transportation and generate a plan that can increase the efficiency of the entire logistics.

本発明の一実施形態に係る物流計画装置100の概略構成を示す図である。It is a figure which shows schematic structure of the physical distribution planning apparatus 100 which concerns on one Embodiment of this invention. 物流計画装置100のハードウエアの構成例を示す図である。It is a figure which shows the structural example of the hardware of the physical distribution planning apparatus. 品目情報の一例を示す図である。It is a figure which shows an example of item information. 拠点情報と拠点間の品目の移動関係の一例を示す図である。It is a figure which shows an example of the movement relationship of the item between base information and bases. 拠点情報の一例を示す図である。It is a figure which shows an example of base information. 在庫情報の一例を示す図である。It is a figure which shows an example of stock information. 作業情報の一例を示す図である。It is a figure which shows an example of work information. 移動ルート情報の一例を示す図である。It is a figure which shows an example of movement route information. 輸送リソース情報の一例を示す図である。It is a figure which shows an example of transport resource information. 倉庫処理能力情報の一例を示す図である。It is a figure which shows an example of warehouse processing capacity information. 出荷計画の一例を示す図である。It is a figure which shows an example of a shipping plan. 倉庫作業計画の一例を示す図である。It is a figure which shows an example of a warehouse work plan. 輸送計画の一例を示す図である。It is a figure which shows an example of a transportation plan. 処理部102が倉庫作業計画、輸送計画を計算する処理の流れを示すフローチャートである。It is a flowchart which shows the flow of the process in which the process part 102 calculates a warehouse work plan and a transportation plan. 処理部102が、一部の輸送手段を候補として生成する処理の流れを示すフローチャートである。It is a flowchart which shows the flow of the process in which the process part 102 produces | generates some transportation means as a candidate. 混合整数計画法を用いる時の目的関数及び制約条件について説明する図である。It is a figure explaining the objective function at the time of using a mixed integer programming and a constraint condition. 物流計画装置100における表示部への表示例を示す図である。It is a figure which shows the example of a display on the display part in the physical distribution planning apparatus. 計算オプションの入力・表示に関する画面の一例を示す図である。It is a figure which shows an example of the screen regarding input / display of a calculation option.

 以下、本発明に係る実施形態としての物流計画装置100について、図面を用いて説明する。 Hereinafter, a logistics planning apparatus 100 as an embodiment according to the present invention will be described with reference to the drawings.

 図1は、物流計画装置100の概略構成を示す図である。物流計画装置100は、主として、入力情報を格納する記憶部101と、処理部102と、出力情報を格納する記憶部103と、表示部104と、入力部105と、を有する。物流計画装置100は、必要に応じて、荷主A、B、C・・・が有する端末111、112、113・・・とネットワーク、通信手段等を介して接続されており、物流計画装置100と端末111、112、113・・・との間で情報が送受信可能である。端末111、112、113・・・は、主として、表示部と、入力部と、記憶部とを有する。 FIG. 1 is a diagram showing a schematic configuration of the physical distribution planning apparatus 100. The distribution planning apparatus 100 mainly includes a storage unit 101 that stores input information, a processing unit 102, a storage unit 103 that stores output information, a display unit 104, and an input unit 105. The logistics planning apparatus 100 is connected to the terminals 111, 112, 113,... Of the shippers A, B, C... Information can be transmitted to and received from the terminals 111, 112, 113. The terminals 111, 112, 113... Mainly have a display unit, an input unit, and a storage unit.

 図2は、物流計画装置100のハードウエア構成例を示す図である。本実施形態において、物流計画装置100は、例えば、パーソナルコンピュータやワークステーション、サーバ装置などの計算機である。 FIG. 2 is a diagram illustrating a hardware configuration example of the physical distribution planning apparatus 100. In the present embodiment, the physical distribution planning device 100 is a computer such as a personal computer, a workstation, or a server device.

 物流計画装置100は、主として、入力装置201と、出力装置202と、外部記憶装置203と演算装置204と、主記憶装置205と、通信装置206と、それぞれの装置を互いに接続するバス207と、を有する。 The distribution planning apparatus 100 mainly includes an input device 201, an output device 202, an external storage device 203, an arithmetic device 204, a main storage device 205, a communication device 206, and a bus 207 that connects the devices to each other. Have

 入力装置201は、例えばキーボードやマウス、あるいはタッチペン、その他ポインティングデバイスなどの入力を受付ける装置である。出力装置202は、例えばディスプレイなどの、表示を行う装置である。外部記憶装置203は、例えばハードディスク装置やフラッシュメモリなどの不揮発性記憶装置である。演算装置204は、例えばCPU(Central Processing Unit)などの演算装置である。 The input device 201 is a device that receives input from, for example, a keyboard, mouse, touch pen, or other pointing device. The output device 202 is a device that performs display, such as a display. The external storage device 203 is a nonvolatile storage device such as a hard disk device or a flash memory. The computing device 204 is a computing device such as a CPU (Central Processing Unit).

 主記憶装置205は、例えばRAM(Random Access Memory)などのメモリ装置である。通信装置206は、アンテナを介して無線通信を行う無線通信装置、又はネットワークケーブルを介して有線通信を行う有線の通信装置である。物流計画装置100の記憶部は、物流計画装置100の主記憶装置205または外部記憶装置203により実現される。 The main storage device 205 is a memory device such as a RAM (Random Access Memory). The communication device 206 is a wireless communication device that performs wireless communication via an antenna, or a wired communication device that performs wired communication via a network cable. The storage unit of the distribution planning device 100 is realized by the main storage device 205 or the external storage device 203 of the distribution planning device 100.

 また、物流計画装置100の入力部、処理部、出力部は、物流計画装置100の演算装置204に処理を行わせるプログラムによって実現される。 Further, the input unit, processing unit, and output unit of the distribution planning apparatus 100 are realized by a program that causes the arithmetic unit 204 of the distribution planning apparatus 100 to perform processing.

 このプログラムは、主記憶装置205または外部記憶装置203内に記憶され、実行にあたって主記憶装置205上にロードされ、演算装置204により実行される。また、物流計画装置100は、必要に応じて通信装置206を有し、通信装置206を介して情報を送受信してもよい。例えば、品目情報や出荷計画を荷主が管理する装置に搭載し、在庫情報を各拠点が管理する装置に搭載し、倉庫にかかわる情報を倉庫運営者が管理する装置に搭載し、輸送にかかわる情報を物流業者が管理する装置に搭載し、計算し結果を出力する処理部を3PL事業者が管理する装置に搭載する形態が考えられる。 This program is stored in the main storage device 205 or the external storage device 203, loaded onto the main storage device 205 for execution, and executed by the arithmetic unit 204. Further, the physical distribution planning apparatus 100 may include a communication device 206 as necessary, and may send and receive information via the communication device 206. For example, product information and shipping plans are installed in equipment managed by the shipper, inventory information is installed in equipment managed by each site, warehouse information is installed in equipment managed by the warehouse operator, and information related to transportation Is installed in an apparatus managed by a logistics company, and a processing unit that calculates and outputs a result is mounted in an apparatus managed by a 3PL operator.

 次に、図1を用いて、物流計画装置100の詳細について説明する。 Next, details of the physical distribution planning apparatus 100 will be described with reference to FIG.

 記憶部101には、輸送・保管する品目の重量、容積、輸送条件などを格納した品目情報と、品目の出荷場所、保管場所、入荷場所を格納した拠点情報と、各品目の場所別の在庫および仕掛量および在庫基準を格納した在庫情報と、各品目の倉庫での作業時間を格納した作業情報と、品目の拠点1(from)から拠点2(to)への移動ルートと移動時間を格納した移動ルート情報と、品目の移動を行う輸送リソース(車、船等)とそのコスト、輸送可能量等を格納した輸送リソース情報と、倉庫での作業可能能力を格納した倉庫処理能力情報と、品目の場所別の複数日の出荷日時および出荷量を格納した出荷計画と、が記憶される。 The storage unit 101 stores item information that stores the weight, volume, transportation conditions, and the like of items to be transported / stored, base information that stores the shipping location, storage location, and arrival location of the items, and inventory by location of each item. In addition, inventory information that stores the amount of work in progress and inventory standards, work information that stores the work time of each item in the warehouse, and the route and time of movement of the item from base 1 (from) to base 2 (to) Travel route information, transport resources (cars, ships, etc.) for moving items, transport resource information storing the cost, transportable amount, etc., warehouse processing capacity information storing work capacity in the warehouse, The shipment date and time and the shipment plan storing the shipment quantity for each item location are stored.

 図3は、品目情報の一例を示す図である。例えば、品目情報には、品目に関する情報として、品目を識別する名称、重量、梱包したときの容積、梱包したときの重量等が格納されている。名称以外の情報は、輸送や保管の制約として考慮すべきものを登録する。本実施の形態では、品目情報は、品目と、重量と、梱包用席と、梱包重量とがそれぞれ関連付けられている。 FIG. 3 is a diagram showing an example of item information. For example, in the item information, a name for identifying the item, a weight, a packaged volume, a packaged weight, and the like are stored as information about the item. For information other than the name, register what should be considered as restrictions on transportation and storage. In the present embodiment, the item information is associated with an item, a weight, a packing seat, and a packing weight.

 図4は、拠点情報と拠点間の品目の移動関係の一例を示す図である。図5は、拠点情報の一例を示す図である。 FIG. 4 is a diagram showing an example of the movement relationship between the base information and the items between the bases. FIG. 5 is a diagram illustrating an example of the base information.

 図4に示すように、例えば、拠点としては、PARTS1を出荷する拠点V1、PARTS2を出荷するV2、PARTS1を入荷しPROD1を出荷するP1、PARTS1を入荷しPROD2を出荷するP2、PARTS2を入荷しPROD3を出荷するP3、PROD1~3を保管するW1、PROD1~2を入荷するM1、PROD3を入荷するM2がある。また、図4においては、拠点間の移動ルートを矢印で示している。例えば、出荷場所V1は、入荷/出荷場所P1、P2に品目が移動可能である。また、入荷/出荷場所P1からは、保管場所W1と入荷場所M1とに品目が移動可能である。なお、図4において、拠点間をつなぐ移動ルートを示す線は、煩雑さを避けるために一部のみが記載されている。 As shown in FIG. 4, for example, the bases V1 that ship PARTS1, V2 that ship PARTS2, P1 that receives PARTS1 and ship PROD1, and P2 that receives PARTS1 and ship PROD2 and PARTS2 are received. There are P3 for shipping PROD3, W1 for storing PROD1-3, M1 for receiving PROD1-2, and M2 for receiving PROD3. Moreover, in FIG. 4, the movement route between bases is shown by the arrow. For example, in the shipping location V1, items can be moved to the receiving / shipping locations P1, P2. Further, items can be moved from the arrival / shipment place P1 to the storage place W1 and the arrival place M1. In FIG. 4, only a part of the line indicating the movement route connecting the bases is shown in order to avoid complexity.

 図5は、この図4に示す出荷場所、入荷/出荷場所、保管場所、入荷場所に関する情報の一覧を示している。拠点情報は、拠点(V1、P1、W1、M1等)と、種別(出荷、入荷/出荷、保管、入荷等)とがそれぞれ関連付けられている。 FIG. 5 shows a list of information relating to the shipping location, receiving / shipping location, storage location, and receiving location shown in FIG. In the base information, bases (V1, P1, W1, M1, etc.) and types (shipping, receiving / shipping, storage, receiving, etc.) are associated with each other.

 図6は、在庫情報の一例を示す図である。在庫情報は、出荷場所、保管場所及び入荷場所を含む拠点に関する情報である。ここでは、在庫情報として、品目と、拠点と、在庫量と、仕掛量と、在庫基準と、コストとがそれぞれ関連付けられている。在庫情報における品目は、品目情報における品目に対応している。在庫情報における拠点は、拠点情報における拠点に対応している。 FIG. 6 is a diagram showing an example of inventory information. The inventory information is information relating to the base including the shipping place, the storage place, and the receiving place. Here, as the inventory information, an item, a base, an inventory amount, an in-process amount, an inventory standard, and a cost are associated with each other. The item in the inventory information corresponds to the item in the item information. The base in the inventory information corresponds to the base in the base information.

 図6に示す例においては、例えば、品目PROD1は、拠点P1に在庫量200、仕掛量200があること、及び、在庫基準は「出荷計画2日分」、つまり先行2日分の出荷計画の量だけ拠点P1に在庫を保管することが望ましい、ことが示されている。なお、在庫基準の定義は一例である。 In the example shown in FIG. 6, for example, the item PROD1 has a stock amount 200 and a work-in-progress amount 200 at the base P1, and the stock standard is “shipping plan 2 days”, that is, the shipping plan for the preceding 2 days. It is shown that it is desirable to store stock in the base P1 by the amount. The definition of the inventory standard is an example.

 図7は、作業情報の一例を示す図である。作業情報は、各品目について、拠点とその拠点における在庫に関する情報とが関連付けられている。本実施の形態では、作業情報は、品目と、拠点と、在庫に関する情報(積み替え工数と、積み替えコストと、入庫工数と、入庫コストと、出庫工数と、出庫コスト等)とが関連付けられている。作業情報における品目は、品目情報における品目に対応している。作業情報における拠点は、拠点情報における拠点に対応している。入庫工数、入庫コスト、出庫工数、出庫コストに応じて倉庫作業におけるコストを算出できる。 FIG. 7 is a diagram showing an example of work information. In the work information, for each item, a base and information related to inventory at the base are associated. In the present embodiment, the work information is associated with items, bases, and inventory information (retransmission man-hours, transshipment costs, warehousing man-hours, warehousing costs, warehousing man-hours, shipping costs, etc.). . The item in the work information corresponds to the item in the item information. The base in the work information corresponds to the base in the base information. The cost for warehouse work can be calculated according to the number of warehousing steps, the warehousing cost, the number of warehousing steps, and the shipping cost.

 図8は、移動ルート情報の一例を示す図である。移動ルート情報は、拠点間の移動ルート及び移動時間を含む移動ルートに関する情報である。本実施の形態では、移動ルート情報は、品目と、移動ルートに関する情報(出発拠点を示す情報(from)と、到着拠点を示す情報(to)と、輸送種別と、輸送時間と、コスト等)とが関連付けられている。移動ルート情報においては、品目は指定されていない。出発拠点を示す情報(from)と、到着拠点を示す情報(to)は、拠点情報における拠点と対応付けられている。
 図8に示す移動ルート情報の1行目は、拠点P2から拠点P1に、車で移動するときに、時間が1であり、コストが1/梱必要であることを登録している。
FIG. 8 is a diagram illustrating an example of travel route information. The travel route information is information related to a travel route including a travel route between bases and a travel time. In the present embodiment, the travel route information includes items, information on the travel route (information (from) indicating the departure base, information (to) indicating the arrival base, transport type, transport time, cost, etc.). And are associated. The item is not specified in the travel route information. Information (from) indicating the departure base and information (to) indicating the arrival base are associated with the base in the base information.
The first line of the travel route information shown in FIG. 8 registers that when the vehicle travels from the base P2 to the base P1, the time is 1 and the cost needs 1 / packing.

 図9は、輸送リソース情報の一例を示す図である。輸送リソース情報は、拠点間の移動を行う輸送リソースに関する情報である。ここでは、輸送リソースに関する情報は、輸送リソースと、輸送種別と、積載重量と、積載容積と、コスト等であり、輸送リソース情報にはこれらが関連付けられて格納されている。積載重量及び積載容量の何割程度を満たすかに応じて輸送コストを算出できる。 FIG. 9 is a diagram showing an example of transport resource information. The transport resource information is information related to transport resources that move between bases. Here, the information regarding the transport resource includes the transport resource, the transport type, the loaded weight, the loaded volume, the cost, and the like, and these are associated with each other and stored in the transport resource information. The transportation cost can be calculated according to what percentage of the loading weight and loading capacity is satisfied.

 図9に示す輸送リソース情報の1行目は、輸送リソースTR1は、輸送種別が車で、積載可能な重量が最大1000であり、積載可能な容量が最大5であり、コストが1車あたり50であることを登録している。 The first line of the transport resource information shown in FIG. 9 shows that the transport resource TR1 has a transport type of car, a maximum loadable weight of 1000, a maximum loadable capacity of 5, and a cost of 50 per vehicle. Is registered.

 図10は、倉庫処理能力情報の一例を示す図である。倉庫処理能力情報は、拠点における処理能力に関する情報である。ここでは、処理能力に関する情報は、拠点と、日付と、人員に関する情報(フルタイムの人数、パートの人数等)等であり、倉庫処理能力情報にはこれらが関連付けられて格納されている。倉庫処理能力情報における拠点は、拠点情報における拠点に対応している。 FIG. 10 is a diagram showing an example of warehouse processing capacity information. The warehouse processing capacity information is information related to the processing capacity at the base. Here, the information on the processing capacity includes the base, the date, the information on the personnel (full-time number of persons, the number of parts, etc.), etc., and these are stored in association with the warehouse processing capacity information. The base in the warehouse processing capacity information corresponds to the base in the base information.

 図10に示す倉庫処理能力情報は、人数で作業時間を計算する例として、各拠点の日ごとの作業人員を登録している。例えば、自動倉庫のような設備の場合には、設備台数や処理能力を登録する。 The warehouse processing capacity information shown in FIG. 10 registers the work personnel for each day at each base as an example of calculating the work time by the number of people. For example, in the case of equipment such as an automatic warehouse, the number of equipment and processing capacity are registered.

 図11は、出荷計画の一例を示す図である。出荷計画とは、品目が出荷元から入荷先に移動する期・量を登録したものである。ここでは、出荷計画には、品目とその納期及び出荷量とが関連付けられている。出荷計画は、物流計画装置100が物流計画を生成する基となる情報である。 FIG. 11 is a diagram showing an example of a shipping plan. The shipping plan is a registration of the period and quantity at which an item moves from the shipping source to the receiving destination. Here, an item, its delivery date, and the shipment amount are associated with the shipment plan. The shipment plan is information on which the logistics planning device 100 generates a logistics plan.

 本実施の形態では、出荷計画は、品目と、出荷元と、入荷先と、出荷部指定の有無に関する情報と、納期と、出荷量とが関連付けられている。出荷計画における品目は、品目情報における品目に対応している。出荷計画における出荷元及び入荷先は、拠点情報における拠点に対応している。なお、本実施の形態では、期を日としたが、週、時間などの単位にしてもよい。 In the present embodiment, the shipment plan is associated with items, shipping origins, receiving destinations, information on the presence / absence of designation of the shipping department, delivery date, and shipping quantity. The item in the shipping plan corresponds to the item in the item information. The shipping source and the receiving destination in the shipping plan correspond to the bases in the base information. In the present embodiment, the period is a day, but it may be a unit such as a week or an hour.

 図1の説明に戻る。処理部102は、記憶部101に格納された情報に基づいて物流計画(倉庫作業計画及び輸送計画)を生成する。処理部102の処理については、後に詳述する。 Returning to the explanation of FIG. The processing unit 102 generates a logistics plan (a warehouse work plan and a transportation plan) based on the information stored in the storage unit 101. The processing of the processing unit 102 will be described in detail later.

 記憶部103には、処理部102で生成した物流計画(倉庫作業計画及び輸送計画)が格納される。 The storage unit 103 stores a logistics plan (a warehouse work plan and a transportation plan) generated by the processing unit 102.

 図12は、倉庫作業計画の一例を示す図である。倉庫作業計画は、生成された倉庫作業計画が格納された結果である。倉庫作業計画は、いつ、どの拠点で、どの品目が、どれだけ作業されるかと、それに要する時間とを示す情報である。倉庫作業計画は、品目と、拠点と、拠点での作業に関する情報(日付と、作業種別と、数量と、作業時間等)とが関連付けられている。倉庫作業計画における品目は、品目情報における品目に対応している。倉庫作業計画における拠点は、拠点情報における拠点に対応している。 FIG. 12 is a diagram showing an example of a warehouse work plan. The warehouse work plan is a result of storing the generated warehouse work plan. The warehouse work plan is information indicating when and how much work is performed on which items and how much time is required. The warehouse work plan is associated with items, bases, and information (date, work type, quantity, work time, etc.) regarding work at the bases. The item in the warehouse work plan corresponds to the item in the item information. The base in the warehouse work plan corresponds to the base in the base information.

 図13は、輸送計画の一例を示す図である。輸送計画は、生成された輸送計画が格納された結果である。輸送計画は、輸送品目に関する情報(輸送品目情報)と、輸送ルートを示す情報(輸送ルート情報)とを有する。 FIG. 13 is a diagram showing an example of a transportation plan. The transportation plan is a result of storing the generated transportation plan. The transportation plan includes information on transportation items (transportation item information) and information indicating transportation routes (transportation route information).

 図13(A)に示す輸送品目情報は、いつ、どの品目を、どのルートで、何を用いて、どれだけ運ぶかを示す情報である。輸送品目情報は、発送日と、着日と、品目と、ルートと、積荷拠点と、降荷拠点と、輸送種別と、車番と、輸送量とが関連付けられている。輸送品目情報における品目は、品目情報における品目に対応している。輸送品目情報における積荷拠点及び降荷拠点は、拠点情報における拠点に対応している。輸送品目情報における輸送種別は、輸送リソース情報における輸送リソースに対応している。 The transportation item information shown in FIG. 13 (A) is information indicating when, what item, which route, what, and how much it is carried. In the transportation item information, the shipping date, the arrival date, the item, the route, the loading base, the unloading base, the transportation type, the car number, and the transportation amount are associated with each other. The item in the transportation item information corresponds to the item in the item information. The loading base and the unloading base in the transport item information correspond to the bases in the base information. The transport type in the transport item information corresponds to the transport resource in the transport resource information.

 図13(B)に示す輸送ルート情報は、品目とその品目を輸送する輸送ルートを示す情報である。輸送ルート情報は、使用した輸送リソース1台ごとに、どのように拠点を回ったかを登録しており、輸送品目は、各ルート上でどの品目をどの拠点でいくつ荷物を積み(積荷拠点)、どの拠点で降ろしたか(降荷拠点)を登録している。輸送ルート情報は、ルートと、到着拠点を示す情報(TO)と、出発拠点を示す情報(FROM)と、ルートにおいて立ち寄る拠点の数を示す立ち寄り数と、ルートにおいて立ち寄る拠点を示す立ち寄り1、立ち寄り2、立ち寄り3とが関連付けられている。 The transportation route information shown in FIG. 13B is information indicating the item and the transportation route for transporting the item. The transportation route information registers how the transportation resources are used for each transportation resource used, and the transportation items include which items are loaded on each route and how many packages are loaded (loading bases). The location at which the product was unloaded (unloading site) is registered. The transport route information includes route, arrival point information (TO), departure point information (FROM), number of stops indicating the number of stops on the route, stop 1, indicating stop points on the route, stop 2 and stop-by 3 are associated with each other.

 図1の説明に戻る。表示部104は、ディスプレイ等の表示を行う装置である。表示部104は、出力装置202の一部を構成する。 Returning to the explanation of FIG. The display unit 104 is a device that performs display such as a display. The display unit 104 constitutes a part of the output device 202.

 入力部105は、キーボードやマウス、あるいはタッチペン、その他ポインティングデバイスなどの入力を受付ける装置である。入力部105は、入力装置201を用いることができる。 The input unit 105 is a device that accepts input from a keyboard, mouse, touch pen, or other pointing device. As the input unit 105, the input device 201 can be used.

 次に、物流計画装置100において、処理部102が行う動作について、適宜具体的な例を用いて説明する。物流計画装置100は、記憶部101に記憶された情報をメモリに格納し、処理部102で倉庫作業計画、輸送計画を計算し、計算した計画をメモリから記憶部103に出力する。処理部102は、CPUとメモリとを用いて処理を行う。 Next, operations performed by the processing unit 102 in the physical distribution planning apparatus 100 will be described using specific examples as appropriate. The distribution planning apparatus 100 stores information stored in the storage unit 101 in a memory, calculates a warehouse work plan and a transportation plan in the processing unit 102, and outputs the calculated plans from the memory to the storage unit 103. The processing unit 102 performs processing using a CPU and a memory.

 図14は、処理部102が倉庫作業計画、輸送計画を計算する処理の流れを示すフローチャートである。図14に示す処理は、入力装置201等から処理開始指示が入力されることにより開始される。 FIG. 14 is a flowchart showing a processing flow in which the processing unit 102 calculates a warehouse work plan and a transportation plan. The process illustrated in FIG. 14 is started when a process start instruction is input from the input device 201 or the like.

 <ステップ1201>
 まず、処理部102は、記憶部101より、計算に必要な入力情報をメモリ上に読み込む。
<Step 1201>
First, the processing unit 102 reads input information necessary for calculation from the storage unit 101 into a memory.

 <ステップ1202>
 次に、処理部102は、記憶部から読み込んだ出荷計画に従い、出荷先から入荷先に品目を輸送するために用いる輸送手段の候補を生成する。ここで、輸送手段は、移動ルートと輸送リソースの組を指す。輸送手段の候補は、移動ルート情報のデータ(図8では、1行1データ)ごとに、輸送種別が一致する輸送リソースを、図9に示す輸送リソース情報から抽出し、輸送手段としてメモリに格納することにより生成する。例えば、図8における1行目の移動ルート(便宜上、「ルート1」と呼ぶ)は、輸送種別が「車」であるから、図9の輸送リソース情報から、「車」としてT1~T3の3つの輸送リソースを抽出し、(ルート1、T1)(ルート1、T2)(ルート1、T3)3つの輸送手段を生成する。
<Step 1202>
Next, the processing unit 102 generates a transportation means candidate used to transport the item from the shipping destination to the receiving destination according to the shipping plan read from the storage unit. Here, the transportation means refers to a set of a movement route and transportation resources. The transportation means candidates are extracted from the transportation resource information shown in FIG. 9 and stored in the memory as transportation means for each moving route information data (in FIG. 8, one line 1 data) with the same transportation type. To generate. For example, the travel route in the first row in FIG. 8 (referred to as “route 1” for convenience) has the transport type “car”, and therefore, from the transport resource information in FIG. One transportation resource is extracted, and (route 1, T1) (route 1, T2) (route 1, T3) three transportation means are generated.

 最も単純な生成手順は、移動ルート全てに対して輸送リソースを当てはめることである。移動ルート情報と輸送リソース情報が少ない場合には、生成される輸送手段も少ないため、問題ない。しかしながら、移動ルート情報のデータ量は、拠点数、移動する道順や料金体系のバリエーションに依存し、情報が多い。したがって、これに輸送リソースを組み合わせた輸送手段の候補は膨大な数になる。本実施の形態において多くの輸送手段の候補を生成すると、後述するステップ1203の計算量が増大し、処理時間が問題となる。 The simplest generation procedure is to apply transport resources to all travel routes. When the travel route information and the transport resource information are small, there is no problem because the transport means to be generated is small. However, the amount of data of travel route information depends on the number of bases, the route to travel, and variations in the fee structure, and there is a lot of information. Therefore, there are a huge number of transportation means candidates that combine transportation resources with this. If many transportation means candidates are generated in the present embodiment, the amount of calculation in step 1203 to be described later increases, and the processing time becomes a problem.

 そこで、本実施の形態では、ステップ1202において、膨大な数のなかからその一部を輸送手段の候補として生成する。図15は、処理部102が、輸送手段の候補を生成する処理の流れを示すフローチャートである。図15は、前回の輸送計画を有効に活用して、輸送手段の候補を絞り込む形態である。 Therefore, in the present embodiment, in step 1202, a part of the huge number is generated as a transportation means candidate. FIG. 15 is a flowchart illustrating a processing flow in which the processing unit 102 generates a transportation means candidate. FIG. 15 shows a form in which candidates for transportation means are narrowed down by effectively utilizing the previous transportation plan.

 <ステップS12021>
 まず、処理部102は、候補ログにある輸送手段を初期候補として読み込む。候補ログは輸送手段の候補を格納しておく記憶領域であり、初回は候補数が0である。
<Step S12021>
First, the processing unit 102 reads the transportation means in the candidate log as an initial candidate. The candidate log is a storage area for storing transportation means candidates, and the number of candidates is zero for the first time.

 候補数が0の場合は、処理部102は、記憶部103に記憶された輸送計画を参照し、輸送計画に格納されている輸送ルート(この段階では輸送リソースは無視)を初期候補(A)とする。すなわち、候補ログにある輸送手段の輸送ルートは、移動ルート情報(図8)に格納された移動ルートに含まれている。 When the number of candidates is 0, the processing unit 102 refers to the transportation plan stored in the storage unit 103, and uses the transportation route stored in the transportation plan (ignoring transportation resources at this stage) as an initial candidate (A). And That is, the transportation route of the transportation means in the candidate log is included in the traveling route stored in the traveling route information (FIG. 8).

 <ステップS12022>
 次に、処理部102は、記憶部101に記憶された移動ルート情報(図8参照)から、出荷計画に登録している出荷元と入荷先の組で登録されているルートを追加する。次に、その中からFrom又はToが、ステップS12021で求められた初期候補(A)と一致するものを検索し、(A)および検索で得た移動ルートを代替可能ルート(B)とする。
<Step S12022>
Next, the processing unit 102 adds a route registered as a set of a shipping source and a receiving destination registered in the shipping plan from the travel route information (see FIG. 8) stored in the storage unit 101. Next, a search is made for From or To that matches the initial candidate (A) obtained in step S12021, and (A) and the travel route obtained by the search are designated as alternative routes (B).

 例えば、初期候補(A)が、P1からW1(図13(A)の1行目)である場合には、From又はToが初期候補(A)と一致するものとして、移動ルート情報(図8参照)からP1からW1、P2からW1、P3からW1の3個のルートが検索される。 For example, when the initial candidate (A) is from P1 to W1 (first line in FIG. 13A), it is assumed that From or To matches the initial candidate (A), and the travel route information (FIG. 8 3 routes from P1 to W1, P2 to W1, and P3 to W1 are searched.

 図8において、各移動ルートの輸送種別が「車」となっている。したがって、処理部102は、輸送種別が「車」となっている輸送リソースを輸送リソース情報(図9参照)から検索する。その結果、輸送リソース「TR1」、「TR2」、「TR3」が検索される。 In FIG. 8, the transport type of each travel route is “car”. Therefore, the processing unit 102 searches the transport resource information (see FIG. 9) for transport resources whose transport type is “car”. As a result, the transport resources “TR1”, “TR2”, and “TR3” are searched.

 処理部102は、このようにして検索したルートのうちの所定の数の移動ルートを初期候補(A)に追加して、代替可能ルート(B)とする。ここでは、ルート及び輸送リソースの組である(P1-W1、TR1)、(P2-W1、TR1)、(P3-W1、TR1)、(P1-W1、TR2)、(P2-W1、TR2)、(P3-W1、TR2)、(P1-W1、TR3)、(P2-W1、TR3)、(P3-W1、TR3)が代替可能ルート(B)となる。なお、代替可能ルート(B)における初期候補(A)からの追加数(所定の数)は、例えば、パラメータで設定する。 The processing unit 102 adds a predetermined number of travel routes out of the routes searched in this way to the initial candidate (A) to make an alternative route (B). Here, (P1-W1, TR1), (P2-W1, TR1), (P3-W1, TR1), (P1-W1, TR2), (P2-W1, TR2) are pairs of routes and transport resources. , (P3-W1, TR2), (P1-W1, TR3), (P2-W1, TR3), (P3-W1, TR3) become the substitutable route (B). Note that the additional number (predetermined number) from the initial candidate (A) in the substitutable route (B) is set by a parameter, for example.

 <ステップS12023>
 そして、処理部102は、代替可能ルート(B)から候補を絞り込む。絞り込みには、例えば、移動ルート情報(図8参照)のコストの情報を用いることができる。例えば、図9に示す輸送リソース情報において、TR1、TR2、TR3の3種類の中からコストが安いTR3を設定する。その結果、(P1-W1、TR3)、(P2-W1、TR3)、(P3-W1、TR3)が代替可能ルート(B)の中から候補として絞り込まれる。ここで、TR3がすでに候補として追加されている場合には、次にコストが安いTR1候補として絞り込むことができる。
<Step S12023>
Then, the processing unit 102 narrows down candidates from the substitutable route (B). For narrowing down, for example, cost information of travel route information (see FIG. 8) can be used. For example, in the transport resource information shown in FIG. 9, TR3 with a low cost is set from the three types TR1, TR2, and TR3. As a result, (P1-W1, TR3), (P2-W1, TR3), and (P3-W1, TR3) are narrowed down as candidates from the substitutable route (B). Here, when TR3 has already been added as a candidate, it can be narrowed down as a TR1 candidate with the next lowest cost.

 または、絞り込みに輸送品目情報を用いることができる。処理部102は、例えば、代替可能ルート(B)におけるルートと輸送リソースとの組が、輸送品目情報(図13(A)参照)に含まれていない情報であって、かつコストが小さいものを優先する等により、候補を絞り込む。 Or, transportation item information can be used for narrowing down. For example, the processing unit 102 can obtain information that is not included in the transport item information (see FIG. 13A) and the cost of the pair of the route and the transport resource in the substitutable route (B) is low. Narrow down candidates by giving priority.

 以上の処理により、候補ログが生成される。後述するステップ1205から、ステップ1202に戻ってきた場合には、ここで生成された候補ログが初期候補(A)となる。 The candidate log is generated by the above processing. When returning to step 1202 from step 1205 described later, the candidate log generated here becomes the initial candidate (A).

 これにより、ステップS1202の処理を終了する。なお、図15に示す処理は、ステップS1202の処理の一例である。 This completes the process of step S1202. The process illustrated in FIG. 15 is an example of the process of step S1202.

 <ステップ1203>
 図14に戻る。処理部102は、出荷計画(図11参照)をみたすような倉庫作業計画及び輸送計画を生成する。具体的には、処理部102は、出荷計画に登録されている品目について、指定の出荷元拠点から指定の入荷先拠点に指定の量だけ入荷するために、どの輸送手段を用い、どの拠点を経由して輸送するかを決定する。その際には、積載重量、積載容量、倉庫保有能力、出荷計画の出荷量などの制約条件を加味し、かつコストの和、在庫基準との乖離量、倉庫作業の保有能力との乖離が最小となるように計算する。なお、制約条件は、記憶部101に記憶された各情報に含まれている。
<Step 1203>
Returning to FIG. The processing unit 102 generates a warehouse work plan and a transportation plan that meet a shipping plan (see FIG. 11). Specifically, the processing unit 102 uses which means of transportation and which site to use to receive a specified amount of items registered in the shipping plan from a specified shipping source base to a specified receiving destination base. Decide whether to transport via. In that case, considering the constraint conditions such as loading weight, loading capacity, warehouse holding capacity, shipment amount of the shipping plan, the sum of the cost, the deviation from the inventory standard, and the deviation from the holding capacity of the warehouse work are minimized. Calculate so that Note that the constraint condition is included in each piece of information stored in the storage unit 101.

 制約条件のもとでコスト等が最小となる計画を計算するアルゴリズムについては様々な方法、例えば混合整数計画法、遺伝的アルゴリズムなどがあり、本発明では特に方法を限定しない。混合整数計画法、遺伝的アルゴリズム等の制約条件のもとでコスト等が最小となる計画を計算するアルゴリズムは、すでに公知であるため、説明を省略する。 There are various methods for calculating a plan that minimizes the cost under the constraint conditions, for example, mixed integer programming, genetic algorithm, and the present invention does not particularly limit the method. An algorithm for calculating a plan that minimizes the cost under a constraint condition such as mixed integer programming or a genetic algorithm is already known and will not be described.

 例えば、混合整数計画法を用いる場合には、候補ログごとの期別品目輸送量を変数に、制約条件を線形方程式系で記述し、目的関数にコストの和、在庫基準との乖離量、倉庫作業の保有能力との乖離の線形加重和を与え、混合整数計画法を求解するソルバーで計算すれば、目的関数が最小となる変数の値を得ることができる。 For example, when using mixed integer programming, describe the amount of transportation for each candidate log as a variable, describe the constraints using a linear equation system, add the cost to the objective function, the amount of deviation from the inventory standard, the warehouse By giving a linear weighted sum of deviations from work holding capacity and calculating with a solver that solves mixed integer programming, the value of the variable that minimizes the objective function can be obtained.

 以下、混合整数計画法を用いる時の目的関数及び制約条件について、図16を用いて具体的に説明する。図16は、拠点の一覧を示す。図16における線は、ステップS1202で求められた輸送手段の候補である。 Hereinafter, the objective function and constraint conditions when using mixed integer programming will be specifically described with reference to FIG. FIG. 16 shows a list of bases. The lines in FIG. 16 are transportation means candidates obtained in step S1202.

 品目PROD1は、拠点M1から9月1日に70個出荷する。拠点M1に入庫される輸送手段候補は、拠点P1から拠点M1、拠点P2から拠点M1、拠点W1から拠点M1の3ルートである。拠点P1から拠点M1の品目PROD1の輸送数をx1、拠点P2から拠点M1の品目PROD1の輸送数をx2、拠点W1から拠点M1の品目PROD1の輸送数をx3とすると、目的関数は数式(1)で示される。 70 items PROD1 will be shipped from the base M1 on September 1st. The transportation means candidates received at the base M1 are the three routes of the base P1 to the base M1, the base P2 to the base M1, and the base W1 to the base M1. Assuming that the number of transportation of the item PROD1 from the base P1 to the base M1 is x1, the number of transportation of the item PROD1 from the base P2 to the base M1 is x2, and the transportation number of the item PROD1 from the base W1 to the base M1 is x3, the objective function is expressed by the formula (1 ).

2×x1+2×x2+1×x3・・・(1) 2 × x1 + 2 × x2 + 1 × x3 (1)

 なお、輸送数をx1、x2、x3に掛けている2、2、1等の数字は、評価パラメータである。ここでは、評価パラメータとして輸送時のコスト(移動ルート情報、図8参照)を用いた例を示す。拠点P1から拠点M1のコストは、移動ルート情報より「2」であるため、数式(1)ではx1に2を掛けている。拠点P2から拠点M1のコストは、移動ルート情報より「2」であるため、数式(1)ではx2に2を掛けている。拠点W1から拠点M1のコストは、移動ルート情報より「1」であるため、数式(1)ではx3に2を掛けている。 Note that numbers such as 2, 2, 1 etc., which are multiplied by x1, x2, x3, are the evaluation parameters. Here, an example is shown in which the cost during transportation (movement route information, see FIG. 8) is used as the evaluation parameter. Since the cost from the base P1 to the base M1 is “2” from the travel route information, x1 is multiplied by 2 in Equation (1). Since the cost from the base P2 to the base M1 is “2” from the travel route information, x2 is multiplied by 2 in Equation (1). Since the cost from the base W1 to the base M1 is “1” from the travel route information, x3 is multiplied by 2 in Equation (1).

 次に、制約条件を線形方程式系で記述した内容について説明する。 Next, we will explain the contents of the constraint conditions described in the linear equation system.

 出荷計画より、9月1日のPROD1の出荷量は70個である(制約条件)。拠点P1から拠点M1の品目PROD1の輸送数をx1、拠点P2から拠点M1の品目PROD1の輸送数をx2、拠点W1から拠点M1の品目PROD1の輸送数をx3とすると、輸送数をx1、x2、x3は数式(2)で表される。なお、出荷計画における出荷先、入荷先は、出荷計画作成時にユーザー等により仮に入力されたものである。 From the shipment plan, the shipment volume of PROD1 on September 1 is 70 (restriction condition). If the number of transportation of the item PROD1 from the base P1 to the base M1 is x1, the transportation number of the item PROD1 from the base P2 to the base M1 is x2, and the transportation number of the item PROD1 from the base W1 to the base M1 is x3, the transportation number is x1, x2. , X3 is expressed by Equation (2). Note that the shipping destination and the receiving destination in the shipping plan are provisionally input by the user or the like when the shipping plan is created.

x1+x2+x3=70・・・(2) x1 + x2 + x3 = 70 (2)

 また、拠点W1からx3個出荷するためには、拠点P1から拠点W1の品目PROD1の輸送数をy1、拠点P2から拠点W1の品目PROD1の輸送数をy2、拠点P3から拠点W1の品目PROD1の輸送数をy3とすると、輸送数y1、y2、y3は数式(3)で表される。ここで、W1における在庫量Z、W1における仕掛量は、在庫情報(図6)に格納されている(制約条件)。 Further, in order to ship x3 items from the base W1, the transport number of the item PROD1 from the base P1 to the base W1 is y1, the transport number of the item PROD1 from the base P2 to the base W1 is y2, and the item PROD1 from the base P3 to the base W1. When the transport number is y3, the transport numbers y1, y2, and y3 are expressed by Equation (3). Here, the inventory quantity Z in W1 and the in-process quantity in W1 are stored in the inventory information (FIG. 6) (restriction condition).

y1+y2+y3+W1における在庫量Z+W1における仕掛量≧x3・・・(3) In-process quantity in inventory quantity Z + W1 in y1 + y2 + y3 + W1 ≧ x3 (3)

 また、移動ルート情報(図8参照)には、拠点W1から拠点M1には車で輸送するという情報が格納されている(制約条件)。輸送リソース情報(図9参照)には、車として輸送リソースTR1、TR2、TR3があるという情報及びその積載重量、積載容量、コストが格納されている(制約条件)。したがって、輸送数x3は、数式(4)で表される。 Further, in the travel route information (see FIG. 8), information that the vehicle is transported from the base W1 to the base M1 is stored (constraint condition). In the transport resource information (see FIG. 9), information indicating that there are transport resources TR1, TR2, and TR3 as vehicles and their load weight, load capacity, and cost are stored (restriction conditions). Therefore, the transport number x3 is expressed by Equation (4).

T1(輸送リソースTR1での輸送数)+T2(輸送リソースTR2での輸送数)+T3(輸送リソースTR3での輸送数)=x3・・・(4) T1 (number of transports in transport resource TR1) + T2 (number of transports in transport resource TR2) + T3 (number of transports in transport resource TR3) = x3 (4)

 ここで、輸送リソースTR1の積載重量は、輸送リソース情報(図9参照)より1000である(制約条件)。また、品目情報(図3)より、品目PROD1の梱包重量は10である(制約条件)。したがって、輸送数T1は、数式(5)で表される。 Here, the loaded weight of the transport resource TR1 is 1000 (constraint condition) from the transport resource information (see FIG. 9). Further, from the item information (FIG. 3), the packing weight of the item PROD1 is 10 (constraint condition). Therefore, the transport number T1 is expressed by Equation (5).

10×T1≦1000・・・(5) 10 × T1 ≦ 1000 (5)

 輸送数T2、T3についても同様に求められる。また、輸送数T1、T2、T3については、積載重量のみでなく、積載容積(図9参照)についても積載重量と同様の方法により数式で表すことができる。 The same applies to the transport numbers T2 and T3. Further, regarding the transport numbers T1, T2, and T3, not only the loaded weight but also the loaded volume (see FIG. 9) can be expressed by a mathematical formula by the same method as the loaded weight.

 これを、品目PROD1の輸送に関する全てのルートに対して行う。このようにして、輸送に関する制約条件を線形方程式系で記述する。次に、拠点に関する制約条件を線形方程式系で記述する。 This is done for all routes related to the transportation of item PROD1. In this way, the constraints related to transportation are described by a linear equation system. Next, the constraints related to the base are described using a linear equation system.

 在庫情報(図6参照)には、拠点W1における品目PROD1の在庫量Z(数式(3)参照)が100以下という情報が格納されている(制約条件)。これは、数式(6)で表される。 In the inventory information (see FIG. 6), information that the inventory amount Z (see Equation (3)) of the item PROD1 at the base W1 is 100 or less is stored (constraint condition). This is expressed by Equation (6).

Z≦100・・・(6) Z ≦ 100 (6)

 倉庫処理能力情報(図10参照)には、拠点W1における作業者がフルタイム30人、パート70人の合計100人であるという情報が格納されている(制約条件)。また、作業情報(図7参照)には、拠点W1で品目PROD1を扱う時の入庫工数及び入庫コストがそれぞれ1であるという情報が格納されている(制約条件)。したがって、拠点W1における制約条件は数式(7)で表される。 The warehouse processing capacity information (see FIG. 10) stores information that the total number of workers at the base W1 is 30 people, that is, 30 full-time workers and 70 part-time workers (restriction condition). Further, the work information (see FIG. 7) stores information that the warehousing man-hours and the warehousing cost when the item PROD1 is handled at the base W1 are 1 (restriction condition). Therefore, the constraint condition at the site W1 is expressed by Expression (7).

x3≦100・・・(7) x3 ≦ 100 (7)

 これを、拠点V1、V2、P1、P2、P3のうちの品目PROD1に関する全ての拠点に対して行う。このようにして、拠点に関する制約条件を線形方程式系で記述する。数式(1)で示す目的関数において、数式(2)~(7)等に示す制約条件を満たし、コストが最小となる輸送数x1、x2、x3が混合整数計画法によって求められる。 This is performed for all bases related to the item PROD1 among the bases V1, V2, P1, P2, and P3. In this way, the constraint condition regarding the base is described by a linear equation system. In the objective function expressed by the mathematical formula (1), the transport numbers x1, x2, and x3 that satisfy the constraints shown in the mathematical formulas (2) to (7) and the cost is determined by the mixed integer programming.

 このように、前回の輸送計画を有効に活用することで、短い処理時間で物流計画を生成することができる。なお、目的関数に目標値があった場合、その目標値を満足する制約条件として、数式(2)~(7)等に示す制約条件を全て満たすように輸送数x1、x2、x3を混合整数計画法によって求めることもできるし、制約条件の一部を満たすように輸送数x1、x2、x3を混合整数計画法によって求めることもできる。 In this way, a logistics plan can be generated in a short processing time by effectively utilizing the previous transportation plan. When there is a target value in the objective function, the transport numbers x1, x2, and x3 are mixed integers so as to satisfy all the constraint conditions shown in equations (2) to (7) as the constraint conditions that satisfy the target value. The number of transports x1, x2, and x3 can be obtained by a mixed integer programming so as to satisfy a part of the constraint conditions.

 <ステップ1204>
 図14の説明に戻る。処理部102は、ステップS1203で生成した倉庫作業計画と輸送計画を記憶部103に出力する。
<Step 1204>
Returning to the description of FIG. The processing unit 102 outputs the warehouse work plan and the transportation plan generated in step S1203 to the storage unit 103.

 記憶部103に記憶された輸送計画(図13(A)、(B)参照)からは、R1ルートにおいて、車TR1を使い、P2でPROD2を30、P1でPROD1を70積み、積載率100%の状態で輸送、W1ですべての品目を降ろしていることが分かる。また、図13(A)、(B)からは、R2ルートにおいて、車TR2を使い、P3でPROD3を300積み、W1でPROD3を100降ろし、代わりにPROD2を30、P1でPROD1を70積み、出荷計画の入荷場所であるM1、M2へ輸送していることが分かる。 From the transportation plan stored in the storage unit 103 (see FIGS. 13A and 13B), on the R1 route, the car TR1 is used, POD2 is 30 in P2, PROD1 is 70 in P1, and the loading ratio is 100%. It can be seen that in the state of transport, all items are unloaded at W1. 13 (A) and (B), in the R2 route, using the car TR2, load 300 PROD3 at P3, lower 100 PROD3 by W1, instead of 30 PROD2 and 70 POD1 by P1. It can be seen that the products are being transported to M1 and M2, which are the arrival locations of the shipping plan.

 また、輸送計画(図13)に示すように、9月2日に出庫した品目PROD3は、出荷計画を実行可能とするために、R3ルートにて拠点W1から拠点M2に輸送されている。記憶部103に記憶された倉庫計画情報(図12参照)に示すように、ここで輸送された品目PROD3は、拠点W1に9月1日に入庫し、9月2日に出庫したものだと分かる。 Also, as shown in the transportation plan (FIG. 13), the item PROD3 issued on September 2 is transported from the base W1 to the base M2 via the R3 route so that the shipping plan can be executed. As shown in the warehouse plan information stored in the storage unit 103 (see FIG. 12), the item PROD3 transported here was received at the base W1 on September 1 and left on September 2. I understand.

 この例のように、ステップS1203では、なるべく少ない車数で、積載率がなるべく高くなるように輸送計画が生成される。また、ステップS1203では、9月2日の出荷計画分を前日に拠点W1の倉庫へ運ぶことで、拠点W1での作業の平準化を実現する倉庫作業が生成される。 As in this example, in step S1203, a transportation plan is generated with as few vehicles as possible so that the loading rate is as high as possible. Further, in step S1203, a warehouse work for realizing leveling of work at the base W1 is generated by carrying the shipment plan for September 2 to the warehouse at the base W1 on the previous day.

 また、処理部102は、ステップS1203で生成した倉庫作業計画と輸送計画を表示部104に出力する。図17は、表示部104における表示例を示す図である。 In addition, the processing unit 102 outputs the warehouse work plan and the transportation plan generated in step S1203 to the display unit 104. FIG. 17 is a diagram illustrating a display example on the display unit 104.

 図17に示すように、表示部104には、輸送計画に関する情報と、倉庫作業計画に関する情報とが、同時に表示される。図17では、輸送計画に関する情報として、輸送計画と、輸送ルートを示す図とが表示されているが、輸送ルートを示す図は必須ではない。また、図17では、倉庫作業計画に関する情報として、倉庫作業計画と、倉庫作業負荷と、在庫推移とが表示されているが、倉庫作業負荷と在庫推移とは必須ではない。また、図17では、拠点W1の倉庫作業計画が表示されているが、拠点W1以外の拠点の倉庫作業計画を表示してもよい。 As shown in FIG. 17, the display unit 104 displays information related to the transportation plan and information related to the warehouse work plan at the same time. In FIG. 17, a transport plan and a diagram showing a transport route are displayed as information related to the transport plan, but the diagram showing the transport route is not essential. In FIG. 17, the warehouse work plan, the warehouse work load, and the inventory transition are displayed as information on the warehouse work plan, but the warehouse work load and the inventory transition are not essential. In FIG. 17, the warehouse work plan for the base W1 is displayed, but a warehouse work plan for a base other than the base W1 may be displayed.

 <ステップ1205>
 次に、処理部102は、ステップ1203で計算し、ステップS1204で表示部104に表示した倉庫作業計画、輸送計画に対し、計画の採否を判断する。処理部102は、入力部105からの入力を受け付け、これに基づいて判断しても良い。また、予め記憶部101にコスト目標を登録しておき、処理部102は、登録されたコスト目標と、計算結果から得られるコストとを比較し、計算結果から得られるコストが登録されたコスト目標より低い場合には計画を採用すると判断しても良い。ここで、コスト目標には、入庫コスト(作業情報(図7)参照)、トータルコスト(移動ルート情報(図8)におけるコスト、輸送リソース情報(図9)におけるコスト、入庫コスト及び出庫コスト(作業情報(図7)参照)の和)、人の稼働率(算出された計画における作業時間と、倉庫処理能力情報(図10)から求められるのべ作業時間との比)等を用いることができる。
<Step 1205>
Next, the processing unit 102 determines whether or not to adopt the plan for the warehouse work plan and the transportation plan calculated in step 1203 and displayed on the display unit 104 in step S1204. The processing unit 102 may receive an input from the input unit 105 and make a determination based on the input. In addition, the cost target is registered in the storage unit 101 in advance, and the processing unit 102 compares the registered cost target with the cost obtained from the calculation result, and the cost target obtained by registering the cost obtained from the calculation result. If it is lower, it may be determined that the plan is adopted. Here, the cost target includes the warehousing cost (work information (see FIG. 7)), the total cost (the cost in the movement route information (FIG. 8), the cost in the transportation resource information (FIG. 9), the warehousing cost and the warehousing cost (work). Sum of information (see FIG. 7)), human availability (ratio of work time in the calculated plan and total work time obtained from warehouse processing capacity information (FIG. 10)), etc. can be used. .

 ステップ1203で計算した倉庫作業計画、輸送計画を採用しない場合(ステップS1205でNG)には、処理部102は、ステップ1202に戻る。処理部102は、現在の候補ログをベースに、ステップS1202で新たな輸送手段候補を生成し、候補ログを更新する。そして、処理部102は、再度ステップ1203以降の処理を行う。このように、ステップ1202から1205の処理を、ステップ1203で計算した倉庫作業計画、輸送計画を採用する(ステップS1205でOK)まで繰り返す。 When the warehouse work plan and the transportation plan calculated in step 1203 are not adopted (NG in step S1205), the processing unit 102 returns to step 1202. Based on the current candidate log, the processing unit 102 generates a new transportation means candidate in step S1202 and updates the candidate log. And the process part 102 performs the process after step 1203 again. In this way, the processing of steps 1202 to 1205 is repeated until the warehouse work plan and the transportation plan calculated in step 1203 are adopted (OK in step S1205).

 輸送手段候補の更新が一巡した場合や、ステップ1203で計算した倉庫作業計画、輸送計画を採用しない場合(ステップS1205でNG)が一定回数(例えば、1万回)以上となった場合や、ステップ1202から1205の処理を繰り返す時間が一定時間(例えば1分)以上となった場合には、これ以上良い計画が見つからない場合と考えられる。このような場合には、処理を終了させるか、ステップ1203で計算する際の評価パラメータを変更して、再計算することにより対処することができる。どちらを採用するかは、予め設定しておいてもよいし、入力部105からの入力を受け付けて選択してもよい。 If the transportation means candidate has been updated, or if the warehouse work plan or transportation plan calculated in step 1203 is not adopted (NG in step S1205) has reached a certain number of times (for example, 10,000 times) or more, If the time for repeating the processing from 1202 to 1205 is equal to or longer than a certain time (for example, 1 minute), it is considered that no better plan can be found. Such a case can be dealt with by terminating the process or changing the evaluation parameter at the time of calculation in step 1203 and recalculating. Which one is adopted may be set in advance, or may be selected by receiving an input from the input unit 105.

 ここで、評価パラメータとは、輸送と倉庫と在庫との重視度合い、すなわち輸送、倉庫作業、在庫の最適性を評価するときに、どれを重視するか、を示すものである。評価パラメータは、品目別や場所別に設定可能である。荷主の立場を考えると、よく売れる品目は在庫が多少増えても輸送効率を上げた方がよく、あまり売れない品目は、輸送効率を落としても少ない在庫で回すのが望ましいことがある。このように、品目や拠点などの違いで最適性の評価尺度が変わる場合、それを計算に取り入れるのが望ましい。なお、すでに説明した数式(1)では、輸送を重視した評価パラメータを用いている。 Here, the evaluation parameter indicates the degree of emphasis on transportation, warehouse, and inventory, that is, which is emphasized when evaluating the optimality of transportation, warehousing, and inventory. Evaluation parameters can be set for each item or location. Considering the shipper's position, it is better to increase the transportation efficiency for items that sell well even if the inventory increases somewhat, and it may be desirable to turn the items that do not sell well with a small inventory even if the transportation efficiency is reduced. Thus, when the evaluation scale for optimality changes due to differences in items, bases, etc., it is desirable to incorporate it into the calculation. Note that, in the mathematical formula (1) already described, the evaluation parameter that emphasizes transportation is used.

 図18は、評価パラメータを入力部105から入力するときの、表示部104の表示例を示す。図17では品目の選択ボタンが表示される品目選択領域と、その品目を扱う拠点を指定する拠点指定領域と、評価パラメータとして輸送、倉庫(倉庫作業)、在庫の重視度合いを相対的に表示する評価パラメータ表示領域とを有している。 FIG. 18 shows a display example of the display unit 104 when the evaluation parameter is input from the input unit 105. In FIG. 17, an item selection area in which an item selection button is displayed, a base designation area for designating a base that handles the item, and the importance of transport, warehouse (warehouse work), and inventory are displayed as evaluation parameters. And an evaluation parameter display area.

 入力部105は、品目選択領域を用いて品目を選択し、拠点指定領域を用いて必要に応じて拠点を選択し、評価パラメータ表示領域を用いて輸送、倉庫作業、在庫の重視度合いを変更する。図18に示す例においては、品目PROD1は、在庫の最適性を重視し、品目PROD3は輸送を重視している。処理部102は、入力部105により変更された評価パラメータを、記憶部103に記憶する。 The input unit 105 selects an item using the item selection area, selects a base as necessary using the base designation area, and changes the degree of emphasis on transportation, warehouse work, and inventory using the evaluation parameter display area. . In the example shown in FIG. 18, the item PROD1 emphasizes the optimality of inventory, and the item PROD3 emphasizes transportation. The processing unit 102 stores the evaluation parameter changed by the input unit 105 in the storage unit 103.

 入力部105により評価パラメータが変更された場合には、処理部102は、ステップ1203で計算した倉庫作業計画、輸送計画を採用しない場合(ステップS1205でNG)とみなしてステップ1202に戻る。処理部102は、ステップ1203にて例えば混合整数計画法を用いる場合には、変更された評価パラメータに基づいて、目的関数の係数を変更する。例えば、輸送、倉庫作業、在庫の重視度合いの比が1:1:2である場合には、輸送のコスト(移動ルート情報(図8)参照)、倉庫作業のコスト(作業情報(図7)参照)、在庫のコスト(在庫情報(図6)参照)を1:1:2で加算した値を目的関数の係数とする。これにより、ユーザーの要望に沿った倉庫作業計画、輸送計画を生成することができる。 When the evaluation parameter is changed by the input unit 105, the processing unit 102 considers that the warehouse work plan and the transportation plan calculated in step 1203 are not adopted (NG in step S1205) and returns to step 1202. For example, when using mixed integer programming in step 1203, the processing unit 102 changes the coefficient of the objective function based on the changed evaluation parameter. For example, when the ratio of the importance level of transportation, warehouse work, and inventory is 1: 1: 2, the cost of transportation (see movement route information (FIG. 8)) and the cost of warehouse work (work information (FIG. 7)). See), and a value obtained by adding the inventory cost (see inventory information (see FIG. 6)) 1: 1: 2 is used as the coefficient of the objective function. Thereby, it is possible to generate a warehouse work plan and a transportation plan according to the user's request.

 本実施の形態によれば、倉庫作業と輸送とを同時に考慮して倉庫作業計画、輸送計画を作成することで、物流全体の効率を上げることができる計画を生成することができる。例えば、コストを低くしたい場合には、倉庫作業と輸送とのコストを考慮して、全体としてのトータルコストを低くすることができる。 According to the present embodiment, it is possible to generate a plan that can increase the efficiency of the entire physical distribution by creating a warehouse work plan and a transport plan in consideration of warehouse work and transportation at the same time. For example, when it is desired to reduce the cost, the total cost as a whole can be reduced in consideration of the costs of warehouse work and transportation.

 また、本実施の形態によれば、倉庫作業と輸送、在庫の評価パラメータを品目や拠点ごとに設定することで、様々な状況に対応することができる。例えば、物流受託事業者の効率だけでなく、荷主側の効率も考慮した物流が可能となる。したがって、より使い勝手の良い物流計画装置を提供することができる。 In addition, according to the present embodiment, it is possible to cope with various situations by setting the evaluation parameters for warehouse work, transportation, and inventory for each item or base. For example, it is possible to carry out logistics in consideration of not only the efficiency of the logistics contractor but also the efficiency of the shipper. Therefore, it is possible to provide a logistics planning apparatus that is more convenient to use.

 なお、本実施の形態では、評価パラメータを品目ごとに入力する(図18参照)ことにより評価パラメータを変更したが、評価パラメータを変更する方法はこれに限定されない。例えば、品目の特性に応じて処理部102が自動的に評価パラメータを変更してもよい。例えば、記憶部101に記憶されている品目情報(図3)に、品目の特性(リリース時期、販売期間等)を品目に関連付けて格納しておき、リリース時期からあまり時間が経過していない(新製品等)場合には、処理部102が輸送の重視度合いを高くしてもよい。また、販売期間が一定以上である場合には、在庫の重視度合いを高くしてもよい。また、倉庫処理能力情報(図10)を参照し、パートの多い拠点を経由する品目については、在庫の増減はあまりコストに影響しないため、在庫の比率を低くしてもよい。 In this embodiment, the evaluation parameter is changed by inputting the evaluation parameter for each item (see FIG. 18), but the method of changing the evaluation parameter is not limited to this. For example, the processing unit 102 may automatically change the evaluation parameter according to the characteristics of the item. For example, in the item information (FIG. 3) stored in the storage unit 101, the characteristics of the item (release time, sales period, etc.) are stored in association with the item, and not much time has passed since the release time ( In the case of a new product or the like, the processing unit 102 may increase the importance of transportation. Further, when the sales period is a certain period or more, the importance degree of inventory may be increased. In addition, referring to the warehouse processing capacity information (FIG. 10), for items passing through a base with many parts, the increase or decrease in inventory does not affect the cost so much, so the ratio of inventory may be lowered.

 また、入力部105により評価パラメータが変更したり、処理部102が自動的に評価パラメータを変更したりするのは、いつ行ってもよい。例えば、図14に示す処理を開始する前に行ってもよい。 Also, the evaluation parameter may be changed by the input unit 105 or the evaluation parameter may be automatically changed by the processing unit 102 at any time. For example, you may perform before starting the process shown in FIG.

 なお、本発明は上記した実施形態に限定されるものではなく、様々な変形例が含まれる。例えば、上記した実施形態は本発明を分かりやすく説明するために詳細に説明したものであり、必ずしも説明した全ての構成を備えるものに限定されるものではない。また、ある実施形態の構成の一部を他の実施形態の構成に置き換えることが可能であり、また、ある実施形態の構成に他の実施形態の構成を加えることも可能である。また、各実施形態の構成の一部について、他の構成の追加・削除・置換をすることが可能である。 Note that the present invention is not limited to the above-described embodiment, and includes various modifications. For example, the above-described embodiment has been described in detail for easy understanding of the present invention, and is not necessarily limited to one having all the configurations described. Further, a part of the configuration of an embodiment can be replaced with the configuration of another embodiment, and the configuration of another embodiment can be added to the configuration of an embodiment. In addition, it is possible to add, delete, and replace other configurations for a part of the configuration of each embodiment.

 また、上記の各構成、機能、処理部、処理手段等は、それらの一部又は全部を、例えば集積回路で設計する等によりハードウエアで実現してもよい。また、上記の各構成、機能等は、プロセッサがそれぞれの機能を実現するプログラムを解釈し、実行することによりソフトウェアで実現してもよい。各機能を実現するプログラム、テーブル、ファイル等の情報は、メモリや、ハードディスク、SSD(Solid State Drive)等の記録装置、または、ICカード、SDカード、DVD等の記録媒体に置くことができる。 In addition, each of the above-described configurations, functions, processing units, processing means, and the like may be realized by hardware by designing a part or all of them with, for example, an integrated circuit. Each of the above-described configurations, functions, and the like may be realized by software by interpreting and executing a program that realizes each function by the processor. Information such as programs, tables, and files for realizing each function can be stored in a recording device such as a memory, a hard disk, an SSD (Solid State Drive), or a recording medium such as an IC card, an SD card, or a DVD.

 また、制御線や情報線は説明上必要と考えられるものを示しており、必ずしも全ての制御線や情報線を示しているとは限らない。実際には殆ど全ての構成が相互に接続されていると考えてもよい。 Also, the control lines and information lines indicate what is considered necessary for the explanation, and not all control lines and information lines are necessarily shown. Actually, it may be considered that almost all the components are connected to each other.

100:物流計画装置、101:記憶部、102:処理部、103:記憶部、104:表示部、105:入力部、111:端末、201:入力装置、202:出力装置、203:外部記憶装置、204:演算装置、205:主記憶装置、206:通信装置、207:バス 100: Logistics planning device 101: Storage unit 102: Processing unit 103: Storage unit 104: Display unit 105: Input unit 111: Terminal 201: Input device 202: Output device 203: External storage device 204: arithmetic unit, 205: main storage device, 206: communication device, 207: bus

Claims (8)

 品目に関する情報である品目情報と、出荷場所、保管場所及び入荷場所を含む拠点に関する情報である拠点情報と、前記品目について前記拠点とその拠点における在庫に関する情報とが関連付けられた在庫情報と、前記品目について前記拠点における作業時間に関する情報である作業情報と、前記拠点間の移動ルート及び移動時間を含む移動ルートに関する情報である移動ルート情報と、前記拠点間の移動を行う輸送リソースに関する情報である輸送リソース情報と、前記拠点における処理能力に関する情報である倉庫処理能力情報と、前記品目と当該品目の納期及び出荷量とが関連付けられた出荷計画と、を記憶する記憶部と、
 前記品目情報、前記拠点情報、前記在庫情報、前記作業情報、前記移動ルート情報、前記輸送リソース情報、及び前記倉庫処理能力情報に含まれる輸送に関する制約条件及び拠点に関する制約条件を満たし、かつ前記出荷計画を実行できるように、前記品目と前記拠点と前記拠点での作業に関する情報が関連付けられた倉庫作業計画、及び、前記品目とその品目を輸送する輸送ルートを示す情報と、当該輸送ルートに関する情報とが関連付けられた輸送計画を生成する処理部と、
 前記生成された倉庫作業計画及び輸送計画を出力する出力部と、
 を備えることを特徴とする物流計画装置。
Item information that is information about the item, base information that is information about a base including a shipping location, a storage location, and a receiving location, inventory information in which the base and information about stock at the base are associated with the item, Work information that is information about work time at the bases for items, travel route information that is information about travel routes and travel routes between the bases, and information about transportation resources that travel between the bases A storage unit that stores transportation resource information, warehouse processing capacity information that is information regarding processing capacity at the base, and a shipping plan in which the delivery time and the shipping amount of the item are associated with each other;
The shipping condition and the restriction condition regarding the base included in the item information, the base information, the inventory information, the work information, the movement route information, the transport resource information, and the warehouse processing capacity information are satisfied, and the shipping A warehouse work plan in which information related to the item, the base, and the work at the base is associated so that the plan can be executed, information indicating the transport route for transporting the item and the item, and information about the transport route A processing unit for generating a transportation plan associated with
An output unit for outputting the generated warehouse work plan and transportation plan;
A logistics planning apparatus comprising:
 請求項1に記載の物流計画装置であって、
 前記記憶部は、輸送と倉庫と在庫との重視度合いを示す評価パラメータを記憶し、
 前記処理部は、前記評価パラメータを用いて前記倉庫作業計画及び前記輸送計画を生成する
 ことを特徴とする物流計画装置。
The logistics planning device according to claim 1,
The storage unit stores an evaluation parameter indicating a degree of emphasis on transportation, warehouse, and inventory,
The processing unit generates the warehouse work plan and the transportation plan using the evaluation parameter.
 請求項2に記載の物流計画装置であって、
 前記評価パラメータを前記品目ごとに入力する入力部を備え、
 前記記憶部は、前記入力された評価パラメータを記憶する
 ことを特徴とする物流計画装置。
The logistics planning device according to claim 2,
An input unit for inputting the evaluation parameter for each item;
The distribution planning apparatus, wherein the storage unit stores the input evaluation parameters.
 請求項2に記載の物流計画装置であって、
 前記処理部は、前記評価パラメータを前記品目に基づいて変更する
 ことを特徴とする物流計画装置。
The logistics planning device according to claim 2,
The said processing part changes the said evaluation parameter based on the said item. The physical distribution planning apparatus characterized by the above-mentioned.
 請求項1に記載の物流計画装置であって、
 前記処理部は、前記移動ルートと前記輸送リソースの組である輸送手段の候補を生成し、当該輸送手段の候補を用いて前記輸送計画を生成する
 ことを特徴とする物流計画装置。
The logistics planning device according to claim 1,
The processing unit generates a transportation means candidate that is a set of the travel route and the transportation resource, and creates the transportation plan using the transportation means candidate.
 請求項5に記載の物流計画装置であって、
 前記出力部は、前記生成された倉庫作業計画及び輸送計画を前記記憶部に出力し、
 前記記憶部は、前記出力された倉庫作業計画及び輸送計画を記憶し、
 前記処理部は、前記記憶部に前記輸送計画が記憶されているときは、当該記憶された輸送計画を用いて前記輸送手段の候補を生成する
 ことを特徴とする物流計画装置。
The logistics planning device according to claim 5,
The output unit outputs the generated warehouse work plan and transportation plan to the storage unit,
The storage unit stores the output warehouse work plan and transport plan,
When the transportation plan is stored in the storage unit, the processing unit generates a candidate for the transportation means using the stored transportation plan.
 品目に関する情報である品目情報と、出荷場所、保管場所及び入荷場所を含む拠点に関する情報である拠点情報と、前記品目について前記拠点とその拠点における在庫に関する情報とが関連付けられた在庫情報と、前記品目について前記拠点における作業時間に関する情報である作業情報と、前記拠点間の移動ルート及び移動時間を含む移動ルートに関する情報である移動ルート情報と、前記拠点間の移動を行う輸送リソースに関する情報である輸送リソース情報と、前記拠点における処理能力に関する情報である倉庫処理能力情報と、前記品目とその納期及び出荷量とが関連付けられた出荷計画と、を記憶する記憶部を備えた装置を用いて行う物流計画生成プログラムであって、
 前記品目情報、前記拠点情報、前記在庫情報、前記作業情報、前記移動ルート情報、前記輸送リソース情報、及び前記倉庫処理能力情報に含まれる輸送に関する制約条件及び拠点に関する制約条件を満たし、かつ前記出荷計画を実行できるように、前記品目と前記拠点と前記拠点での作業に関する情報が関連付けられた倉庫作業計画及び前記品目とその品目を輸送する輸送ルートを示す情報と、当該輸送ルートに関する情報とが関連付けられた輸送計画を生成するステップと、
 前記生成された倉庫作業計画及び輸送計画を出力するステップと、
 を前記装置に実行させることを特徴とする物流計画生成プログラム。
Item information that is information about the item, base information that is information about a base including a shipping location, a storage location, and a receiving location, inventory information in which the base and information about stock at the base are associated with the item, Work information that is information about work time at the bases for items, travel route information that is information about travel routes and travel routes between the bases, and information about transportation resources that travel between the bases This is performed using an apparatus including a storage unit that stores transport resource information, warehouse processing capacity information that is information regarding processing capacity at the base, and a shipping plan in which the item is associated with a delivery date and a shipping amount. A logistics plan generation program,
The shipping condition and the restriction condition regarding the base included in the item information, the base information, the inventory information, the work information, the movement route information, the transport resource information, and the warehouse processing capacity information are satisfied, and the shipping A warehouse work plan in which information on the item, the base, and work at the base is associated so that the plan can be executed, information indicating a transportation route for transporting the item and the item, and information on the transportation route are provided. Generating an associated transportation plan;
Outputting the generated warehouse work plan and transportation plan;
The distribution plan generation program characterized by causing the apparatus to execute.
 請求項7に記載の物流計画生成プログラムを格納したコンピュータ読み取り可能な記憶媒体。 A computer-readable storage medium storing the distribution plan generation program according to claim 7.
PCT/JP2013/078474 2013-10-21 2013-10-21 Physical distribution planning device, physical distribution planning program, and storage medium Ceased WO2015059750A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2015543588A JPWO2015059750A1 (en) 2013-10-21 2013-10-21 Distribution planning apparatus, distribution plan generation program, and storage medium
PCT/JP2013/078474 WO2015059750A1 (en) 2013-10-21 2013-10-21 Physical distribution planning device, physical distribution planning program, and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2013/078474 WO2015059750A1 (en) 2013-10-21 2013-10-21 Physical distribution planning device, physical distribution planning program, and storage medium

Publications (1)

Publication Number Publication Date
WO2015059750A1 true WO2015059750A1 (en) 2015-04-30

Family

ID=52992390

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2013/078474 Ceased WO2015059750A1 (en) 2013-10-21 2013-10-21 Physical distribution planning device, physical distribution planning program, and storage medium

Country Status (2)

Country Link
JP (1) JPWO2015059750A1 (en)
WO (1) WO2015059750A1 (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112801437A (en) * 2019-11-13 2021-05-14 顺丰科技有限公司 Sorting equipment scheduling method and device, electronic equipment and storage medium
JP2021513134A (en) * 2019-03-13 2021-05-20 クーパン コーポレイション Genetic algorithm-based systems and methods for simulating outbound flow
KR20210124869A (en) * 2020-04-07 2021-10-15 쿠팡 주식회사 Systems and methods for automated outbound profile generation
JP2022014106A (en) * 2020-07-06 2022-01-19 日立建機株式会社 Inventory evaluation device
JP2022016205A (en) * 2020-07-10 2022-01-21 株式会社オープンロジ Delivery support system
JP2023154789A (en) * 2022-04-08 2023-10-20 ロジスティード株式会社 Inventory supply planning method and inventory supply planning system
JP2024058370A (en) * 2022-10-14 2024-04-25 株式会社日立製作所 System and method for creating production and logistics plans

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000276688A (en) * 1999-03-29 2000-10-06 Hitachi Software Eng Co Ltd Method and system for preparing transport schedule
JP2001233414A (en) * 1999-12-16 2001-08-28 Hitachi Ltd Production planning method
JP2002032108A (en) * 2000-07-19 2002-01-31 Toyota Motor Corp Product transportation planning equipment
JP2003271797A (en) * 2002-03-14 2003-09-26 Hitachi Ltd Production plan support method, production plan support system, and production plan support program
JP2008114960A (en) * 2006-11-02 2008-05-22 Hitachi Ltd Transportation planning system
JP2010055382A (en) * 2008-08-28 2010-03-11 Hitachi Ltd Supply planning device, program and synthetic method
JP2013178731A (en) * 2012-02-01 2013-09-09 Hitachi Ltd Producible quantity calculation device, producible quantity calculation program, and storage medium

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000276688A (en) * 1999-03-29 2000-10-06 Hitachi Software Eng Co Ltd Method and system for preparing transport schedule
JP2001233414A (en) * 1999-12-16 2001-08-28 Hitachi Ltd Production planning method
JP2002032108A (en) * 2000-07-19 2002-01-31 Toyota Motor Corp Product transportation planning equipment
JP2003271797A (en) * 2002-03-14 2003-09-26 Hitachi Ltd Production plan support method, production plan support system, and production plan support program
JP2008114960A (en) * 2006-11-02 2008-05-22 Hitachi Ltd Transportation planning system
JP2010055382A (en) * 2008-08-28 2010-03-11 Hitachi Ltd Supply planning device, program and synthetic method
JP2013178731A (en) * 2012-02-01 2013-09-09 Hitachi Ltd Producible quantity calculation device, producible quantity calculation program, and storage medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"SAP Butsuryu Solution no Goshokai", 27 March 2013 (2013-03-27), pages 1 - 41, Retrieved from the Internet <URL:http://global.sap.com/japan/events/2013/0327_mfg/06.pdf> [retrieved on 20140107] *

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2021513134A (en) * 2019-03-13 2021-05-20 クーパン コーポレイション Genetic algorithm-based systems and methods for simulating outbound flow
JP7018142B2 (en) 2019-03-13 2022-02-09 クーパン コーポレイション Genetic algorithm-based systems and methods for simulating outbound flows
CN112801437A (en) * 2019-11-13 2021-05-14 顺丰科技有限公司 Sorting equipment scheduling method and device, electronic equipment and storage medium
KR20210124869A (en) * 2020-04-07 2021-10-15 쿠팡 주식회사 Systems and methods for automated outbound profile generation
KR102354795B1 (en) * 2020-04-07 2022-02-07 쿠팡 주식회사 Systems and methods for automated outbound profile generation
JP2022014106A (en) * 2020-07-06 2022-01-19 日立建機株式会社 Inventory evaluation device
JP7438041B2 (en) 2020-07-06 2024-02-26 日立建機株式会社 inventory evaluation device
JP2022016205A (en) * 2020-07-10 2022-01-21 株式会社オープンロジ Delivery support system
JP2023154789A (en) * 2022-04-08 2023-10-20 ロジスティード株式会社 Inventory supply planning method and inventory supply planning system
JP2024058370A (en) * 2022-10-14 2024-04-25 株式会社日立製作所 System and method for creating production and logistics plans

Also Published As

Publication number Publication date
JPWO2015059750A1 (en) 2017-03-09

Similar Documents

Publication Publication Date Title
CN107194646B (en) Inventory scheduling method and device
JP7062561B2 (en) Stock allocation design equipment and inventory allocation design method
WO2015059750A1 (en) Physical distribution planning device, physical distribution planning program, and storage medium
Karaoğlan et al. The coordinated production and transportation scheduling problem with a time-sensitive product: a branch-and-cut algorithm
Coelho et al. The inventory-routing problem with transshipment
Mousavi et al. A possibilistic programming approach for the location problem of multiple cross-docks and vehicle routing scheduling under uncertainty
JP6650508B2 (en) Warehouse management system and warehouse management method
JP5980408B2 (en) Supply rule generation device and supply rule generation program
TW200945242A (en) Dynamically routing salvage shipments and associated method
JP7175839B2 (en) Transportation planning device, transportation planning system, and transportation planning method
JP6856135B2 (en) Transfer work control device, transfer work control method, and transfer work control program
CN113807759A (en) Deep learning-based freight rate determination method and device
JP6050980B2 (en) Production number calculation device, production number calculation program, and storage medium
Pang et al. Ship routing problem with berthing time clash avoidance constraints
Gschwind et al. Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
Yang et al. Mixed reality-based online 3D pallet loading problem to achieve augmented intelligence in e-fulfilment processes
JP2020119297A (en) Server, luggage delivery method and program
US20200065746A1 (en) Order management system for e-retail orders
CN114841646A (en) Storage management method, device, computer equipment, system and storage medium
US20140279321A1 (en) Method and system of charge distribution in a transportation management component
Dondo et al. A branch-and-price approach to manage cargo consolidation and distribution in supply chains
JP7249265B2 (en) Inventory planning device and inventory planning method
CN116777315A (en) Information processing device and information processing method
Achamrah et al. Contextual bandits-guided local search for solving air cargo palletisation problem
CN112801567B (en) Express delivery mode selection method, device, computer equipment and storage medium

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

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2015543588

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13895855

Country of ref document: EP

Kind code of ref document: A1