JP5005194B2 - Transport vehicle operation plan creation method - Google Patents
Transport vehicle operation plan creation method Download PDFInfo
- Publication number
- JP5005194B2 JP5005194B2 JP2005196505A JP2005196505A JP5005194B2 JP 5005194 B2 JP5005194 B2 JP 5005194B2 JP 2005196505 A JP2005196505 A JP 2005196505A JP 2005196505 A JP2005196505 A JP 2005196505A JP 5005194 B2 JP5005194 B2 JP 5005194B2
- Authority
- JP
- Japan
- Prior art keywords
- transport
- time
- factory
- transport vehicle
- intermediate process
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims description 131
- 239000002994 raw material Substances 0.000 claims description 106
- 238000004364 calculation method Methods 0.000 claims description 23
- 238000005457 optimization Methods 0.000 claims description 13
- 238000004088 simulation Methods 0.000 claims description 13
- 238000004519 manufacturing process Methods 0.000 claims description 11
- 239000000463 material Substances 0.000 claims description 6
- 238000002360 preparation method Methods 0.000 claims description 2
- 230000006870 function Effects 0.000 description 14
- 238000009826 distribution Methods 0.000 description 9
- 230000014509 gene expression Effects 0.000 description 9
- 230000007704 transition Effects 0.000 description 8
- 238000003860 storage Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 2
- 238000010304 firing Methods 0.000 description 2
- 238000012824 chemical production Methods 0.000 description 1
- 239000004615 ingredient Substances 0.000 description 1
- 235000014214 soft drink Nutrition 0.000 description 1
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
Landscapes
- General Factory Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Description
本発明は、輸送車による原料最適搬送のための輸送車の運行計画作成方法に係り、原料を製造する複数の工場Aと当該原料を用いる複数の工場Bとが存在し、各工場Aで製造された原料を複数台の輸送車が積載し、各工場Bへ輸送するプロセスにおいて、各輸送車が向かう搬送先工場Bを決定するために用いて好適な技術である。 The present invention relates to a transport vehicle operation plan creation method for optimal transport of raw materials by transport vehicles, and there are a plurality of factories A that manufacture raw materials and a plurality of factories B that use the raw materials. This is a technique suitable for use in determining a transport destination factory B to which each transport vehicle is directed in a process in which a plurality of transport vehicles are loaded and transported to each factory B.
石油製造・ガス製造・薬品製造・清涼飲料製造等、様々な業種の製造プロセスにおいて、図3に示すように、原料を製造する複数の工場7(以下、工場Aと呼ぶ)と、当該原料を用いる複数の工場8(以下、工場Bと呼ぶ)が存在し、各工場Aで製造された原料を複数台の輸送車4が積載し、各工場Bへ輸送する場合が多く見られる。原料を工場Aから工場Bまで搬送するために、道路上を走るタンクローリーや軌道上を走る貨車が用いられることが多い。輸送車4が工場Bに到着すると、原料混合工程で反応容器5に原料が注がれる。反応容器内の原料はその後、目標成分に合わせるため成分調整等が行われ、製品として出荷される。各工場Aでは異なるの原料を製造する場合でも良く、また、各工場Bが異なる製品を製造する場合でも構わない。
In manufacturing processes of various industries such as oil production, gas production, chemical production, soft drink production, etc., as shown in FIG. 3, a plurality of factories 7 (hereinafter referred to as factory A) that produce raw materials, In many cases, there are a plurality of factories 8 (hereinafter referred to as factories B) to be used, and a plurality of
工場Bでは原料が到着しないと製品を製造することができないため、原料不足を生じさせないよう、複数の工場Aから複数の工場Bに適切に原料を供給する必要がある。この際、工場Bが複数あり、各々の距離が離れている場合には、輸送車の搬送先である工場Bを適切に指定しないと、ある工場Bには原料が余り、他の工場Bには原料が不足するという問題が生じ、製品の製造機会を逸することになってしまう。 Since the product cannot be manufactured if the raw material does not arrive at the factory B, it is necessary to appropriately supply the raw material from the plurality of factories A to the plurality of factories B so as not to cause a shortage of the raw material. At this time, if there are a plurality of factories B and the distances between the factories are different, if a factory B that is a transport destination of the transport vehicle is not properly specified, there is a surplus of raw materials in one factory B, and other factories B Causes a problem of shortage of raw materials, and misses the opportunity to manufacture products.
また、工場Aで製造される原料の成分は、一定しておらず、かなり変動が激しいこともある。この場合、特許文献1に開示されているように、無作為に原料を混合してしまうと、反応容器の成分調整量が多くなってしまうため、輸送車の原料成分と反応容器の目標成分に応じて適切に混合しなければならない。
In addition, the ingredients of the raw material produced at the factory A are not constant and may vary considerably. In this case, as disclosed in
従って、工場Bでの原料不足を生じさせることなく、かつ、反応容器の成分調整量を極力少なくするよう各輸送車の搬送先を適切に決定することが重要である。それに加え、反応容器の成分調整機の能力制約から、反応容器の成分調整前の混合原料に関する成分や温度に制約が存在する場合もあり、それらも満足するよう輸送車の搬送先を決めるのは大変難しい問題であった。 Accordingly, it is important to appropriately determine the transport destination of each transport vehicle so as not to cause a shortage of raw materials in the factory B and to reduce the component adjustment amount of the reaction vessel as much as possible. In addition, due to the capacity restrictions of the reaction vessel component adjuster, there may be restrictions on the components and temperature related to the mixed raw material before adjusting the reaction vessel components. It was a very difficult problem.
この問題に関連して、特許文献1では、混合整数計画問題として取り扱って、各輸送車の各反応容器への注ぎ量の制約や、各反応容器の成分調整量の制約等を線形の等式と不等式で表し、反応容器内原料の成分調整量の総和と輸送車内原料の成分調整量の総和と輸送車運行コストの総和を目的関数とする最適化問題を解き、各輸送車の各反応容器への原料最適注ぎ量、各輸送車内での最適成分調整量を求める手法を提案している。
In relation to this problem,
しかしながら、この手法では工場Aから工場Bまでの搬送プロセス全体の物流現象を線形等不等式で表す必要があり、解くべき変数や制約式の数が大規模になってしまう問題がある。 However, with this method, it is necessary to represent the distribution phenomenon of the entire transport process from the factory A to the factory B by linear inequality, and there is a problem that the number of variables and constraint expressions to be solved becomes large.
しかも、本問題の場合、輸送車の搬送先を決定する必要があり、この変数は整数でなければならない。例えば、輸送車kの搬送先を表す変数をskjとし、第一工場Bに搬送する際にsk1を1、第二工場Bに搬送する際にsk2を1と定義すると、skjは0又は1という整数解が得られなければならず、skjが0.8という実数解であってはならない。このような整数解を求めなければならない最適化問題の計算時間は、整数変数の数の指数乗に比例することが知られている。本問題の場合、搬送プロセス全体の定式化まで行うと、前記skjのような整数変数が多数現れ(例えば、中間工程での輸送車入車順番等が整数変数となる)、実用的な時間で解が得られなくなってしまう。
Moreover, in the case of this problem, it is necessary to determine the transport destination of the transport vehicle, and this variable must be an integer. For example, a variable representing the transport destination of the transporter k and s kj, the
そこで、本発明は、輸送車の適切な搬送先を可及的高速・短時間に計算し、輸送車の輸送計画を作成する方法を提供することを目的とする。 Accordingly, an object of the present invention is to provide a method for calculating a transport destination of a transport vehicle by calculating an appropriate transport destination of the transport vehicle as quickly and as quickly as possible.
課題を解決するための手段として、本発明の輸送車の運行計画作成方法は、原料を製造する複数の工場Aから、複数の工場B内に配設された各反応容器へ、前記原料を複数の輸送車で輸送するプロセスであって、当該複数の工場Aから当該複数の工場Bへの輸送経路の途中に、当該輸送車が入出車する複数の中間工程が存在して、当該輸送車の全てが、当該中間工程のうちの1つの中間工程に入出車するプロセスにおける前記複数の輸送車の運行計画作成方法であって、計画開始時刻における、各輸送車の工場A出発時刻と原料積載量の実績値と計画値、並びに、各輸送車の中間工程通過時刻と工場B到着時刻の実績値を入力するステップと、搬送先が確定していない全ての輸送車に対して、積載している原料を輸送可能な全ての工場Bの到着時刻と、搬送先が確定している全ての輸送車に対して、搬送先の工場Bの到着時刻を、前記輸送車が前記中間工程に入車する前には、前記輸送車の前記工場Aの出発時刻の実績値もしくは計画値と、前記工場Aから前記中間工程までの移動時間と、前記中間工程の処理時間と、前記中間工程から前記工場Bまでの移動時間とから、また、前記輸送車が前記中間工程に入車中には、前記輸送車の前記中間工程の入車時刻の実績値と、前記中間工程の処理時間と、前記中間工程から前記工場Bまでの移動時間とから、さらに、前記輸送車が前記中間工程を出車後には、前記輸送車の前記中間工程の出車時刻の実績値と、前記中間工程から前記工場Bまでの移動時間とから、予測するステップと、前記工場Bの到着時刻、及び各反応容器の要求原料量と要求時刻の計画値を入力とし、各反応容器が各輸送車から注がれる原料量の総和は、当該各反応容器の要求原料量以下とする第1の制約と、各輸送車が各反応容器へ注ぐ原料量の総和は、当該各輸送車の積載している原料量以下とする第2の制約と、搬送先への各輸送車の到着時刻が、当該輸送車から注がれる反応容器の要求時刻に間に合わない場合は、当該輸送車から当該反応容器に原料を注ぐことは不可であるという第3の制約と、各輸送車の搬送先は複数の工場Bのうちの1個所のみであるという第4の制約を満足する前記輸送車の搬送先の中から、各搬送先に向かう輸送車の原料積載量を平準化する目的関数であって、前記各輸送車から前記各反応容器へ注がれる原料量に、当該輸送車が工場Bに到着してから当該反応容器の要求時刻まで待機する時間に応じて設定された調整係数を乗じた原料量の総和である目的関数が最小となるものを、混合整数計画法による最適化計算を行って求めることにより、各輸送車の搬送先を求めるステップと、搬送先が確定していない輸送車の中で、前記運行計画開始時刻から予め設定された時間後までに、工場Aを出発する輸送車の搬送先を、前記最適化計算で求めた搬送先に確定するステップと、前記工場Aから前記中間工程を経て前記工場Bまでの輸送プロセスの物流現象として、中間工程到着時刻、中間工程入車時刻、中間工程出車時刻、及び工場B到着時刻をモデル化した物流シミュレータにて、計画開始時刻から予め設定された時間後までのシミュレーションを行い、前記輸送計画開始時刻において、工場Bに到着していない全ての輸送車に対して、前記予め設定された時間後の各輸送車の中間工程通過時刻と工場B到着時刻を予測するステップとを有し、前記予め設定された時間後の時刻を新たに計画開始時刻として、前記入力するステップ以外の全てのステップを全ての輸送車の搬送先が確定するまで繰り返すことにより、複数の輸送車の搬送先を決定することを特徴としている。
また、反応容器において原料成分の調整を行う場合には、原料を製造する複数の工場Aから、複数の工場B内に配設された各反応容器へ、前記原料を複数の輸送車で輸送後、反応容器において原料成分の調整を行うプロセスであって、当該複数の工場Aから当該複数の工場Bへの輸送経路の途中に、当該輸送車が入出車する複数の中間工程が存在して、当該輸送車の全てが、当該中間工程のうちの1つの中間工程に入出車する前記複数の輸送車の運行計画作成方法であって、計画開始時刻における、各輸送車の工場A出発時刻、原料積載量、及び原料成分の実績値と計画値、並びに、各輸送車の中間工程通過時刻と工場B到着時刻の実績値を入力するステップと、搬送先が確定していない全ての輸送車に対して、積載している原料を輸送可能な全ての工場Bの到着時刻、並びに、搬送先が確定している全ての輸送車に対して、搬送先の工場Bの到着時刻を、前記輸送車が前記中間工程に入車する前には、前記輸送車の前記工場Aの出発時刻の実績値もしくは計画値と、前記工場Aから前記中間工程までの移動時間と、前記中間工程の処理時間と、前記中間工程から前記工場Bまでの移動時間とから、また、前記輸送車が前記中間工程に入車中には、前記輸送車の前記中間工程の入車時刻の実績値と、前記中間工程の処理時間と、前記中間工程から前記工場Bまでの移動時間とから、さらに、前記輸送車が前記中間工程を出車後には、前記輸送車の前記中間工程の出車時刻の実績値と、前記中間工程から前記工場Bまでの移動時間とから、予測するステップと、前記工場Bの到着時刻、並びに各反応容器の要求原料量、要求時刻、及び成分調整後の目標成分の計画値を入力とし、各反応容器が各輸送車から注がれる原料量の総和は、当該各反応容器の要求原料量以下とする第1の制約と、各輸送車が各反応容器へ注ぐ原料量の総和は、当該各輸送車の積載している原料量以下とする第2の制約と、搬送先への各輸送車の到着時刻が、当該輸送車から注がれる反応容器の要求時刻に間に合わない場合は、当該輸送車から当該反応容器に原料を注ぐことは不可であるという第3の制約と、各輸送車の搬送先は複数の工場Bのうちの1個所のみであるという第4の制約を満足する前記輸送車の搬送先の中から、各搬送先に向かう輸送車の原料積載量を平準化すると同時に、各反応容器の成分調整量の最小化する目的関数であって、前記各輸送車から前記各反応容器へ注がれる原料量に、当該輸送車が工場Bに到着してから当該反応容器の要求時刻まで待機する時間に応じて設定された調整係数を乗じた原料量の総和、及び、各輸送車の原料成分の実績値もしくは計画値と、各輸送車から各反応容器に注がれる原料量とから計算される各反応容器の原料成分と、各反応容器の目標成分との差から計算される各反応容器の成分調整量の全ての反応容器に対する総和、の重み調整係数付きの和である目的関数が最小となるものを、混合整数計画法による最適化計算を行って求めることにより、各輸送車の搬送先を求めるステップと、搬送先が確定していない輸送車の中で、前記運行計画開始時刻から予め設定された時間後までに、工場Aを出発する輸送車の搬送先を、前記最適化計算で求めた搬送先に確定するステップと、前記工場Aから前記中間工程を経て前記工場Bまでの輸送プロセスの物流現象として、中間工程到着時刻、中間工程入車時刻、中間工程出車時刻、及び工場B到着時刻をモデル化した物流シミュレータにて、計画開始時刻から予め設定された時間後までのシミュレーションを行い、前記輸送計画開始時刻において、工場Bに到着していない全ての輸送車に対して、前記予め設定された時間後の各輸送車の中間工程通過時刻と工場B到着時刻を予測するステップとを有し、前記予め設定された時間後の時刻を新たに計画開始時刻として、前記入力するステップ以外の全てのステップを全ての輸送車の搬送先が確定するまで繰り返すことにより、複数の輸送車の搬送先を決定しても良い。
さらに、前記制約に加え、各反応容器の原料成分と要求成分についての第5の制約を追加し、輸送車の搬送先を決定しても良い。
As a means for solving the problem, the transport vehicle operation plan creation method of the present invention includes a plurality of the raw materials from a plurality of factories A that manufacture the raw materials to each reaction vessel disposed in the plurality of factories B. of a process of transporting transport vehicles, in the course from the plurality of plants a transport paths to the plurality of plants B, and multiple intermediate steps the transportation vehicle you input and vehicle are present, the transport A method for preparing an operation plan for the plurality of transport vehicles in a process in which all of the vehicles enter and leave one intermediate process of the intermediate processes, and the factory A departure time and raw material of each transport vehicle at the plan start time The step of inputting the actual value and the planned value of the load capacity, the actual value of the intermediate process passing time and the factory B arrival time of each transport vehicle, and the loading for all transport vehicles whose transport destinations are not fixed. To all factories B that can transport raw materials And time, for all the transport vehicles transport destination is determined, the arrival time of the transport destination factory B, and before the transporter is Nyukuruma the intermediate step, the factory A of the transporter From the actual value or the planned value of the departure time, the travel time from the factory A to the intermediate process, the processing time of the intermediate process, and the travel time from the intermediate process to the factory B, and the transportation While the car enters the intermediate process, from the actual value of the entry time of the intermediate process of the transport vehicle, the processing time of the intermediate process, and the travel time from the intermediate process to the factory B, Further, after the transport vehicle leaves the intermediate process, predicting from the actual value of the departure time of the intermediate process of the transport vehicle and the travel time from the intermediate process to the factory B ; Arrival time of the factory B and request source of each reaction vessel The total amount of raw material poured into each reaction vessel from each transport vehicle is input with the planned amount of the amount and the required time, and the first constraint that the total amount of raw materials poured from each transport vessel is less than or equal to the required raw material amount of each reaction vessel, The total amount of raw materials poured into the reaction vessel is the second constraint that the amount of raw materials loaded in each transport vehicle is equal to or less than that of the transport vehicles, and the arrival time of each transport vehicle at the transport destination. If the required time of the container is not met, the third restriction that it is impossible to pour the raw material from the transport vehicle into the reaction container, and the transport destination of each transport vehicle is only one of the factories B An objective function for leveling the material loading amount of the transport vehicle toward each transport destination from among the transport destinations of the transport vehicle that satisfies the fourth constraint, The amount of raw material that is poured into the reactor vessel is important after the transport vehicle arrives at Factory B. Each transport vehicle is obtained by performing optimization calculation by mixed integer programming to obtain the minimum objective function, which is the sum of the amount of raw materials multiplied by the adjustment coefficient set according to the waiting time until the time required The transport destination of the transport vehicle that leaves the factory A within a predetermined time from the start time of the operation plan among the transport vehicles for which the transport destination has not been determined. The step of determining the transfer destination obtained by the calculation and the logistics phenomenon of the transportation process from the factory A to the factory B through the intermediate process, intermediate process arrival time, intermediate process entry time, intermediate process departure time , And a logistics simulator that models factory B arrival time, a simulation is performed from the planned start time to a preset time later, and the factory arrives at factory B at the transport plan start time. A step of predicting the intermediate process passing time and factory B arrival time of each transport vehicle after the preset time, and newly setting the time after the preset time. In addition, as the planned start time, all the steps other than the input step are repeated until the transport destinations of all transport vehicles are determined, thereby determining the transport destinations of a plurality of transport vehicles.
In addition, when adjusting the raw material components in the reaction vessel, after the raw material is transported by a plurality of transport vehicles from a plurality of factories A that manufacture the raw material to each reaction vessel disposed in the plurality of factories B. , a process of adjusting the raw material components in the reaction vessel, in the middle of the plurality of plants a transport paths to the plurality of plants B, multiple intermediate steps the transportation vehicle you input and vehicle are present The transportation plan preparation method for the plurality of transportation vehicles in which all of the transportation vehicles enter and leave one intermediate step of the intermediate steps, and the departure time of the factory A of each transportation vehicle at the planning start time. , Step of inputting raw material loading amount, actual value and planned value of raw material component, and actual value of intermediate process passing time and factory B arrival time of each transport vehicle, and all transport vehicles whose transport destinations are not fixed Can transport loaded materials Arrival time of all plants B, as well, for all the transport vehicles transport destination is determined, the arrival time of the transport destination factory B, and before the transporter is Nyukuruma the intermediate step, Actual value or planned value of departure time of the factory A of the transport vehicle, travel time from the factory A to the intermediate process, processing time of the intermediate process, and travel time from the intermediate process to the factory B In addition, while the transport vehicle enters the intermediate process, the actual value of the transit time of the intermediate process of the transport vehicle, the processing time of the intermediate process, and the factory B from the intermediate process Further, after the transport vehicle leaves the intermediate process, the actual value of the departure time of the intermediate process of the transport vehicle, the travel time from the intermediate process to the factory B, and from the steps of prediction, the arrival time of the factory B The total amount of raw materials that each reaction vessel is poured from each transport vehicle is the required raw material amount for each reaction vessel. The first constraint to be less than or equal to the amount, and the total amount of raw material that each transport vehicle pours into each reaction container is the second constraint to be less than or equal to the amount of material loaded on each transport vehicle and each of the transport destinations If the arrival time of the transport vehicle is not in time for the request time of the reaction container poured from the transport vehicle, the third restriction that raw material cannot be poured from the transport vehicle into the reaction container, and each transport When the material loading amount of the transport vehicle heading to each transport destination is leveled out of the transport destinations of the transport vehicle satisfying the fourth restriction that the transport destination of the vehicle is only one place among the plurality of factories B At the same time, it is an objective function that minimizes the component adjustment amount of each reaction vessel. The raw material multiplied by the amount of raw material poured into each reaction vessel from each transport vehicle by an adjustment factor set according to the time that the transport vehicle arrives at the factory B and waits until the time required for the reaction vessel The total amount of raw materials, the actual or planned values of the raw material components of each transport vehicle, and the raw material components of each reaction vessel calculated from the amount of raw material poured into each reaction vessel from each transport vehicle, Optimization calculation using mixed integer programming that minimizes the objective function, which is the sum of the component adjustment amount of each reaction vessel calculated from the difference from the target component for all reaction vessels, with the weight adjustment coefficient To obtain the transport destination of each transport vehicle, and within the transport vehicle for which the transport destination has not been determined, leave the factory A before the preset time from the operation plan start time. Optimize the transport vehicle destination As a logistics phenomenon of the transport process from the factory A to the factory B through the intermediate process, the intermediate process arrival time, the intermediate process entry time, the intermediate process departure time, In addition, a simulation from the planned start time to a time after the preset time is performed in the logistics simulator that models the factory B arrival time, and for all transport vehicles that have not arrived at the factory B at the transport plan start time. The intermediate process passing time of each transport vehicle after the preset time and the step of predicting the factory B arrival time, the time after the preset time as a new plan start time, By repeating all steps other than the input step until the transport destinations of all transport vehicles are determined, the transport destinations of a plurality of transport vehicles may be determined.
Furthermore, in addition to the above-described constraints, a fifth constraint regarding the raw material components and required components of each reaction vessel may be added to determine the transport destination of the transport vehicle.
本発明によれば、工場Aから工場Bまでの物流現象を模擬するシミュレータを用いることにより、解くべき変数や制約式の数を大幅に減らすことができ、計算に要する計算機負荷を下げられる。各搬送先で要求される原料の量や成分・温度の制約を考慮して、各搬送先に向かう原料量の平準化と成分調整量を最適にする輸送車の搬送先を短時間で求めることができるため、原料不足を防止し、かつ、成分調整コストを下げることが可能となる。また、各搬送先にバランス良く輸送車が向かうことになるため、不必要な輸送車を削減することが可能であり、全体の輸送車台数を減らすこともできる。さらに、計算と実績にずれが生じたときにも再計算する時間が短いため、常に適切な輸送車の運行指示を与えることができる。 According to the present invention, by using a simulator that simulates a physical distribution phenomenon from factory A to factory B, the number of variables and constraint equations to be solved can be greatly reduced, and the computer load required for calculation can be reduced. In consideration of the amount of raw materials required at each transport destination and the restrictions on components and temperature, the transport destination of the transport vehicle that optimizes the level of raw material amount and the component adjustment amount toward each transport destination in a short time. Therefore, it is possible to prevent shortage of raw materials and reduce component adjustment costs. In addition, since transport vehicles are directed to each transport destination in a well-balanced manner, unnecessary transport vehicles can be reduced, and the total number of transport vehicles can be reduced. Furthermore, since the time for recalculation is short even when there is a difference between the calculation and the actual result, it is possible to always give an appropriate transport vehicle operation instruction.
以下、添付図面を参照して、本発明の好適な実施形態について説明する。図1は本発明に係わる全ての工程を1台のコンピュータにて実現した場合の実施形態を示す図である。また、図2は運行計画作成方法のための演算処理を示すフローチャートである。 Preferred embodiments of the present invention will be described below with reference to the accompanying drawings. FIG. 1 is a diagram showing an embodiment in which all processes according to the present invention are realized by a single computer. FIG. 2 is a flowchart showing a calculation process for the operation plan creation method.
入力装置1はキーボードやマウス、又は、ネットワークで接続された機器等であり、成分調整前の各反応容器の要求量・要求成分・要求温度・要求時刻、及び、成分調整後の目標成分、並びに、各輸送車の工程通過時刻(工場A出発時刻、中間工程到着・入車・出車時刻、工場B到着時刻)・原料量・原料成分・原料温度の実績値(空輸送車においては計画値を用いる)を、コンピュータ本体2に入力する(ステップS201)。ここで、「要求・・」とは、各反応容器に定められ、守らなければならない制約を意味し、「実績値」は過去の測定値を、「計画値」は将来の予測値を意味している。
The
コンピュータ本体2は、中央処理装置や主記憶メモリ、ハードディスク等の記憶装置等から構成され、記憶装置内に格納されているプログラムの指示通りに動作する。先ず、コンピュータ本体2は入力装置1から読み込んだデータと、記憶装置もしくはプログラム内に格納されている各種定数データ(繰り返し計算における輸送車の確定台数やシミュレーション時間範囲等)より、全ての輸送車の搬送先が確定するまで、ステップS202〜S206の処理(図1の11〜14に相当する)を繰り返し行い、求まった輸送車の搬送先を出力装置3へ出力する。
The computer
出力装置3はディスプレイやプリンタ、ネットワークで接続された機器等である。
The
本発明の輸送計画作成方法の原理について示す。決定したい項目は輸送車の搬送先であるが、中間工程での処理能力に起因する輸送車間の干渉の回避や、工場Bの原料混合工程での入出車制約等、数多くの制約を考慮する必要がある。これら数多くの制約を全て含んだ制約式を用いて、混合整数計画法で解を求めることも原理的に可能であるが、実用的な時間で解を得る事はコンピュータの処理能力上、不可能である。 The principle of the transportation plan creation method of the present invention will be described. The item to be determined is the transport destination of the transport vehicle, but it is necessary to consider many restrictions such as avoiding interference between transport vehicles due to the processing capacity in the intermediate process, and restrictions on entering and leaving the vehicle in the raw material mixing process of Factory B There is. In principle, it is possible to obtain a solution by mixed integer programming using a constraint equation that includes all these constraints, but it is impossible to obtain a solution in a practical time because of the processing power of the computer. It is.
そこで、輸送車の搬送先を決定する処理(図2)において、工場Aから工場Bまでの物流現象、例えば、中間工程での輸送車間の干渉等をステップS206の物流シミュレータで計算することが本発明の特徴である。物流シミュレータを用いてシミュレーションをするためには、輸送車の搬送先は確定しておく必要があるので、シミュレーションをする前に、ステップS202(図1の11に相当する)で各輸送車が移動可能な全ての工場Bの到着時刻を、繰返し計算の必要無い関係式等で可能な限り正確に予測し、予測した到着時刻を基に、ステップS203で輸送車の搬送先決定に関する等式・不等式制約式を作成するとともに、輸送計画の良否を定量的に表す目的関数を定め(図1の15に相当する)、ステップS204にて制約式を満足し、目的関数を最小とする解を混合整数計画法で解き、各輸送車の搬送先を求めている(図1の12に相当する)。 Therefore, in the process of determining the transport destination of the transport vehicle (FIG. 2), the distribution phenomenon from the factory A to the factory B, for example, the interference between the transport vehicles in the intermediate process, etc. is calculated by the distribution simulator in step S206. It is a feature of the invention. In order to perform a simulation using the logistics simulator, it is necessary to determine the transport destination of the transport vehicle. Therefore, before the simulation, each transport vehicle moves in step S202 (corresponding to 11 in FIG. 1). Predict the arrival times of all possible factories B as accurately as possible with relational expressions that do not require repeated calculations, and on the basis of the predicted arrival times, equations and inequalities for determining the transport destination of the transport vehicle in step S203 Create a constraint equation and define an objective function that quantitatively represents the quality of the transportation plan (corresponding to 15 in FIG. 1). In step S204, a solution that satisfies the constraint equation and minimizes the objective function is a mixed integer. Solved by the planning method, the transport destination of each transport vehicle is obtained (corresponding to 12 in FIG. 1).
ただし、工場Aから工場Bまでで輸送車間の干渉がある時には、ステップS202で予測した工場B到着時刻は正確ではない。特に、工場A出発時刻が計画開始時刻に比べて離れている輸送車に対しては、工場B到着時刻は予測誤差が累積し、ずれが大きくなってしまう。 However, when there is interference between transport vehicles from factory A to factory B, the factory B arrival time predicted in step S202 is not accurate. In particular, for transport vehicles whose factory A departure time is far away from the planned start time, the factory B arrival time accumulates prediction errors, and the deviation becomes large.
そこで、求められた輸送車の搬送先にて全ての輸送車の搬送先を確定してしまうのではなく、ステップS205にて、工場A出発時刻が早い順に、一部の輸送車の搬送先を確定し(図1の13に相当する)、ステップS206にて、詳細物流シミュレータで、計画開始時刻から設定時間後までの物流シミュレーションを行い、設定時間後の輸送車の工程通過時刻(中間工程到着・入車・出車時刻、工場B到着時刻)・原料量・原料成分・原料温度を予測する(図1の14に相当する)。 Therefore, instead of determining the transport destinations of all transport vehicles at the determined transport destination of transport vehicles, in step S205, the transport destinations of some transport vehicles are set in order of the factory A departure time. Confirmed (corresponding to 13 in FIG. 1), and in step S206, the detailed logistics simulator performs a logistics simulation from the plan start time to the set time later, and the transit time of the transport vehicle after the set time (intermediate process arrival) (Entrance / departure time, arrival time at factory B) Predict the amount of raw material, raw material component, and raw material temperature (corresponding to 14 in FIG. 1).
そして、設定時間後の時刻を新たに計画開始時刻と見なして、ステップS202〜S206の処理を繰り返すことにより、全輸送車の搬送先を徐々に確定する。ここで、前記一部の輸送車とは、次回の物流シミュレーション時に搬送先が確定している必要がある輸送車であり、例えば、工場Aを出発した輸送車の搬送先を変更できない場合には、計画開始時刻から設定時間後に工場Aを出発する計画となっている輸送車となる。 Then, the time after the set time is newly regarded as the plan start time, and the processing of steps S202 to S206 is repeated to gradually determine the transport destinations of all transport vehicles. Here, the partial transport vehicle is a transport vehicle whose transport destination needs to be determined at the next physical distribution simulation. For example, when the transport destination of the transport vehicle leaving the factory A cannot be changed. The transport vehicle is scheduled to leave the factory A after a set time from the planned start time.
このように、輸送車の搬送先を徐々に確定することにより、工場B到着時刻の予測誤差のずれを少なくすることができ、精度の高い解を短時間で得ることが可能となる。 In this way, by gradually determining the transport destination of the transport vehicle, it is possible to reduce the deviation in the prediction error of the factory B arrival time, and to obtain a highly accurate solution in a short time.
(実施例)
以下、工場Aから工場Bまでの物流工程が図4の場合を実施例として説明する。本実施例では、輸送車が第一工場Bへ向かうときには、第一中間工程を使用し、第二工場Bへ向かうときには、第二中間工程を使用するとする。工程数が異なる場合や、他の条件が付加される場合も、本実施例と同様に導出可能である。表1には、関係式で使用している変数や定数の記号を示す。
(Example)
Hereinafter, the case where the physical distribution process from the factory A to the factory B is FIG. 4 will be described as an example. In the present embodiment, when the transport vehicle goes to the first factory B, the first intermediate process is used, and when the transport vehicle goes to the second factory B, the second intermediate process is used. Even when the number of steps is different or when other conditions are added, it can be derived in the same manner as in this embodiment. Table 1 shows symbols of variables and constants used in the relational expressions.
まず、ステップS201にて、入力装置1より各工場Bの反応容器が必要とする成分調整前の原料に関する要求原料量・要求成分・要求時刻・要求温度、及び、成分調整後の目標成分、及び、各輸送車の工程通過時刻・原料量・原料成分・原料温度の実績値と計画値を入力し、コンピュータ本体2の記憶装置に格納する。
First, in step S201, the required raw material amount / required component / required time / required temperature related to the raw material before component adjustment required by the reaction vessel of each factory B from the
次に、ステップS202にて、各輸送車の工程通過工程より、輸送車毎に、搬送可能な全ての工場B到着時刻を予測する。このとき、搬送先が確定している輸送車に対しては、当該工場B到着時刻のみ予測し、搬送先が確定していない輸送車に対しては、搬送可能な全ての工場B到着時刻を予測する。到着時刻の予測には、例えば、(式1)のような式を用いる。 Next, in step S202, all factory B arrival times that can be transported are predicted for each transport vehicle from the process passing step of each transport vehicle. At this time, only the arrival time of the factory B is predicted for a transport vehicle for which the transport destination is determined, and all the transport times of the factory B that can be transported are determined for a transport vehicle for which the transport destination is not determined. Predict. For example, an expression such as (Expression 1) is used for predicting the arrival time.
(式1)は輸送車同士の干渉を考えない単純な例であるが、輸送車同士の干渉を考えたより複雑な式に変更しても構わない。また、時々刻々の輸送車の現在位置が取得可能なときには、輸送車の現在位置を用いたより高精度な到着時刻予測を行っても構わない。 (Equation 1) is a simple example that does not consider the interference between transport vehicles, but may be changed to a more complicated equation that considers the interference between transport vehicles. In addition, when the current position of the transport vehicle can be obtained from time to time, the arrival time can be predicted with higher accuracy using the current position of the transport vehicle.
次に、ステップS203において、輸送車の搬送先決定に関する以下の等式・不等式制約を作成する。
(1)一つの反応容器iが各輸送車kから注がれる原料量の総和についての第1の制約は、下記の(式2)のように定式化する。
Next, in step S203, the following equality / inequality constraints relating to the determination of the transport destination of the transport vehicle are created.
(1) The first constraint on the total amount of raw materials poured from each transport vehicle k in one reaction vessel i is formulated as shown in (Formula 2) below.
(2)一つの輸送車kが各反応容器iへ注ぐ原料量の総和についての第2の制約は、下記の(式3)のように定式化する。 (2) The second constraint on the total amount of raw materials that one transport vehicle k pours into each reaction vessel i is formulated as shown in (Equation 3) below.
(3)各輸送車kの到着時刻と当該輸送車から注がれる反応容器の要求時刻についての第3の制約は、下記の(式4)のように定式化する。 (3) The third constraint on the arrival time of each transport vehicle k and the required time of the reaction container poured from the transport vehicle is formulated as shown in (Formula 4) below.
(4)各輸送車の搬送先は1個所のみであるという第4の制約は、下記の(式5)、(式6)のように定式化する。 (4) The fourth constraint that there is only one transport destination for each transport vehicle is formulated as in the following (Expression 5) and (Expression 6).
(5)各反応容器の原料成分と要求成分についての第5の制約は、下記の(式7)、(式8)のように定式化する。 (5) The 5th restriction | limiting about the raw material component of each reaction container and a request | requirement component is formulated like the following (Formula 7) and (Formula 8).
(6)各反応容器の原料温度と要求温度についての第6の制約は、下記の(式9)のように定式化する。 (6) The sixth constraint on the raw material temperature and the required temperature of each reaction vessel is formulated as shown in (Equation 9) below.
(7)各搬送先に向かう輸送車の原料量を平準化する目的関数は、下記の(式10)のように定式化する。 (7) The objective function for leveling the raw material amount of the transport vehicle heading to each transport destination is formulated as shown in (Equation 10) below.
(8)各反応容器の成分調整量の総和を最小にする目的関数は、下記の(式11)、(式12)のように定式化する。 (8) The objective function that minimizes the sum of the component adjustment amounts of each reaction vessel is formulated as in the following (Expression 11) and (Expression 12).
(9)最適化計算を行う際の目的関数は、(式10)のJ1と(式12)のJ2とに重み調整係数Wを付けた、下記の(式13)とする。 (9) the objective function for performing the optimization calculation, it is assumed that the weighted adjustment factor W to the J 2 and J 1 (Formula 10) (Formula 12), the following equation (13).
以上説明した制約式と目的関数は全て線形の等式と不等式であるため、ステップS204にて、(式2)〜(式12)で示される等式・不等式制約式を満足し、(式13)で示される目的関数を最小にする最適化計算を混合整数計画法等を用いて行い、各輸送車の搬送先skjを得ることができる。
Since the constraint equations and objective functions described above are all linear equations and inequalities, the equality / inequality constraint equations shown in (Equation 2) to (Equation 12) are satisfied in step S204, and (
次に、ステップS205にて、搬送先が確定していない輸送車の中で、工場A出発時刻が早い順に、一部の輸送車の搬送先を確定し、以降の計算にて、確定された輸送車の搬送先は変更しないものとする。例えば、計画開始時刻から設定時間後までに、工場Aを出発する輸送車の搬送先を確定する。 Next, in step S205, the transport destinations of some transport vehicles are determined in order of the factory A departure time in the transport vehicles whose transport destinations have not been determined, and determined in the subsequent calculations. The transport destination of the transport vehicle shall not be changed. For example, the transport destination of the transport vehicle that leaves the factory A is determined between the planned start time and the set time.
次に、ステップS206にて、工場Aから工場Bまでの輸送工程の物流現象をモデル化した詳細シミュレータにて、設定時間後の輸送車の状況を予測する。本例の場合、詳細シミュレータは図5のようなペトリネットでモデル化することが可能である。 Next, in step S206, the state of the transport vehicle after the set time is predicted by a detailed simulator that models the logistics phenomenon in the transport process from the factory A to the factory B. In this example, the detailed simulator can be modeled by a Petri net as shown in FIG.
図5において、トランジションの出力アークに記載されている記号(F(p1,p^1)(p^の表記はpの上に^が付されていることを意味するものとする)等)は、トランジションが発火後に出側プレースに出力されたトークンが次に発火できるまでの時間であり、輸送車の移動時間や中間工程での処理時間を意味している。出力アークに記号が記載されていないときには、時間0で発火可能であることを意味している。 In FIG. 5, symbols (F (p 1 , p ^ 1 ) (p ^ notation means that ^ is attached on p), etc.) described in the output arc of the transition) Is the time until the token output to the outgoing place after the transition is ignited can be ignited next, and means the travel time of the transport vehicle and the processing time in the intermediate process. When no symbol is written in the output arc, it means that ignition is possible at time zero.
また、トランジションの入力アークに記載されている記号は、当該トランジションの発火条件を意味しており、例えば、[sk1=1]であれば、プレース19のトークン(輸送車を意味する)の中で、搬送先が第一中間工程のトークンが発火可能であることを意味し、[到着順]であれば、中間工程にトークンが到着した順番に発火可能であることを意味している。 The symbol written in the input arc of the transition means the firing condition of the transition. For example, if [s k1 = 1], the token in the place 19 (meaning a transport vehicle) This means that the token of the first intermediate process can be ignited, and if it is [arrival order], it means that the token can be ignited in the order in which the tokens arrived at the intermediate process.
説明を簡単にするために、図5のような単純なペトリネットを例として記載したが、より複雑な輸送工程では、if-thenルール等でトランジションの発火条件を記載しても構わない。 In order to simplify the explanation, a simple Petri net as shown in FIG. 5 has been described as an example. However, in a more complicated transportation process, the firing condition of the transition may be described by an if-then rule or the like.
図5のようなペトリネットモデルを用いた詳細シミュレータに、入力装置1で入力された輸送車の工程通過時刻より、トークンを配置して、設定された時間までのシミュレーションを行い、その時刻における輸送車の工程通過時刻を予測する。
A token is placed in the detailed simulator using the Petri net model as shown in FIG. 5 from the process passing time of the transport vehicle input by the
さて、ステップS206でシミュレーション後、まだ搬送先が確定していない輸送車が存在していれば、計画開始時刻をシミュレーション後の時刻(計画開始時刻+設定時間)とし、ステップS202〜S206を繰り返し行うことにより、全ての輸送車の搬送先skjを徐々に確定する。このように、繰り返し計算を行い、徐々に輸送車の搬送先を確定することにすれば、ステップS202で計算した輸送車の工場B到着時刻akjの精度が最適性に大きな影響を及ぼすことは少ない。 If there is a transport vehicle whose destination has not yet been determined after the simulation in step S206, the plan start time is set as the time after the simulation (plan start time + set time), and steps S202 to S206 are repeated. Thus, the transport destination s kj of all transport vehicles is gradually determined. As described above, if the calculation is repeatedly performed and the transport destination of the transport vehicle is gradually determined, the accuracy of the transport vehicle factory B arrival time a kj calculated in step S202 greatly affects the optimality. Few.
以上実施例として本発明に係わる制約式や目的関数等を詳しく説明したが、本発明は本実施例に限定されるものではない。 Although the constraint equations and objective functions according to the present invention have been described in detail as examples, the present invention is not limited to the examples.
また、輸送車台数が非常に多い場合、やはり整数変数が多くなり、ステップS204の最適化計算に時間が掛かってしまうときには、繰り返し計算中の計画開始時刻からかなり将来に工場Aを出発する輸送車に対しては、正確に搬送先を決める必要はないため、搬送先skjを実数変数として取り扱っても構わない。 Also, if the number of transport vehicles is very large, the number of integer variables also increases, and if the optimization calculation in step S204 takes a long time, the transport vehicles leave the factory A quite in the future from the planned start time during the repeated calculation. However, since it is not necessary to accurately determine the transport destination, the transport destination s kj may be handled as a real variable.
1 … 入力装置
2 … コンピュータ本体
3 … 出力装置
4 … 輸送車
5 … 成分調整前の反応容器
6 … 成分調整後の反応容器
7 … 工場A
8 … 工場B
9 … 原料混合工程
10 … 搬送路
11 … 各輸送車が移動可能な全ての工場Bの到着時刻を予測する処理
12 … 各輸送車の搬送先を計算する最適化計算
13 … 一部の輸送車の搬送先を確定する処理
14 … 輸送車の工場B到着時刻や到着温度・到着成分を詳細に求める詳細シミュレーション
15 … 目的関数
16 … 成分調整中の反応容器
17 … 成分調整工程
18 … 中間工程
19〜21 … 第一〜第三工場Aを意味するプレース
22〜27 … 工場Aから中間工程へ出発するときに発火するトランジション
28、29 … 第一と第二中間工程に到着したことを意味するプレース
30、31 … 第一と第二中間工程に入車するときに発火するトランジション
32、33 … 第一と第二中間工程に入車中を意味するプレース
34、35 … 第一と第二中間工程が空いていることを意味するプレース
36、37 … 中間工程から工場Bへ出発するときに発火するトランジション
38、39 … 第一と第二工場Bに到着したことを意味するプレース
40 … 輸送車を意味するトークン
DESCRIPTION OF
8 ... Factory B
9 ... Raw
Claims (3)
計画開始時刻における、各輸送車の工場A出発時刻と原料積載量の実績値と計画値、並びに、各輸送車の中間工程通過時刻と工場B到着時刻の実績値を入力するステップと、
搬送先が確定していない全ての輸送車に対して、積載している原料を輸送可能な全ての工場Bの到着時刻と、搬送先が確定している全ての輸送車に対して、搬送先の工場Bの到着時刻を、前記輸送車が前記中間工程に入車する前には、前記輸送車の前記工場Aの出発時刻の実績値もしくは計画値と、前記工場Aから前記中間工程までの移動時間と、前記中間工程の処理時間と、前記中間工程から前記工場Bまでの移動時間とから、また、前記輸送車が前記中間工程に入車中には、前記輸送車の前記中間工程の入車時刻の実績値と、前記中間工程の処理時間と、前記中間工程から前記工場Bまでの移動時間とから、さらに、前記輸送車が前記中間工程を出車後には、前記輸送車の前記中間工程の出車時刻の実績値と、前記中間工程から前記工場Bまでの移動時間とから、予測するステップと、
前記工場Bの到着時刻、及び各反応容器の要求原料量と要求時刻の計画値を入力とし、各反応容器が各輸送車から注がれる原料量の総和は、当該各反応容器の要求原料量以下とする第1の制約と、各輸送車が各反応容器へ注ぐ原料量の総和は、当該各輸送車の積載している原料量以下とする第2の制約と、搬送先への各輸送車の到着時刻が、当該輸送車から注がれる反応容器の要求時刻に間に合わない場合は、当該輸送車から当該反応容器に原料を注ぐことは不可であるという第3の制約と、各輸送車の搬送先は複数の工場Bのうちの1個所のみであるという第4の制約を満足する前記輸送車の搬送先の中から、各搬送先に向かう輸送車の原料積載量を平準化する目的関数であって、前記各輸送車から前記各反応容器へ注がれる原料量に、当該輸送車が工場Bに到着してから当該反応容器の要求時刻まで待機する時間に応じて設定された調整係数を乗じた原料量の総和である目的関数が最小となるものを、混合整数計画法による最適化計算を行って求めることにより、各輸送車の搬送先を求めるステップと、
搬送先が確定していない輸送車の中で、前記運行計画開始時刻から予め設定された時間後までに、工場Aを出発する輸送車の搬送先を、前記最適化計算で求めた搬送先に確定するステップと、
前記工場Aから前記中間工程を経て前記工場Bまでの輸送プロセスの物流現象として、中間工程到着時刻、中間工程入車時刻、中間工程出車時刻、及び工場B到着時刻をモデル化した物流シミュレータにて、計画開始時刻から予め設定された時間後までのシミュレーションを行い、前記輸送計画開始時刻において、工場Bに到着していない全ての輸送車に対して、前記予め設定された時間後の各輸送車の中間工程通過時刻と工場B到着時刻を予測するステップとを有し、
前記予め設定された時間後の時刻を新たに計画開始時刻として、前記入力するステップ以外の全てのステップを全ての輸送車の搬送先が確定するまで繰り返すことにより、複数の輸送車の搬送先を決定することを特徴とする複数の輸送車の運行計画作成方法。 A process of transporting the raw material from a plurality of factories A that manufacture raw materials to reaction containers arranged in a plurality of factories B by a plurality of transport vehicles, the plurality of factories A to the plurality of factories in the middle of the transport path to B, in the process of the transporter is present more than one intermediate step you input and vehicles, all of the transport vehicle, and out car one intermediate step of the intermediate steps An operation plan creation method for the plurality of transport vehicles,
A step of inputting factory A departure time and actual value and plan value of raw material loading amount of each transport vehicle, and actual value of intermediate process passing time and factory B arrival time of each transport vehicle at the plan start time;
For all transport vehicles for which the transport destination has not been determined, the arrival time of all factories B capable of transporting the loaded raw materials and for all transport vehicles for which the transport destination has been determined The arrival time of the factory B before the transport vehicle enters the intermediate process, the actual value or the planned value of the departure time of the factory A of the transport vehicle, and the factory A to the intermediate process From the travel time, the processing time of the intermediate process, and the travel time from the intermediate process to the factory B, and when the transport vehicle enters the intermediate process, the intermediate process of the transport vehicle From the actual value of the entry time, the processing time of the intermediate process, and the travel time from the intermediate process to the factory B, after the transport vehicle leaves the intermediate process, the transport vehicle The actual value of the departure time of the intermediate process and the factory from the intermediate process From the travel time of up to, and the step of predicting,
The arrival time of the factory B, the required amount of raw material for each reaction vessel and the planned value of the required time are input, and the total amount of raw materials poured into each reaction vessel from each transport vehicle is the required raw material amount for each reaction vessel. The first constraint, and the total amount of raw material that each transport vehicle pours into each reaction container is the second constraint that is less than or equal to the amount of raw material loaded on each transport vehicle, and each transport to the transport destination If the arrival time of the car is not in time for the request time of the reaction container poured from the transport vehicle, the third constraint that it is impossible to pour the raw material from the transport vehicle into the reaction container, and each transport vehicle The purpose of leveling the material loading amount of the transport vehicle heading to each transport destination from among the transport destinations of the transport vehicle satisfying the fourth restriction that the transport destination is only one of a plurality of factories B The amount of raw material poured from each transport vehicle to each reaction vessel A mixed integer programming method that minimizes the objective function, which is the sum of the amount of raw materials multiplied by the adjustment coefficient set according to the time that the transport vehicle arrives at the factory B and waits until the required time of the reaction vessel. Determining the transport destination of each transport vehicle by performing an optimization calculation according to
Among the transport vehicles for which the transport destination has not been determined, the transport destination of the transport vehicle leaving the factory A by the time set in advance from the start time of the operation plan is the transport destination obtained by the optimization calculation. A step to confirm,
A logistics simulator that models the intermediate process arrival time, intermediate process entry time, intermediate process departure time, and factory B arrival time as a logistics phenomenon of the transport process from the factory A to the factory B through the intermediate process Then, a simulation is performed from the planned start time to a preset time, and each transport after the preset time is set for all transport vehicles that have not arrived at the factory B at the planned transport time. The intermediate process passing time of the car and the step of predicting the factory B arrival time,
By repeating the steps other than the inputting step as a new planning start time after the preset time until the transport destinations of all transport vehicles are determined, the transport destinations of a plurality of transport vehicles are determined. A method for preparing an operation plan for a plurality of transport vehicles, characterized by determining.
計画開始時刻における、各輸送車の工場A出発時刻、原料積載量、及び原料成分の実績値と計画値、並びに、各輸送車の中間工程通過時刻と工場B到着時刻の実績値を入力するステップと、
搬送先が確定していない全ての輸送車に対して、積載している原料を輸送可能な全ての工場Bの到着時刻、並びに、搬送先が確定している全ての輸送車に対して、搬送先の工場Bの到着時刻を、前記輸送車が前記中間工程に入車する前には、前記輸送車の前記工場Aの出発時刻の実績値もしくは計画値と、前記工場Aから前記中間工程までの移動時間と、前記中間工程の処理時間と、前記中間工程から前記工場Bまでの移動時間とから、また、前記輸送車が前記中間工程に入車中には、前記輸送車の前記中間工程の入車時刻の実績値と、前記中間工程の処理時間と、前記中間工程から前記工場Bまでの移動時間とから、さらに、前記輸送車が前記中間工程を出車後には、前記輸送車の前記中間工程の出車時刻の実績値と、前記中間工程から前記工場Bまでの移動時間とから、予測するステップと、
前記工場Bの到着時刻、並びに各反応容器の要求原料量、要求時刻、及び成分調整後の目標成分の計画値を入力とし、各反応容器が各輸送車から注がれる原料量の総和は、当該各反応容器の要求原料量以下とする第1の制約と、各輸送車が各反応容器へ注ぐ原料量の総和は、当該各輸送車の積載している原料量以下とする第2の制約と、搬送先への各輸送車の到着時刻が、当該輸送車から注がれる反応容器の要求時刻に間に合わない場合は、当該輸送車から当該反応容器に原料を注ぐことは不可であるという第3の制約と、各輸送車の搬送先は複数の工場Bのうちの1個所のみであるという第4の制約を満足する前記輸送車の搬送先の中から、各搬送先に向かう輸送車の原料積載量を平準化すると同時に、各反応容器の成分調整量の最小化する目的関数であって、前記各輸送車から前記各反応容器へ注がれる原料量に、当該輸送車が工場Bに到着してから当該反応容器の要求時刻まで待機する時間に応じて設定された調整係数を乗じた原料量の総和、及び、各輸送車の原料成分の実績値もしくは計画値と、各輸送車から各反応容器に注がれる原料量とから計算される各反応容器の原料成分と、各反応容器の目標成分との差から計算される各反応容器の成分調整量の全ての反応容器に対する総和、の重み調整係数付きの和である目的関数が最小となるものを、混合整数計画法による最適化計算を行って求めることにより、各輸送車の搬送先を求めるステップと、
搬送先が確定していない輸送車の中で、前記運行計画開始時刻から予め設定された時間後までに、工場Aを出発する輸送車の搬送先を、前記最適化計算で求めた搬送先に確定するステップと、
前記工場Aから前記中間工程を経て前記工場Bまでの輸送プロセスの物流現象として、中間工程到着時刻、中間工程入車時刻、中間工程出車時刻、及び工場B到着時刻をモデル化した物流シミュレータにて、計画開始時刻から予め設定された時間後までのシミュレーションを行い、前記輸送計画開始時刻において、工場Bに到着していない全ての輸送車に対して、前記予め設定された時間後の各輸送車の中間工程通過時刻と工場B到着時刻を予測するステップとを有し、
前記予め設定された時間後の時刻を新たに計画開始時刻として、前記入力するステップ以外の全てのステップを全ての輸送車の搬送先が確定するまで繰り返すことにより、複数の輸送車の搬送先を決定することを特徴とする複数の輸送車の運行計画作成方法。 A process of adjusting raw material components in a reaction container after transporting the raw material by a plurality of transport vehicles from a plurality of factories A that manufacture raw materials to each reaction container arranged in a plurality of factories B, in the middle from the plurality of plants a transport paths to the plurality of plants B, and multiple intermediate steps the transportation vehicle you input and vehicle are present, all of the transport vehicle, of the intermediate steps An operation plan creation method for the plurality of transport vehicles entering and leaving a single intermediate process ,
Step of inputting factory A departure time of each transport vehicle, raw material loading amount, actual value and plan value of raw material components, and intermediate process passing time and actual value of factory B arrival time of each transport vehicle at the planned start time When,
Conveyance for all transport vehicles for which transport destinations have not been determined, arrival time for all factories B that can transport loaded materials, and transport vehicles for which transport destinations have been determined Before the transport vehicle enters the intermediate process , the arrival time of the previous factory B, the actual value or the planned value of the departure time of the factory A of the transport vehicle, and the factory A to the intermediate process Travel time of the intermediate process, the travel time from the intermediate process to the factory B, and when the transport vehicle enters the intermediate process, the intermediate process of the transport vehicle From the actual value of the entry time of the vehicle, the processing time of the intermediate process, and the travel time from the intermediate process to the factory B, further, after the transport vehicle leaves the intermediate process, The actual value of the departure time of the intermediate process and the previous from the intermediate process From the Time to Plant B, and the step of predicting,
With the arrival time of the factory B and the required raw material amount of each reaction vessel, the required time, and the planned value of the target component after component adjustment as inputs, the sum of the raw material amount that each reaction vessel is poured from each transport vehicle is: The first restriction that is less than or equal to the required raw material amount of each reaction container, and the second restriction that the total amount of raw material that each transport vehicle pours into each reaction container is less than or equal to the amount of raw material that is loaded on each transport vehicle If the arrival time of each transport vehicle at the transport destination is not in time for the request time of the reaction container poured from the transport vehicle, it is impossible to pour the raw material from the transport vehicle into the reaction container. The transport vehicle heading to each transport destination from among the transport destinations of the transport vehicle satisfying the third constraint and the fourth constraint that the transport destination of each transport vehicle is only one place among the plurality of factories B. At the same time as leveling the raw material load, minimize the amount of component adjustment in each reaction vessel It is an objective function, and the amount of raw material poured from each transport vehicle into each reaction container is set according to the time that the transport vehicle waits until the request time of the reaction container after arrival at the factory B The total amount of raw materials multiplied by the adjustment factor, the actual or planned value of the raw material components of each transport vehicle, and the raw material components of each reaction vessel calculated from the amount of raw material poured into each reaction vessel from each transport vehicle And the sum of the component adjustment amount of each reaction vessel calculated from the difference from the target component of each reaction vessel with respect to all reaction vessels, the sum with weight adjustment coefficient is the smallest integer Determining the transport destination of each transport vehicle by performing an optimization calculation by the programming method,
Among the transport vehicles for which the transport destination has not been determined, the transport destination of the transport vehicle leaving the factory A by the time set in advance from the start time of the operation plan is the transport destination obtained by the optimization calculation. A step to confirm,
A logistics simulator that models the intermediate process arrival time, intermediate process entry time, intermediate process departure time, and factory B arrival time as a logistics phenomenon of the transport process from the factory A to the factory B through the intermediate process Then, a simulation is performed from the planned start time to a preset time, and each transport after the preset time is set for all transport vehicles that have not arrived at the factory B at the planned transport time. The intermediate process passing time of the car and the step of predicting the factory B arrival time,
By repeating the steps other than the inputting step as a new planning start time after the preset time until the transport destinations of all transport vehicles are determined, the transport destinations of a plurality of transport vehicles are determined. A method for preparing an operation plan for a plurality of transport vehicles, characterized by determining.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2005196505A JP5005194B2 (en) | 2005-07-05 | 2005-07-05 | Transport vehicle operation plan creation method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2005196505A JP5005194B2 (en) | 2005-07-05 | 2005-07-05 | Transport vehicle operation plan creation method |
Publications (2)
Publication Number | Publication Date |
---|---|
JP2007018083A JP2007018083A (en) | 2007-01-25 |
JP5005194B2 true JP5005194B2 (en) | 2012-08-22 |
Family
ID=37755223
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP2005196505A Expired - Fee Related JP5005194B2 (en) | 2005-07-05 | 2005-07-05 | Transport vehicle operation plan creation method |
Country Status (1)
Country | Link |
---|---|
JP (1) | JP5005194B2 (en) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2874029A1 (en) * | 2013-11-15 | 2015-05-20 | Bayer Technology Services GmbH | Method for operating a system for carrying out of at least one chemical reaction |
JP6428435B2 (en) * | 2015-03-30 | 2018-11-28 | Jfeスチール株式会社 | Transportation plan creation device and transportation plan creation method |
JP6736258B2 (en) * | 2015-04-27 | 2020-08-05 | 日本製鉄株式会社 | Planning device, method and program |
CN108983721B (en) * | 2018-07-25 | 2020-09-08 | 中国能源建设集团广东省电力设计研究院有限公司 | Vehicle logistics control system and method |
KR102430276B1 (en) * | 2020-06-22 | 2022-08-08 | 박근범 | Material filling recognition method and computing device for executing the method |
JP7241974B2 (en) | 2020-06-30 | 2023-03-17 | 旭化成株式会社 | Apparatus, method and program |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH06259411A (en) * | 1993-03-10 | 1994-09-16 | Kawasaki Steel Corp | Inference device for transport plan |
JPH11310313A (en) * | 1998-02-26 | 1999-11-09 | Kobe Steel Ltd | Physical distribution planing device |
JP2003015728A (en) * | 2001-04-03 | 2003-01-17 | Nippon Steel Corp | Method and device for calculating optimal mixing of raw material, computer program and computer readable storage medium |
JP4171189B2 (en) * | 2001-05-08 | 2008-10-22 | 新日本製鐵株式会社 | Conveyance plan creation method and apparatus in conveyance process, conveyance control method and apparatus, computer program, and computer-readable storage medium |
-
2005
- 2005-07-05 JP JP2005196505A patent/JP5005194B2/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
JP2007018083A (en) | 2007-01-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Adulyasak et al. | Benders decomposition for production routing under demand uncertainty | |
JP5005194B2 (en) | Transport vehicle operation plan creation method | |
Liu et al. | Integrated scheduling of ready-mixed concrete production and delivery | |
CN102637272B (en) | Distribution method and the device of the front storehouse of hot rolling slab residue slab | |
Sun | Green and Reliable Freight Routing Problem in the Road‐Rail Intermodal Transportation Network with Uncertain Parameters: A Fuzzy Goal Programming Approach | |
Xu et al. | A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system | |
Zhao et al. | A chance-constrained stochastic approach to intermodal container routing problems | |
Christiansen et al. | Robust inventory ship routing by column generation | |
Vojinović et al. | A Novel Integrated Fuzzy‐Rough MCDM Model for Evaluation of Companies for Transport of Dangerous Goods | |
Li et al. | A hybrid simulated annealing heuristic for multistage heterogeneous fleet scheduling with fleet sizing decisions | |
Fuller et al. | Oil industry value chain simulation with learning agents | |
Mrabti et al. | A multi-objective optimization model for the problems of sustainable collaborative hub location and cost sharing | |
Mousavi et al. | Two calibrated meta-heuristics to solve an integrated scheduling problem of production and air transportation with the interval due date | |
Ganji et al. | A new coordinating model for green supply chain and batch delivery scheduling with satisfaction customers | |
JP4377792B2 (en) | Vehicle allocation plan creation device, vehicle allocation plan creation method, computer program, and computer-readable recording medium | |
Yang et al. | Concrete vehicle scheduling based on immune genetic algorithm | |
ALBAYRAK et al. | Investigation of ready mixed concrete transportation problem using linear programming and genetic algorithm | |
JP2006228035A (en) | Selecting method and system of inventory replenishment model | |
CN113610453A (en) | Multi-transportation-mode combined container transportation path selection method | |
Golias et al. | Scheduling of inbound trucks at a cross-docking facility: Bi-objective vs bi-level modeling approaches | |
CN106650981A (en) | Optimized procurement and ship/vehicle-sharing transport method based on genetic algorithm | |
CN113706874B (en) | Method and device for predicting arrival time of logistics vehicles in factory in real time and electronic equipment | |
Shoaee et al. | Clusters of floor locations-allocation of stores to cross-docking warehouse considering satisfaction and space using MOGWO and NSGA-II algorithms | |
JP4994797B2 (en) | Production / distribution plan creation apparatus and method for continuous or related processes, production / distribution control apparatus and method, computer program, and computer-readable recording medium | |
Tsaples et al. | Investigating the effects of introducing Automated Straddle Carriers in port operations with a System Dynamics model |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
A621 | Written request for application examination |
Free format text: JAPANESE INTERMEDIATE CODE: A621 Effective date: 20080307 |
|
A131 | Notification of reasons for refusal |
Free format text: JAPANESE INTERMEDIATE CODE: A131 Effective date: 20110614 |
|
A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20110810 |
|
A131 | Notification of reasons for refusal |
Free format text: JAPANESE INTERMEDIATE CODE: A131 Effective date: 20120228 |
|
A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20120424 |
|
TRDD | Decision of grant or rejection written | ||
A01 | Written decision to grant a patent or to grant a registration (utility model) |
Free format text: JAPANESE INTERMEDIATE CODE: A01 Effective date: 20120515 |
|
A01 | Written decision to grant a patent or to grant a registration (utility model) |
Free format text: JAPANESE INTERMEDIATE CODE: A01 |
|
A61 | First payment of annual fees (during grant procedure) |
Free format text: JAPANESE INTERMEDIATE CODE: A61 Effective date: 20120523 |
|
FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20150601 Year of fee payment: 3 |
|
R151 | Written notification of patent or utility model registration |
Ref document number: 5005194 Country of ref document: JP Free format text: JAPANESE INTERMEDIATE CODE: R151 |
|
FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20150601 Year of fee payment: 3 |
|
FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20150601 Year of fee payment: 3 |
|
S533 | Written request for registration of change of name |
Free format text: JAPANESE INTERMEDIATE CODE: R313533 |
|
FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20150601 Year of fee payment: 3 |
|
R350 | Written notification of registration of transfer |
Free format text: JAPANESE INTERMEDIATE CODE: R350 |
|
S533 | Written request for registration of change of name |
Free format text: JAPANESE INTERMEDIATE CODE: R313533 |
|
R350 | Written notification of registration of transfer |
Free format text: JAPANESE INTERMEDIATE CODE: R350 |
|
LAPS | Cancellation because of no payment of annual fees |