KR102256385B1 - Apparatus and method of vessel scheduling for steel products - Google Patents

Abstract

The steel product wiring plan establishment apparatus according to an embodiment of the present invention includes a first algorithm unit for generating a first solution having an initial ship route for a pre-allocation order, and the initial ship of the first solution of the first algorithm unit. The wiring according to the target wiring satisfaction rate desired by the user by controlling the repetition of the generation of the ship path of the second algorithm unit, the first algorithm unit, and the second algorithm unit to generate a second solution with an improved ship path based on the path. A third algorithm unit that establishes a plan, and a fourth algorithm unit that determines a better solution among the first solution of the first algorithm unit and the second solution of the second algorithm unit according to the target wiring satisfaction rate. A method for establishing a steel product wiring plan according to another embodiment of the present invention includes a first algorithm step in which a first algorithm unit generates a first solution having an initial ship route for a pre-allocation order, and a second algorithm unit includes the first solution. A second algorithm step of generating a second solution having an improved ship path based on the initial ship path of the first solution of the algorithm unit, and a third algorithm unit of generating a ship path of the first algorithm unit and the second algorithm unit A third algorithm step of establishing a wiring plan according to the target wiring satisfaction rate desired by the user by controlling repetition, the fourth algorithm unit is the first solution of the first algorithm unit and the second solution of the second algorithm unit according to the target wiring satisfaction rate It may include a fourth algorithm step of determining the better solution.

Description

Steel product wiring plan establishment device and method {APPARATUS AND METHOD OF VESSEL SCHEDULING FOR STEEL PRODUCTS}

The present invention relates to a steel product wiring plan establishment apparatus and method for establishing a wiring plan for shipment and delivery of steel products having various constraints.

In general, in the steel industry, product wiring plans are manually established depending on the user's experience, so it is difficult to review product distribution costs and attempt to reduce them through systematic wiring plan establishment.

Conventionally, technology for establishing and optimizing the wiring plan existed, but it was intended for product transportation in a field other than the steel industry, and the transport characteristics of steel products were not considered, or the overall wiring plan was not attempted to be optimized. Or, there is a limit in that the core algorithm for optimizing the wiring plan cannot be specified.

Republic of Korea Patent Publication No. 10-2013-0082774 Republic of Korea Patent Publication No. 10-2016-0104909

According to an embodiment of the present invention, there is provided an apparatus and method for establishing a wiring plan for steel products capable of delivering at a minimum cost while satisfying the constraints imposed when a steel company ships and ships various types of products.

In order to solve the problems of the present invention described above, the steel product wiring plan establishment apparatus according to an embodiment of the present invention includes a first algorithm unit for generating a first solution having an initial ship route for a pre-allocation order, the first 1 Controls repetition of the generation of the ship path of the algorithm part, the second algorithm part, the first algorithm part, and the second algorithm part for generating a second solution with an improved ship path based on the initial ship path of the first solution Thus, a third algorithm unit that establishes a wiring plan according to the target wiring satisfaction rate desired by the user, and determines a better solution among the first solution of the first algorithm unit and the second solution of the second algorithm unit according to the target wiring satisfaction rate. It may include a fourth algorithm unit.

A method for establishing a steel product wiring plan according to another embodiment of the present invention includes a first algorithm step in which a first algorithm unit generates a first solution having an initial ship route for a pre-allocation order, and a second algorithm unit includes the first solution. A second algorithm step of generating a second solution having an improved ship path based on the initial ship path of the first solution of the algorithm unit, and a third algorithm unit of generating a ship path of the first algorithm unit and the second algorithm unit A third algorithm step of establishing a wiring plan according to the target wiring satisfaction rate desired by the user by controlling repetition, the fourth algorithm unit is the first solution of the first algorithm unit and the second solution of the second algorithm unit according to the target wiring satisfaction rate It may include a fourth algorithm step of determining the better solution.

According to an embodiment of the present invention, it is possible to solve the problem of allocating a large number of orders to a vessel in consideration of complex constraints and planning a schedule in a short time. In addition, there is an effect of reducing the total logistics cost and increasing the transport volume to reduce the logistics cost incurred relative to the transport volume.

1 is a schematic configuration diagram of an apparatus for establishing a wiring plan for a steel product according to an embodiment of the present invention.
2 is a schematic operation flowchart of a method for establishing a wiring plan for a steel product according to an embodiment of the present invention.
3 to 6 are schematic operation flowcharts of each algorithm unit and each algorithm step of the apparatus for establishing a wiring plan for a steel product according to an embodiment of the present invention shown in FIGS. 1 and 2.
7 is a diagram illustrating an exemplary computing environment in which one or more embodiments disclosed herein may be implemented.

Hereinafter, preferred embodiments will be described in detail with reference to the accompanying drawings so that those of ordinary skill in the art may easily implement the present invention.

The present invention relates to collection and delivery using a ship, and since there is a time for completion of preparation of an order and a deadline for arrival, this may be referred to as a kind of Pickup and Delivery Problem with Time windows (PDPTW). Similar to PDPTW, many ships ship steel products produced from up to two ports of loading and then return to up to two ports of destination to deliver the products.

However, in the present invention, there are various constraints in addition to the order completion time and the arrival period, which are general constraints of the PDPTW. Constraints will be described later for each vessel, port, and order.

First of all, in the case of ships, there is a list of available ships, and each ship enters the scheduled arrival site on the scheduled arrival date. Therefore, the vessel cannot be used before the scheduled arrival date. In addition, the ship cannot be operated if more than a certain amount of products cannot be loaded because there is a minimum amount of distribution on the ship, and even if more than a certain amount of products is not loaded, the operation is possible if more than a certain amount of products cannot be loaded, but additional costs are incurred. When a ship intends to visit a port, there are ports that cannot be visited due to the weight, length, or width of the ship. Therefore, the possibility of the ship's port visitation must also be taken into account when shipping the product for the order. Ships belong to each shipping company, but after final wiring plan is established, when the quota is calculated for each shipping company, it must be within a certain range.

Ports can be divided into a port of shipment in which the product is shipped and a port of destination in which the product is to be shipped. Each port has a minimum amount of distribution, and orders can be assigned to a ship only if the amount of loading at the port of loading or the amount of unloading at the port of destination is greater than the minimum amount of distribution for each ship. In addition, if you visit two or more ports of shipment or two or more destination ports, you incur a surcharge for discharging and discharging to the port. At this time, the surcharge incurred when visiting two or more ports of destination must not exceed a certain level.

Before explaining the constraints on the order, the items that make up the order are as follows.

(1) Port of shipment: The port where the product corresponding to the order is produced

(2) Port of destination: The port to which the product included in the order should be delivered

(3) Product type: It means the type of product included in the order, and one order has one product type.

(4) Department name: The name of the department that requested the order

(5) Shipment Quantity: The quantity of products the order wishes to ship

(6) Cargo Ready: The earliest date when the product requested by the order can be prepared at the port of shipment.

(7) Date of unloading request: The date or period during which the product included in the order can be unloaded at the destination port.

(8) Urgent Goods: Items that indicate whether the order should be allocated to the ship as possible due to urgent delivery.

(9) Whether it is possible to divide: The item on whether a given order can be divided into multiple ships and shipped.

(10) Whether trucking is possible: The item on whether the product corresponding to the order can be shipped from another port of loading by landing the product, rather than shipping it from the previously given port of shipment.

An order has a Cargo Ready date, which means the date the order is ready for shipment at the port of shipment. Therefore, orders cannot be shipped to the ship before Cargo Ready. However, it is possible to wait at the port of shipment before Cargo Ready. In addition, there is a request for unloading, which means the date or period during which the order can be unloaded at the destination port. The date of dismissal may be a specific date or period. Orders can only be unloaded within the date of the unloading request, and it is possible to arrive and wait at the destination port before the date of the unloading request.

The following constraints must be taken into account when shipping orders on board.

(1) Mandatory Conformity Order: A set of orders that must be shipped together on the same ship without multiple orders being divided.

(2) Non-partitionable order: An order that cannot be shipped because one order is split across multiple ships.

(3) Non-shipment order: An order that cannot be shipped to a specific ship depending on the characteristics of the order.

(4) Order that cannot be combined: An order that cannot be shipped on the same ship depending on the characteristics between the order and the order.

(5) Ship Designated Order: An order that must be shipped to a ship designated in advance

(6) Ship capacity limitation: The sum of orders shipped on the ship cannot exceed the capacity of the ship. In this case, it is not calculated according to the shipment volume of the order, but a conversion ratio that varies depending on the product type, destination, and ship, multiplied by the shipment volume. Calculate using

(7) Target wiring satisfaction rate: The actual shipped quantity compared to the requested quantity of the total order must satisfy a certain level or higher.

The wiring plan created by satisfying these constraints will search for an improved solution by comprehensively considering the total cost, the wiring satisfaction rate, and the transport burden rate for each ship by using a 2-opt algorithm.

Meanwhile, the ship/order selection criteria are as follows.

1. When the selected order is assigned to that ship, it carries more quantities than other ships.

2. When the selected order is assigned to that ship, it is carried at a lower unit cost than other ships.

3. When the selected order is assigned to that ship, the ship is on hold for less period than other ships.

Hereinafter, the present invention will be described in detail with reference to the drawings.

1 is a schematic configuration diagram of an apparatus for establishing a wiring plan for a steel product according to an embodiment of the present invention.

1, a steel product wiring plan establishment apparatus 100 according to an embodiment of the present invention includes a first algorithm unit 110, a second algorithm unit 120, a third algorithm unit 130, and a fourth algorithm. It may include an algorithm unit 140.

The first algorithm unit 110 may generate a first solution having an initial ship route for a pre-allocation order.

The second algorithm unit 120 may generate a second solution having an improved ship path based on the initial ship path of the first solution of the first algorithm unit 110.

The third algorithm unit 130 may control repetition of the generation of the ship route by the first algorithm unit 110 and the second algorithm unit 120 to establish a wiring plan according to a target wiring satisfaction rate desired by the user.

The fourth algorithm unit 140 may determine a better solution among the first solution of the first algorithm unit 110 and the second solution of the second algorithm unit 120 according to the target wiring satisfaction rate.

2 is a schematic operation flowchart of a method for establishing a wiring plan for a steel product according to an embodiment of the present invention.

Along with FIG. 1 and referring to FIG. 2, FIG. 2 shows a method for establishing a wiring plan for a steel product according to an embodiment of the present invention. A first algorithm step (S101 to S104) and a second algorithm step (S105, S106, S107) , A third algorithm step (S108. S109) and a fourth algorithm step (S110).

3 to 6 are schematic operation flowcharts of each algorithm unit and each algorithm step of the apparatus for establishing a wiring plan for a steel product according to an embodiment of the present invention shown in FIGS. 1 and 2.

Referring to FIG. 3 along with FIGS. 1 and 2, in the first algorithm step, the first algorithm unit 110 arranges pre-allocation orders in the order of the cargo ready date, and if the cargo ready date is the same, the delivery request date is In a faster order, if the same until the delivery request date, the order quantity can be sorted in the order of a large number (S11).

Next, the first algorithm unit 110 may preferentially allocate ship designation orders to the corresponding ship (S12).

Thereafter, the first algorithm unit 110 may perform the next process by sequentially selecting orders from the sorted order list (S13).

First, it is possible to allocate the order selected in order to the ships in the ship list in consideration of the following items set in advance (S14).

(1) Whether ships and orders cannot be shipped

(2) Whether the existing order shipped on the ship and the order to be allocated are not compatible

(3) Whether the vessel can enter the port of destination of the order to be allocated

(4) If the order to be allocated is non-partitionable, whether the ship's capacity is exceeded

(5) Considering the conversion ratio, calculate the shipping capacity of the order.

(6) All positions that can be allocated among the ship's existing routes are compared, and orders are allocated in the order of lowest cost.

Thereafter, the best ship among the ships to which the order has been assigned is selected (S15), and if the order cannot be assigned to any ship (S16), the operation can be repeated by moving to step S12.

If the order has been allocated to the ship, the order may be deducted from the existing order amount by the allocated amount (S17), and steps S13 to S17 may be repeated until the ship allocation is completed (S18).

Next, the ship, the port of loading, and the port of destination are inspected for violations of the minimum amount of wiring, and if violated, all orders for the relevant ship are de-allocated (S19), and then, by selecting a ship in order from the ship list (S20), the next step is performed. can do.

First, all the unallocated orders are assigned to the selected vessel, and the best order is selected (S21), and if all orders cannot be assigned to the vessel, the process moves to step S20 (S22), and all orders are assigned to the vessel. Subtract the amount of the ordered amount from the order amount (S23), it is possible to repeat the steps S20 to S23 until the allocation is completed (S24). Thereafter, the ship, the port of loading, and the port of destination are inspected for violations of the minimum amount of distribution, and if the violation is made, all orders of the relevant ship can be deallocated (S25).

Referring to FIG. 4 along with FIGS. 1 and 2, in the second algorithm step, similarly, the second algorithm unit 120 arranges the pre-allocation order in the order of the cargo ready date, and if the cargo ready date is the same, the dismissal request date In this faster order, if it is the same until the delivery request date, the order can be sorted in the order of the large number of orders (S31).

Thereafter, the second algorithm unit 120 may perform the next step by sequentially selecting orders from the sorted order list (S32).

First, the second algorithm unit 120 selects an order behind the selected order from the order list and changes the order of the two orders (S33), and uses the order list in the changed order from steps S12 to S25 of the above-described first algorithm step. The same steps may be performed (S34).

That is, the second algorithm unit 120 preferentially allocates ship-designated orders to the corresponding ship, and then selects orders in order from the sorted order list, and considers the following items set in advance to ship the ships in the ship list. You can assign the selected order to in turn.

(1) Whether ships and orders cannot be shipped

(2) Whether the existing order shipped on the ship and the order to be allocated are not compatible

(3) Whether the vessel can enter the port of destination of the order to be allocated

(4) If the order to be allocated is non-partitionable, whether the ship's capacity is exceeded

(5) Considering the conversion ratio, calculate the shipping capacity of the order.

(6) All positions that can be allocated among the ship's existing routes are compared, and orders are allocated in the order of lowest cost.

Next, the best ship among the ships to which the order has been allocated is selected, and if the order cannot be allocated to any ship, the ship-designated orders may be assigned preferentially to the corresponding ship, and the above-described operation may be repeated.

If an order has been allocated to a ship, the amount is deducted from the existing order amount by the allocated amount, and from the step of sequentially selecting the order from the order list arranged until the ship allocation is complete, if the order has been allocated to the ship, the allocated amount is the same. The step of subtracting from the order quantity can be repeated.

Next, the ship, the port of loading, and the port of destination are inspected for violations of the minimum amount of wiring, and if it is violated, all orders of the ship are deallocated, and the next step can be performed by selecting the ship in order from the ship list.

First, all the unallocated orders are assigned to the selected vessel, and the best order is selected. If all orders cannot be assigned to the vessel, the process moves to the step of selecting the vessel in turn from the vessel list, and when all orders are assigned to the vessel, It is possible to repeat the steps of subtracting the allocated amount from the order amount (S23), selecting the ships in order from the ship list until the allocation is completed, and subtracting the allocated amount from the order amount. Thereafter, the ship, the port of loading, and the port of destination are inspected for violations of the minimum capacity, and if violated, all orders of the ship can be deallocated.

Finally, the second algorithm unit 120 may compare the existing solution (first solution) and the newly obtained solution (second solution) to store a better solution as the existing solution (first solution) (S35).

Referring to FIG. 5 along with FIGS. 1 and 2, in the third algorithm step, the third algorithm unit 130 sets the initial target wiring satisfaction rate to a minimum wiring satisfaction rate designated by the user (S41),

Thereafter, after obtaining the initial solution (the first solution) by the operation of the first algorithm step of the first algorithm unit 110, the value obtained by adding the wiring satisfaction rate interval set by the user to the existing target wiring satisfaction rate is added to the new target wiring. Set as a satisfaction rate value (S42), and if this value is not greater than the maximum wiring satisfaction rate specified by the user (S43), the second algorithm step operation of the second algorithm unit 120 is executed (S44), and if it is greater, the target After setting the wiring satisfaction rate as the maximum wiring satisfaction rate, the operation of the second algorithm step of the second algorithm unit 120 may be executed (S45).

1 and 2, and referring to FIG. 6, in the fourth algorithm step, the fourth algorithm unit 140 calculates the wiring satisfaction rate of the existing solution (the first solution) and the improved solution (the second solution). Compared with the target wiring satisfaction rate (S51), if there is only one solution that exceeds the target wiring satisfaction rate among the two solutions (S52, S54), it is determined that the solution is a better solution (best solution) and terminated (S55). If both solutions do not satisfy the target wiring satisfaction rate (S52), the higher wiring satisfaction rate among the two solutions may be determined as the better solution (the best solution) and terminated (S53).

When both solutions exceed the target wiring satisfaction rate (S54), the following steps may be performed.

First, the shipping port, the port of destination, and the port and the year in which the number of ships violates the minimum number of ships are determined as the better year (best solution) and terminated (S57).If the number is the same, the next step can be moved. have.

Next, it is determined that the year in which the order for urgent goods and the order with the specified date of dismissal is processed more is a better year, and ends (S59 (and if the number is the same (S58)), and the user includes the total number of orders processed in the criteria. If the number is the same (S60), and the number is the same, but if the user does not include the total number of orders processed in the criteria, it is determined that the year with the more total number of orders processed is the better (best solution) and ends (S61). , If the number is the same, if the user selects the criterion for the judgment as cost (S62), the solution with the lower total cost of the two is S63), and if the criterion for the criterion is the wiring satisfaction rate, the solution with a higher wiring satisfaction rate ) As a good solution S64) and can be terminated.

7 is a diagram illustrating an exemplary computing environment in which one or more embodiments disclosed herein may be implemented.

Referring to FIG. 7, an illustration of a system 1000 including a computing device 1100 configured to implement one or more embodiments described above is shown. For example, the computing device 1100 may be a personal computer, a server computer, a handheld or laptop device, a mobile device (mobile phone, PDA, media player, etc.), a multiprocessor system, a consumer electronic device, a mini computer, a mainframe computer, Distributed computing environments including, but not limited to, any of the aforementioned systems or devices.

The computing device 1100 may include at least one processing unit 1110 and a memory 1120. Here, the processing unit 1110 may include, for example, a central processing unit (CPU), a graphic processing unit (GPU), a microprocessor, an application specific integrated circuit (ASIC), and Field Programmable Gate Arrays (FPGA). Can be, and can have a plurality of cores. The memory 1120 may be a volatile memory (eg, RAM, etc.), a nonvolatile memory (eg, ROM, flash memory, etc.), or a combination thereof.

Additionally, the computing device 1100 may include an additional storage 1130. Storage 1130 includes, but is not limited to, magnetic storage, optical storage, and the like. The storage 1130 may store computer-readable instructions for implementing one or more embodiments disclosed herein, and other computer-readable instructions for implementing an operating system, an application program, and the like. Computer-readable instructions stored in storage 1130 may be loaded into memory 1120 for execution by processing unit 1110.

Further, the computing device 1100 may include an input device(s) 1140 and an output device(s) 1150. Here, the input device(s) 1140 may include, for example, a keyboard, a mouse, a pen, a voice input device, a touch input device, an infrared camera, a video input device, or any other input device. Further, the output device(s) 1150 may include, for example, one or more displays, speakers, printers, or any other output device, and the like. Further, the computing device 1100 may use an input device or an output device provided in another computing device as the input device(s) 1140 or the output device(s) 1150.

Further, computing device 1100 may include communication connection(s) 1160 that enable communication with other devices (eg, computing device 1300) via network 1200. Here, the communication connection(s) 1160 is a modem, a network interface card (NIC), an integrated network interface, a radio frequency transmitter/receiver, an infrared port, a USB connection, or other computing device for connecting the computing device 1100 to another computing device. May include an interface. Further, the communication connection(s) 1160 may include a wired connection or a wireless connection.

Each component of the above-described computing device 1100 may be connected by various interconnections such as a bus (e.g., peripheral component interconnection (PCI), USB, firmware (IEEE 1394), optical bus structure, etc.). And may be interconnected by a network.

Terms such as “algorithm unit” and “algorithm step” as used herein generally refer to a computer-related entity that is hardware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. For example, both the controller and the application running on the controller may be components. One or more components may exist within a process and/or thread of execution, and a component may be localized on one computer or distributed between two or more computers.

As described above, in the present invention, in order to establish a wiring plan, the wiring satisfaction rate, the total cost, the transport burden rate for each shipping company, and the urgent order processing rate are used as objective formulas. The route is created using an algorithm that inserts the order into the smallest part of the defined cost expression after inserting the order at various locations on the ship where the order can be inserted. Repeat this method to allocate all orders to ships, but repeat the process of inserting until there are no more ships available, and one solution is derived. The solution derived in this way is defined as the first solution, and after that, the order of the ordered orders is changed using the 2-opt algorithm to obtain the solution again. If the objective expression value of the new solution is better than the existing solution, the new solution is replaced with the existing solution, and the process of obtaining a new solution and comparing it with the existing solution is repeated.

As described above, according to the present invention, it is possible to solve the problem of allocating a large number of orders to a ship in consideration of complex constraints and planning a schedule in a short time. In addition, it is possible to reduce the total logistics cost and increase the transport volume to reduce the logistics cost incurred compared to the transport volume.

The present invention described above is not limited by the above-described embodiments and the accompanying drawings, but is limited by the claims to be described later, and the configuration of the present invention is varied within the scope not departing from the technical spirit of the present invention. It can be easily understood by those of ordinary skill in the art that the present invention can be changed and modified.

100: steel product wiring planning device
110: first algorithm unit
120: second algorithm unit
130: third algorithm unit
140: fourth algorithm unit

Claims (28)

A first algorithm unit for generating a first solution having an initial ship route for the pre-allocation order;
A second algorithm unit for generating a second solution having an improved ship path based on the initial ship path of the first solution of the first algorithm unit;
A third algorithm unit configured to establish a wiring plan according to a target wiring satisfaction rate desired by a user by controlling repetition of the generation of the ship path of the first algorithm unit and the second algorithm unit; And
A fourth algorithm unit for determining a better solution among a first solution of the first algorithm unit and a second solution of the second algorithm unit according to the target wiring satisfaction rate,
The first algorithm unit sorts the pre-allocation orders in order according to at least one of a cargo ready date, a dismissal request date, and an order quantity, and sorts the pre-allocation orders in order of a cargo ready date, and If the date is the same, the delivery request date is arranged in the order of the earlier order, and if the delivery request date is the same, the order quantity is arranged in the order of the largest quantity. Steel product wiring plan establishment device for generating the first solution having the initial ship route by assigning the order selected in order to the ships in the ship list according to the item.
delete The method of claim 1,
The items set in advance include whether the ship and the order cannot be shipped, whether the existing order shipped on the ship and the order to be allocated cannot be matched, whether the ship can enter the port of destination of the order to be allocated, and the order to be allocated is non-partitionable. Steel products that include at least one of the ship's capacity excess and the conversion ratio, calculating the shipping capacity of the order, comparing all positions that can be allocated among the ship's existing routes, and assigning the order in the order of lowest cost. Wiring planning device.
The method of claim 3,
The first algorithm unit selects the best ship among the ships to which the order has been allocated, deducts from the existing order amount by the allocated order amount, selects a ship in order from the ship list, and allocates all unallocated orders to the selected ship, and the best Steel product wiring planning device that selects an order and subtracts the allocated order quantity from the existing order quantity.
The method of claim 4,
The first algorithm unit inspects the violation of the minimum amount of wiring for the vessel, the port of loading, and the destination port, and in the event of a violation, a steel product wiring plan establishment device that allocates all orders of the vessel.
The method of claim 1,
The second algorithm unit sorts the pre-allocation orders in order according to at least one of a cargo ready date, a dismissal request date, and an order quantity, and sequentially selects an order from the sorted order list, and from the order list rather than the selected order. The order of the two selected orders is changed by selecting the order of the lower order, and the order specified by the ship is assigned priority to the relevant ship by using the order list of the changed order, and the order in the ship list according to the items set in advance in the sorted order list. Steel product wiring plan establishment device for generating the second solution with the improved ship route by assigning the order selected in turn to the ship.
The method of claim 6,
The items set in advance include whether the ship and the order cannot be shipped, whether the existing order shipped on the ship and the order to be allocated cannot be matched, whether the ship can enter the port of destination of the order to be allocated, and the order to be allocated is non-partitionable. Steel products that include at least one of the ship's capacity excess and the conversion ratio, calculating the shipping capacity of the order, comparing all positions that can be allocated among the ship's existing routes, and assigning the order in the order of lowest cost. Wiring planning device.
The method of claim 7,
The second algorithm unit selects the best ship among the ships to which the order has been allocated, deducts from the existing order amount by the allocated order amount, selects ships in order from the ship list, and allocates all unallocated orders to the selected ship, and the best Steel product wiring planning device that selects an order and subtracts the allocated order quantity from the existing order quantity.
The method of claim 8,
The second algorithm unit inspects the violation of the minimum amount of wiring for the vessel, the port of loading, and the destination port, and in the event of a violation, a steel product wiring plan establishment device that allocates all orders of the vessel.
The method of claim 9,
The second algorithm unit compares the first solution and the second solution of the first algorithm unit and stores a better solution as the first solution of the first algorithm unit.
The method of claim 1,
The third algorithm unit sets the minimum wiring satisfaction rate specified by the user as an initial target wiring satisfaction rate value, and when the first solution is obtained from the first algorithm unit, the wiring satisfaction rate interval set by the user to the existing target wiring satisfaction rate. Is set as a new target wiring satisfaction rate value, and if it is less than the set new target wiring satisfaction rate value and the maximum wiring satisfaction rate specified by the user, the second algorithm unit is executed, and if it is above, the target wiring satisfaction rate is set to the maximum. A steel product wiring plan establishment device that executes the second algorithm unit after setting the wiring satisfaction rate.
The method of claim 1,
The fourth algorithm unit is a steel product wiring plan establishment device that determines a better solution according to a determination criterion set by a user.
The method of claim 12,
The fourth algorithm unit compares the wiring satisfaction rate of the first solution and the second solution with a target wiring satisfaction rate,
If there is one solution in the two seas that exceeds the target wiring satisfaction rate, the corresponding solution is judged as a better solution,
If both solutions are less than the target wiring satisfaction rate, the solution having the higher wiring satisfaction rate among the two is judged as a better solution,
If both years exceed the target wiring satisfaction rate, a steel product wiring plan establishment device that judges as a better solution a year with a smaller number of ports and ships that violate the minimum wiring quantity of the loading port, destination port, and ship.
The method of claim 13,
The determination criterion set by the user is a steel product wiring plan establishment apparatus including at least one of the number of processing orders for urgent goods and orders for which the delivery date is specified, the total number of orders processed, cost and wiring satisfaction rate.
A first algorithm step of generating, by a first algorithm unit, a first solution having an initial ship path for a pre-allocation order;
A second algorithm step of generating, by a second algorithm unit, a second solution having an improved ship path based on the initial ship path of the first solution by the first algorithm unit;
A third algorithm step of establishing a wiring plan according to a target wiring satisfaction rate desired by a user by controlling the repetition of the generation of the ship route by the first algorithm unit and the second algorithm unit by a third algorithm unit; And
A fourth algorithm step of determining a better solution among a first solution of the first algorithm unit and a second solution of the second algorithm unit according to the target wiring satisfaction rate,
The first algorithm step
Sorting, by the first algorithm unit, the pre-allocation order according to at least one of a cargo ready date, a dismissal request date, and an order quantity;
Preferentially allocating ship designation orders to a corresponding ship among the pre-allocation orders; And
And generating the first solution having the initial ship route by assigning the orders sequentially selected to ships in the ship list according to the items set in advance in the sorted order list,
The aligning step
A steel product wiring plan in which the first algorithm arranges the pre-allocation orders in the order of the cargo ready date in the order of the fastest, and if the cargo ready date is the same, the delivery request date is in the earlier order, and if the same until the delivery request date, the order quantity is arranged. How to establish.
delete The method of claim 15,
The items set in advance include whether the ship and the order cannot be shipped, whether the existing order shipped on the ship and the order to be allocated cannot be matched, whether the ship can enter the port of destination of the order to be allocated, and the order to be allocated is non-partitionable. Steel products that include at least one of the ship's capacity excess and the conversion ratio, calculating the shipping capacity of the order, comparing all positions that can be allocated among the ship's existing routes, and assigning the order in the order of lowest cost. How to make a wiring plan.
The method of claim 17,
Allocating the selected order to generate the first solution having the initial ship route
Allocating an order selected in sequence to a ship in a ship list according to a preset item by the first algorithm unit;
Selecting the best ship among ships to which the order has been allocated;
If the order cannot be assigned to any ship, prioritizing the ship designation orders to the corresponding ship;
Subtracting from the existing order amount by the allocated order amount;
Repeating the step of generating the first solution with the initial ship route by assigning the selected order;
Inspecting the vessel, the port of loading, and the port of destination for violations of the minimum capacity, and in the event of a violation, releasing the allocation of all orders of the vessel;
Selecting a vessel in order from the vessel list and allocating all unallocated orders to the selected vessel to select the best order; And
After repeating the step of selecting the best order, inspecting for violations of the minimum volume for the vessel, the port of loading, and the port of destination, and in the event of a violation, disassigning all orders of the relevant vessel.
Steel product wiring plan establishment method comprising a.
delete The method of claim 15,
The second algorithm step
Arranging, by the second algorithm unit, the pre-allocation order according to at least one of a cargo ready date, a dismissal request date, and an order quantity;
Generating the second solution by selecting orders in order from the sorted order list; And
Comparing the first solution and the second solution by the first algorithm unit and storing a better solution as the first solution
Steel product wiring plan establishment method comprising a.
The method of claim 20,
Generating the second solution comprises:
Changing the order of the two selected orders by selecting, by the second algorithm unit, an order sequentially from the sorted order list, selecting an order of a lower order from the order list than the selected order;
Assigning, by the second algorithm unit, sequentially selected orders to ships in the ship list according to a preset item by using the order list in the changed order;
Selecting the best ship among ships to which the order has been allocated;
If the order cannot be assigned to any ship, moving to the step of preferentially allocating the ship designation orders to the corresponding ship;
Subtracting from the existing order amount by the allocated order amount;
Repeating the step of generating the first solution with the initial ship route by assigning the selected order;
Inspecting the vessel, the port of loading, and the port of destination for violations of the minimum capacity, and in the event of a violation, releasing the allocation of all orders of the vessel;
Selecting a ship in order from the ship list and allocating all unallocated orders to the selected ship to select the best order; And
After repeating the step of selecting the best order, inspecting for violations of the minimum volume for the vessel, the port of loading, and the destination port, and in the event of a violation, disassigning all orders of the vessel.
Steel product wiring plan establishment method comprising a.
The method of claim 20,
The aligning step
Steel product wiring plan in which the second algorithm arranges the pre-allocation orders in the order of the cargo ready date in the order of the earliest order, and if the cargo ready date is the same, the delivery request date is in the earlier order, and if the same until the delivery request date, the order quantity is arranged. How to establish.
The method of claim 21,
The items set in advance include whether the ship and the order cannot be shipped, whether the existing order shipped on the ship and the order to be allocated cannot be matched, whether the ship can enter the port of destination of the order to be allocated, and the order to be allocated is non-partitionable. Steel products that include at least one of the ship's capacity excess and the conversion ratio, calculating the shipping capacity of the order, comparing all positions that can be allocated among the ship's existing routes, and assigning the order in the order of lowest cost. How to make a wiring plan.
The method of claim 15,
The third algorithm step
Setting, by the third algorithm unit, a minimum wiring satisfaction rate designated by a user as an initial target wiring satisfaction rate value;
When the first solution is obtained from the first algorithm unit, a value obtained by adding the wiring satisfaction rate interval set by the user to the existing target wiring satisfaction rate is set as a new target wiring satisfaction rate value, and the set new target wiring satisfaction rate value and If it is less than or equal to the maximum wiring satisfaction rate specified by the user, executing the second algorithm unit, and if it is above, setting the target wiring satisfaction rate to the maximum wiring satisfaction rate and then executing the second algorithm unit
Steel product wiring plan establishment method comprising a.
The method of claim 15,
The fourth algorithm step
A method of establishing a steel product wiring plan in which the fourth algorithm unit determines a better solution according to a determination criterion set by a user.
The method of claim 25,
The fourth algorithm step
Comparing, by the fourth algorithm unit, a wiring satisfaction rate of the first solution and the second solution with a target wiring satisfaction rate; And
The step of judging a year with fewer ships and ports that violate the minimum wiring quantity of the loading port, destination port, and ship as a better year.
Steel product wiring plan establishment method comprising a.
The method of claim 26,
Comparing with the target wiring satisfaction rate
If one of the two seas exceeds the target wiring satisfaction rate, determining the solution as a better solution and terminating;
If both solutions are less than the target wiring satisfaction rate, determining a solution having a higher wiring satisfaction rate among the two as a better solution and terminating; And
If both solutions exceed the target wiring satisfaction rate, determining a solution having a smaller number of ports and ships as a better solution
Steel product wiring plan establishment method comprising a.
The method of claim 25,
The determination criterion set by the user is a method of establishing a steel product wiring plan including at least one of the number of processing orders for urgent goods and orders for which the delivery date is specified, the total number of orders processed, cost, and a wiring satisfaction rate.

Images