JP2014215849A - Transportation planning apparatus, transportation planning method, and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To efficiently make a transportation plan in transporting objects, which have been transported from a plurality of supply sources to a predetermined place, to a supply destination.SOLUTION: A transportation planning device makes a plan for transporting objects, which have been transported from a plurality of supply sources to a predetermined place, from the predetermined place to a supply destination at a predetermined interval. The transportation planning device includes: first storage means which stores restriction information in transporting the object; second storage means which stores evaluation condition information in allocating the objects to supply operations; and optimization means which allocates the objects from the supply sources to the supply operations, while leveling the number of objects for each supply operation, according to the restriction information of the first storage means, in descending order of frequency and the amount of the objects supplied from the supply sources. The optimization means moves the objects for each of the supply operations to a subsequent supply operation in leveling, and evaluates allocation of the objects for the supply operation before and after the movement, on the basis of the evaluation condition information in the second storage means.

Description

  The present invention relates to a transportation plan planning device, a transportation plan planning method, and a program for carrying a plan for transporting a transported object from a plurality of suppliers to a predetermined place and transporting it from the predetermined place to a supplier every predetermined time. .

  For example, in manufacturing factories, etc., parts delivered from suppliers such as parts factories are accepted at parts delivery locations, and accepted parts are transported through the respective transportation courses to suppliers such as assembly processes at predetermined intervals. . At this time, an efficient transportation plan for parts to the supplier is desired. On the other hand, once the parts delivered from the supplier are piled up in each supply time, the number of parts transported in each supply time is leveled by moving the parts in each supply time to the subsequent supply times. A transportation plan planning device is known (see Patent Document 1).

Japanese Unexamined Patent Publication No. 07-093412

  However, in the transportation plan planning apparatus shown in Patent Document 1, the number of parts at each supply time is leveled after the parts are once piled up for each supply time. For this reason, it is necessary to disintegrate parts at each supply time, and it takes time for the processing, and there is a possibility that an efficient transportation plan becomes difficult.

  The present invention has been made to solve such a problem, and can transport a transport plan efficiently when transporting a transported material transported from a plurality of suppliers to a predetermined location to a supplier. The main purpose is to provide a planning device, a transportation planning method, and a program.

One aspect of the present invention for achieving the above object is that a transported material is transported from a plurality of suppliers to a predetermined location, and the transported transported material is transported from the predetermined location to a supplier every predetermined time. A transportation plan planning device for performing first storage means for storing constraint condition information when transporting the transported object, and second storage means for storing evaluation condition information when assigning the transported object to each supply time And, in order of increasing the number of times of supply and supply amount of the transported goods supplied from each of the supply sources, each transported product from each of the supply sources for each supply time, according to the constraint condition information of the first storage means, An optimization means for allocating while carrying out the leveling of the number of conveyed items in the supply time, and the optimization means moves the conveyed items in each of the supply times to a subsequent supply time when performing the leveling, Based on the evaluation condition information of the second storage means, the movement To evaluate the allocation of transport of each supply times before and after it is transported planning apparatus according to claim.
In this aspect, the optimizing unit may move the transported object of each supply time to a subsequent supply time so as to reduce the number of times of supply to the supply destination.
In this one aspect, the constraint condition information stored in the first storage means is the amount of transportable material that can be transported once for each transport course to the supply destination, the maximum work amount including the travel time to the supply destination, And it may include at least one of the maximum number of movements in which the transported goods of each supply time can be moved to a subsequent supply time.
In this one aspect, the evaluation condition information stored in the second storage means includes an evaluation item for performing the evaluation, and the optimization means It may be determined whether or not to move the transported item in each supply time to a subsequent supply time by calculating and comparing evaluation points with respect to the evaluation items.
In this one aspect, the evaluation items of the evaluation condition information include the number of transporters who transport the transported goods at each supply time to the supply destination, the number of transports, and the difference between the maximum number of transported goods and the minimum number of transported goods at each of the supply times. And at least one of the cumulative value of the difference in the number of conveyed items between adjacent supply times and the number of times the conveyed item is moved in each of the supply times.
In this aspect, a priority may be set for the evaluation item of the evaluation condition information.
In this aspect, among the transported items assigned by the optimization unit, transported supporters who cannot transport the transported item by the dedicated transporter based on the constraint condition information stored in the first storage unit. Further, a minimizing means for allocating the transported goods may be provided, and the minimizing means may allocate the transported goods to each supply time so that the number of transport supporters is minimized.
In this one aspect, the minimizing means moves the transported object of each supply time to a subsequent supply time, and transports each supply time before and after the movement based on the evaluation condition information of the second storage means. You may perform the allocation of the said conveyance thing with respect to the said conveyance supporter by evaluating and comparing the allocation of the thing.
One aspect of the present invention for achieving the above object is that a transported material is transported from a plurality of suppliers to a predetermined location, and the transported transported material is transported from the predetermined location to a supplier every predetermined time. A method for planning a transportation plan to be performed, the step of storing constraint condition information when transporting the transported material, the step of storing evaluation condition information when allocating the transported material to each supply time, and each supplier In order of the number of supplies and the amount of supplies supplied from each source, the number of items to be supplied from each supply source is leveled for each supply time according to the constraint information for each supply time. And the step of allocating, and when carrying out the leveling, the transported goods of each supply time are moved to a subsequent supply time, and based on the evaluation condition information, the transported goods of each supply time before and after the movement are allocated. And including a step of evaluating It may be transported planning method comprising.
One aspect of the present invention for achieving the above object is that a transported material is transported from a plurality of suppliers to a predetermined location, and the transported transported material is transported from the predetermined location to a supplier every predetermined time. A program to be performed when transporting the transported goods from each of the supply sources in order of descending number of supply times and supply amount of the transported goods supplied from the respective supply sources. In accordance with the constraint information, the process of allocating the number of conveyed items for each supply time while performing the leveling, and when performing the leveling, the conveyed item for each supply time is moved to a subsequent supply time, The program may be characterized by causing a computer to execute the process of evaluating the allocation of the conveyed goods at each supply time before and after the movement, based on the evaluation condition information at the time of allocation to the supply times.

  According to the present invention, there is provided a transportation plan planning device, a transportation plan planning method, and a program capable of efficiently planning a transportation plan when transporting a transported material transported to a predetermined place from a plurality of suppliers. be able to.

It is a block diagram which shows the schematic system configuration | structure of the conveyance plan planning apparatus which concerns on one embodiment of this invention. It is a figure for demonstrating a course unit optimization process. It is a flowchart which shows the flow of the course unit optimization process by a course unit optimization part. It is a figure which shows the state which sorted the supplier in order with the frequency | count of supply, and carrying baggage. It is a figure which shows the method of assigning a transported luggage to each charge. It is a figure which shows the method of assigning a transported luggage to each charge. It is a figure which shows the method of assigning a transported luggage to each charge. It is a flowchart which shows the optimization process flow by a course unit optimization part. It is a figure for demonstrating an evaluation item. It is a figure for demonstrating "the number of conveyance" and "the number of conveyance" of an evaluation item. It is a figure for demonstrating the "work amount difference" and "the difference in the number of conveyance trolleys" of an evaluation item. It is a figure for demonstrating the "remainder" of an evaluation item. It is a figure for demonstrating the "remainder 0" of an evaluation item. It is a figure for demonstrating the "movement number" of an evaluation item. It is a flowchart which shows the minimization processing flow by the supporter minimization part which concerns on one embodiment of this invention. It is a figure for demonstrating a specific example of the minimization process.

  Embodiments of the present invention will be described below with reference to the drawings. The transportation planning apparatus according to an embodiment of the present invention performs, for example, a planning that efficiently allocates a work amount when a part delivered to a manufacturing factory is transported to an assembly process or the like to a transportation resource. The transportation plan planning device can create a transportation plan that minimizes transportation resources in a short time.

  For example, parts necessary for manufacturing a product are delivered to a predetermined place from a plurality of suppliers (suppliers). A certain number of parts delivered to a given location are packed in a box and placed on a transport cart. Then, the transport dedicated person and the transport supporter can move the transport carts from the predetermined place every predetermined time (for each supply time, for example, the first time 9:00, the second time 9:30,...) Pass through the transport course and transport to each assembly process (supplier).

  As described above, the transportation plan planning apparatus according to the present embodiment can efficiently plan a transportation plan that minimizes the transportation resources required when the transportation cart is transported to each assembly process through each transportation course.

  FIG. 1 is a block diagram showing a schematic system configuration of a transportation plan planning apparatus according to an embodiment of the present invention. The transportation plan planning apparatus 1 according to the present embodiment includes an optimization evaluation condition database 2, a transportation course information database 3, a transportation constraint condition database 4, a workload database 5, a course unit optimization unit 6, and support. A person minimizing unit 7 and a transportation plan database 8 are provided.

  The transportation planning apparatus 1 includes, for example, a CPU (Central Processing Unit) that performs arithmetic processing and control processing, a ROM (Read Only Memory) and a RAM (Random Access) that store arithmetic programs and control programs that are executed by the CPU. The hardware is composed mainly of a microcomputer including a memory including a memory and an interface unit (I / F) for inputting / outputting signals to / from the outside. The CPU, memory, and interface unit are connected to each other via a data bus or the like.

  The optimization evaluation condition database 2 is a specific example of the first storage unit, and stores optimum evaluation condition information for performing an evaluation described later. The optimum evaluation condition information is, for example, a transportation plan (each supply) in the optimization process for each conveyance course for conveying the parts delivered from each supplier to the factory to the assembly process and the supporter minimization process described later. Information on evaluation items and evaluation criteria for determining pass / fail of allocation of transported baggage).

  The transport course information database 3 stores transport course information including information on a transport course for transporting transported packages delivered from each supplier to the factory to the assembly process. The transportation course information includes, for example, information such as the number of personnel dedicated to transportation, the traveling distance of the transportation course, the time required for the transportation course, and the stop time at an intersection existing in the transportation course for each transportation course. .

  The transport constraint condition database 4 is a specific example of the second storage unit, and stores transport constraint condition information that is a constraint condition when transporting. The transport constraint condition information is, for example, the maximum number of carts, the maximum number of boxes, and the maximum work amount that can be transported once per transport course (each supply time) (total time of travel time + temporary stop time + handling time) The maximum possible number of delays for each supply time (the number of possible movements (later) described later, for example, once or twice), the same supplier is the same person in charge (transport specialist or transport supporter) ) Is information on the constraints when transporting, such as allocation.

  The work amount database 5 stores work amount information including information such as the number of trucks necessary for transportation for each supplier and each supply time, the number of boxes in which parts are accommodated, and the handling time per box.

  The course unit optimization unit 6 is a specific example of an optimization unit, and includes optimum evaluation condition information stored in the optimization evaluation condition database 2 and conveyance constraint condition information stored in the conveyance constraint condition database 4. On the basis of this, a transport luggage (transport cart) is allocated to each supply time. As a result, compared with the conventional case, the transportation plan delivered from the supplier is once piled up as it is in each supply time, and then the leveling and optimization processing is executed to perform the mountain collapse. The planning time can be greatly reduced.

  The course unit optimization unit 6 makes the best use of the transport capacity of the transport specialist for each transport course and minimizes the number of times of delaying the supply times (moving the transported luggage to the subsequent supply times). A conveyance course unit optimization process (hereinafter referred to as a course unit optimization process) for allocating luggage (work load) to each supply time is performed.

  The supporter minimizing unit 7 is a specific example of the minimizing means, and the number of transport supporters is minimized when allocating transported luggage (work load) that cannot be transported by the transport specialist for each transport course to the transport supporter. Each transported luggage is assigned to each supply time so that The supporter minimizing unit 7 selects the transportation plan (assignment of the transportation baggage for each supply time) based on the transportation constraint condition information in the transportation constraint condition database 4 and the optimum evaluation condition information in the optimization evaluation condition database 2. Allocating the transported baggage to each supply time while judging the quality.

  The transportation plan database 8 stores transportation plan information processed by the course unit optimization unit 6 and the supporter minimization unit 7. The transportation plan information includes information such as which transportation dedicated person or which transportation supporter carries which transportation luggage for each transportation course and each supply time. In accordance with the transportation plan information, transportation of the transported luggage including the parts delivered from each supplier is actually executed.

  Next, each carrying baggage (work load) so as to minimize the number of times that the carrying baggage is delayed (the number of times of shifting) in each supply time, while making the best use of the carrying capacity of the carrying specialist for each carrying course described above. The course unit optimization process for allocating the item to the transport specialist will be described in detail with reference to FIG.

  The course unit optimizing unit 6 determines the number of times of supply when assigning each transported baggage to each supply time (1,..., 24) of each transport course based on the work amount information in the work amount database 5. Sort the suppliers (A,..., F) in descending order of transported luggage.

  For example, supplier A supplies transported luggage to supply times 1 to 6 (supply count 6), and supplier B supplies transport luggage to supply times 1-3, 5, and 6 (supply count 5), Supplier C supplies transported goods to supply times 1, 3, 5 (supplied number of times 3), and supplier D supplies transported goods to supply times 1, 3, 5 (supplied number of times 3) and purchases The destination E supplies four transported goods to the supply times 1 and 5 (supply time 2), and the supplier E supplies two transported goods to the supply times 1 and 5 (supply time 2). Therefore, it is sorted in the order of suppliers A, B, C, D, E, and F.

  (1) The course unit optimizing unit 6 satisfies the transport constraint condition information while evaluating the transport load of the supplier A having the largest number of supply times and the large transport load based on the optimal evaluation condition information. Assign to each supply times 1-6. The course unit optimizing unit 6 performs the evaluation by, for example, calculating and comparing evaluation points according to evaluation items of optimum evaluation condition information described later in detail.

  (2) The course unit optimizing unit 6 satisfies the transportation constraint condition information while evaluating the transportation baggage of the supplier B having the next largest number of supply times and the largest transportation baggage based on the optimum evaluation condition information. Assign to each of the supply times 1-3, 5, and 6.

  (3) The course unit optimizing unit 6 satisfies the transportation constraint condition information while evaluating the transportation baggage of the supplier C having the next largest number of supply times and the largest transportation baggage based on the optimum evaluation condition information. Assign to each supply time 1, 3, 5. At this time, the course unit optimizing unit 6 moves the transported luggage of each of the supply times 1, 3, 5 to the subsequent supply times 2, 4, 6 in order to equalize the number of transported luggage in each supply time. Do Zulashi. In addition, as the transport constraint condition, for example, the possible number of shifts is set to 1. In this case, the course unit optimizing unit 6 calculates the evaluation points before and after the shift and compares them. Then, the course unit optimization unit 6 determines, for example, the allocation after the shift with a small (good) evaluation score (the delivery of the supplier C is allocated to the supply times 2, 4, and 6).

  (4) The course unit optimizing unit 6 satisfies the transportation constraint condition information while evaluating the transportation luggage of the supplier D having the next largest number of supply times and the largest transportation luggage based on the optimum evaluation condition information. Assign to each supply time 1, 3, 5.

  (5) The course unit optimizing unit 6 satisfies the transportation constraint condition information while evaluating the transportation luggage of the supplier E having the next largest number of supply times and the largest transportation luggage based on the optimum evaluation condition information. Assign to each supply time 1,5.

  (6) The course unit optimizing unit 6 satisfies the transport constraint condition information while evaluating the transport luggage of the supplier F having the next largest number of supply times and the largest transport luggage based on the optimal evaluation condition information. Assign to each supply time 1,5. At this time, the course unit optimizing unit 6 performs a shift to move the transported luggage of the supply times 1 and 5 to the subsequent supply times 2 and 6 in order to level the transported luggage at each supply time. The course unit optimizing unit 6 calculates evaluation points before and after the shift, and determines the allocation after allocation with a small evaluation score (assignment to supply times 2 and 6).

  FIG. 3A is a flowchart showing a course unit optimization process performed by the course unit optimization unit described above. The course unit optimization unit 6 sorts the suppliers (A,..., F) in descending order of the number of times of supply and the transported luggage (step S101) (FIG. 3B). The course unit optimization unit 6 sets 0 (number of sets = 0) as the number of sets (step S102), and sets 0 (in charge No = 0) as the assigned number (step S103). Note that the person in charge No. 1 is a full-time transporter and the person in charge No. 2 is a transport supporter. The course unit optimization unit 6 repeatedly executes the processes from (L1) to (L2) shown in FIG. 3A by the number of suppliers.

  The course unit optimizing unit 6 increments the assigned No (ie assigned No + 1) (step S104). The course unit optimization unit repeatedly executes the processes from (M1) to (M2) shown in FIG. 3A until the charge of all the transported luggage is determined.

  The course unit optimizing unit 6 determines whether it is possible to move and allocate the transported baggage for each supply time to the designated charge No1 (step S105). The course unit optimizing unit 6 repeatedly executes the processing from (N1) to (N2) shown in FIG. 3A up to 0 to the maximum number of movements (the maximum value of the number of movements when the transported luggage is moved in each supply time).

  Here, the course unit optimizing unit 6 sets, as the transport constraint condition information in the transport constraint condition database 4, for example, the transport load of the same supplier in the same charge, and sets the maximum towed number (maximum transported load number) to 6. It is said.

  (1) For example, as shown in FIG. 3C, when the transported packages of supply times 1 and 5 are assigned to the responsible No. 1 as they are, the number of transported loads is 6 and the transport constraint condition is satisfied for supply time 1, while supply For round 5, the number of transported luggage is 7, which does not satisfy the transport constraint condition. In this case, the course unit optimizing unit 6 determines that the allocation of the transported luggage to the assigned No. 1 is impossible.

  (2) As shown in FIG. 3D, when the transported baggage is moved to the next supply times 2 and 6 and assigned to No. 1 in charge, the number of transported baggage is 7 and does not satisfy the transport constraint condition. Also for the supply time 6, the number of transported luggage is 7, which does not satisfy the transport restriction condition. Also in this case, the course unit optimizing unit 6 determines that the assignment of the transported luggage to the assigned No1 is impossible.

  (3) Therefore, as shown in FIG. 3E, the course unit optimizing unit 6 allocates the transported cargo of the supply times 1 and 5 to the assigned No. 2 as it is without moving it.

  When the course unit optimizing unit 6 determines that it is possible to allocate the transported baggage for each supply time to the assigned No. 1 (YES in step S105), the course unit optimizing unit 6 determines the assigned assignment and increments the set number (set number + 1). (Step S106). When the course unit optimizing unit 6 determines that it is impossible to allocate the transported baggage for each supply time to the assigned No. 1 (NO in step S105), the course unit optimizing unit 6 proceeds to the following processing (step S110).

  The course unit optimization unit 6 determines whether (the number of sets) is equal to (the number of executions of the course unit optimization process (optimization execution number)) (step S107). When the course unit optimization unit 6 determines that (the number of sets) is equal to (the number of optimization executions) (YES in step S107), the course unit optimization unit 6 executes an optimization process described later (step S108). On the other hand, when the course unit optimizing unit 6 determines that (the number of sets) and (the number of optimization executions) are not equal (NO in step S107), the course unit optimizing unit 6 proceeds to (step S110) described later.

  The course unit optimization unit 6 sets 0 (number of sets = 0) as the number of sets (step S109). The course unit optimizing unit 6 moves to (M2) when determining the allocation of the transported baggage for the assigned Nos. 1 and 2 to the current allocation (YES in step S110), and when not determining the current allocation (in step S110) NO), shift to (N2). Finally, the course unit optimization unit 6 executes the optimization process again (step S111).

  Next, the optimization process by the course unit optimization unit 6 described above will be described in detail. FIG. 4 is a flowchart showing an optimization processing flow by the course unit optimization unit. The course unit optimizing unit 6 determines whether or not the transport constraint conditions in the transport constraint condition database 4 are satisfied when the transported luggage of each supply time is moved (step S201).

  When the course unit optimizing unit 6 determines that the transport constraint condition of the transport constraint database 4 is satisfied (YES in Step S201), the transport unit of each supply time is moved to the subsequent supply time (Step S202). .

  The course unit optimizing unit 6 calculates an evaluation score regarding the allocation of the transported baggage at each supply time, and determines whether or not the evaluation score after the movement may be compared (small) with the evaluation score before the movement. (Step S203). The evaluation method using the evaluation points will be described later in detail.

  When the course unit optimizing unit 6 determines that the evaluation score after the movement is better than the evaluation score before the movement (YES in Step S203), the course unit optimization unit 6 stores the allocation of the transported luggage for each supply time after the movement (Step S204). ). On the other hand, when the course unit optimizing unit 6 determines that the evaluation score after the movement is worse than the evaluation score before the movement (NO in step S203), the course unit optimization unit 6 returns to the allocation of the transported baggage in each supply time before the movement (step S205). ).

  The course unit optimizing unit 6 repeatedly executes the above-described processing from (Step S201) to (Step S204) (processing from N1 to N2) from 0 to the maximum number of movements. In addition, the course unit optimization unit 6 performs the above-described processing from (Step S201) to (Step S205) (processing from M1 to M2 and L1 to L2). Repeatedly execute to each assigned charge No.

  As a result of repeating the above process, the course unit optimizing unit 6 has evaluated that the evaluation score after the movement is better than the evaluation score before the movement (YES in step S206). The transported luggage is allocated (step S207). On the other hand, if the course unit optimizing unit 6 does not evaluate that the evaluation score after movement is better than the evaluation score before movement (NO in step S206), the course unit optimization unit 6 ends this processing. The course unit optimizing unit 6 repeatedly executes the processing from the above (Step S201) to (Step S207) (the processing from W1 to W2) until the evaluation that the evaluation score is good is performed.

Next, the evaluation method using the evaluation points by the course unit optimization unit 6 will be described in detail.
The course unit optimization unit 6 includes a plurality of evaluation items (for example, the number of transported persons, the number of transported times, a work amount difference (difference between the maximum number of transported luggage and the minimum number of transported luggage in each supply time), a difference in the number of transporting carts, and a remainder of 0 Calculate the evaluation score for (total supply count-supply count using the total carrying capacity), remainder, number of movements (number of times the transported baggage was moved in each supply cycle), and compare the evaluation points to evaluate the evaluation. Do. Each evaluation item has a priority for performing the following evaluation. The evaluation items and the priority are configured so that the user can appropriately change them.

  For example, as shown in FIG. 5, the evaluation item “number of transporters” is set as the priority 1, and “small” is set for the dedicated transporter and the transport supporter. This means that when the transported luggage is moved at each supply time, the transport dedicated staff and the transport supporter move the transported luggage at each of the supply times so that the number of persons is minimized.

  Similarly, the evaluation item “number of times of transportation” is set as the priority 2, and “small” is set for the transportation specialist and the transportation supporter. This means that when the transported baggage is moved at each supply time, the transported baggage is moved at each of the above-mentioned supply times so that the number of transports by the transport specialist and the transport supporter is minimized.

  Here, regarding the evaluation items “number of transporters” and “number of transports”, it can be said that the transport efficiency is higher when the number of transporters and transport supporters is “less”. Therefore, as described above, the priority of the evaluation items “number of transporters” and “number of transports” is set to 1 and 2, respectively, and “small” is set to the transport specialist and transport supporter.

  In each supply time, one dedicated transporter can transport a maximum of six transported loads (transport constraint conditions) in one transport. In addition, the transport supporter transports the transported luggage that exceeds the transport restriction conditions (maximum 6 transported luggage) of the transport specialist at each supply time (FIG. 6).

  For example, in the supply time 1, a full-time transporter transports four transported luggage, and a transport supporter transports one transported luggage. In supply time 2, a full-time transporter transports six transported packages. On the other hand, the transport supporter transports one transported load. Here, the transport supporter's transported load is moved to the supply time 3. Thereby, although the transportation load of the transportation supporter in the supply time 3 increases to 3, the transportation supporter's transportation load in the supply time 2 becomes 0, and the number of transportation supporters' transportation can be reduced. As shown in FIG. 6, for example, in the supply times 1 to 4, the “number of transporters” is a total of two persons, one dedicated transporter and one transport supporter. In addition, the “number of times of transportation” is 6 times, that is, 4 times of the full-time transportation person and 2 times of the transportation supporter. As described above, the “number of transporters” and the “number of transports” are reduced by moving the transported baggage at each supply time.

  The evaluation items “Difference in work volume” and “Difference in the number of carriages” affect the transportation time. Therefore, it is necessary to level the number of packages to be transported in each supply cycle so that transport delays do not occur. Become. For example, regarding the “work load difference”, a two-digit value indicating “difference between the maximum number of transported luggage and the minimum number of transported luggage” and “cumulative sum of differences in the number of transported luggage for each successive supply” 3 Evaluation is performed with a 5-digit evaluation point including a numerical value of digits.

  For example, as shown in FIG. 7, in the case of (1), the number of transported luggage at each supply time is 1, 2, 3, 4 and the difference between the maximum number of transported luggage 4 and the minimum number of transported luggage 1 is 3 In addition, the total difference in the number of transported luggage for each successive supply time is 4. Therefore, the 5-digit evaluation score is 03004.

  On the other hand, in the case of (2), the number of transported luggage at each supply time is 2, 3, 2, and 3, and the difference between the maximum transported luggage number 3 and the minimum transported luggage number 2 is 1. In addition, the total difference in the number of transported luggage for each successive supply time is 4. Therefore, the 5-digit evaluation score is 01004. When the evaluation score 03004 in the case of (1) is compared with the evaluation score 01004 in the case of (2), since the numerical value in the case of (2) is smaller, the allocation of the transported luggage in the case of (2) is selected Is done.

  Note that the evaluation item “difference in the number of carriages” is also evaluated by calculating evaluation points in the same manner as the “difference in work load”. Further, the leveling of the transported baggage at each supply time and the leveling by evaluation of the evaluation points are performed only on the transported baggage of the full-time transporter.

The method for obtaining the evaluation item “remainder” will be described in detail. When the number of transporting carts at each supply time is less than half of the preset maximum number of transporting carts (the maximum value of the number of transporting carts that can be used), the number of carts at the supplying time is set as “remainder”.
If (number of carriages) <(maximum number of carriages) / 2, then "remainder" = number of trucks at the time of supply

On the other hand, when the number of transport carts at each supply time is 1/2 or more of the preset maximum transport cart constraint number, (maximum transport cart constraint number) − (transport cart number) is set as “remainder”.
When (number of carriages) ≥ (maximum number of carriages) / 2, "remainder" = (maximum carriage restrictions)-(number of carriages)
Finally, the “remainder” obtained for each supply is added.

  For example, in the case of (1) shown in FIG. 8, the number of transport carts at each supply time is 2, 3, 5, and 5, and (maximum transport cart constraint number) / 2 is 3. Accordingly, the “remainder” for each supply time is 2, 3, 1, 1, and the total of these “remainder” is 7. Here, among the supply times, the supply cart with a small number of transport carts is moved to eliminate such supply times. Further, the transported luggage is moved to the supply times in which the number of transport carts at each supply time is close to the maximum transport cart restriction number.

  For example, in the case of (2) (when the transported baggage of supply time 2 is moved to supply time 3), the number of transport carts at each supply time is 2, 2, 6, 5. Therefore, the “remainder” for each supply time is 2, 2, 0, 1 and the total “remainder” is 5.

Next, how to obtain the evaluation item “remainder 0” will be described in detail. The difference between the “remainder” obtained above and “the number of times of supply carrying the same number of transport carts as the maximum transport cart constraint number” is obtained, and this difference is set as “residue 0”.
"Remainder 0" = "Remainder"-(Number of times of supply transporting the same number of transport carts as the maximum number of transport carts)

  For example, in the case of (1) shown in FIG. 9, since there is no “supply time for transporting the same number of transport carts as the maximum transport cart constraint number”, “remainder 0” is 7−0 = 7. On the other hand, in the case of (2) shown in FIG. 9, since “the supply time for transporting the same number of transport carts as the maximum transport cart restriction number” is one, “remainder 0” is 5-1 = 4.

  Evaluation is performed using a 5-digit evaluation score including “remainder 0” and “remainder” obtained as described above. For example, in the case of (1), “remainder 0” is 4 and “remainder” is 7. Therefore, the 5-digit evaluation score in the case of (1) is 04007. In the case of (2), “remainder 0” is 4, and “remainder” is 5. Therefore, the 5-digit evaluation score in the case of (2) is 04005.

  When the evaluation score 04007 in the case of (1) is compared with the evaluation score 04005 in the case of (2), since the numerical value in the case of (2) is smaller, the allocation of the transport cart in the case of (2) Is selected. As described above, by reducing the numerical values of the evaluation items “remainder” and “remainder 0”, it is possible to clarify the peaks and troughs of the number of transport carts at each supply time and reduce the number of transport operations.

  Next, how to obtain the evaluation item “number of movements” will be described in detail. The “number of movements” is a total value of the number of times that the transported baggage is moved from the initial supply time to the subsequent supply times. It should be noted that the transported baggage can be moved only to the subsequent supply times on the time axis. When the transported baggage is moved to a later supply time, the arrival of parts in the assembly process is delayed, so it is preferable to reduce such movement.

  For example, in the case of (1) shown in FIG. 10, since the transported baggage is moved once in the next supply time, the “number of movements” is 1, and the evaluation score is 001. In the case of (2) shown in FIG. 10, since the transported baggage is moved twice in the next supply time, the “number of movements” is 2, and the evaluation score is 002. Since the evaluation score 001 in the case (1) is smaller than the evaluation score 002 in the case (2), the allocation of the transported luggage in the case (1) is selected.

  As shown in FIG. 5, the course unit optimization unit 6 compares the evaluation points for each evaluation item in a horizontal row as shown in FIG. Adopt that assignment. After performing the above course unit optimization process, the transport baggage is assigned to the transport supporter at each supply time of each transport course.

  When the supporter minimizing unit 7 allocates a work amount that cannot be transported by a full-time person for each transport course to the supporter, the transport constraint condition information in the transport constraint condition database 4 is set so that the number of transport supporters is minimized, Based on the optimum evaluation condition information in the optimization evaluation condition database 2, the assignment is selected while determining the quality of the choice of the delivery luggage allocation at each supply time.

  FIG. 11A is a flowchart showing a minimization process flow by the supporter minimizing unit according to the present embodiment. The supporter minimizing unit 7 acquires the target data of the transport supporter. For example, four transportation supporters are required for the four courses of the transportation courses G, E, C, and A (FIG. 11B (1)). Then, the supporter minimizing unit 7 sorts the suppliers in the descending order of the number of supply times and the transported luggage (step S301) (FIG. 11B (2)).

  Next, the supporter minimizing unit 7 assigns a transport supporter to each supplier as follows. In addition, each conveyance supporter shall carry on the same conveyance course in the same supply time.

  The supporter minimizing unit 7 repeatedly executes the processes (L1) to (L2) shown in FIG. 11A by 0 to the number of suppliers. The supporter minimizing unit 7 sets 0 to the supporter No (step S302). The supporter minimizing unit 7 repeatedly executes the processing from (M1) to (M2) shown in FIG. 11A until all the transported luggage in each supply time is set. The supporter minimizing unit 7 increments the supporter No (step S303).

  When the supporter minimizing unit 7 determines that the supporter No. is larger than the number of transported supporters (set number) already placed (YES in step S304), the supporter allocation is set for each current supply time. (Data set) (step S305) (FIG. 11B (3)). On the other hand, when the supporter minimizing unit 7 determines that the supporter number is equal to or less than the number of transport supporters already placed (NO in step S304), whether the transporter can be transported by the allocation of the transported baggage at each supply time. Is determined (step S306). The supporter minimizing unit 7 repeatedly executes the processes (N1) to (N2) shown in FIG. 11A for the maximum number of movements limited by the transportation constraint condition information.

  When the supporter minimizing unit 7 determines that transportation is possible by assigning the transported luggage at each supply time (YES in step S306), the supporter minimizing unit 7 sets the current allocation of the transported luggage at each supply time (data set) ( Step S307). On the other hand, when the supporter minimizing unit determines that transportation is impossible due to the allocation of the transport luggage at each supply time (NO in step S306), the supporter minimization unit moves the transport luggage at each supply time (step S308).

  As described above, in the transportation plan planning apparatus 1 according to the present embodiment, the transported luggage from each supplier is supplied to each supply time in descending order of the number of times and the supply amount of the transported luggage supplied from each supplier. In accordance with the transport constraint conditions, the items are allocated while leveling the number of transported packages at each supply time, and when performing leveling, the transported items at each supply time are moved to the subsequent supply times, and the evaluation items of the optimal evaluation condition information Based on the above, the allocation of the transported luggage at each supply time before and after the movement is evaluated. As a result, the leveling and optimization processes are executed each time for the transported packages delivered from each supplier. Therefore, since the transported luggage delivered from each supplier is not piled up once in each supply time as in the prior art, the transport plan planning time can be greatly shortened. That is, it is possible to efficiently formulate a transportation plan for transporting a transported article from a plurality of suppliers to a predetermined place and transporting a transported article to a supplier.

  Note that the present invention is not limited to the above-described embodiment, and can be changed as appropriate without departing from the spirit of the present invention.

  In addition, the present invention can be realized, for example, by causing the CPU to execute a computer program for the processes shown in FIGS. 3A, 4 and 11A.

  The program may be stored using various types of non-transitory computer readable media and supplied to a computer. Non-transitory computer readable media include various types of tangible storage media. Examples of non-transitory computer-readable media include magnetic recording media (for example, flexible disks, magnetic tapes, hard disk drives), magneto-optical recording media (for example, magneto-optical disks), CD-ROMs (Read Only Memory), CD-Rs, CD-R / W and semiconductor memory (for example, mask ROM, PROM (Programmable ROM), EPROM (Erasable PROM), flash ROM, RAM (random access memory)) are included.

  The program may also be supplied to the computer by various types of transitory computer readable media. Examples of transitory computer readable media include electrical signals, optical signals, and electromagnetic waves. The temporary computer-readable medium can supply the program to the computer via a wired communication path such as an electric wire and an optical fiber, or a wireless communication path.

1 Transportation Plan Planning Device 2 Optimization Evaluation Condition Database 3 Transportation Course Information Database 4 Transportation Constraint Condition Database 5 Work Volume Database 6 Course Unit Optimization Unit 7 Supporter Minimization Unit 8 Transportation Planning Database

Claims (10)

A transportation plan drafting device for carrying a transported material from a plurality of suppliers to a predetermined place and performing a plan for transporting the transported transported material from the predetermined location to a supplier every predetermined time,
First storage means for storing constraint condition information when transporting the transported article;
Second storage means for storing evaluation condition information when allocating the transported item to each supply time;
In order of increasing the number of times of supply and the supply amount of the transported goods supplied from the respective supply sources, the respective transport times from the respective supply sources are supplied to the respective supply times according to the constraint condition information of the first storage means. Optimization means for allocating while leveling the number of transported items,
The optimization means moves the transported goods of each supply time to a subsequent supply time when performing the leveling, and each supply time before and after the movement based on the evaluation condition information of the second storage means. A transportation planning device characterized by evaluating the allocation of transported goods. A transportation planning apparatus according to claim 1,
The said optimization means moves the conveyance thing of each said supply time to the subsequent supply time so that the frequency | count of supply to the said supply destination may be decreased, The conveyance plan planning apparatus characterized by the above-mentioned. A transportation planning apparatus according to claim 1 or 2,
The constraint condition information stored in the first storage means includes the amount of transportable material that can be transported at one time for each transport course to the supply destination, the maximum work amount including the travel time to the supply destination, and each supply A transportation plan planning device comprising at least one of a maximum number of movements that can move a transported object to a subsequent supply time. A transportation plan planning device according to any one of claims 1 to 3,
The evaluation condition information stored in the second storage means includes an evaluation item for performing the evaluation,
The optimization means calculates and compares the evaluation points regarding the evaluation items with respect to the allocation of the transported goods at each supply time before and after the movement, so that the transported goods at each supply time are transferred to the subsequent supply times. A transportation planning apparatus characterized by determining whether or not to move. A transportation planning apparatus according to claim 4,
The evaluation items of the evaluation condition information include the number of transporters who transport the transported goods at each supply time to the supply destination, the number of transports, the difference between the maximum number of transported goods and the minimum number of transported goods at each supply time, and each adjacent supply A transportation plan planning device comprising: at least one of a cumulative value of the difference in the number of transported objects and the number of times the transported objects are moved in each of the supply times. A transportation planning apparatus according to claim 4 or 5,
A priority is set for the evaluation item of the evaluation condition information, and the transportation plan planning apparatus according to claim 1. A transportation plan planning device according to any one of claims 1 to 6,
Minimizing allocation of transported items that cannot be transported by a dedicated transporter based on the constraint condition information stored in the first storage unit among transported products allocated by the optimization unit to the transport supporter Further comprising means,
The transportation plan planning apparatus, wherein the minimizing means assigns the transported items to each supply time so that the number of transport supporters is minimized. A transportation plan planning device according to claim 7,
The minimizing means moves the transported goods of each supply time to a subsequent supply time, and evaluates the allocation of the transported goods of each supply time before and after the movement based on the evaluation condition information of the second storage means. Then, the transportation plan drafting device is characterized in that the transportation is allocated to the transportation supporter by comparison. A transportation plan planning method for carrying a plan to transport a transported material from a plurality of suppliers to a predetermined location and transport the transported material from the predetermined location to a supplier every predetermined time,
Storing constraint information when transporting the transported article;
Storing evaluation condition information when allocating the transported item to each supply time;
In order of increasing the number of supplies and the supply amount of the transported goods supplied from each of the suppliers, the number of transported goods of each supply time is determined according to the constraint condition information for each supply from each supplier. A step of allocating while leveling;
When carrying out the leveling, moving the transported goods of each supply time to a subsequent supply time, and evaluating the allocation of the transported goods of each supply time before and after the movement based on the evaluation condition information; A transportation planning method characterized by including: A program for carrying a transported object from a plurality of suppliers to a predetermined place, and for transporting the transported object from the predetermined place to a supplier every predetermined time,
According to the constraint condition information when transporting the transported goods for each supply time, the transported goods from each of the supply sources in the descending order of the number of times and the supply amount of the transported goods supplied from each of the above supply sources. The process of allocating while leveling the number of conveyed items in the supply time,
When carrying out the leveling, the transported material of each supply time is moved to a subsequent supply time, and based on the evaluation condition information when assigning the transported material to each supply time, A program for causing a computer to execute processing for evaluating allocation of a transported item.

Images