JP3928268B2 - Operation equipment operation plan creation method and system - Google Patents

Description

【００６４】
各制約条件と評価指標の評価関数は、完全に充足している場合には値が０で、充足度合が低くなるにつれて値が増加するペナルティ関数であること唯一の条件とする。例えば、評価指標「検査設定本数が少ない」に対しては下記に示す関数を与えることができる。
【００６５】
【数５】
Ｆ検査本数(ｒ)＝（ｒの検査設定本数）−（最低検査本数）
ここで最低検査本数＝車両総数／回帰日数
評価値算出用の評価関数とその重みは、図１７に示すパターン評価指標としてまとめられる。項目１７０１は制約条件を含む評価指標の名前である。項目１７０２は評価指標が有効かどうかを示す論理値であり、Ｔrueであれば有効、Ｆalseであれば無効をそれぞれ意味する。項目１７０３は各指標の重みを表しており、有効な評価指標全ての重みの総和が１になるように設定される。無効な評価指標に対しては、値がないことを示す特別なヌル文字「―」等を設定する。項目１７０４は評価関数に対応する処理ルーチンへのポインタである。運用ローテーションパターンの評価時にはこのパターン評価指標を参照し、有効な指標を全て用いて数式に対応した処理をおこない評価値を算出する。
【００６６】
図１２に戻り運用ローテーションパターン探索部の説明を続ける。ステップ１２０５では、世代数カウンタｉの値を１増やす。ステップ１２０６では処理の終了判定をおこなう。世代数カウンタｉが図１５の探索パラメータにおける項目１５０４の世代数を超えた場合には、最終世代で得られた運用ローテーションパターンを出力して処理を終了する。そうでない場合には、ステップ１２０７へ進み染色体群に自然淘汰処理を施す。本実施例においては各染色体の評価値を参照し、全ての染色体の中で評価値の低いものから順に、図１５の探索パラメータにおける項目１５０２の淘汰率に示した割合で染色体を削除する。
【００６７】
ステップ１２０８では、染色体群に対して交叉処理を施す。本実施例においては、自然淘汰で残った優秀な染色体からランダムに２個の染色体を選択し、両者を親としてオーソドックスな一点交叉により新たな染色体を生成する。一点交叉とは、親染色体をシーケンス上の任意の一点で切断して後方のシーケンスを互いに交換する処理である。
【００６８】
ステップ１２０９では、染色体群に対して突然変異処理を施す。図１５の探索パラメータにおける項目１５０３の変異率に従って、染色体の遺伝子を確率的に変化させる。染色体の遺伝子長（ダイヤと予備の総数）をＮとすると、致死遺伝子をの出現を防ぐために、染色体を表すシーケンスのｉ番目の遺伝子ｑiを変更する場合には、その範囲を１＜＝ｑi＜＝Ｎ−ｉ＋１に制限する。
【００６９】
以下再びステップ１２０３に戻り処理を繰り返す。
【００７０】
図１に戻り本発明の全体構成の説明を続ける。運用ローテーションパターン探索部０１１１の実行結果として得られる運用ローテーションパターン０１０５は、運用ローテーションパターン評価・修正部０１１２に入力されて計画作成者によるチェックを受ける。処理開始時点では、得られた運用ローテーションパターンの中で最も評価値の高い（すなわち最も質の高い）ものに対して、パターン中の各運用を図の運用データのイメージ形式に変換し、パターンの順序通りに表示装置に出力する。マウスなどのポインティングデバイスやキーボード等の入力装置を用いて他の運用ローテーションパターン指定して表示装置に出力することもできる。
【００７１】
この処理ブロックは、計画作成者によるパターンの評価・修正のための様々な情報提供機能と手動介入機能を備える。まず、表示装置に出力されている運用ローテーションパターンの制約条件と評価指標の充足程度を評価情報として数値化して表示装置に出力することができる。図１８に評価情報の一例を示す。各項目は図のパターン評価指標における評価項目に対応しており、項目１８０１は接続条件違反がないことを、項目１８０２は回帰条件違反が１件あることを、項目１８０３は設定した検査の数が３回であることを、項目１８０４はパターン中の運用の並びにおける予備運用の出現間隔のばらつき具合が標準偏差で２.０日であることを、項目１８０５は昼入庫をおこなう運用の同じく出現間隔のばらつき具合が０.７１日であることを、項目１８０６は車庫・時間帯についてバランス良く列車検査が設定されているかどうかを示す指数が５.４１％(小さいほどバランスが良い）であることを、それぞれ表す。
【００７２】
計画作成者は運用ローテーションパターンと共に、上記評価情報を合わせて用いることにより、探索結果検証を迅速かつ的確におこなうことが可能となる。また、本処理ブロックは評価項目の追加・削除や重みの変更といった各種調整をおこなう機能を備えており、これにより評価指標を変更して後にあらためて運用ローテーションパターンの探索をやりなおすといったことも可能である。
【００７３】
図１９は評価指標調整機能のインターフェース例である。チェックマーク１９０１は、対応する評価項目が有効であることを示している。チェックマークが表示されている領域を囲む四角形の任意の位置をマウス等のポインティングデバイスで押下することにより、チェックマークの表示・非表示を切り替えることができる。ある評価項目をはずして運用ローテーションパターンを評価する場合には、該当評価項目に対応するチェックマークを非表示に設定すると、図のパターン評価指標中の該当項目の有効フラグがＦalseに変化する。ゲージ１９０２は、対応する評価項目の重みを視覚的にわかり易く表示する。三角マーク１９０３の位置で現在の重みの大きさを表す。マウスなどのポインティングデバイスを用いて三角マークをスライドさせることにより重みを変化させることができる。そのスライドの度合に応じて図のパターン評価指標中の重みの値が変化する。
【００７４】
上記の評価指標調整機能に加えて、探索パラメータを計画作成者が調整する機能も備えている。これは図１５の探索パラメータを表示装置に出力し、計画作成者がマウスやキーボード等の各種入力装置を利用してダイレクトに値を変更するインターフェースを提供することで実現する。
【００７５】
評価指標や探索パラメータを調整して何度も探索をやりなおすことにより、計画作成者が試行錯誤を繰り返しつつ作成者自身の意図に合った運用ローテーションパターンを作成することができる。最終的に作成者の承認を受けたパターンは、以降の運用ローテーションパターン調整部(計画作成部)で利用するデータとしてシステム内に登録される。場合によっては計画作成者の指示を受けてプリンタ等に帳票形式で印刷される。
【００７６】
図１に戻り本発明の全体構成の説明を続ける。運用割当部０１１３では、運用ローテーションパターン評価・修正部０１１２を経て計画作成者の承認を受けた運用ローテーションパターンを利用して一定期間分の車両運用計画を作成する。
【００７７】
図２０に本ブロックの処理概要を示す。作成初日を開始地点として各車両に対する運用割当を日付に沿って順次おこなっていく。各日ごとの計画作成は、該当日の計画の雛型を作成する処理Ａと、その結果に対して調整を施す処理Ｂの２段階の処理からなる。
【００７８】
処理Ａの概要は以下の通りである。
【００７９】
１．ローテーション順の運用割当
各車両に対して、前日に割り当てられた運用のローテーションパターン内での位置を調べ、その次に位置する運用を順次割り当てる。
【００８０】
２．運用振り替えによる運用予約との整合性確保
当日に運用予約がある車両は、単純にローテーションに従って運用を割り付けると予定の運用とは全く異なる運用が割り付けられることになる。そこで一旦ローテーションどおりの割当をおこなった後に、運用予約がある車両に対して割り当てられた運用と本来設定すべき運用を振り替える。これにより運用予約との整合性を確保する。
【００８１】
上記処理により、理想的な運用ローテーションパターンをできるだけ崩さずに運用予約との整合性がとれた車両運用計画を作成することができる。しかしながら、部分的にでもローテーションパターン順の運用割り当てを崩した結果、ローテーションパターンが満たしていた制約条件や評価指標の一部が未充足になってしまうため、このままでは実際の運用業務に使用することができないものとなる。
【００８２】
そこで上記処理Ａに加えて、各日ごとの運用割り当てにおいて、制約違反の解消や評価指標の充足度向上を目的とする様々な調整ロジックを適用することにより、実運用での使用に耐えうる高レベルの車両運用計画の作成を実現する（処理Ｂ）。図２１に調整ロジックのデータ形式を示す。項目２１０１はロジックの名称を表す。項目２１０２はロジックの適用順序を設定するフィールドであり、数値の小さいものから順番に処理を実行する。接続違反解消及び回帰違反解消のふたつの調整ロジックは必須のロジックであり、他のロジックを適用する前に処理を実行する。それらに対応する適用順序の項目には、空のデータを表すヌル文字「―」等を設定する。項目２１０３は、調整ロジックの処理ルーチンへのポインタである。
【００８３】
処理Ｂは、まず必須の制約充足用ロジックにより制約違反の解消をおこなった後に、適用順序に従って品質向上用ロジックを順次適用していく。調整ロジックによっては、当日のみの調整では目的を達成できない場合に前日以前に戻って割り当て済みの部分を再作成するものもある。
【００８４】
図２２のフローチャートを用いて運用割当部の処理の概要を説明する。まずステップ２２０１では日付変数ｉの値を０に初期化する。ステップ２２０２では、第ｉ日目のローテーション割り当て及び運用振り替え、すなわち上記処理Ａを実施する。次にステップ２２０３において計画案の第ｉ日目の調整処理、すなわち上記処理Ｂを実施する。本実施例では、制約違反解消用のふたつの調整ロジックに加えて、品質向上用の検査間隔均等化ロジックを適用するものとして以降の説明を進める。
【００８５】
処理Ｂでは、まずステップ２２３１において接続違反解消ロジックを適用するが、その処理の概要を図２３のフローチャートを用いて説明する。まずステップ２３０１では、前処理として全ての車両を含むリストを作成する。ステップ２３０２では処理の終了判定をおこない、車両リストの要素数が０であれば、処理を終了する。そうでない場合にはステップ２３０３に進み、リストの先頭要素の車両（hu）を取りだし、なおかつその車両の第ｉ日目の割り当て運用（ocio）を取得する。ステップ２３０4では運用ocioに関わる制約条件の検出をおこない、ステップ２３０５において検出結果の中に接続条件違反が含まれるかどうかを判定する。接続違反がない場合にはステップ２３１０に進み、車両リストから車両huを削除してステップ２３０２へ再び戻る。接続違反がある場合には他の運用との振り替えにより違反の解消をこころみるため、まずステップ２３０６へ進み同じ日の他の運用から振り替え候補を検索する。
【００８６】
接続違反が生じるのは、翌日運用予約があり、その朝出庫場所（予備運用の場合は在線場所）と運用ocioの夜入庫場所（予備運用の場合は在線場所）が異なる場合である。したがって検索条件は、
１．朝出庫場所が運用ocioと等しい
２．翌日に予約された運用の朝出庫場所と夜入庫場所が等しい
上記２点である。
【００８７】
これらの条件を満たす運用と運用ocioを交換することにより、車両huの接続違反が解消される。これによりあらたな接続条件違反は生じない。そこでステップ２３０７で候補の存在の有無を判定し、候補がある場合にはステップ２３０８に進み候補運用と運用ocioを交換して接続条件違反を解消する。その後はステップ２３１０に進み車両リストから車両huを削除してステップ２３０２へ再び戻る。
【００８８】
運用検索により候補が見つからなかった場合はステップ２３０９へ進む。ここでは計画案に対して前日以前に戻って修正を施すことにより接続条件違反の解消を試みる。この処理をバックトラック処理と呼ぶことにする。
【００８９】
図２４はバックトラック処理の作成イメージである。一日単位の運用振り替えでは、接続違反を解消できない場合には、連続する数日分の運用をまとめて交換することにより違反の解消を実現する。着目する日付を第ｉ日とすると、そこから一日づつ後ろへ戻りながら、下記の条件を満たす交換可能な運用の部分系列を探していく。
【００９０】
１．部分系列の先頭の運用の朝出庫場所（予備運用ならば在線場所、以下同様）が、違反を生じた車両の部分系列における先頭運用の朝出庫場所と等しい
２．部分系列の最後の運用の夜入庫場所（予備運用ならば在線場所）が、翌日の予約運用の朝出庫場所（予備運用ならば在線場所）と等しい
これらの条件を満たす運用の部分系列と違反を生じた車両の同じ期間の部分系列をそっくり交換することにより、接続違反を解消することができる。またこれによりあらたな接続違反が生じることはない。
【００９１】
このバックトラック処理の概要を図２５のフローチャートを用いて説明する。車両carの第i日目の運用ocioが接続違反をおこし、振り替え候補が存在しない場合を想定する。まずステップ２５０１において日付カウンタｊの値をｉ−１に初期化する。ステップ２５０２では車両carの第ｊ日目の運用（これをop1とする）を取得し、さらに車両carを除く全ての車両から第ｊ日目の運用を取得してリストを作成する（ＯpList）。次にステップ２５０３においてＯpＬistから交換候補の運用を検索し、その結果を集めてリスト（ＲesultＬist）を構成する。検索条件は、（１）朝出庫場所がop1と等しい運用、である。
【００９２】
この検索結果の判定をステップ２５０４でおこなう。候補がひとつもない場合には、さらに前日に戻って違反解消処理をおこなうためにステップ２５０５へ進みｊ＝ｊ−１とする。そしてステップ２５０６で処理の終了判定をおこなう。ｊ＜０（すなわち作成初日を下回る）ならば処理を終了する。そうでなければ、再びステップ２５０２へ戻り処理を繰り返す。交換候補が存在する場合にはステップ２５０７へ進む。ここでは交換候補に対応する車両をそれぞれ取得し、さらにそれらの車両の第ｉ日目の運用を取得してリストを作成する（ＯpＬist2）。
【００９３】
次にステップ２５０８においてＯpＬist2を対象として交換候補の運用を検索する。この場合の検索条件は、（２）夜入庫場所（予備運用ならば在線場所）が、車両carの第ｉ＋１日目の予約運用の朝出庫場所（在線場所）と等しい、である。検索の結果得られた候補運用をリスト化し、ステップ２５０９においてその先頭要素に対応する車両と車両carのそれぞれｊ日〜ｉ日の間の全ての運用を互いに交換する。これにより接続違反が解消され処理が終了する。
【００９４】
図２３のフローチャートに戻り接続違反解消ロジックの説明を続ける。ステップ２３０９においてバックトラック処理により接続違反を解消した後に、ステップ２３１０で車両リストから車両huを削除して再びステップ２３０２へ戻り処理を繰り返す。
【００９５】
図２２のフローチャートに戻り運用割当部の処理Ｂの説明を続ける。次にサブステップ２２３２において回帰違反解消ロジックを計画の第ｉ日目に適用する。この処理の概要を図２６のフローチャートを用いて説明する。
【００９６】
まずステップ２６０１では、前処理として全ての車両を含むリスト（ＣarＣopyＬist）を作成する。ステップ２６０２では処理の終了判定をおこない、車両リストの要素数が０であれば処理を終了する。そうでない場合にはステップ２６０３に進み、リストの先頭要素の車両（hu）を取りだし、なおかつその車両の第ｉ日目の割り当て運用（ocio）を取得する。ステップ２６０４では運用ocioに関わる制約条件の検出をおこない、ステップ２６０５において検出結果の中に回帰違反が含まれるかどうかを判定する。回帰違反がない場合にはステップ２６０６に進み車両リストから車両huを削除してから、再びステップ２６０２に戻り処理を繰り返す。回帰違反が存在する場合には他の運用との振り替えにより違反の解消をこころみるため、まずステップ２６０７へ進み同じ日の他の運用から振り替え候補を検索する。
【００９７】
運用振り替えの候補となる運用の条件は下記の４点である。
【００９８】
１．朝出庫場所が運用ocioと等しい
２．運用ocioの翌日に運用予約が設定されている場合はその朝出庫場所（在線場所）と夜入庫場所が等しい。
【００９９】
３．翌日に運用予約が設定されていない
４．回帰日数を下回る間隔で列車検査が設定済みである
条件（４）は、例えばある車両が最後に列車検査を受けたのが２日前で、当日列車検査が設定されているといった、設定間隔が回帰日数（３日）ちょうどではない場合が該当する。これらの条件を満たす運用と運用ocioを交換することにより、車両huの回帰違反が解消される。またあらたな接続条件違反が生じることはない。
【０１００】
そこでステップ２６０８で候補の存在の有無を判定し、候補がある場合にはステップ２６０９に進み、候補運用の中で一つ前の列車検査の実施からの経過日数が最も少ないものと運用ocioを交換する。その後はステップ２６０６に進み車両リストから車両huを削除してステップ２６０２へ再び戻る。
【０１０１】
ステップ２６０８において振り替え候補の運用が存在しない場合は、まずステップ２６１０で現在の運用ocioに列車検査を直接設定可能かどうかを判定する。列車検査が設定可能かどうかの判定は、運用ocioにおける在線車庫、在線時間帯を調べ、該当車庫の作業容量とそれまでの検査設定本数を比較することによりおこなう。
【０１０２】
このステップで列車検査を設定可能と判定された場合にはステップ２６１１に進み、運用ocioに対して実際に列車検査を追加設定して回帰違反を解消する。その後はステップ２６０６に進み車両リストから車両huを削除してステップ２６０２へ再び戻る。
【０１０３】
列車検査を設定することができない場合には、列車検査を設定可能な運用を他の車両から探し、その運用と運用ocioを振り替えて列車検査を設定することにより回帰違反の解消を図る。そこでまずステップ２６１２に進み、振り替え候補の運用の検索をおこなう。その際の検索条件は４点あり、そのうちの３点はステップ２６０７における条件（１）から（３）までと同じである。残りのひとつは、（４）列車検査が未設定でなおかつ設定可能、というものである。
【０１０４】
ステップ２６１３は検索結果の判定をおこなう。候補が見つかった場合にはステップ２６１４に進み候補と運用ocioを交換し、さらに列車検査を追加設定することで回帰違反を解消する。その後はステップ２６０６に進み車両リストから車両huを削除してステップ２６０２へ再び戻り処理を繰り返す。候補が存在しない場合には回帰違反の解消をあきらめ、ステップ２６０６に進み車両リストから車両huを削除してステップ２６０２へ再び戻り処理を繰り返す。ここで前日以前に戻って計画を修正するといった、回帰違反を解消するための別の処理を加えても良い。
【０１０５】
図２２のフローチャートに戻り運用割当部の処理Ｂの説明を続ける。次にサブステップ２２３３において列車検査間隔均等化ロジックを計画の第ｉ日目に適用する。この処理は、各車両に対する列車検査の実施間隔をできるだけ均等にするための調整ロジックである。具体的には、ｉ日目において、経過日数が少ないのに列車検査が設定されている車両の運用と、それより経過日数が多いが列車検査が設定されていない車両の運用を交換することにより、列車検査の実施間隔の均等化を図る。
【０１０６】
列車検査間隔均等化ロジックの処理の概要を図27のフローチャートを用いて説明する。まずステップ２７０１において経過日数カウンタｊと車両カウンタｋの値をそれぞれ０に初期化する。次にステップ２７０２において第ｉ日目における車両ｋの運用（ocioとする）を取得し、さらに前回列車検査を実施してから当日までの経過日数（after_days）を算出する。ステップ２７０３では先に算出した経過日数がカウンタｊに等しく運用ocioが列車検査が設定されているかどうかを判定する。
【０１０７】
この結果がＮoの場合は、まずステップ２７０４に進み車両数カウンタｋの値を１増やす。次にステップ２７０５においてｋの値と車両総数を比較し、ｋが車両総数を超えていないならば、ステップ２７０２に再び戻り処理を繰り返す。ｋが車両総数以上ならばステップ２７０６に進み経過日数カウンタｊの値を１増やす。ステップ２７０７ではｊの値と列車検査の回帰日数を比較し、ｊが回帰日数を超えていないならばステップ２７０２に再び戻り処理を繰り返す。ｊが回帰日数以上であれば列車検査間隔均等化ロジックの処理を終了する。
【０１０８】
ステップ２７０３の条件判定処理に戻り説明を続ける。この判定結果がＹesの場合には、まずステップ２７０８に進み車両カウンタｌの値を０に初期化する。次にステップ２７０９において、第ｉ日目の車両ｋ(ｋ＜＞ｌとする）の運用（dest）を取得し、さらに前回列車検査を実施してから当日までの経過日数（after_days2）を算出する。ステップ２７１０において、運用ocioとdestの振り替え可能性を判定する。判定条件は、
１．after_daysよりafter_days2の方が大きい
２．運用ocioと運用destは朝出庫場所（在線場所）が等しい
３．運用ocioと運用destの少なくともどちらかが翌日運用予約ありならば、夜入庫場所（在線場所）が等しい
４．運用destは列車検査未設定
である。
【０１０９】
この判定結果が偽（すなわち振り替え不可能）となった場合には、ステップ２７１１に進み車両カウンタｌの値を１増やし、ステップ２７１２でループの終了判定をおこなう。ｌの値が車両総数を超えていないならば再びステップ２７０９へ戻りループを繰り返す。ｌの値が車両総数以上であればステップ２７０４に進む。それ以降の処理の流れは前記したとおりである。ステップ２７１０の判定結果が真となった場合には、ステップ２７１３に進み実際に運用ocioと運用destを振り替える。その後はステップ２７０４に進み、前記したとおりに処理を繰り返す。
【０１１０】
本実施例においては、列車検査間隔均等化ロジックを適用して処理Ｂを終える。処理Ｂは接続違反解消と回帰違反解消のふたつのロジックを含むことが最低限要求されるが、それ以外に関しては計画作成対象の鉄道路線の実情に応じた調整ロジックを自由に組み込めるものとする。その数や適用順序に関しても同様に計画作成状況に応じて柔軟に設定する。
【０１１１】
図２２のフローチャートに戻り運用割当部の処理の説明を続ける。ステップ２２０４では日付変数ｉの値を１増やし、次のステップ２２０５で処理の終了判定をおこなう。ｉの値が作成日数を下回る場合には翌日部分の運用割当をおこなうために再びステップ２２０２へ戻り処理を繰り返す。ｉの値が作成日数以上となった場合には、それまでに運用割当をおこなって得られた車両運用計画を最終結果として出力して処理を終了する。
【０１１２】
図１に戻り本発明の全体構成の説明を続ける。運用割当部０１１３の実行結果として得られる車両運用計画案は、計画案評価・修正部０１１４に入力されて計画作成者によるチェックを受ける。計画案は図７の車両運用計画のイメージ形式に変換されて表示装置に出力される。車両数が多い、作成期間が長いなどといった原因のために標準サイズでは計画案の一部分しか表示できない場合には、表示倍率を変更することにより、任意の大きさで計画案全体を表示することができる。また、逆に計画案の特定の部分のみを拡大して表示することも可能である。
【０１１３】
本処理ブロックは、この計画案全体を表示する機能に加えて、計画作成者が計画案を様々な角度から検証するための各種情報を提供する（１）運用詳細表示、（２）作業量表示、（３）運用検索、の３つの情報提供機能を備えている。さらには、自動作成された計画案に対して計画作成者が修正を加えるための（１）作業設定、（２）運用交換、（３）運用変更、の３つの手動介入機能を備えている。
【０１１４】
まず、情報提供機能のひとつである運用詳細表示機能について図２８の例を用いて説明する。この機能は、計画案が表示装置に出力されている状態で、マウス等のポインティングデバイスを用いて特定の運用のマス目を指定することにより、該当運用の詳細な内容を表示するものである。図２８の表示部分２８０１は、該当運用の日付および担当する車両番号を示す。表示部分２８０２は図５の運用データのイメージ形式であり、該当運用の視覚的イメージを計画作成者に提示する。表示部分２８０３は該当運用において実施する作業を示すものであり、例では「列車検査を基地Ｙにおいて昼間実施する」と読みとることができる。
【０１１５】
一日の中で複数の作業（各種清掃等）を組み合わせて実施する場合には、全ての予定作業をリスト形式で表示する。表示部分２８０４は各作業の前回実施日からの経過日数を示す。例では「要部検査は１８４日、列車検査は３日、それぞれ経過した」と読みとることができる。表示部分２８０５は、計画案の該当運用に関係する制約条件違反を示す。例では、車両０１は前日の運用で基地Ｘに入庫したにも関わらず、当日基地Ａから出庫するダイヤＤ２が割り当てられているために、接続条件違反をおこしているということが読みとれる。違反が複数ある場合には、それらをリスト化して表示するものとする。計画案全体を表示させて全体の概要を掴むと同時に本機能を用いて各運用の詳細を確認することができるため、計画案の把握を容易にできる。
【０１１６】
次に、作業量表示機能について図２９の例を用いて説明する。本機能は表示装置に計画案全体が表示されている状態で、任意の日付部分をマウス等のポインティングデバイスを用いて指定することにより起動される。ボタン２９０１を押下することにより、表示部分２９０２は該当日における全作業の実施予定総本数が表示される。この中の特定の作業を指定してボタン２９０３を押下することによって、該当作業の各車両基地毎の内訳を表示することができる。例では列車検査の内訳が表示部分２９０５に示されており、「基地Ｘでは昼間１本夜間０本、基地Ｙでは昼間１本夜間１本実施予定」と読みとることができる。ボタン２９０６もしくはボタン２９０７をマウス等で押下することにより、それぞれの車両基地毎の作業予定数が表示部分２９０２に全体本数の場合と同様に表示される。
【０１１７】
図３０は作業量表示機能の別の例であり、先の例がある特定の日における作業情報を計画作成者に提示するのに対して、本機能では計画作成期間全体にわたる各作業の実施量・場所・時間帯の推移をグラフとして示すものである。
【０１１８】
ラベル３００１は情報を表示する作業名を示す。図３０の例では列車検査の情報を表示することが読みとれる。この部分に他の作業名を直接入力したり、リストから選択するなどして表示する情報を切替えることができる。作業情報はグラフ３００２に表示される。これは横軸が日付、縦軸は実施本数の棒グラフであり、実施場所と時間帯が異なる作業を異なる記号（●×等）で表示する。
【０１１９】
作業量表示機能を用いることにより、複数の車両基地で分散して実施される各種作業の内容を包括的に捉えることができると共に、特定の作業に関してその実施場所、時間帯、日付のばらつき具合を視覚的に把握することができるため、作業量・作業内容の側面からの計画案の検証を容易に進めることが可能となる。
【０１２０】
次に、運用検索機能について説明する。本機能は計画作成者による手動修正を支援するための情報提供機能である。後述する運用検索機能や運用変更機能を用いて計画案の修正をする際には、計画作成者はある車両に対して、設定したいと思う運用の理想形を頭の中に描き、それに合うものを計画案の中から探して修正を進めることとなるが、車両数が非常に多くなると適切な運用を効率的に探し出すことが著しく困難になり、作成者にとって相当な負担となる。そこで運用検索機能を用いることにより、求める運用の検索を自動的かつ高速におこなうことで、計画作成者による修正作業の効率を大幅に向上することができる。
【０１２１】
図３１は検索機能の実行結果の一例である。表示部分３１０１には検索の結果、条件にマッチした運用がリストとして表示される。例では４個の運用が表示されている。結果のひとつをマウス等のポインティングデバイスで指定してから、ボタン３１０２を押下することにより前記運用詳細表示機能が起動し、該当運用の内容が計画作成者に提示される。
【０１２２】
計画作成者は運用検索時の検索条件を設定することができる。その条件としては、
１．運転種別（ダイヤ運行か予備か）
２．朝入庫・夜出庫の場所とその時間帯
３．昼入庫の有無とその時間帯
４．特定作業の可能・不可能の指定
５．特定作業の設定・未設定の指定
等が考えられる。検索条件設定用インターフェースの例として、図３２に示す入出庫条件設定インターフェースについて説明する。
【０１２３】
設定項目３２０１は目的運用の昼入庫の有無を設定する部分である。（１）昼入庫がある、（２）昼入庫がない、（３）どちらでもよい、という３種類の指定が可能であり、マウス等のポインティングデバイスを用いてどれかひとつを指定する。例では「昼入庫あり」を検索条件として指定しいることが読みとれる。設定項目３２０２は、朝出庫場所を設定する部分である。特定の場所から出庫する運用を探したい場合には、例に示すようにマウス等を用いてチェックマークを表示し、その名前を直接入力するかリストから選択するなどして表示させる。
【０１２４】
例では、基地Ｙから出庫する運用を指定していることが読みとれる。この項目を設定しない（すなわち朝出庫場所がどんな運用でも良い）場合には、チェックマークを非表示にする。設定項目３２０３及び設定項目３２０４は、それぞれ昼在線場所と夜入庫場所の設定部分であり、操作方法は朝出庫の設定と同じである。例では、昼在線場所は特定せず駅Ｂに入庫する運用を指定していることがわかる。
【０１２５】
こうした設定用インターフェースを各検索条件毎に提供する。これらを用いて条件のカスタマイズをおこない、再検索を繰り返し実行することにより、計画作成者が意図する理想的な運用を計画案の中から効率的に見つけることが可能となる。
【０１２６】
以下では、計画案を修正するための３つの手動介入機能についてそれぞれ説明する。まず、運用の作業予定を変更するための作業設定機能を図３３を用いて説明する。本機能は、計画案において任意の運用を指定した後に起動される。ボタン３３０１とボタン３３０２はそれぞれ設定対象の時間帯を切替えるために用いられる。図３３ではボタン３３０１を押下して昼間の作業時間帯を設定している。運用によっては作業時間帯のどちらか（もしくはどちらも）が存在しない場合があるが、そうした場合には存在しない作業時間帯に対応するボタンは表示されないものとする。
【０１２７】
ラベル３３０３は設定場所を表し、図３３では基地Ｘでの作業設定であることが読みとれる。ラベル３３０４は該当作業時間帯の時刻とその時間間隔を表す。図３３では、１０時１０分から１７時４０分までの４５０分間であることが読みとれる。作業リスト３３０５は該当作業時間帯に追加設定可能な作業をリスト化して表示する。作業リスト３３０６は、該当作業時間帯に既に設定済みの作業をリスト化して表示する。
【０１２８】
作業を追加設定する場合には、作業リスト３３０５から目的の作業を選択し、追加ボタン３３０７を押下することによりその作業が作業リスト３３０５から作業リスト３３０６へ移動する。逆に設定済の作業を運用から削除する場合には、作業リスト３３０６から目的の作業を選択した後に削除ボタン３３０８を押下することにより、該当作業が作業リスト３３０６から作業リスト３３０５へ移動する。
【０１２９】
作業を追加設定したことにより、作業容量や作業時間をオーバーしたり、作業を削除したことにより回帰違反をおこすといった作業設定による状況変化が生じた場合には、ラベル３３０９にその旨のメッセージを表示する。図３３では列車検査を追加設定したことにより、作業容量をオーバーしたことが読みとれる。本機能による作業設定の変更は、計画データに即座に反映され、それに応じて計画案全体の表示や運用の詳細表示等が即座に更新される。制約条件違反が生じた場合には、計画案の該当部分に対する色付け等による通知がおこなわれる。
【０１３０】
次に計画案の任意の日付におけるふたつの運用を交換する運用交換機能について説明する。計画作成者による計画案の修正方法としては様々なものが考えられるが、現在最も一般的で頻繁におこなわれるのは、２つの編成の運用を交換する操作である。例えば車両Ａに対してある特定の日に列車検査を実施したいと作成者が考えた場合、現在の編成Ａの運用に列車検査を追加設定できなければ、Ａの運用と交換可能であり、なおかつ列車検査を設定できる（もしくは設定済みの）ものを選択して交換することで計画を修正しようとする。本機能はこの修正操作の効率的な実行を目的とするものである。
【０１３１】
図３４は運用交換機能のインターフェース例である。本機能は交換したい運用を計画案の中からひとつ選択した後に起動される。予備運用、午前のみ営業運転する運用やダイヤが午前と午後の２つからなる複合型の運用に対しては運用全体の交換の他に午前のみもしくは午後のみといった半日単位の交換も可能であり、図３４のインターフェースを表示する前にあらかじめそうした指定もおこなっておくものとする。本機能の起動時に該当運用とその交換部分から候補の条件を自動的に設定して運用検索機能を実行し、その結果が表示部分３４０１に図３１の運用検索機能の表示フォーマットで示される。自動設定される条件として、交換により制約違反を生じないということが最低限求められる。その他の部分についてはシステム化対象の車両基地や路線の状況等に応じて決定する。本機能の実行時に作成者が検索条件を逐次変更することもできるため、検索を繰り返しながら相手の運用を絞り込んでいくことが可能である。
【０１３２】
表示部分３４０２には指定した交換元運用の内容が、表示部分３４０３には、検索結果の運用をひとつ選択して表示ボタンを押下することにより、該当運用の内容がそれぞれ図２８の運用詳細表示のフォーマットで示される。ふたつの運用を表示した状態で、交換ボタン３４０４を押下することにより運用交換が実施され計画データに即座に反映され、計画案全体表示や運用詳細表示が更新される。制約条件違反が生じた場合には該当部分の色づけやコメント表示により警告が発せられる。一旦交換した運用を元に戻したい場合には、取消ボタン３４０５を押下することにより、即座に修正内容がクリアされ表示も修正前に復帰する。このように本機能を用いることにより修正内容を視覚的に把握しつつ運用交換を試行錯誤的に実行することが可能である。
【０１３３】
次に手動介入機能の３番目として運用変更機能について説明する。本機能は、前述の運用交換機能と類似の機能である。運用交換機能が運用を丸ごと、もしくは車庫に在線している時間帯を境に午前・午後単位で交換するのに対して、運用変更機能を用いれば車両が車庫に在線中か本線上で営業運転中かに一切関係なく、任意の時刻で運用を切断して他の編成の運用と交換することが可能となる。本機能は、営業運転中の車両に故障などが発生して運行が続けられなくなった場合に、車両基地で待機中の予備車両に運行を切替えるといった突発事態に対応するための機能である。操作インターフェースは前記運用交換機能と同じであり、変更相手を絞り込むために運用検索機能も利用することができる。本機能は変更したい運用を計画案の中からひとつ選択した後に起動されるが、その前に運用変更の時刻を指定する操作を必要とする。
【０１３４】
図１に戻り本発明の全体構成の説明を続ける。処理ブロック０１１４の計画案評価・修正部は、上記の情報提供機能と手動介入機能に加えて、計画案の自動作成に必要とされる作業容量、運用予約、調整ロジックの各データを変更するインターフェースを備えており、それらを用いることにより作成者が計画作成の条件を自由に変更可能である。作成者は条件の変更をおこなった後に運用割当部に対して再計画を指示して新たな計画案を得ることができる。このように何度も計画作成を繰り返しながら作成者自身の意図に合った車両運用計画を作成することができる。最終的に作成者の承認を受けた計画案は、正式な車両運用計画としてシステム内に登録されるとともに、計画作成者の指示を受けてプリンタ等の出力装置に帳票形式で印刷される。
【０１３５】
【発明の効果】
本発明によれば、運用計画作成における段階的な作成業務を包括的に扱い運行ダイヤから直接的に運用計画の素案を自動提案でき、また計画作成者が素案に対して多角的な評価お施して効果的な修正をおこなうことができるため、計画作成現場の実情に柔軟に適合した品質の高い運用計画を効率的に作成することが可能となる。
【図面の簡単な説明】
【図１】本発明の実施形態である車両運用計画作成支援のシステム構成図である。
【図２】図１の計画運行ダイヤの説明図である。
【図３】本発明の作業計画のデータ構造を示す図である。
【図４】本発明の運用のデータ構造を示す図である。
【図５】本発明の運用データのイメージ形式を示す図である。
【図６】本発明の車両運用計画のデータ構造を示す図である。
【図７】本発明の車両運用計画のイメージ形式を示す図である。
【図８】本発明の作業容量のデータ構造を示す図である。
【図９】本発明の運用ローテーションパターンの説明図である。
【図１０】本発明の運用ローテーションパターンのデータ構造を示す図である。
【図１１】本発明の運用ローテーションパターンを用いた運用割当の説明図である。
【図１２】本発明の運用ローテーションパターン探索部の処理の流れを示すフローチャートである。
【図１３】本発明の染色体のデータ構造を示す図である。
【図１４】本発明の順序表現変換手続きの処理の流れを示すフローチャートである。
【図１５】本発明の探索パラメータのデータ構造を示す図である。
【図１６】本発明のデコード処理の流れを示すフローチャートである。
【図１７】本発明のパターン評価指標のデータ構造を示す図である。
【図１８】本発明の実施形態の評価情報の表示画面である。
【図１９】本発明の評価指標調整機能のインターフェースを示す図である。
【図２０】本発明の運用割当部の処理概要の説明図である。
【図２１】本発明の調整ロジックのデータ構造を示す図である。
【図２２】本発明の運用割当部の処理の流れを示すフローチャートである。
【図２３】本発明の接続違反解消ロジックの処理の流れを示すフローチャートである。
【図２４】本発明のバックトラック処理の処理概要の説明図である。
【図２５】本発明のバックトラック処理の流れを示すフローチャートである。
【図２６】本発明の回帰違反解消ロジックの処理の流れを示すフローチャートである。
【図２７】本発明の列車検査間隔均等化ロジックの処理の流れを示すフローチャートである。
【図２８】本発明の運用詳細表示機能の起動画面である。
【図２９】本発明の作業量表示機能(日別)の起動画面である。
【図３０】本発明の作業量表示機能(期間全体)の起動画面である。
【図３１】本発明の運用検索機能の起動画面である。
【図３２】本発明の検索条件設定用インターフェースを示す図である。
【図３３】本発明の作業設定機能の起動画面である。
【図３４】本発明の運用交換機能の起動画面である。
【符号の説明】
０１０１…運行ダイヤ、０１０２…作業容量、 ０１０３…探索パラメータ、
０１０４…パターン評価指標、０１０５…運用ローテーションパターン、
０１０６…運用予約、 ０１０７…車両履歴、 ０１０８…調整ロジック、
０１０９…車両運用計画案、 ０１１１…運用ローテーションパターン探索部、
０１１２…運用ローテーションパターン評価・修正部、
０１１３…運用割当部、 ０１１４…計画案評価・修正部、
０１２１…表示装置、 ０１２２…入力装置、 ０１２３…プリンタ。[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a method and apparatus for supporting scheduling work in the field of production and transportation with a computer. Specifically, the present invention relates to a method for planning using a computer, a method for displaying a plan result, a method for correcting a plan result, and a plan. It relates to a method for verifying the results.
[0002]
[Prior art]
Regarding the method or system for planning the daily operation method for operating equipment, regarding the computerization of the vehicle operation planning work in the railway field, it is the standard for daily allocation of operation schedules such as operation schedule and inspection / repair to the vehicle A basic allocation order (referred to as an operation rotation pattern) that is a combination of a probabilistic search technique and an AI-like search technique (see (1) Japanese Patent Application No. 8-131870 application), based on the operation rotation pattern Using a probabilistic search technique to make an operation plan for a certain period of time for all vehicles (see (2) Japanese Patent Application No. 8-109713 application and (3) “Vehicle allocation scheduling in railways”, Tsuchiya et al., Artificial Intelligence, 19933.8) is known.
[0003]
As for (1) and (2), in addition to the automatic planning function for the above-mentioned plan, the planner can change the constraints and evaluation indices for creating the plan or modify a part of the plan Various interfaces (information providing function and manual intervention function) are provided.
[0004]
[Problems to be solved by the invention]
The operation plan for operating equipment is created for the purpose of improving the efficiency of equipment, personnel, and equipment usage while ensuring safe and reliable operations related to the daily maintenance and management of equipment. In recent years, in the field of production and transportation, the planning work has become more complicated as the service for users has been improved and the scope of use has been expanded, and the burden on planners has increased. Since it is becoming increasingly difficult, there is an increasing demand for computerization of conventional manual planning work.
[0005]
The mainstream approach to creating a conventional operation plan is to first create an ideal operation assignment pattern (operation rotation pattern) that serves as a standard for assigning operations to equipment on a daily basis. In order to ensure consistency with the exception part, the operation allocation is performed while adjusting the pattern to obtain the actual plan.
[0006]
In this way, by creating the operation plan in two stages, pattern creation and pattern adjustment, the plan obtained will be of very high quality along the ideal pattern and will always be similar to the pattern. This makes it possible to standardize operational operations. If the daily work contents follow a certain pattern, it is not necessary for the field workers involved in the operation work to learn the work contents every day from the beginning, and mistakes due to memory differences can be greatly reduced. Even if complete patterning is impossible, if the majority of the work is in line with the pattern, it is possible to easily understand the work content simply by focusing on the differences from the pattern. Unlike the scheduling of systems that do not involve humans at all, such as task scheduling inside computers, patterning of the contents of plans is an important concept along with efficiency in various business scheduling in the production and transportation field that assumes human use. It is.
[0007]
In the railway field, the use of the concept of patterning as a constraint for planning can greatly reduce the number of possible combinations and simplify the planning method. Railway companies with large-scale routes actively plan for the concept of patterning.
[0008]
Generally, in the actual planning in each company, the department that creates the operation rotation pattern and the department that assigns the operation may be the same or different, and there is no clear separation. Currently. When the departments are different, the operation rotation pattern is usually created once at the time of the diamond revision at the head office's diagram creation department, and the operation assignment is usually created at each vehicle base on the route that manages and manages vehicles. If the production departments are the same, they are created together at each vehicle base.
[0009]
In the future, when railway companies actively promote improvement of user services and expansion of route scale, etc., they will operate flexibly and efficiently in accordance with changes in various conditions such as vehicle base equipment conditions and vehicle operation modes. Is required to implement. For that purpose, it may be necessary to frequently recreate the reference operation rotation pattern not only at the time of the diamond revision but reflecting the actual situation of each vehicle base where the operation allocation is actually performed. For this reason, it is considered that in the future, it will be mainstream for both railway companies to create both at the depot at the same time, and effectively support the planning work of the creator who is in charge of planning based on such a form of creation. Therefore, the realization of a computer system is a very important issue. However, any of the known examples described above is a method or system for computerizing only one of the plans.
[0010]
In addition, in the above-mentioned known example (3), the time required for planning the operation plan for about 4 weeks satisfies the minimum practicable conditions and is about 3 hours, satisfying many evaluation indicators at a high level. It takes about 16 hours to obtain a high-quality operation plan, and it takes a long time to create a plan, even though the operation rotation pattern is given in advance. There was a problem of waiting. In general, many business plans involving humans have many ambiguities, and there are many conditions related to planning that are difficult to grasp as a category of computerization and systemization. For this reason, a final check by a person in charge of plan creation and a manual fine adjustment are indispensable for the plan automatically created by the planning system, and high responsiveness of the system related to plan creation is required for this realization.
[0011]
The known examples (1) and (2) have an automatic plan creation function. In addition, the plan creator can change the plan creation constraint conditions / evaluation index in the course of planning, or a part of the plan. It has a basic interface (information provision function and manual intervention function) to correct traffic, but the number of vehicles has increased significantly due to expansion of routes, etc., and vehicles are distributedly managed at multiple vehicle bases, etc. If the plan becomes large-scale and complicated, it becomes extremely difficult for the planner to verify the plan and to correct the plan effectively while accurately reflecting his intention. Therefore, there is a need for an information provision function and a manual intervention function for effectively creating and supporting an operation plan corresponding to the number of large-scale vehicles and multiple vehicle bases according to the actual situation of the plan creation site.
[0012]
The object of the present invention is to be able to comprehensively handle stepwise creation processing in the creation of an operation plan, and to efficiently create a high-quality operation plan that is flexibly adapted to the actual situation of a large-scale and complex plan creation site. It is to provide an operation plan creation support system for possible operation equipment.
[0013]
[Means for Solving the Problems]
The purpose is to search and output an operation rotation pattern defined as a basic allocation order of operations for vehicles using an operation schedule as input, and to modify an operation rotation pattern by interactive interaction with a plan creator; Allocate operation to vehicles while partially adjusting the operation rotation pattern, and output the result as a plan, and modify the plan by interactive interaction with the plan creator to create the final plan This is accomplished by creating steps.
[0014]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, a vehicle operation plan creation support system in a railway vehicle base will be described as an embodiment of the present invention.
[0015]
This example is a system that supports vehicle operation work at a railway vehicle base, whether or not each vehicle performs business operation on the main line, which business diagram is responsible for business operation, repair, A vehicle operation plan that represents the daily operation schedule of a vehicle such as when and where maintenance work such as inspection and cleaning is performed for several weeks is created.
[0016]
First, the preconditions for creating a plan are explained. FIG. 2 is an example of an operation schedule that serves as input data for creating a plan. In the figure, six types of diamonds are shown, and numbers that do not overlap each other are given as numbers 0201. The horizontal axis 0202 represents the route operating time zone. A black bar line in each diagram means that a commercial operation is performed on the main line. A circle symbol 0203 indicates a departure from a vehicle base or station indicated by a label 0204, and a triangle symbol 0205 indicates a vehicle base indicated by a label 0206 or Represents arrival at the station. A label 0207 represents the name of a partial diagram constituting the service diagram. For example, the diamond of No. 2 departs from station A after 6 o'clock in the morning, then operates on the main line until around noon and enters the base X (partial diamond D2), and then returns to the main line in the evening. The operation is resumed, and after the day's operation is finished, the goods are finally stored in the base Y (partial diagram D3). As shown in this example, some of the diamonds are once again in the middle of commercial operation and then resume commercial operation after entering the vehicle base. Other, such as the No. 1 diagram, the entire day business operation is performed on the main line. There is also. In the following description, either a diamond number such as diamond 2 or a combination of partial diamond names such as D2-D3 is used in order to specify the operation diagram (diagram 2 and D2-D3 are the same in FIG. 2). ).
[0017]
In order to carry out these service schedules, vehicles are assigned to each schedule daily without any duplication (one-to-one). In addition, because there is a special work that must be done all day long at the depot, and because there is a need to prepare a standby vehicle to cope with sudden situations such as vehicle failure, the total number of vehicles (total number of diamonds) As a spare vehicle that does not carry out business operation, that is, is not assigned a diamond, it will stay at the vehicle base all day. In addition, it is assumed that the allocation of spare vehicles to each vehicle base is determined in advance.
[0018]
FIG. 3 is an example of a work plan showing a schedule of work (hereinafter referred to as long-term work) to be carried out while staying at the vehicle base all day. The item 0301 is an identification number that does not overlap with the others attached to the work target vehicle. An item 0302 represents the type of work to be performed. Item 0303 is a depot for carrying out the work. Item 0304 and item 0305 are the start date and end date of the work, respectively, and the corresponding vehicle will receive a predetermined work while staying at the same vehicle base throughout this period. The work plan related to this long-term work has already been prepared before the operation plan is prepared, and the operation plan needs to be prepared in compliance with this schedule.
[0019]
In addition to long-term work in which a work schedule is planned in advance, there are some short-term work that is performed in a relatively short time, such as several tens of minutes to several hours, such as cleaning and some kind of inspection. These short-term work can also be carried out using the time spent at the vehicle base between commercial operations, so it is possible to carry out the work place, time zone, and simultaneous execution without creating a schedule in advance. Set as part of the operation plan creation, taking into account the number of units. Of these short-term work, the work regression test is called the train inspection (or work inspection). In making the operation plan, each railway company pays close attention so that the interval between train inspections never exceeds the number of days of return.
[0020]
Although there are provisions for the number of days of return for other short-term work, they are used only as a guideline for setting, and are not strict conditions for creating an operation plan. Therefore, in this embodiment, only one train inspection is performed for short-term work for the sake of easy understanding. If there are other short-term work with loose regression conditions, assign all of the above schedules, preliminary, long-term inspections, train inspections, and manually or automatically after considering the number of days of return after the operation plan is completed. You only have to make settings, and the essence of the problem will not change even if you make such a simplification.
[0021]
Next, the vehicle operation plan creation problem is formally defined as follows.
[0022]
The number of vehicles is n, the number of diamonds is m (n> m), and c_i(i = 1,..., n) is a vehicle, d_jLet (j = 1,..., m) be a diamond. Also, considering staying at the depot all day (preliminary) as a special schedule,_{m + 1}, ..., d_nAnd Furthermore, there are k types of work, of which train inspection is w₁, Long-term work₂, ..., w_kAnd However, w_kMeans so-called empty work, and if this is set, nothing needs to be done.
[0023]
Further, if C is a set of vehicles, D is a set of diamonds including a spare, and W is a set of work, the operation allocation of the vehicle is to configure an allocation function f shown below.
[0024]
[Expression 1]
f: C → D × W
However, ∀c_j∀c_j(i, j = 1, ..., n, c_i≠ c_j): F (c_i) = {D, w}, f (c_j) = {D ′, w ′} → d ≠ d ′. A pair of diamond (preliminary) and work, which is the output of the function f, is called operation.
[0025]
With this allocation function, all the schedules including the spares are allocated to the vehicle without any duplication, and any one of the tasks including the empty task is allocated. Also, this allocation function determines the daily operation of all vehicles, and the creation of a weekly operation plan representing the operation content for one week corresponds to each date of the creation period as shown below. It can be regarded as constituting a set F of allocation functions made up of individual elements.
[0026]
[Expression 2]
F = {f₁, f₂, ..., f₇}
FIG. 4 shows a specific data format actually used for planning for the operation {d, w} which is the output of the function f. An item 0401 represents the identification number of the vehicle to be operated. An item 0402 represents a date when the operation is performed. An item 0403 represents an operation schedule or a spare identification symbol to be implemented. In the example, the second schedule (D2-D3) from the top in the list of operation schedules in FIG. An item 0404 represents an operation to be performed. If there is no scheduled work, a null character string “-” corresponding to an empty work is set. An item 0405 is an execution time zone of the corresponding work. In the present embodiment, in order to make the explanation easy to understand, the work execution time zone is divided into two, daytime and nighttime, and information of either “daytime” or “nighttime” is set in this item. Item 0406 is a work place. By the way, diagram 2 in FIG. 2 has entered the base Y once in the daytime, then takes it out again in the evening and conducts commercial operation, so the train inspection incorporated in this operational data can actually be implemented. I know that there is.
[0027]
When short-term work other than train inspection exists and a plurality of them can be implemented, this is dealt with by increasing the number of items 0404, 0405, 0406 according to the number of work.
[0028]
FIG. 5 shows an image format of operational data. The operation image 0501 is a visualization of the operation data in FIG. A label 0503 represents the work content, and represents that the corresponding work is performed in a time zone where the label is located. The operation image 0502 is a visualization of the preliminary operation. A label 0504 indicates that the corresponding operation is a spare and indicates the location of the line, and in the example, indicates that the line is present all day at the base Y. It can also be seen from the work label that the main part inspection is scheduled to be conducted on the day.
[0029]
This image format is used for the detailed display of the operation contents for the plan creator in the plan display / correction unit described below.
[0030]
FIG. 6 shows a data format of a vehicle operation plan to be created by the vehicle operation plan creation support system of the present embodiment. It has a two-dimensional array structure with the date and vehicle number as indexes, and the array element is a pointer to operational data. For example, the pointer 0601 points to the operation data 0602. “The operation content of the vehicle 03 on April 12 is that the operation of the diamond D2-D3 (diagram number 2 in FIG. 2) and the train inspection are performed at the base Y in the daytime. Can be read.
[0031]
FIG. 7 shows an image format of the vehicle operation plan. Similar to the data format, it has a two-dimensional array structure with the date and vehicle number as an index, and each element in the array represents the operation content of one vehicle per day. For example, in the operation content 0701, the upper label 0702 indicates that the responsible diamond of the vehicle is D2-D3 (diamond 2 in FIG. 2), and the lower label 0703 indicates that the train inspection is performed at the vehicle base Y. means. When a spare is assigned to the vehicle, a label “pre” indicating a spare is displayed instead of the diamond name. The operation content 0704 indicates that the main part inspection, which is a long-term operation, is scheduled to be performed.
[0032]
This image format is used to present an outline of the entire operation plan to the plan creator in the plan display / correction unit described below. This allows you to perform multiple tasks on the same day, such as displaying all labels corresponding to the type, or displaying work labels in different colors depending on the base instead of representing the vehicle base as a symbol. Based on the format, various measures may be taken to present appropriate information to the plan creator in an easy-to-understand manner.
[0033]
When creating an operational plan that can be executed, it is required to observe the following constraints.
[0034]
1. Assign the diamond (or spare on line) that departs from the last storage location of the diamond on the previous day (or the location where the line was reserved on the previous day) on the day (connection conditions).
[0035]
2. Set the train inspection within the specified number of return days stipulated by law (regression condition).
[0036]
3. Observe operational reservations obtained from long-term work plans. (Reservation conditions)
The operation reservation in the reservation condition is to designate a part of the operation plan in advance or the designated contents. Formally, if there is a plan for a long-term operation w for a certain vehicle c in the operation plan creation period, prepare a spare d that is connected to the vehicle base where the operation is scheduled to be performed, The output of the allocation function fi for the scheduled date i
[0037]
[Equation 3]
fi (c) = {d, w}
And fixing in advance.
[0038]
In addition to operation reservations obtained from work plans for such long-term work, due to various factors such as changes in the work execution environment and the planner's preference, implementation contents and implementation of short-term work such as implementation schedule and train inspection Operational reservations such as fixing the location can also be considered. For planning, the operation data shown in the figure is used only for the reserved part and is created in advance.
[0039]
In order to create a high-quality vehicle operation plan that can withstand use in actual vehicle operation work, it is required to satisfy a plurality of evaluation indexes at a high level in addition to the above-described constraint conditions. Examples of evaluation indicators are as follows.
[0040]
1. Less work
2. The amount of work does not exceed the work capacity specified for each depot
3. There is no unevenness of work volume by location, date, and time zone
4). Spare allocation intervals for each vehicle are even
5). Same storage location is not continuous
6). Vehicles detained at the station the previous day will be stored at the depot on the day.
7). Perform commercial operation the day after the long-term work ends
8). The mileage of all vehicles is uniform
The work capacity is defined as the number of work that can be performed simultaneously with the workable time zone in each vehicle base for all work that can be performed. For long-term work, the work plan was created before the operation plan was created, and the only work that should be taken into account when creating the operation plan is the train inspection. In the example, only train inspection).
[0041]
FIG. 8 shows an example of work capacity for short-term work. In the present embodiment, the time zone is roughly divided into two, and the detailed time, work required time, and number of simultaneous executions are set for each vehicle base. However, the work time zone may be further increased.
[0042]
An item 0801 represents the type of work, and in the example, indicates work capacity related to train inspection. If it is necessary to set various types of cleaning in addition to train inspection at the time of creating the operation plan, create a work capacity similar to the work capacity related to train inspection in the figure in advance and use it to satisfy the capacity condition. Set work settings. An item 0802 represents a vehicle base that performs the corresponding work. Item 0803 and item 0804 represent the number of simultaneous executions in the daytime and nighttime, respectively, and when the work is set exceeding the number shown here, a capacity condition violation occurs. Item 0805 and item 0806 represent the time required for work in each work time zone. Item 0807 and item 0808 represent the earliest start time and latest end time of daytime work, respectively, and similarly item 0809 and item 0810 represent the earliest start time and latest end time of night work.
[0043]
Since some of the evaluation indicators are in a trade-off relationship with each other, it is necessary to create a plan while skillfully balancing the two in consideration of priority. In addition, since the evaluation index and its weight vary depending on the vehicle operation policy and plan creator at each depot, it is essential to implement a flexible planning algorithm that does not assume a fixed evaluation index. is there.
[0044]
Below, the basic concept of vehicle operation plan creation in the present invention will be described.
[0045]
Needless to say, the most important purpose of creating the vehicle operation plan is to improve the efficiency of the operation work, but patterning of the operation work is also one of the important viewpoints in creating the plan. If the daily work contents follow a certain pattern, it is not necessary for the field workers involved in the operation work to have trouble learning the work contents from the beginning, and the mistakes caused by the noble town can be greatly reduced. Even if a complete pattern is impossible, if the majority of the business is in line with the pattern, the business content can be easily understood simply by focusing on the differences from the pattern. Unlike scheduling of systems that do not involve humans, such as task scheduling inside computers and FMS (Flexible Manufacturing System) scheduling in the production field, services such as various business scheduling and transportation schedule creation that are generally premised on human use In scheduling, patterning is an important concept along with efficiency.
[0046]
Therefore, in the present invention, the operation plan creation processing includes (1) an operation rotation pattern creation unit that represents an ideal pattern of operation work, and (2) an operation that actually allocates operations to vehicles while adjusting the patterns. By making a plan by dividing into two stages of the allocation unit, the business pattern is realized.
[0047]
FIG. 9 shows an example of the operation rotation pattern in the present embodiment. The operation rotation in the present embodiment is a cyclic assignment order of operations for one vehicle when it is assumed that there is no operation reservation for long-term work or the like. In FIG. 9, it is assumed that an operation 0901 is assigned to a certain vehicle on the first day of the plan creation period. From the next day onward, in accordance with the arrows indicating the operation allocation order for the corresponding vehicle, the operations 0902, 0903, 0904, 0905, 0906, 0907, 0908, return to 0901, and so on will be performed sequentially. Thus, it is possible to completely satisfy the connection conditions and the regression conditions among the above-mentioned constraints. In addition, there is a merit that mileage can be made uniform by assigning operations in accordance with this order to all vehicles, so that various evaluation indexes required for vehicle operation plans can be satisfied at a high level. it can.
[0048]
The data format of the operation rotation pattern is shown in FIG. It has a one-dimensional array structure, and the array element is a pointer to operational data. The order of element arrangement corresponds to the order in which operations are assigned. In the figure, the second pointer 1001 in the array points to the operation 1002. For each operational data, no data is set in the vehicle number and date part, and instead, a null character string “-” or the like indicating empty data is set. The number of elements is equal to the total number of diamonds including spares, and the diamonds (spare) included in each operation are different from each other.
[0049]
Since all the diamonds and spares are included in the pattern without overlap, the operation rotation pattern represents the ideal allocation order for one vehicle and at the same time represents the daily operation contents for all vehicles. Therefore, as shown in FIG. 11, assuming an ideal situation where there is no long-term work schedule, it is possible to achieve high quality by simply applying the operation rotation pattern by shifting the allocation start position for all vehicles. A vehicle operation plan can be obtained.
[0050]
Naturally, there is almost no situation where there is no long-term work schedule for two weeks, and it is usually necessary to perform long-term work on several vehicles. There is also a situation where an implementation schedule is designated in advance for a specific vehicle. Since it is required to satisfy the reservation conditions related to such various operation reservations, in order to actually balance with the operation reservations, it is necessary to partially disrupt the operation rotation pattern and perform operation allocation. come. This process is performed to adjust the rotation pattern. First, the operation is forcibly assigned to vehicles with operation reservations, and the rotation pattern is not broken as much as possible for the remaining vehicles. In addition, operation allocation is performed while making adjustments so as not to violate the constraint conditions. The vehicle operation plan thus obtained is a high-quality plan that resembles an ideal operation rotation pattern.
[0051]
In the following, the components of the present invention will be described with reference to FIG.
[0052]
First, the outline of the operation rotation pattern search unit 0111 will be described with reference to the flowchart of the drawing. In this embodiment, the search algorithm is configured using a genetic algorithm (Genetic Algorith, hereinafter referred to as GA) framework, but the tabu search method is an improved algorithm of linear programming (LP), local search, and local search. Other iterative refinement algorithms that use an externally changeable evaluation index, such as an annealing method or an annealing method, may be used.
[0053]
In step 1201, the generation number counter i is initialized to 1. In step 1202, a group of chromosomes to be subjected to GA genetic manipulation is generated. The chromosome structure uses an order expression that directly reflects the schedule (order) of operation schedules and spares in the operational rotation pattern. FIG. 13 shows the chromosome data format. If the total number of schedules and spares is N, the chromosome is a one-dimensional array composed of N numbers. However, the i-th element q in the array_iIs 1<= Q_i <= An integer value satisfying N−i + 1.
[0054]
Give each diamond or spare a number from 1 to N without duplication, d_i(1<= I<Assuming that = N) represents the diagram or reserve of number i, the sequence of operation diagrams and reserves can be obtained from the chromosome (order representation) using the sequence representation conversion procedure shown in the flowchart of FIG.
[0055]
First, in step 1401, a sequence S1 is prepared in which operation schedules and spares to be rearranged are arranged in numerical order. In step 1402, an empty sequence S2 for storing the rearrangement result is generated. In step 1403, the value of index i for extracting an element from the chromosome is initialized to 1. Steps 1401 to 1403 are rearrangement preprocessing.
[0056]
Next, in step 1404, the value of the element qi is obtained from the chromosome (order expression) using the index i, and the qi-th element is extracted from the head of the sequence S1 using that as an index (the extracted element is deleted from S1). Then, the value is added to the end of the sequence S2. In step 1405, the value of index i is incremented by 1, and in step 1406, the end of processing is determined. If i exceeds the total number N of elements, the process is terminated. The finally obtained sequence S2 is a sequence of diamonds and spares in the operation rotation pattern. If i is less than or equal to N, the process returns to step 1404 and is repeated.
[0057]
Returning to FIG. The number of chromosomes generated in step 1202 is defined by the item 1501 in the search parameter whose data format is shown in FIG.
[0058]
Next, in step 1203, an operational rotation pattern is constructed from each generated chromosome (decoding process). The outline of the processing is as follows: (1) Obtaining a sequence of diamonds and reserves using the sequence representation conversion procedure of FIG. 14, and (2) Train inspection so that the regression conditions are satisfied for the diamonds and reserves arranged according to the sequence. Is to set.
[0059]
The flow of the decoding process will be described in more detail using the flowchart of FIG. In step 1601, a sequence of diamonds and spares is constructed for each chromosome using the sequence representation conversion procedure shown in the figure. In step 1602, a position variable i indicating the position of interest in the diamond and spare line is initialized to 1. In step 1603, train inspection is set at intervals of the number of days of return (3 days) with respect to the arrangement of diamonds and spares with the variable i as the start position. i is incremented by one, and if a diamond or spare that cannot be set for train inspection is encountered on the way, the process ends and the process proceeds to step 1604. If i exceeds the total number of diamonds and spares, the train and diamonds set for train inspection are converted into the data format of the operational rotation pattern shown in the figure, output as the final result, and the entire process is terminated.
[0060]
In the subsequent steps, as an alternative when the train inspection cannot be set at the interval of the return days in step 1603, the diagram or spare that can be set for the train inspection is searched backwards, and the elements found as a result are inspected. Is set (backtrack processing). In step 1604, the value of i is stored in the position saving variable x. In step 1605, the value of the variable i is used as the start position, and the list is traced backward to search for a schedule or spare that can be set for train inspection. If such an element is found, the train inspection is set back to the already set element, or the process ends when the top of the list is returned. In step 1606, it is determined whether or not an element capable of setting train inspection has been found in the previous step. If found, the train inspection is actually set for the element, the process proceeds to step 1609, the value of i is incremented by 1, and the process returns to step 1603. If no settable element is found, the process proceeds to step 1607 to set the value of the position variable next to the start point of the backtrack process, and the process returns to step 1603.
[0061]
Judgment whether train inspection can be set is performed by checking the current garage and the current time zone in the corresponding diamond or spare, and comparing the work capacity of the corresponding garage with the number of inspection settings so far.
[0062]
In this process, when the train inspection cannot be set at the interval of the return days, backtracking is performed and the setting within the return days is attempted, but it fails and the return days are exceeded (an invalid operation rotation pattern occurs). It can happen. Returning to FIG. 12, the description of the operation rotation pattern search unit will be continued. In step 1204, two constraint conditions of connection conditions and regression conditions and the degree of satisfaction of various evaluation indexes set in advance are checked against the operation rotation pattern obtained in step 1203. An evaluation function is set in advance for each constraint condition and evaluation index, and at the time of evaluation, the function value is obtained by applying them to the operation rotation pattern, and the evaluation value is calculated by taking all of the weighted sums. .
[0063]
[Expression 4]

[0064]
The evaluation function of each constraint condition and the evaluation index is a penalty function in which the value is 0 when it is completely satisfied and the value increases as the degree of satisfaction decreases. For example, the following function can be given to the evaluation index “the number of inspection setting is small”.
[0065]
[Equation 5]
F number of inspections (r) = (number of inspection settings for r)-(minimum number of inspections)
Here, the minimum number of inspections = total number of vehicles / return days
The evaluation function for calculating the evaluation value and its weight are summarized as a pattern evaluation index shown in FIG. An item 1701 is the name of an evaluation index including a constraint condition. An item 1702 is a logical value indicating whether or not the evaluation index is valid, and means true if it is true and invalid if false. An item 1703 represents the weight of each index, and is set so that the sum of the weights of all the effective evaluation indices is 1. For an invalid evaluation index, a special null character “-” or the like indicating that there is no value is set. An item 1704 is a pointer to a processing routine corresponding to the evaluation function. At the time of evaluation of the operation rotation pattern, the pattern evaluation index is referred to, and the processing corresponding to the mathematical formula is performed using all the effective indexes to calculate the evaluation value.
[0066]
Returning to FIG. 12, the description of the operation rotation pattern search unit will be continued. In step 1205, the value of the generation number counter i is incremented by one. In step 1206, the end of the process is determined. When the generation number counter i exceeds the number of generations of the item 1504 in the search parameter of FIG. 15, the operation rotation pattern obtained in the final generation is output and the process is terminated. If not, the process proceeds to Step 1207, where natural selection processing is performed on the chromosome group. In this embodiment, the evaluation value of each chromosome is referred to, and the chromosomes are deleted in the order shown in the search rate of the item 1502 in the search parameter of FIG.
[0067]
In step 1208, crossover processing is performed on the chromosome group. In this embodiment, two chromosomes are selected at random from the excellent chromosomes remaining in the natural selection, and new chromosomes are generated by orthodox one-point crossover with the two as parents. One-point crossover is a process in which a parent chromosome is cut at an arbitrary point on the sequence and the subsequent sequences are exchanged with each other.
[0068]
In step 1209, mutation processing is performed on the chromosome group. The chromosome genes are stochastically changed according to the mutation rate of the item 1503 in the search parameters of FIG. Assuming that the chromosome gene length (total number of diamonds and spares) is N, in order to prevent the appearance of a lethal gene, when changing the i-th gene qi of the sequence representing the chromosome, the range is 1<= Qi<= N-i + 1.
[0069]
Thereafter, the process returns to step 1203 and the process is repeated.
[0070]
Returning to FIG. 1, the description of the overall configuration of the present invention will be continued. The operation rotation pattern 0105 obtained as an execution result of the operation rotation pattern search unit 0111 is input to the operation rotation pattern evaluation / correction unit 0112 and is checked by the plan creator. At the time of processing start, each operation in the pattern is converted to the image format of the operation data in the figure for the one with the highest evaluation value (that is, the highest quality) in the obtained operation rotation pattern. Output to the display device in order. Another operation rotation pattern can be designated and output to the display device using a pointing device such as a mouse or an input device such as a keyboard.
[0071]
This processing block has various information providing functions and manual intervention functions for pattern evaluation and correction by the planner. First, the constraint condition of the operational rotation pattern output to the display device and the degree of satisfaction of the evaluation index can be digitized as evaluation information and output to the display device. FIG. 18 shows an example of evaluation information. Each item corresponds to an evaluation item in the pattern evaluation index of the figure, item 1801 indicates that there is no connection condition violation, item 1802 indicates that there is one regression condition violation, and item 1803 indicates the number of inspections set. Item 1804 indicates that the variation in the interval of appearance of the preliminary operation in the operation sequence in the pattern is 2.0 days in standard deviation, and item 1805 indicates the same appearance interval of the operation that performs the daytime entry. The item 1806 has an index indicating whether train inspection is set in a well-balanced manner for the garage / time zone, and the index is 5.41% (the smaller the better the balance). , Respectively.
[0072]
By using the evaluation information together with the operation rotation pattern, the plan creator can quickly and accurately perform the search result verification. In addition, this processing block has a function to make various adjustments such as adding / deleting evaluation items and changing weights, so that the evaluation index can be changed and the operation rotation pattern can be searched again later. .
[0073]
FIG. 19 shows an example of an interface of the evaluation index adjustment function. A check mark 1901 indicates that the corresponding evaluation item is valid. Display / non-display of the check mark can be switched by pressing an arbitrary position of a rectangle surrounding the area where the check mark is displayed with a pointing device such as a mouse. When evaluating an operational rotation pattern with a certain evaluation item removed, if the check mark corresponding to the corresponding evaluation item is set to non-display, the valid flag of the corresponding item in the pattern evaluation index in the figure changes to False. The gauge 1902 displays the weight of the corresponding evaluation item visually and in an easily understandable manner. The position of the triangle mark 1903 represents the current weight size. The weight can be changed by sliding the triangle mark using a pointing device such as a mouse. The value of the weight in the pattern evaluation index in the figure changes according to the degree of the slide.
[0074]
In addition to the evaluation index adjustment function described above, the plan creator also has a function for adjusting the search parameters. This is achieved by outputting the search parameters shown in FIG. 15 to the display device and providing an interface for the plan creator to directly change the values using various input devices such as a mouse and a keyboard.
[0075]
By adjusting the evaluation index and the search parameter and performing the search again and again, the plan creator can create an operation rotation pattern that suits the creator's own intention while repeating trial and error. The pattern finally approved by the creator is registered in the system as data to be used in the subsequent operation rotation pattern adjustment section (plan creation section). In some cases, it is printed in a form on a printer or the like in response to an instruction from the plan creator.
[0076]
Returning to FIG. 1, the description of the overall configuration of the present invention will be continued. The operation allocation unit 0113 creates a vehicle operation plan for a certain period using the operation rotation pattern approved by the plan creator through the operation rotation pattern evaluation / correction unit 0112.
[0077]
FIG. 20 shows an outline of the processing of this block. Starting from the first day of creation, operation allocation for each vehicle is performed sequentially along the date. The creation of a plan for each day consists of two stages of processing A for creating a template of the plan for the day and processing B for adjusting the result.
[0078]
The outline of the process A is as follows.
[0079]
1. Operational allocation in rotation order
For each vehicle, the position in the operation rotation pattern assigned on the previous day is checked, and the next operation is sequentially assigned.
[0080]
2. Ensuring consistency with operation reservations through operation transfer
If a vehicle has an operation reservation on that day, simply assigning the operation according to the rotation will assign an operation completely different from the planned operation. Therefore, after assigning once according to the rotation, the operation assigned to the vehicle with the operation reservation and the operation to be originally set are transferred. This ensures consistency with the operation reservation.
[0081]
With the above processing, it is possible to create a vehicle operation plan that is consistent with the operation reservation without breaking the ideal operation rotation pattern as much as possible. However, as a result of disrupting the operation allocation in the rotation pattern order even partly, some of the constraint conditions and evaluation indices that the rotation pattern has satisfied are not satisfied. Can not be.
[0082]
Therefore, in addition to the above processing A, by applying various adjustment logics for the purpose of eliminating constraint violations and improving the degree of satisfaction of evaluation indices in the daily operation allocation, it is possible to withstand use in actual operation. A level vehicle operation plan is created (Process B). FIG. 21 shows the data format of the adjustment logic. An item 2101 represents the name of the logic. An item 2102 is a field for setting the logic application order, and processes are executed in order from the smallest numerical value. The two adjustment logics for eliminating connection violations and regression violations are indispensable logics, and execute processing before applying other logic. A null character “-” or the like representing empty data is set in the items of the application order corresponding to them. An item 2103 is a pointer to the processing routine of the adjustment logic.
[0083]
In the process B, first, the constraint violation is resolved by the essential constraint satisfaction logic, and then the quality improvement logic is sequentially applied according to the application order. Some reconciliation logic may go back to the previous day and recreate the assigned part if the goal cannot be achieved with just the current reconciliation.
[0084]
The outline of the processing of the operation allocation unit will be described with reference to the flowchart of FIG. First, in step 2201, the value of the date variable i is initialized to zero. In step 2202, the i-th rotation assignment and operation transfer, that is, the processing A is performed. Next, in step 2203, the adjustment process on the i-th day of the plan, that is, the process B is performed. In this embodiment, the following description will be made assuming that in addition to two adjustment logics for eliminating constraint violations, an inspection interval equalization logic for quality improvement is applied.
[0085]
In process B, first, connection violation elimination logic is applied in step 2231. The outline of the process will be described with reference to the flowchart of FIG. First, in step 2301, a list including all vehicles is created as preprocessing. In step 2302, it is determined whether or not to end the process. If the number of elements in the vehicle list is 0, the process ends. If not, the process proceeds to step 2303, the vehicle (hu) of the head element of the list is taken out, and the allocation operation (ocio) on the i-th day of the vehicle is acquired. In step 2304, a constraint condition related to the operation ocio is detected, and in step 2305, it is determined whether or not a connection condition violation is included in the detection result. If there is no connection violation, the process proceeds to step 2310 to delete the vehicle hu from the vehicle list and returns to step 2302 again. If there is a connection violation, in order to resolve the violation by transferring to another operation, the process first proceeds to step 2306 to search for transfer candidates from other operations on the same day.
[0086]
A connection violation occurs when there is an operation reservation the next day, and the delivery location in the morning (the location in the case of standby operation) and the night entry location of the operation ocio (the location in the case of standby operation) are different. Therefore, the search condition is
1. Morning shipping location is equal to operation ocio
2. The morning departure place reserved at the next day is the same as the night entry place.
These are the above two points.
[0087]
By exchanging the operation and the operation ocio that satisfy these conditions, the connection violation of the vehicle hu is eliminated. This does not cause a new connection condition violation. In step 2307, it is determined whether or not there is a candidate. If there is a candidate, the process proceeds to step 2308 to exchange the candidate operation and the operation ocio to eliminate the connection condition violation. Thereafter, the process proceeds to step 2310, where the vehicle hu is deleted from the vehicle list and the process returns to step 2302.
[0088]
If no candidate is found by the operation search, the process proceeds to step 2309. Here, it tries to eliminate the violation of the connection condition by returning to the plan before the previous day and making corrections. This processing is called backtrack processing.
[0089]
FIG. 24 is a creation image of backtrack processing. If connection violations cannot be resolved by daily operation transfer, the violations can be resolved by exchanging the operations for several consecutive days. Assuming that the date of interest is the i-th day, it searches backward for an exchangeable operation partial sequence that satisfies the following conditions while returning to the next day.
[0090]
1. The morning departure location of the first operation in the partial series (the location of the current line in the case of preliminary operation, the same applies below) is the same as the morning departure location of the first operation in the partial series of the vehicle that caused the violation.
2. The night entry location of the last operation of the sub-series (the location of the current line in the case of standby operation) is equal to the morning delivery location of the reservation operation the next day (the location of the current line in the case of standby operation).
The connection violation can be resolved by exchanging the partial sequence of the operation that satisfies these conditions and the partial sequence of the vehicle in which the violation occurred in the same period. This also does not cause a new connection violation.
[0091]
The outline of the backtrack processing will be described with reference to the flowchart of FIG. Assume that the operation ocio on the i-th day of the vehicle car violates the connection and there is no transfer candidate. First, in step 2501, the value of the date counter j is initialized to i-1. In step 2502, the operation on the j-th day of the vehicle car (this is set to op1) is acquired, and the operation on the j-th day is acquired from all the vehicles excluding the vehicle car to create a list (OpList). Next, in step 2503, the operation of the exchange candidate is searched from OpList, and the results are collected to form a list (ResultList). The search conditions are (1) operation where the morning shipping location is equal to op1.
[0092]
This search result is determined in step 2504. If there is no candidate, the process proceeds to step 2505 to return to the previous day and perform the violation elimination process, and j = j−1. In step 2506, the end of processing is determined. If j <0 (that is, less than the first creation date), the process is terminated. Otherwise, return to step 2502 and repeat the process. If there is an exchange candidate, the process proceeds to step 2507. Here, the vehicles corresponding to the exchange candidates are acquired, and the operation on the i-th day of those vehicles is acquired to create a list (OpList2).
[0093]
Next, in step 2508, the operation of the exchange candidate is searched for OpList2. The search conditions in this case are (2) The night entry location (the location where the vehicle is reserved) is equal to the morning delivery location (the location where the vehicle is located) of the reservation operation on the i + 1th day of the vehicle car. Candidate operations obtained as a result of the search are listed, and in step 2509, all operations between day j and day i of the vehicle and vehicle car corresponding to the head element are exchanged with each other. This eliminates the connection violation and ends the process.
[0094]
Returning to the flowchart of FIG. 23, the description of the connection violation elimination logic will be continued. In step 2309, after the connection violation is eliminated by the backtrack process, the vehicle hu is deleted from the vehicle list in step 2310, and the process returns to step 2302 again to repeat the process.
[0095]
Returning to the flowchart of FIG. 22, the description of the process B of the operation allocation unit will be continued. Next, in substep 2232, regression violation resolution logic is applied on the i-th day of the plan. The outline of this process will be described with reference to the flowchart of FIG.
[0096]
First, in step 2601, a list (CarCopyList) including all vehicles is created as preprocessing. In step 2602, it is determined whether or not to end the process. If the number of elements in the vehicle list is 0, the process ends. If not, the process proceeds to step 2603, where the vehicle (hu) of the head element of the list is taken out, and the allocation operation (ocio) of the vehicle on the i-th day is acquired. In step 2604, a constraint condition related to the operation ocio is detected, and in step 2605, it is determined whether or not a regression violation is included in the detection result. If there is no regression violation, the process proceeds to step 2606 to delete the vehicle hu from the vehicle list, and then returns to step 2602 again to repeat the processing. If there is a regression violation, in order to resolve the violation by transferring to another operation, the process first proceeds to step 2607 to search for transfer candidates from other operations on the same day.
[0097]
There are the following four conditions for operation as candidates for operation transfer.
[0098]
1. Morning shipping location is equal to operation ocio
2. If an operation reservation is set on the day after the operation ocio, the morning departure place (the place where the line is located) and the night entry place are the same.
[0099]
3. Operation reservation is not set the next day
4). Train inspection has been set at intervals less than the number of return days
The condition (4) corresponds to a case where the set interval is not exactly the number of days of return (3 days), for example, that a certain vehicle has undergone a train inspection last two days ago and that day train inspection is set. By exchanging the operation and the operation ocio that satisfy these conditions, the regression violation of the vehicle hu is eliminated. Also, no new connection condition violation will occur.
[0100]
Therefore, in step 2608, it is determined whether or not there is a candidate. If there is a candidate, the process proceeds to step 2609, where the operation ocio is exchanged for the candidate operation with the least number of days elapsed since the previous train inspection. To do. Thereafter, the process proceeds to step 2606, where the vehicle hu is deleted from the vehicle list and the process returns to step 2602 again.
[0101]
If there is no transfer candidate operation in step 2608, it is first determined in step 2610 whether train inspection can be directly set in the current operation ocio. Judgment whether train inspection can be set is performed by checking the line garage and the line time zone in the operation ocio and comparing the work capacity of the garage with the number of inspection settings so far.
[0102]
If it is determined in this step that the train inspection can be set, the process proceeds to step 2611 to actually set additionally the train inspection for the operation ocio to eliminate the regression violation. Thereafter, the process proceeds to step 2606, where the vehicle hu is deleted from the vehicle list and the process returns to step 2602 again.
[0103]
When the train inspection cannot be set, an operation capable of setting the train inspection is searched for from other vehicles, and the operation violation and the operation ocio are changed to set the train inspection to eliminate the regression violation. Therefore, first, the process proceeds to step 2612 to search for the operation of the transfer candidate. There are four search conditions at that time, three of which are the same as the conditions (1) to (3) in step 2607. The other one is that (4) train inspection is not set yet can be set.
[0104]
In step 2613, the search result is determined. If a candidate is found, the process proceeds to step 2614, the candidate and the operation ocio are exchanged, and the regression violation is resolved by additionally setting a train inspection. Thereafter, the process proceeds to step 2606, the vehicle hu is deleted from the vehicle list, the process returns to step 2602 again, and the process is repeated. If no candidate exists, the cancellation of the regression violation is given up, the process proceeds to step 2606, the vehicle hu is deleted from the vehicle list, and the process returns to step 2602 again to repeat the process. Here, another process for resolving the regression violation, such as returning to the previous day and correcting the plan, may be added.
[0105]
Returning to the flowchart of FIG. 22, the description of the process B of the operation allocation unit will be continued. Next, in sub-step 2233, train inspection interval equalization logic is applied on the i-th day of the plan. This process is an adjustment logic for making the train inspection intervals for each vehicle as uniform as possible. Specifically, on the i-th day, by exchanging the operation of a vehicle for which the train inspection is set although the number of elapsed days is small and the operation of the vehicle for which the number of elapsed days is greater but the train inspection is not set , Equalize the intervals between train inspections.
[0106]
An outline of the processing of the train inspection interval equalization logic will be described with reference to the flowchart of FIG. First, in step 2701, the values of the elapsed day counter j and the vehicle counter k are initialized to 0, respectively. Next, in step 2702, operation of the vehicle k on the i-th day (referred to as ocio) is acquired, and the number of days (after_days) from the previous train inspection to the current day is calculated. In step 2703, it is determined whether the elapsed time calculated earlier is equal to the counter j and the operation ocio is set to train inspection.
[0107]
If the result is No, the process first proceeds to step 2704 and the value of the vehicle number counter k is incremented by one. Next, in step 2705, the value of k is compared with the total number of vehicles. If k does not exceed the total number of vehicles, the process returns to step 2702 and the process is repeated. If k is equal to or greater than the total number of vehicles, the process proceeds to step 2706 and the value of the elapsed day counter j is incremented by one. In step 2707, the value of j is compared with the number of days of return for train inspection. If j does not exceed the number of days of return, the process returns to step 2702 and the process is repeated. If j is equal to or greater than the number of days of return, the train inspection interval equalization logic process is terminated.
[0108]
Returning to the condition determination process in step 2703, the description will be continued. When the determination result is Yes, the process proceeds to step 2708 to initialize the value of the vehicle counter 1 to 0. Next, in step 2709, the operation (dest) of the vehicle k (k <> l) on the i-th day is acquired, and the elapsed days (after_days2) from the previous train inspection to the current day are calculated. . In step 2710, it is determined whether the operation ocio and dest can be transferred. Judgment condition is
1. after_days2 is greater than after_days
2. Operation ocio and operation dest have the same morning shipping location
3. If at least one of operation ocio or operation dest has an operation reservation for the next day, the night warehousing location (the location on the line) is the same.
4). Operation dest is not set for train inspection
It is.
[0109]
If the determination result is false (that is, transfer is impossible), the process proceeds to step 2711, where the value of the vehicle counter l is incremented by 1, and the loop end determination is performed in step 2712. If the value of l does not exceed the total number of vehicles, the process returns to step 2709 again to repeat the loop. If the value of l is equal to or greater than the total number of vehicles, the process proceeds to step 2704. The subsequent processing flow is as described above. If the determination result in step 2710 is true, the process proceeds to step 2713, and the operation ocio and operation dest are actually transferred. Thereafter, the process proceeds to step 2704 and the process is repeated as described above.
[0110]
In this embodiment, the train inspection interval equalization logic is applied to finish the process B. The process B is required to include at least two logics for eliminating connection violations and regression violations, but in other cases, adjustment logic according to the actual situation of the railway to be created can be freely incorporated. Similarly, the number and application order are set flexibly according to the plan creation situation.
[0111]
Returning to the flowchart of FIG. 22, the description of the processing of the operation allocation unit will be continued. In step 2204, the value of the date variable i is incremented by 1, and in the next step 2205, the end of processing is determined. If the value of i is less than the number of creation days, the process returns to step 2202 again to repeat the operation allocation for the next day portion. When the value of i is equal to or greater than the number of creation days, the vehicle operation plan obtained through the operation allocation so far is output as the final result, and the process is terminated.
[0112]
Returning to FIG. 1, the description of the overall configuration of the present invention will be continued. The vehicle operation plan draft obtained as the execution result of the operation allocation unit 0113 is input to the plan plan evaluation / correction unit 0114 and checked by the plan creator. The plan is converted into the image format of the vehicle operation plan of FIG. 7 and output to the display device. If only a part of the plan can be displayed with the standard size due to a large number of vehicles or a long preparation period, the entire plan can be displayed at an arbitrary size by changing the display magnification. it can. Conversely, only a specific part of the plan can be enlarged and displayed.
[0113]
In addition to the function of displaying the entire plan, this processing block provides various information for the plan creator to verify the plan from various angles. (1) Operation details display, (2) Work amount display , (3) Operation search, and three information providing functions are provided. Furthermore, it has three manual intervention functions: (1) work setting, (2) operation replacement, and (3) operation change for the plan creator to correct the automatically created plan.
[0114]
First, an operation detail display function which is one of information providing functions will be described with reference to an example of FIG. This function displays the detailed contents of the corresponding operation by designating a specific operation cell using a pointing device such as a mouse while the plan is being output to the display device. A display portion 2801 in FIG. 28 shows the date of the corresponding operation and the vehicle number in charge. The display portion 2802 is the image format of the operation data in FIG. 5, and presents a visual image of the operation to the plan creator. A display portion 2803 indicates an operation to be performed in the corresponding operation. In the example, it can be read that “train inspection is performed in the daytime at the base Y”.
[0115]
When a plurality of operations (various cleanings, etc.) are performed in combination during the day, all scheduled operations are displayed in a list format. A display portion 2804 indicates the number of days that have elapsed since the previous execution date of each operation. In the example, it can be read that “the main part inspection has passed 184 days and the train inspection has passed 3 days”. A display portion 2805 indicates violation of constraint conditions related to the corresponding operation of the plan. In the example, it can be read that although the vehicle 01 has entered the base X during the previous day's operation, the diamond D2 to be delivered from the base A on that day is assigned, so that the connection condition is violated. If there are multiple violations, they shall be listed and displayed. Since the entire plan can be displayed to get an overview of the entire plan and at the same time the details of each operation can be confirmed using this function, it is easy to grasp the plan.
[0116]
Next, the work amount display function will be described with reference to the example of FIG. This function is activated by designating an arbitrary date part using a pointing device such as a mouse while the entire plan is displayed on the display device. When a button 2901 is pressed, the display portion 2902 displays the total number of scheduled executions of all work on the corresponding day. By specifying a specific work among them and pressing a button 2903, a breakdown of each work base for each work can be displayed. In the example, the breakdown of the train inspection is shown in the display portion 2905, and it can be read that "one schedule is scheduled for one day at night at Base X, and one schedule is scheduled for one day at night at Base Y". When the button 2906 or the button 2907 is pressed with a mouse or the like, the planned number of work for each vehicle base is displayed on the display portion 2902 as in the case of the total number.
[0117]
FIG. 30 shows another example of the work amount display function. In the previous example, work information on a specific day is presented to the plan creator, whereas in this function, the amount of work performed over the entire plan creation period is shown.・ It shows the transition of place and time as a graph.
[0118]
A label 3001 indicates a work name for displaying information. In the example of FIG. 30, it can be read that the train inspection information is displayed. Information to be displayed can be switched by directly entering another work name in this part or selecting from a list. Work information is displayed in a graph 3002. This is a bar graph with the abscissa indicating the date and the ordinate indicating the number of executions, and the work in which the execution place and the time zone are different is displayed with different symbols (• x, etc.).
[0119]
By using the work amount display function, it is possible to comprehensively grasp the contents of various work performed in a distributed manner at multiple vehicle depots, and to identify the variation in the location, time zone, and date of the specific work. Since it can be grasped visually, it becomes possible to easily proceed with the verification of the plan from the aspect of the work amount and work content.
[0120]
Next, the operation search function will be described. This function is an information provision function to support manual correction by the planner. When the plan is revised using the operation search function or operation change function described later, the plan creator draws the ideal form of operation that he / she wants to set for a vehicle and fits it. However, if the number of vehicles becomes very large, it will become extremely difficult to find an appropriate operation efficiently, which will be a considerable burden on the creator. Therefore, by using the operation search function, it is possible to greatly improve the efficiency of the correction work by the plan creator by performing the search for the required operation automatically and at high speed.
[0121]
FIG. 31 shows an example of a search function execution result. In the display portion 3101, as a result of the search, operations that match the conditions are displayed as a list. In the example, four operations are displayed. One of the results is designated with a pointing device such as a mouse, and then the operation detail display function is activated by depressing a button 3102, and the contents of the operation are presented to the plan creator.
[0122]
The plan creator can set search conditions for operational search. As the condition,
1. Driving type (Diamond operation or backup)
2. Morning entry / night departure place and time zone
3. Whether there is no entry in the day and the time zone
4). Specification of specific work possible / impossible
5). Specifying whether specific work is set or not set
Etc. are considered. As an example of the search condition setting interface, a storage / exit condition setting interface shown in FIG. 32 will be described.
[0123]
A setting item 3201 is a part for setting the presence / absence of a purpose-operated lunch storage. Three types of designations are possible: (1) there is a daytime entry, (2) there is no daytime entry, and (3) either is acceptable, and one of them is designated using a pointing device such as a mouse. In the example, it can be seen that “with lunch storage” is specified as a search condition. A setting item 3202 is a part for setting a morning shipping place. If you want to search for operations to be issued from a specific location, display a check mark using a mouse or the like as shown in the example, and enter the name directly or select it from the list.
[0124]
In the example, it can be read that the operation of leaving the base Y is specified. When this item is not set (that is, any operation can be performed in the morning delivery place), the check mark is not displayed. The setting item 3203 and the setting item 3204 are setting portions for the daytime line location and the night entry location, respectively, and the operation method is the same as the setting for morning delivery. In the example, it can be seen that the operation of entering the station B is specified without specifying the location of the daytime line.
[0125]
Such a setting interface is provided for each search condition. By customizing the conditions using these and repeatedly executing the search again, it becomes possible to efficiently find the ideal operation intended by the plan creator from the plan.
[0126]
In the following, each of the three manual intervention functions for correcting a plan will be described. First, a work setting function for changing the operation work schedule will be described with reference to FIG. This function is activated after any operation is specified in the plan. A button 3301 and a button 3302 are used to switch the time zone to be set. In FIG. 33, a daytime work time zone is set by pressing a button 3301. Depending on the operation, either (or both) of the work time zones may not exist, but in such a case, the buttons corresponding to the work time zones that do not exist are not displayed.
[0127]
A label 3303 represents a setting location. In FIG. 33, it can be read that the setting is a work setting at the base X. A label 3304 indicates the time of the corresponding work time zone and its time interval. In FIG. 33, it can be read that it is 450 minutes from 10:10 to 17:40. The work list 3305 displays a list of work that can be additionally set in the corresponding work time zone. The work list 3306 displays a list of works that have already been set in the corresponding work time zone.
[0128]
When additional work is set, the target work is selected from the work list 3305 and an add button 3307 is pressed to move the work from the work list 3305 to the work list 3306. On the other hand, when deleting a set work from the operation, the target work is moved from the work list 3306 to the work list 3305 by pressing the delete button 3308 after selecting the target work from the work list 3306.
[0129]
If there is a change in the situation due to work settings, such as exceeding the work capacity or work time due to additional work settings, or causing a regression violation due to deleting work, a message to that effect is displayed on the label 3309 To do. In FIG. 33, it can be read that the work capacity has been exceeded by additionally setting the train inspection. The change of the work setting by this function is immediately reflected in the plan data, and the display of the entire plan and the detailed operation display are immediately updated accordingly. When a constraint condition is violated, a notice is given by coloring the corresponding part of the plan.
[0130]
Next, an operation exchange function for exchanging two operations on an arbitrary date of a plan will be described. There are various methods for correcting the plan by the plan creator. Currently, the most common and frequently performed operation is an operation for exchanging the operations of the two organizations. For example, if the creator wants to carry out a train inspection on a certain day on vehicle A, if the train inspection cannot be additionally set in the current operation of formation A, it can be exchanged with the operation of A, and The plan is revised by selecting and exchanging a train inspection that can be set (or already set). This function is intended for efficient execution of this correction operation.
[0131]
FIG. 34 shows an example of the interface of the operation exchange function. This function is activated after selecting one of the plans to replace. For preliminary operation, operation that operates in the morning only, and combined operation that consists of two schedules, morning and afternoon, in addition to exchanging the entire operation, it is also possible to exchange in half-day units such as only in the morning or only in the afternoon, It is assumed that such designation is made in advance before displaying the interface of FIG. When this function is activated, candidate search conditions are automatically set from the corresponding operation and its exchange part, and the operation search function is executed. The result is displayed in the display part 3401 in the display format of the operation search function in FIG. As a condition for automatic setting, it is a minimum requirement that no constraint violation occurs due to replacement. The other parts are determined according to the status of the vehicle base to be systemized and the route. Since the creator can sequentially change the search condition when executing this function, it is possible to narrow down the operation of the partner while repeating the search.
[0132]
The content of the designated exchange operation is displayed in the display portion 3402, and one of the search result operations is selected in the display portion 3403 and the display of the corresponding operation is displayed by pressing the display button. Shown in format. In the state where two operations are displayed, by pressing an exchange button 3404, the operation is exchanged and immediately reflected in the plan data, and the entire plan display and operation details display are updated. When a constraint condition violation occurs, a warning is issued by coloring the corresponding part or displaying a comment. When it is desired to restore the operation once exchanged, the correction contents are immediately cleared by pressing a cancel button 3405, and the display is restored before the correction. In this way, by using this function, it is possible to execute operation exchange on a trial and error basis while visually grasping the contents of correction.
[0133]
Next, the operation change function will be described as the third manual intervention function. This function is similar to the aforementioned operation exchange function. The operation exchange function replaces the entire operation or in the morning / afternoon unit at the time when the line is in the garage, but if the operation change function is used, the vehicle is operating in the garage or on the main line The operation can be disconnected at any time and exchanged with another organization operation regardless of whether it is in the middle or not. This function is a function for responding to an unexpected situation in which operation is switched to a standby vehicle that is waiting at a vehicle base when a vehicle or the like in business operation has failed and cannot be operated. The operation interface is the same as the operation exchange function, and the operation search function can also be used to narrow down the change partner. This function is activated after selecting the operation to be changed from the plan, but requires an operation to specify the operation change time before that.
[0134]
Returning to FIG. 1, the description of the overall configuration of the present invention will be continued. The plan evaluation / correction unit of the processing block 0114 is an interface for changing each data of work capacity, operation reservation, and adjustment logic required for automatic creation of a plan in addition to the information providing function and the manual intervention function. By using these, the creator can freely change the conditions for creating the plan. After changing the conditions, the creator can instruct re-planning to the operation allocation unit to obtain a new plan. In this way, it is possible to create a vehicle operation plan that suits the creator's own intention while repeating the plan creation many times. The plan finally approved by the creator is registered in the system as a formal vehicle operation plan, and is printed in a form on a printer or other output device in response to the plan creator's instruction.
[0135]
【The invention's effect】
According to the present invention, it is possible to comprehensively handle step-by-step creation work in the creation of an operation plan, and automatically propose an operation plan draft directly from the operation schedule, and the plan creator can perform multifaceted evaluation on the draft. Therefore, it is possible to efficiently create a high-quality operation plan that is flexibly adapted to the actual situation of the plan creation site.
[Brief description of the drawings]
FIG. 1 is a system configuration diagram of a vehicle operation plan creation support that is an embodiment of the present invention.
FIG. 2 is an explanatory diagram of the planned operation diagram of FIG.
FIG. 3 is a diagram showing a data structure of a work plan according to the present invention.
FIG. 4 is a diagram showing a data structure of operation of the present invention.
FIG. 5 is a diagram showing an image format of operational data according to the present invention.
FIG. 6 is a diagram showing a data structure of a vehicle operation plan according to the present invention.
FIG. 7 is a diagram showing an image format of a vehicle operation plan according to the present invention.
FIG. 8 is a diagram showing a data structure of a working capacity according to the present invention.
FIG. 9 is an explanatory diagram of an operation rotation pattern according to the present invention.
FIG. 10 is a diagram illustrating a data structure of an operation rotation pattern according to the present invention.
FIG. 11 is an explanatory diagram of operation allocation using an operation rotation pattern of the present invention.
FIG. 12 is a flowchart showing a flow of processing of an operation rotation pattern search unit of the present invention.
FIG. 13 is a diagram showing a data structure of a chromosome of the present invention.
FIG. 14 is a flowchart showing a processing flow of an order expression conversion procedure according to the present invention.
FIG. 15 is a diagram showing a data structure of a search parameter according to the present invention.
FIG. 16 is a flowchart showing a flow of decoding processing according to the present invention.
FIG. 17 is a diagram showing a data structure of a pattern evaluation index according to the present invention.
FIG. 18 is a display screen of evaluation information according to the embodiment of the present invention.
FIG. 19 is a diagram showing an interface of an evaluation index adjustment function of the present invention.
FIG. 20 is an explanatory diagram of a processing outline of an operation allocation unit according to the present invention.
FIG. 21 is a diagram showing a data structure of adjustment logic according to the present invention.
FIG. 22 is a flowchart showing a processing flow of an operation allocation unit of the present invention.
FIG. 23 is a flowchart showing a process flow of connection violation elimination logic of the present invention.
FIG. 24 is an explanatory diagram of a processing outline of backtrack processing according to the present invention.
FIG. 25 is a flowchart showing the flow of backtrack processing of the present invention.
FIG. 26 is a flowchart showing a flow of processing of regression violation elimination logic of the present invention.
FIG. 27 is a flowchart showing a process flow of a train inspection interval equalization logic according to the present invention.
FIG. 28 is a startup screen of an operation detail display function of the present invention.
FIG. 29 is a startup screen of a work amount display function (daily) according to the present invention.
FIG. 30 is a start screen of the work amount display function (entire period) of the present invention.
FIG. 31 is a start screen of an operation search function of the present invention.
FIG. 32 is a diagram showing a search condition setting interface according to the present invention.
FIG. 33 is a start screen of a work setting function of the present invention.
FIG. 34 is a start screen of the operation exchange function of the present invention.
[Explanation of symbols]
0101 ... Diagram, 0102 ... Work capacity, 0103 ... Search parameters,
0104 ... Pattern evaluation index, 0105 ... Operation rotation pattern,
0106 ... Operation reservation, 0107 ... Vehicle history, 0108 ... Adjustment logic,
0109: Vehicle operation plan, 0111: Operation rotation pattern search unit,
0112 ... Operation rotation pattern evaluation / correction part,
0113: Operation allocation unit, 0114: Plan plan evaluation / correction unit,
0121 ... Display device, 0122 ... Input device, 0123 ... Printer.

Claims (14)

In the transportation field, a method for creating an operation plan for operation equipment by a computer to create an operation plan that allocates a certain period of time by configuring operation including daily maintenance schedule and operation schedule for operation equipment ,
The search unit of the computer searches for and outputs an operation rotation pattern defined as a basic allocation order of operation for vehicles based on the operation schedule and its spare, using a genetic algorithm, and
The first correction unit of the computer displays the operation rotation pattern on a display device, and corrects the operation rotation pattern according to a correction input from the plan creator for the operation rotation pattern displayed on the display device. Steps,
The operation allocation unit of the computer allocates the operation of the vehicle while partially adjusting the operation rotation pattern, and outputs the result as a plan,
A second correction unit of the computer displays the plan on a display device, corrects the plan according to a correction input from the plan creator for the plan displayed on the display device, and finalizes the plan have a step to create a,
The step of searching for and outputting the operation rotation pattern includes the search unit,
Prepare a sequence S1 in which train schedules and spares are arranged, and generate an empty sequence S2 for storing the result of rearrangement, and give it as a one-dimensional array of N numbers (N is the sum of schedules and spares) The element value is obtained from the chromosome obtained by using an index, and the element is extracted from the sequence S1 using the index as an index. The extracted element value is added to the sequence S2, and the obtained result is obtained as a result. Sequence S2 is a sequence of the operation schedule and the spare,
When train inspection is set at intervals of the number of days of return for the train schedule and spare line as a start position with the value of the position variable indicating the position of interest in the train schedule and spare line, and the train test cannot be set Goes around the schedule and reserve backward with the value of the position variable as the starting position, searches the schedule or reserve that can set the train inspection, sets the train inspection for the found element, As a result, the train schedule set with the train inspection and the backup sequence are converted into the data format of the train rotation pattern and output,
In the step of outputting as the plan, the operation assigning unit
On the i-th day, check the position in the operation rotation pattern assigned on the previous day, assign the next operation in order, and assign the operation according to the operation rotation to the vehicles with the operation reservation on the day. After that, transfer the operation assigned to the vehicle with the operation reservation on that day and the operation to be originally set, and create a template of the plan for the day,
Create a vehicle list, take out the vehicle from the vehicle list, obtain the allocation operation on the i-th day of the taken out vehicle, detect the constraint condition related to the operation, and violate the connection condition in the detection result or It is determined whether or not a regression condition violation is included, and if there is no violation of the connection condition and the regression condition, the vehicle is deleted from the vehicle list, and if there is a violation of the connection condition or the regression condition Change the connection condition and the regression condition violation by transferring to other operations, delete the vehicle that solved the connection condition violation and the regression condition violation from the vehicle list, and adjust the plan A method for preparing an operation plan for operating equipment. The operation includes at least implementation operation schedule, scheduled work, the information of the work place and work time zone,
The operational rotation patterns, operational planning method operating equipment according to claim 1, characterized in that a sequence of operations to encompass different operation schedule of the same number as the number of vehicles. The step of outputting by searching the operational rotation pattern, the search unit is in the respective operation implementation location, simultaneous implementation the maximum number of working time required, by using a working volume that includes at least information of possible time zones, Assuming that all operations included in the operation rotation pattern are performed on the same day, work information is set for operations so that the number of operations does not exceed the maximum number of simultaneous executions at each location and time zone. The operation plan preparation method of the operation equipment according to claim 1 or 2 . Pattern evaluation index is a list of information relating to a plurality of evaluation items,
Each element corresponding to the evaluation item in the list includes at least a reference to an evaluation function that outputs a sufficiency degree for the corresponding evaluation item of the operation rotation pattern, and information on the weight of the corresponding evaluation item,
List of information relating to the plurality of evaluation items, evaluation and connection conditions between operational successive assuming that it will assign daily operational rotation pattern to the vehicle, the compliance of the regression conditional on the implementation interval short work Has at least two elements as items,
The step of outputting by searching the operational rotation pattern, calculating the search unit, a linear weighted sum fullness obtained by applying the cost function corresponding to each evaluation item, the evaluation value of the operational rotation pattern The operation plan creation method for an operation equipment according to claim 1 or 2, characterized in that: Step, wherein the first correction unit, operational rotation pattern and metrics satisfy about the image of character information, displays on the display device by using the numerical information, and additional evaluation item for correcting the operational rotation pattern 5. The operation equipment operation plan creation method according to claim 4, wherein re-searching of the plan is advanced upon receipt of deletion and weight change.   The connection condition violation is a violation regarding a connection condition between consecutive operations in a single vehicle,
  The operation plan creation method for an operation equipment according to claim 1, wherein the regression condition violation is a violation of a regression condition related to an execution interval of a short-term work that should strictly observe the number of days of return in a single vehicle.   In the step of outputting as the plan, the operation allocation unit cannot solve the connection condition violation even if the operation of exchanging the i-th day operation and the operation of adding and deleting the i-th day operation are performed. If the date before the i-th day is the j-th day, the connection condition is set in the sub-series of operation assignments from the current date of the other vehicle to the j-th day while returning to the next day. The partial sequence satisfying the connection condition is exchanged with a partial sequence satisfying the connection condition and a partial sequence of a vehicle that violates the connection condition when a partial sequence satisfying the connection condition is found. How to create an operation plan for operation equipment as described in.   In the step of creating the final plan, the second correction unit displays a summary of the plan on a display device, and accepts designation for an arbitrary operation on the plan via a pointing device such as a mouse. In this case, the operation equipment operation plan creation method according to claim 1, wherein the detailed contents of the operation are displayed on a display device.   In the step of creating the final plan, the second correction unit sums up the work date, amount, place, and time zone of the work in the plan, and the total result and plan of the creation period The operation plan creation method for operating equipment according to claim 1, wherein a totaling result for a specific date designated by the creator is displayed on a display device using graphs, numerical values, and character information.   The step of creating the final plan is characterized in that the second correction unit accepts operations for adding and deleting work to a specific operation in the plan, and proceeds to create a final plan of the operation plan. The operation plan preparation method of the operation equipment according to claim 1.   In the step of creating the final plan, the second correction unit accepts an operation for exchanging with another operation on the plan whose execution date is the same as the specific operation in the plan, and the final plan of the operation plan The operation equipment operation plan preparation method according to claim 1, wherein preparation of the plan is advanced.   In the step of creating the final plan, the second correction unit calculates the characteristics of the operation of the exchange partner from the characteristics of the operation designated as the exchange target, and includes the operation schedule, departure and arrival location, departure and arrival time included A search condition that includes at least a work time zone, a work place, whether or not a specific work is set as a search item, and searches for replacement candidate operations using the search conditions, and displays the operation of the search results The operation plan creation method for operation equipment according to claim 11, wherein the operation plan is displayed on the screen.   The step of creating the final draft is characterized in that the second correction unit accepts an operation for changing at least work capacity, operation reservation, adjustment logic, and search conditions from a plan creator. Operation plan creation method for operation equipment. In the transportation field, in the operation equipment preparation system for operation equipment to create an operation plan that allocates a certain period of time by configuring operation including daily maintenance schedule and operation schedule for operation equipment,
A search unit that searches and outputs an operation rotation pattern defined as a basic allocation order of operations for vehicles based on the operation schedule and its spare, using a genetic algorithm,
A first correction unit that displays the operation rotation pattern on a display device, and corrects the operation rotation pattern according to a correction input from a plan creator for the operation rotation pattern displayed on the display device;
An operation allocation unit that allocates the operation of the vehicle while partially adjusting the operation rotation pattern, and outputs the result as a plan,
A second correction unit that displays the plan on a display device and corrects the plan according to a correction input from the plan creator for the plan displayed on the display device to create a final plan; And
The search unit
Prepare a sequence S1 in which train schedules and spares are arranged, and generate an empty sequence S2 for storing the result of rearrangement, and give it as a one-dimensional array of N numbers (N is the sum of schedules and spares) The element value is obtained from the chromosome obtained by using an index, and the element is extracted from the sequence S1 using the index as an index. The extracted element value is added to the sequence S2, and the obtained result is obtained as a result. Sequence S2 is a sequence of the operation schedule and the spare,
When train inspection is set at intervals of the number of days of return for the train schedule and spare line, starting from the position variable value indicating the position of interest in the train schedule and spare line, and the train test cannot be set Goes around the schedule and reserve backward with the value of the position variable as the start position, searches the schedule or reserve that can set the train inspection, sets the train inspection for the found element, As a result, the train schedule set with the train inspection and the backup sequence are converted into the data format of the train rotation pattern and output,
The operation allocation unit is
On the i-th day, check the position in the operation rotation pattern assigned on the previous day, assign the next operation in order, and assign the operation according to the operation rotation to the vehicles with the operation reservation on the day. After that, transfer the operation assigned to the vehicle with the operation reservation on that day and the operation to be originally set, and create a template of the plan for the day,
Create a vehicle list, take out the vehicle from the vehicle list, obtain the allocation operation on the i-th day of the taken out vehicle, detect the constraint condition related to the operation, and violate the connection condition in the detection result or It is determined whether or not a regression condition violation is included, and if there is no violation of the connection condition and the regression condition, the vehicle is deleted from the vehicle list, and if there is a violation of the connection condition or the regression condition Change the connection condition and the regression condition violation by transferring to other operations, delete the vehicle that has solved the connection condition violation and the regression condition violation from the vehicle list, and adjust the plan An operation equipment planning system for operating equipment.

Images