JP3926751B2

JP3926751B2 - Delivery planning system and program for causing computer to execute the same

Info

Publication number: JP3926751B2
Application number: JP2003037967A
Authority: JP
Inventors: 昌彦平野
Original assignee: Mitsubishi Electric Information Systems Corp
Current assignee: Mitsubishi Electric Information Systems Corp
Priority date: 2003-02-17
Filing date: 2003-02-17
Publication date: 2007-06-06
Anticipated expiration: 2023-02-17
Also published as: JP2004244201A

Description

【０００１】
【発明の属する技術分野】
この発明は配送計画システムに関し、特に、特定の倉庫から一定量の荷物を積むように構成する配送計画システムに関するものである。
【０００２】
【従来の技術】
従来の配送計画システムは、単一倉庫の荷物を積んで、それを複数の配送先に配送するように計画するのが一般的である。それをシングルデポシステムと呼ぶ。従って、従来の配送計画システムにおいては、マルチデポシステムと呼ばれる、複数倉庫を経由して複数の配送先に配送するように、配送計画を策定することは難しい。また、１又は複数台の車両を用いて、特定の倉庫に一定期間内に指定の回数だけ立ち寄り、荷物を積むように配送計画を策定することも難しい。
【０００３】
配送する荷物が例えば、セメント、ガス、原油等、複数の倉庫に在庫としてあるものの品質がさほど変わらないときは、複数の同業者間で特定の倉庫からの荷詰めを一定期間で所定量を交換するように運用することがある。同業者間で、それぞれの倉庫に在庫としてある荷物を融通するようにすれば、配送経路に応じて選択できる倉庫の候補が多くなり、全体の配送計画が効率的に策定できる。また、荷物の在庫管理もしやすいという利点がある。
【０００４】
また、自社倉庫が点在しているときなど、倉庫毎に生産計画（在庫計画）を例えば月毎に定め、それにより倉庫毎の出荷量（荷物の搭載量）を決めることがある。
【０００５】
だが、現行のシステムではマルチデポシステムに対応していなく、また特定の倉庫からの荷物の搭載量を考慮した計画の策定も困難であったため、そのような配送計画は別途配送計画策定者が考えて策定していた。
【０００６】
また、特開２０００−３６０９３号公報には、（ｉ）発着地点別の輸送依頼を車載容量毎にまとめた、セット作成、（ｉｉ）制約条件を充足する複数ルートを生成する、セット連結、（ｉｉｉ）連結されたセットの中から適切なルートを選択する、ルート選択の３つのフェーズで配送計画を作成する配送装置が開示されている。
【０００７】
【特許文献１】
特開２０００−３６０９３号公報
【０００８】
【発明が解決しようとする課題】
従来の配送計画システムは、特定の倉庫に一定期間内に指定の回数だけ立ち寄り、荷物を積むように配送計画を策定することができなかった。
【０００９】
また、特許文献１に開示された配車装置では、発着地別のセットを作成し、そのセットを連結した複数ルートの候補から適切なルートを選択する技術が開示されている。だが、この特許文献１は、発着地が固定の場合の配車装置であり、物流拠点（倉庫）の候補が複数あるとき、その倉庫の候補から配送先又は配送経路に応じた倉庫を選択するようには構成されていない。また、１又は複数台の車両を用いて、特定の倉庫に一定期間内に指定の回数だけ立ち寄り、荷物を搭載する配送計画には対応していない。
【００１０】
この発明は、かかる問題点を解決するためになされたものであり、マルチデポシステムに対応し、１又は複数台の車両を用いて、特定の倉庫に一定期間内に指定の回数だけ立ち寄り、荷物を搭載するように構成する、配送計画システム及び配送計画方法を得ることを目的とする。
【００１１】
【課題を解決するための手段】
本発明に係る配送計画システムは、予め定められた第１の期間に、１又は複数の車庫、倉庫及び配送先を経由する配送計画を作成する配送計画システムであって、予め定められた第２の期間内に所定量の荷物の搭載を定めた倉庫を特殊倉庫とし、この特殊倉庫コード、及び上記第１の期間内の上記特殊倉庫への立ち寄り指定回数を受付ける特殊倉庫回数受付部と、上記特殊倉庫回数受付部が受付けた、立ち寄り指定回数分の受注データを、配送先を特殊倉庫配送先として作成する特殊倉庫行受注データ作成部と、上記受注データに基づき、上記立ち寄り指定回数分、上記特殊倉庫を経由するように上記第１の期間の配送計画を作成する配送計画作成部とを備えたものである。
【００１２】
また、上記車庫、倉庫及び配送先の位置データを発着地位置データファイルに登録する発着地登録部と、上記発着地位置データファイルに登録された位置データに基づき、それぞれの位置データ間の移動にかかる所要時間を算出するとき、出発地が特殊倉庫到着地及び特殊倉庫配送先となるデータに関して、特殊倉庫到着地・特殊倉庫配送先間、及び特殊倉庫配送先・特殊倉庫出発地間以外の所要時間は、第１の期間より大きくなるように算出し、さらに特殊倉庫出発地・特殊倉庫到着地間、特殊倉庫出発地・特殊倉庫配送先間の所要時間は、第１の期間より大きくなるように算出し、その算出結果を発着地間時間・距離データファイルに登録する発着地間ルート検索部とを備え、上記特殊倉庫回数受付部は、さらに上記特殊倉庫を、特殊倉庫出発地、特殊倉庫到着地及び特殊倉庫配送先として当該位置データを上記発着地位置データファイルに登録し、上記配送計画作成部は、上記発着地間時間・距離データファイルに基づき、特殊倉庫到着地、特殊倉庫配送先、特殊倉庫出発地の順序で経由するように、上記第１の期間内の配送計画を作成することを特徴とするものである。
【００１３】
また、予め定められた第１の期間に、１又は複数の車庫、倉庫及び配送先を経由する配送計画を作成する配送計画システムであって、予め定められた第２の期間内に所定量の荷物の搭載を定めた倉庫を特殊倉庫とし、この特殊倉庫コード、及び上記第２の期間内に搭載する上記特殊倉庫からの荷物搭載量を受付け、上記荷物搭載量を上記第１の期間に換算した搭載量を算出し、この第１の期間に換算した搭載量及び車両の積載量に応じて、上記第１の期間の上記特殊倉庫への立ち寄り指定回数を算出する特殊倉庫処理部と、上記特殊倉庫処理部が算出した、立ち寄り指定回数分の受注データを、配送先を特殊倉庫配送先として作成する特殊倉庫行受注データ作成部と、上記受注データに基づき、上記立ち寄り指定回数分、上記特殊倉庫を経由するように上記第１の期間の配送計画を作成する配送計画作成部とを備えたことを特徴とするものである。
【００１４】
また、上記配送計画作成部が作成した配送計画に、特殊倉庫到着地、特殊倉庫配送先、特殊倉庫出発地を経由する経路があるときはこの経路を削除する配送計画データ加工部を備えたことを特徴とするものである。
【００１５】
また、上記配送計画作成部は、車両毎に指定された、出庫車庫又は入庫車庫に応じて、各車両の配送計画を定めることを特徴とするものである。
【００１６】
本発明に係るコンピュータに、配送計画方法を実行させるためのプログラムは、予め定められた第２の期間内に所定量の荷物の搭載を定めた倉庫を特殊倉庫とし、この特殊倉庫コード、及び上記第１の期間内の上記特殊倉庫への立ち寄り指定回数を受付ける立ち寄り回数受付ステップと、上記立ち寄り回数受付ステップが受付けた、立ち寄り指定回数分の受注データを、配送先を特殊倉庫配送先として作成する特殊倉庫行受注データ作成ステップと、上記受注データに基づき、上記立ち寄り指定回数分、特殊倉庫を経由するように上記第１の期間内の配送計画を作成する配送計画作成ステップとを備えたものである。
【００１７】
本発明に係るコンピュータに、配送計画方法を実行させるためのプログラムは、上記車庫、倉庫及び配送先の位置データを発着地位置データファイルに登録する発着地登録ステップと、予め定められた第２の期間内に所定量の荷物の搭載を定めた倉庫を特殊倉庫とし、この特殊倉庫コード、及び上記第１の期間内の上記特殊倉庫への立ち寄り指定回数を受付ける立ち寄り回数受付ステップと、上記立ち寄り回数受付ステップで受付けた特殊倉庫を、特殊倉庫出発地、特殊倉庫到着地及び特殊倉庫配送先として当該位置データを上記発着地位置データファイルに登録する位置データ登録ステップと、上記発着地位置データファイルに登録された位置データに基づき、それぞれの位置データ間の移動にかかる所要時間を算出するとき、出発地が特殊倉庫到着地及び特殊倉庫配送先となるデータに関して、特殊倉庫到着地・特殊倉庫配送先間、特殊倉庫配送先・特殊倉庫出発地間以外の所要時間は、第１の期間より大きくなるように算出し、さらに特殊倉庫出発地・特殊倉庫到着地間、特殊倉庫出発地・特殊倉庫配送先間の所要時間は、第１の期間より大きくなるように算出する特殊倉庫時間算出ステップと、上記特殊倉庫時間算出ステップで算出した結果を発着地間時間・距離データファイルに登録する発着地間ルート検索ステップと、上記立ち寄り回数受付ステップが受付けた、立ち寄り指定回数分の受注データを、配送先を特殊倉庫配送先として作成する特殊倉庫行受注データ作成ステップと、上記受注データ及び上記発着地間時間・距離データファイルに基づき、特殊倉庫到着地、特殊倉庫配送先、特殊倉庫出発地の順序で経由するように、上記第１の期間内の配送計画を作成する配送計画作成ステップとを備えたものである。
【００１８】
本発明に係るコンピュータに、配送計画方法を実行させるためのプログラムは、上記車庫、倉庫及び配送先の位置データを発着地位置データファイルに登録する発着地登録ステップと、予め定められた第２の期間内に所定量の荷物の搭載を定めた倉庫を特殊倉庫とし、この特殊倉庫コード、及び上記第２の期間内の上記特殊倉庫からの荷物搭載量を受付ける特殊倉庫条件受付ステップと、上記特殊倉庫条件受付ステップで受付けた荷物搭載量を上記第１の期間に換算し、さらにこの第１の期間に換算した荷物搭載量及び車両の積載量に応じて、上記第１の期間の上記特殊倉庫への立ち寄り指定回数を算出する特殊倉庫処理ステップと、上記特殊倉庫処理ステップが算出した、立ち寄り指定回数分の受注データを、配送先を特殊倉庫配送先として作成する特殊倉庫行受注データ作成ステップと、上記受注データに基づき、上記立ち寄り指定回数分、特殊倉庫を経由するように上記第１の期間内の配送計画を作成する配送計画作成ステップを備えたものである。
【００１９】
さらに、上記配送計画作成ステップの後、特殊倉庫到着地、特殊倉庫配送先、特殊倉庫出発地を経由する経路があるときはこの経路を削除する配送計画データ加工ステップを備えたことを特徴とするものである。
【００２０】
【発明の実施の形態】
実施の形態１．
本実施の形態における配送計画システムは、予め定められた期間（第１の期間）を１日とし、１日の間で複数の倉庫を経由して、荷物を積み、配送先に配送する配送計画を作成するものとする。また、１日の配送計画はその当日に作成するものとする。
【００２１】
また配送する荷物は例えば、セメント、ガス、原油等、複数の倉庫に在庫としてあるものの品質がさほど変わらないものであるとし、複数の同業者間で特定の倉庫からの荷詰めを一定期間で所定量を交換するように運用する例について示す。またこの一定期間（第２の期間）は、本実施の形態では１ヶ月間とする。このように、同業者間で、それぞれの倉庫の荷物を融通するようにすれば、配送経路に応じて選択できる倉庫の候補が多くなり、全体の配送計画が効率的に策定できる。また、荷物の在庫管理もしやすいという利点がある。
【００２２】
さらに、倉庫からの荷詰め（荷物の搭載量）を所定量に定めた特定の倉庫を特殊倉庫と呼び、特殊倉庫毎に搭載量を定める。例えば、Ａ地区にａ，ｂ，ｃの倉庫を有するＸ業者と、Ｂ地区にｄ，ｅ，ｆの倉庫を有するＹ業者があったとする。Ｘ業者は、Ａ地区近辺で荷物の配送をするときはＸ業者が有する倉庫から荷物を搭載すれば良いが、Ｂ地区近辺で荷物の配送をするときもＸ業者が有する倉庫から荷物の搭載をすると、配送経路としては、効率が悪くなる。Ｙ業者に関しても同様であり、Ｂ地区近辺を配送するときは良いが、Ａ地区近辺を配送するときは効率が悪い。そのようなことから、Ｘ業者とＹ業者の間で、それぞれが所有する倉庫から荷物を融通するように契約することがある。例えば、Ｙ業者は、ａ倉庫から１００t/月、ｂ倉庫から２００t/月、ｃ倉庫から３００t/月の荷物の搭載をするとし、Ｘ業者は、ｄ倉庫から２００t/月、ｅ倉庫から２００t/月、ｆ倉庫から２００t/月の荷物の搭載をするように定める。このように構成することで、それぞれの業者は配送計画を効率的に策定することができる。
【００２３】
また本実施の形態で特徴的なことは、例えば月に、２００ｔ搭載するとした量をトラック（車両）が立ち寄る回数で定めることである。１回の立ち寄りで、トラックの最大積載量の荷物を搭載するとして、１ヶ月当たりの荷物の搭載量になるように算出する。このとき、月当たりの荷物の量を予め１日ずつ平均に割り振り、その１日の量とトラックの積載量に応じて１日当たりの立ち寄り回数を定めることもできるし、車両の運行状況等に応じて、１日ごとに異なる立ち寄り回数を設定することもできる。これは配送計画策定者が任意に定められる。
【００２４】
図１は、本実施の形態におけるシステム構成図を示したものである。図１において、発着地登録部１は、あらかじめ車庫、配送先及び倉庫の位置データ（発着地コード、緯度・経度）を発着地位置データファイル２に登録する。発着地位置登録データファイル２に登録された情報をもとに、発着地間ルート検索部３は、発着地間の移動にかかる時間（所要時間）やその時の走行距離を算出し、その結果を発着地間時間・距離データファイル４に登録する。配送条件登録部５は、配送条件を配送条件データファイル６に登録し、受注情報登録部７は、伝票コード、配送日、配送先の発着地コード、配送内容情報（配送先発着地コード、品種、配送重量など配送内容）を受注データファイル８に登録する。
【００２５】
特殊倉庫回数受付部９は、配送計画策定者から特殊倉庫の指定と、その日の立ち寄り指定回数を受付け、この特殊倉庫の位置データを発着地位置データファイル２に登録する。このとき特殊倉庫を、「特殊倉庫出発地」、「特殊倉庫到着地」及び「特殊倉庫配送先」とし、それぞれ異なる発着地コードを有する同一位置データを発着地位置データファイル２に登録する。また、特殊倉庫行受注データ作成部１０は、特殊倉庫回数受付部９が受付けた立ち寄り指定回数分の受注データを配送先を「特殊倉庫配送先」として、作成する。
【００２６】
また車両情報登録部１１は、車両情報を車両情報データファイル１２に登録し、配送先情報登録部１３は、配送先情報を配送先情報データファイル１４に登録する。配送計画作成部１５は、発着地間時間・距離データファイル４、配送条件データファイル６、受注データファイル８、車両情報データファイル１２及び配送先情報データファイル１４に基づき、最短となる経路で配送計画を作成し、その結果を配送計画データファイル１６を作成する。また配送計画作成部１５は、特殊倉庫に関しては、「特殊倉庫到着地」、「特殊倉庫配送先」、「特殊倉庫出発地」の順序で経由するように、経路を作成する。なお配送計画作成部１５が採用する最短の条件としては、所要時間又は走行距離で、任意に定められるものとする。
【００２７】
さらに配送計画データ加工部１７は、配送計画データファイル１６の中で、「特殊倉庫到着地」、「特殊倉庫配送先」、「特殊倉庫出発地」の順序で経由する経路があったときは、その経路を削除し、車両が実際に走行する経路として、配送計画加工ファイル１８を作成する。配送計画加工ファイル１８を紙に印刷したり、各車両に配送計画加工ファイル１８の内容を送信したりすることで、配送計画が各車両に伝達されることになる。
【００２８】
本実施の形態で特殊倉庫に指定回数分立ち寄るための、構成は簡単に説明すると、次のような手順になる。
【００２９】
(1)特殊倉庫回数受付部９が特殊倉庫を、「特殊倉庫出発地」、「特殊倉庫到着地」及び「特殊倉庫配送先」とし、それぞれ異なる発着地コードを有する同一位置データを発着地位置データファイル２に登録する。
【００３０】
（２）特殊倉庫行受注データ作成部１０が立ち寄り指定回数分の受注データを配送先を「特殊倉庫配送先」として、作成する。
【００３１】
(3)配送計画作成部１５が特殊倉庫に関しては、「特殊倉庫到着地」、「特殊倉庫配送先」、「特殊倉庫出発地」の順序で経由するように、経路を作成する。
【００３２】
また、図２は、上述した発着地位置データファイル２、発着地間時間・距離データファイル４、配送条件データファイル６、受注データファイル８、車両情報データファイル１２及び配送先情報データファイル１４のデータの構成を示したものである。図２において、発着地位置データファイル２は、「発着地コード（ＩＤ）」と当該発着地の「緯度・経度」のデータを含んでいる。また、発着地間時間・距離データファイル４は、「出発地コード」、「到着地コード」、「所要時間」、「走行距離」のデータを含んでいる。なお「出発地コード」及び「到着地コード」は、それぞれ出発する場所、到着する場所を示す「発着地コード」であり、「出発地コード」及び「到着地コード」と「発着地コード」とは、同一コードになる。
【００３３】
更に、図２において、配送条件データファイル６は、配送先の「発着地コード（配送先）」、配送する商品の品種等の「商品情報」、当該商品が保管されている倉庫の「発着地コード」の情報を含んでいる。同一の配送先、商品情報に対して、複数の倉庫が対象となることもあり、そのときは同一「発着地コード（配送先）」、「商品情報」に対して、異なる「発着地コード（倉庫）」が複数レコードとして登録される。受注データファイル８は、「伝票コード」、「配送日」、「発着地コード（配送先）」、配送する商品の品種等の商品情報である「配送内容情報」を含んでいる。
【００３４】
車両情報データファイル１２は、「車両コード」及び「車両属性情報」として車両の車型、車種、配送可能時間、最大積載量、所属車庫（入庫車庫、出庫車庫）、運用形態などを含んでいる（図２では、「車両属性情報」は、「属性データ１」…「属性データｎ」と記載）。配送先情報データファイル１４は、「発着地コード」及び「配送先属性情報」として配送可能車型、配送可能車種、配送可能時間帯などを含んでいる（図２では、「配送先属性情報」は、「属性データ１」…「属性データｎ」と記載）。
【００３５】
次に、配送計画データファイル１６及び配送計画加工ファイル１８を作成する処理の流れを順を追って、説明する。図３は、発着地登録部１が発着地位置データファイル２を登録する処理と、発着地間ルート検索部３が発着地位置データ２に基づき、発着地間時間・距離データファイル４を登録する処理の流れを示したフローチャートである。発着地登録部１は、発着地に関する位置データの新規登録を受け付け（ステップＳ１）、その受けつけた位置情報を発着地位置データファイル２へ登録する（ステップＳ２）。発着地登録部１の処理は、新規に配送計画を作成しようとするとき、また発着地が追加になったときなどに、随時実施される。
【００３６】
発着地間ルート検索部３は、発着地位置データファイル２を参照し、「発着地コード」と同一のコードを、発着地間時間・距離データファイル４の「出発地コード」と「到着地コード」とに登録する（ステップＳ１１）。その後発着地間ルート検索部３は、発着地間時間・距離データファイル４に登録された「出発地コード」と「到着地コード」の間の所要時間及び走行距離を算出し（ステップＳ１２）、算出結果を発着地間時間・距離データファイル４へ登録する（ステップＳ１３）。発着地登録部１と、発着地間ルート検索部３の処理は、連動させることも可能であり、また発着地間ルート検索部３の処理を一定の条件で実施するように構成することもできる。
【００３７】
図４は、発着地間ルート検索部３が、すべての発着地間について、発着地間の移動にかかる時間（所要時間）やその時の走行距離を算出し、その結果を登録した、発着地間時間・距離データファイル４の説明図である。図２に示した、発着地間時間・距離データファイル４は、出発地を「出発地コード」、到着地を「到着地コード」で示し、その経路の「所要時間」、「走行距離」を登録している。この発着地間時間・距離データファイル４を別の形で示すと、図４に示したようなマトリクス表にすることができる。図４に示した一例では、行方向（図４では「From」と記載、１行〜１１行）を出発地、列方向（図４では「To」と記載、Ａ列〜Ｋ列）を到着地とし、車庫α、配送先（Ａ〜Ｅ）、倉庫（a〜ｃ）の間の移動にかかる所要時間や走行距離を算出した数値を登録している。図４（ａ）は、発着地間の所要時間によりマトリクス表としたものであり、図４（ｂ）は、発着地間の走行距離によりマトリクス表としたものである。図４（ａ）及び（ｂ）には、行と列で定められる枠名（Ａ１〜Ｋ１１）を示しているが、実際には所要時間又は走行距離が登録される。また、発着地が同一となるとき、通常は経路として選択しないため、発着地が同一となる枠には、一例として「０」と記している。なお後述するように、通常は所要時間が「０」となる経路は選択しないが、特殊倉庫に関しては、「特殊倉庫到着地」→「特殊倉庫配送先」及び「特殊倉庫配送先」→「特殊倉庫出発地」の順番で経由するように構成するため、所要時間が「０」となる経路を選択するようになる。
【００３８】
倉庫（a〜ｃ）の中で、倉庫ｂは立ち寄り指定回数が定められた、特殊倉庫であるため、１つの特殊倉庫倉庫ｂに対して、「特殊倉庫到着地」、「特殊倉庫配送先」、「特殊倉庫出発地」の３つ「発着地コード」が「出発地コード」及び「到着地コード」のそれぞれに登録されている。図４では、「特殊倉庫到着地」、「特殊倉庫配送先」、「特殊倉庫出発地」は、「ｂ着」、「ｂ配送先」、「ｂ発」と記載している。
【００３９】
さらに図５（ａ）は、図４に示した発着地間時間・距離データファイル４に実際の所要時間を入力した、一例である。発着地間ルート検索部３は、特殊倉庫が発着地となる場合以外は、発着地間の移動にかかる時間（所要時間）を算出し、発着地間時間・距離データファイル４に登録する。発着地間時間・距離データファイル４には、所要時間と走行距離とが登録され、配送計画作成部１５は最短になるように経路を作成するが、「特殊倉庫配送先」が配送先となる受注データに関しては、所要時間を用いて最短を算出するものとする。
【００４０】
「特殊倉庫配送先」が配送先となる受注データ以外の配送先については、所要時間または走行距離で、最短の条件を定めておく。このとき、最短とは次の（１）〜（５）が考えられる。
（１）車庫または配送先から倉庫までの空車（荷物積載なし）の走行距離が最短
（２）倉庫から配送先までの実車（荷物積載あり）の走行距離が最短
（３）空車と実車とを合わせた経路全体の、走行距離が最短
（４）車庫または配送先から倉庫までの空車（荷物積載なし）の所要時間が最短
（５）倉庫から配送先までの実車（荷物積載あり）の所要時間が最短
そして配送計画作成部１５は、指定回数分特殊倉庫に立ち寄るために、特殊倉庫が発着地となるときは、以下のように動作する。
【００４１】
(1)出発地が「特殊倉庫到着地」及び「特殊倉庫配送先」となるデータに関して、「特殊倉庫到着地」・「特殊倉庫配送先」間、及び「特殊倉庫配送先」・「特殊倉庫出発地」間以外の所要時間は、１日の運行時間より大きい時間を入力。
「特殊倉庫到着地」・「特殊倉庫配送先」間、及び「特殊倉庫配送先」・「特殊倉庫出発地」間は「０」を入力。
(2)「特殊倉庫出発地」・「特殊倉庫到着地」間、「特殊倉庫出発地」・「特殊倉庫配送先」間の所要時間は、１日の運行時間より大きい時間を入力。「特殊倉庫出発地」・「特殊倉庫出発地」間は「０」を入力。それ以外で出発地が「特殊倉庫出発地」のときは、所要時間を算出し、入力。
なお１日の運行時間を８時間としたとき、その運行時間より大きい時間を入力するということは、例えば９時間と入力するということであり、それにより、配送計画作成部１５は「９時間」と登録された経路は選択しない。図５（ａ）では、運行時間より大きく算出した時間を、「∞」と記載しているが、実際には運行時間より大きい時間（例えば９時間）を固定で登録しておくように構成する。
上述（１）、（２）を図５（ａ）で説明すると、以下（３）、（４）のようになる。
(3)出発地が「ｂ着」のとき、到着地「ｂ配送先」間の所要時間は、「０」とし、それ以外の到着地は「∞」とする。出発地が「ｂ配送先」のとき、到着地「ｂ発」間の所要時間は、「０」とし、それ以外の到着地は「∞」とする。
(4)「ｂ発」・「ｂ着」間、「ｂ発」・「ｂ配送先」間の所要時間は、「∞」とする。「ｂ発」・「ｂ発」間は、「０」とする。「ｂ発」が出発地となるそれ以外の経路は、所要時間を算出し、入力する。
上述のように、発着地間時間・距離データファイル４を構成することで、特殊倉庫を経由する経路に関しては、「特殊倉庫到着地」、「特殊倉庫配送先」、「特殊倉庫出発地」の順番で経由するような仕組みができる。
【００４２】
また、発着地間ルート検索部３が走行距離や所要時間を算出するとき、ナビゲーションシステムと同様の方法を用いることができる。ナビゲーションシステムでは、地図上のすべての交差点が、その緯度・経度を、ｘ座標及びｙ座標としたノードと呼ばれる点でしめされており、交差点と交差点との間の道がリンクと呼ばれる線で示されている。リンクには、交差点間の距離や、その形状（曲線、直線等）、国道または高速道路の種別、一方通行（向き）、平均速度データ等の付加情報が付与されている。これらのノードとリンクとの情報がナビゲーションシステムのデータベースとなっている。これらの情報を用いれば、上述した発着地間時間・距離データファイル４を演算により求めることができる。
【００４３】
なお図３に示した、発着地間ルート検索部３が発着地位置データ２に基づき、発着地間時間・距離データファイル４を登録する処理の中で、受注データファイル８を考慮することにより、当日分の発着地間時間・距離データファイル４を登録するように構成することもできる。このときは、ステップＳ１１の処理の中で、発着地間ルート検索部３は、発着地位置データファイル２及び受注データファイル８を参照するようにし、受注データファイル８の当日分配送先として登録された、「発着地コード」を発着地間時間・距離データファイル４に「出発地コード」と「到着地コード」を登録するように構成する。このように構成すると、より当日の所要時間及び走行距離に厳密なデータで配送計画データファイル１６を作成することができる。
【００４４】
図６は、配送条件登録部５、受注情報登録部７、車両情報登録部１１、配送先情報登録部１３の処理の流れを示したフローチャートである。配送条件登録部５は、配送条件の登録を受け付け（ステップＳ２１）、受け付けた配送条件を配送条件データファイル６へ登録する（ステップＳ２２）。受注情報登録部７は、受注情報の登録を受け付け（ステップＳ３１）、受け付けた受注情報を受注データファイル８へ登録する（ステップＳ３２）。車両情報登録部１１は、車両情報の登録を受け付け（ステップＳ４１）、受け付けた車両情報を車両情報データファイル１２へ登録する（ステップＳ４２）。配送先情報登録部１３は、配送先情報の登録を受け付け（ステップＳ５１）、受け付けた配送先情報を配送先情報データファイル１４へ登録する（ステップＳ５２）。配送条件登録部５、受注情報登録部７、車両情報登録部１１及び配送先情報登録部１３の処理は、随時、例えば受注情報を受けつけるとき、新規の条件を登録するときなどに実施される。受注データファイル８には、「配送日」の項目があるため、配送日指定がされた受注データを予め受けつけることが可能である。
【００４５】
図７は、特殊倉庫回数受付部９が特殊倉庫毎の立ち寄り指定回数を受付ける受付け画面の一例を示したものである。受付画面２１は、配送計画策定者から特殊倉庫及び特殊倉庫毎の立ち寄り指定回数を受付ける。図７に示すように、「倉庫ｂ」は３回、「倉庫ｘ」は２回、「倉庫ｙ」は１回、「倉庫ｚ」は２回と指定されている。また、「倉庫ｂ」、「倉庫ｘ」、「倉庫ｙ」、「倉庫ｚ」は既に登録されている特殊倉庫であるが、新規に特殊倉庫を登録するときは、「新規倉庫指定」ボタンを押下して、「倉庫名」、「立ち寄り回数/日」を指定する。その後確定するときは、「確定」ボタン、一度入力した内容を取り消すときは「取消」ボタンを押下する。
【００４６】
図８は、特殊倉庫回数受付部９が特殊倉庫毎の指定回数を受付ける処理の流れを示した、フローチャートである。特殊倉庫回数受付部９は、受付画面２１を表示し、配送計画策定者から特殊倉庫別の立ち寄り回数の指定を受け付ける（ステップＳ６１）。受付画面２１の構成は図７に示したとおりであり、既存及び新規の特殊倉庫毎の立ち寄り回数を受け付ける。その後特殊倉庫回数受付部９は、受け付けた特殊倉庫毎の立ち寄り回数を一時的データとして保管をし（ステップＳ６２）、その後一時的データから特殊倉庫別の保管データを取り出す（ステップＳ６３）。ステップＳ６３で取り出した特殊倉庫の位置データを、特殊倉庫回数受付部９は発着地位置データファイル２に登録し（ステップＳ６４）、特殊倉庫行受注データ作成１０は「特殊倉庫配送先」を配送先として、立ち寄り指定回数分の受注データを作成する（ステップＳ６５）。ステップＳ６４に示した処理は、図９にて、ステップＳ６５に示した処理は、図１０にて詳細を示している。その後ステップＳ６６で、ステップＳ６２で保管した一時的データに次の特殊倉庫が登録されているかどうかを確認し、次の特殊倉庫がないときは処理を終了し、次の特殊倉庫があるときはステップＳ６３に処理が戻る。
【００４７】
図９は、特殊倉庫回数受付部９が特殊倉庫の位置データを発着地位置データファイル２に登録する処理の流れを示す、フローチャートである。特殊倉庫回数受付部９は特殊倉庫別に取り出した保管データを参照し（ステップＳ７１）、その特殊倉庫に対応する、「特殊倉庫到着地」、「特殊倉庫配送先」、「特殊倉庫出発地」が発着地位置データファイル２に登録されているかどうかを確認し（ステップＳ７２）、既に登録されているときは処理を終了する。登録されていないときは、その位置データを「特殊倉庫到着地」、「特殊倉庫配送先」、「特殊倉庫出発地」として発着地位置データファイル２に登録し、処理を終了する（ステップＳ７３）。上述したように倉庫ｂは、「ｂ着」、「ｂ配送先」、「ｂ発」としたが、具体的にはそれに対応する発着地コードを登録する。
【００４８】
図１０は、特殊倉庫行受注データ作成部１０が受注データを作成する処理の流れを示す、フローチャートである。特殊倉庫行受注データ作成部１０は特殊倉庫別に取り出した保管データを参照し（ステップＳ８１）、その立ち寄り指定回数を読み込み、発着地位置データファイル２を参照して、「特殊倉庫配送先」を「発着地コード（配送先）」として、その回数分の受注データを作成し（ステップＳ８２）、受注データファイル８に保存する（ステップＳ８３）。処理を終了する。
【００４９】
図８〜図１０に示したフローチャートにより、特殊倉庫の位置データを発着地位置データファイル２に登録し、立ち寄り指定回数分の受注データを作成し、受注データファイル８に登録することができる。
【００５０】
次に図１１を用いて、配送計画作成部１５が配送計画データファイル１６を作成する処理の流れを説明する。配送計画作成部１５は、配送条件データファイル６、受注データファイル８、車両情報データファイル１２、配送先情報データファイル１４を参照し（ステップＳ９１）、順次、配送先と倉庫とを抜き出し、その間の所要時間・走行距離を算出し、一時保管配送データを作成する（ステップＳ９２）。一時保管配送データと配送計画データに既に登録された数値とを比較し（ステップＳ９３）、一時保管配送データが配送計画データより良いとき、つまり最短の条件に近いとき、ステップＳ９４の処理に移り、受注データファイル８、配送先情報データ１４の制約を確認する（ステップＳ９４）。制約を満たしていれば、ステップＳ９５に処理が移り、配送条件データファイル６の指定倉庫の制約を確認する（ステップＳ９５）。ステップＳ９４及びステップＳ９５の制約を満たしていたら、一時保管配送データを配送計画データファイル１６に登録し（ステップＳ９６）、またステップＳ９２からの処理を繰り返す。ステップＳ９３で、一時保管配送データが配送計画データファイル１６のデータより悪いとき、ステップＳ９４及びステップＳ９５で制約を満たさないときは、ステップＳ９２からの処理に戻る。
【００５１】
ステップＳ９３で一時保管配送データと配送計画データとを比較し、最短であるかどうかを判定しているが、上述のとおり、この「最短」の条件は、所要時間または走行距離で予め決めておく。経由する倉庫を選択するときも、配送条件データファイル６に指定された倉庫があればその中から、指定された倉庫がなければ全ての倉庫の中から、前後の配送先との組合せで最短となる倉庫を選択する。
【００５２】
ステップＳ９６で配送計画データファイル１６に登録された一次保管配送データを、トリップと呼び、トリップを繋げていくと、１日の配送経路となる。例えば、トリップ１が、「車庫→配送先Ａ→配送先Ｅ→倉庫ａ→配送先Ｂ→倉庫ｃ」となっていたとすると、次に続くトリップ２は、「倉庫ｃ→配送先Ｂ→倉庫ｃ…」となる。１つのトリップの最後の到着地が、次のトリップの出発地となり、それにより１つの配送経路として構成することができる。以上説明したように、配送計画作成部１５は、特殊倉庫及び通常の配送先を同様に処理し、受注データの配送先が全て経由できるように、複数台のトラックの配送計画を策定する。
【００５３】
図１２は、配送計画データ加工部１７が配送計画加工ファイル１８を作成する処理の流れを示す、フローチャートである。配送計画データ加工部１７は、配送計画データファイル１６を読み出し（ステップＳ１０１）、トリップ単位で取り出す（ステップＳ１０２）。そのトリップが「特殊倉庫到着地」→「特殊倉庫配送先」→「特殊倉庫出発地」であるかどうかを確認し、「特殊倉庫到着地」→「特殊倉庫配送先」→「特殊倉庫出発地」トリップのときはステップＳ１０２の処理に戻り、そうでないときは該当ステップを配送計画加工ファイル１８に追加する（ステップＳ１０４）。その後、配送計画データファイル１６の次のトリップがあるかどうかを確認し（ステップＳ１０５）、次のトリップがあるときはステップＳ１０２の処理に戻り、トリップがないときは処理を終了する。このように配送計画加工ファイル１８を作成することで、車両が実際に走行する経路を作成することができ、この配送計画加工ファイル１８を紙に印刷したり、各車両に配送計画加工ファイル１８の内容を送信したりすることで、配送計画が各車両に伝達されることになる。
【００５４】
以上のように、本実施の形態における配送計画システムにおいては、１ヶ月の間に所定量の荷物の搭載を定めた倉庫を特殊倉庫とし、この特殊倉庫コード、及び１日の上記特殊倉庫への立ち寄り指定回数を受付け、立ち寄り指定回数分の受注データを、配送先を特殊倉庫配送先として作成し、この受注データに基づき、立ち寄り指定回数分、特殊倉庫を経由するようにしたので、特殊倉庫からの所定量の搭載を考慮した、効率的な配送計画を作成することができる。
【００５５】
また、車両情報データファイル１２に、トラック毎の運用形態を反映するように構成しているため、特殊倉庫を経由する経路を作成するとき、トラック側の条件を考慮することができる。
【００５６】
なお図３に示した、発着地間ルート検索部３が発着地位置データファイル２に基づき、発着地間時間・距離データファイル４を登録する処理の中で、受注データファイル６を考慮することにより、当日分の発着地間時間・距離データファイル４を登録するように構成することもできる。このように構成すると、より当日の所要時間及び走行距離に厳密なデータで配送計画データファイル１６を作成することができる。
【００５７】
さらに、本実施の形態において、配送条件データファイル６の作成を在庫システムと連動させ、倉庫・品種ごとに配送の可否を配送条件データに反映させることにより、在庫状況を考慮したマルチデポ配送計画の策定も可能になる。
【００５８】
また、本実施の形態では、Ａ地区にａ，ｂ，ｃの倉庫を有するＸ業者と、Ｂ地区にｄ，ｅ，ｆの倉庫を有するＹ業者間で荷物を融通する一例を示したが、１社内で、倉庫毎に生産計画（在庫計画）が、例えば月毎に定められるときなどにも本実施の形態は適用できる。
【００５９】
また、本実施の形態では、予め定められた期間（第１の期間）を１日、一定期間（第２の期間）を１ヶ月間としたが、それに限られるものではなく、一定期間（第２の期間）が予め定められた期間（第１の期間）と等しいか、それより長い期間であればそれぞれ任意に設定できる。また、１日の配送計画はその当日ではなく、前日に作成することも可能である。
【００６０】
実施の形態２．
図１３は、本実施の形態におけるシステム構成図を示したものである。また、本実施の形態においても、予め定められた期間を１日とし、１日の間で複数の倉庫を経由して、荷物を積み、配送先に配送する配送計画を作成するものとする。また、１日の配送計画はその当日に作成するものとする。
【００６１】
本実施の形態が実施の形態１と異なる点は、特殊倉庫処理部１９が１ヶ月の間に特殊倉庫から掲載する荷物の量を受け付け、その量を１日当たりに換算して、１日当たりの特殊倉庫への立ち寄り指定回数を算出し、その回数分の受注データを作成することである。実施の形態１では特殊倉庫回数受付部９が１日の立ち寄り回数を受付けていたのに対して、本実施の形態では、特殊倉庫受付部１９が１ヶ月に搭載する荷物の量の指定を受け付け、それを１日当たりに換算する。１日当たりに換算する方法としては、例えば１ヶ月の営業日が２０日だとしたときは、１ヶ月の搭載量を２０で割り、１日当たりの搭載量とする。または、１ヶ月の中の特定の日（例えば、曜日指定、日にち指定、期間指定、３日おきなどの間隔指定など）に特殊倉庫行きの経路を作成するように予め決めておき、その特定の日だけ受注データを作成するように構成することもできる。
【００６２】
図１３は、本実施の形態におけるシステム構成図である。図１３において、１〜１８は実施の形態１で用いた図１で説明したとおりである。上述したとおり、特殊倉庫処理部１９は１ヶ月の間に特殊倉庫から掲載する荷物の量を受け付け、その量を１日当たりに換算して、１日当たりの特殊倉庫への立ち寄り指定回数を算出する。
【００６３】
図１４は、特殊倉庫回数処理部１９が１ヶ月の特殊倉庫毎の荷物の搭載量を受け付ける受付画面２２である。受付画面２２では、特殊倉庫毎に、１ヶ月の搭載量を受け付ける。また特殊倉庫回数処理部１９は、配送計画策定者から予め特殊倉庫行き経路作成条件を受け付けていて、その経路作成条件に基づき、該当する日に特殊倉庫行き受注データを作成する。経路作成条件とは、上述したように、営業日全ての均一にする、曜日指定、日にち指定、期間指定、３日おきなどの間隔指定などが考えられる。受付画面２２への入力は、月初め又は前月の終わりなどに実施すればよく、新規特殊倉庫を指定するときは、「新規倉庫指定」ボタンを押下して、「倉庫名」と「搭載量/月」を入力後、「確定」ボタンを押下する。また図１３に示した、１〜１８に関する処理手順等は、実施の形態１で説明したとおりである。
【００６４】
以上のように、本実施の形態における配送計画システムにおいては、１ヶ月の間に所定量の荷物の搭載を定めた倉庫を特殊倉庫とし、特殊倉庫処理部１９が１ヶ月の間に特殊倉庫から掲載する荷物の量を受け付け、その量を１日当たりに換算して、１日当たりの特殊倉庫への立ち寄り指定回数を算出し、その回数分の受注データを作成する。また経路作成条件を予め入力しておくことができるので、配送計画策定者は１ヶ月に１度、特殊倉庫からの搭載量を指定すればよい。また、毎月変更にならないときは、一度受け付けた指定を引き継ぐように構成したり、月の途中での変更を受け付けたり、さらに１ヶ月の間の上旬・下旬のように期間を限定して、指定を受け付けるように構成することもできる。
【００６５】
【発明の効果】
本発明は、以上説明したように構成されているため、以下に示すような効果を奏する。
特定の倉庫に一定期間内に指定の回数だけ立ち寄り、荷物を積むように構成する、配送計画を作成することができる。
【図面の簡単な説明】
【図１】実施の形態１において、配送計画システムを実現するためのシステム構成図である。
【図２】実施の形態１における発着地位置データファイル２、発着地間時間・距離データファイル４、配送条件データファイル６、受注データファイル８、車両情報データファイル１２及び配送先情報データファイル１４のデータの構成を示した構成図である。
【図３】発着地登録部１及び発着地間ルート検索部３の処理の流れを示したフローチャートである。
【図４】発着地間ルート検索部３が登録した、発着地間時間・距離データファイル４の説明図である。
【図５】発着地間時間・距離データファイル４の実際の数値を入力した説明図である。
【図６】配送条件データファイル６、受注データファイル８、車両情報データファイル１２、配送先情報データファイル１４を登録する処理を示したフローチャートである。
【図７】特殊倉庫回数受付部９が特殊倉庫毎の指定回数を受付ける受付画面の説明図である。
【図８】特殊倉庫回数受付部９が特殊倉庫毎の指定回数を受付ける処理の流れを示したフローチャートである。
【図９】特殊倉庫回数受付部９が特殊倉庫の位置データを発着地位置データファイル２に登録する処理の流れを示したフローチャートである。
【図１０】特殊倉庫行受注データ作成部１０が受注データを作成する処理の流れを示したフローチャートである。
【図１１】配送計画作成部１５が配送計画データファイル１６を作成する処理の流れを示したフローチャートである。
【図１２】配送計画データ加工部１７が配送計画加工ファイル１８を作成する処理の流れを示したフローチャートである。
【図１３】実施の形態２において、配送計画システムを実現するためのシステム構成図である。
【図１４】実施の形態２において、特殊倉庫回数処理部１９が特殊倉庫毎の搭載量を受け付ける受付画面の説明図である。
【符号の説明】
１発着地登録部、２発着地位置データファイル、３発着地間ルート検索部、４発着地間時間・距離データファイル、５配送条件登録部、６配送データファイル、７受注情報登録部、８受注データファイル、９特殊倉庫回数受付部、１０特殊倉庫行受注データ作成部、１１車両情報登録部、１２車両情報データファイル、１３配送先情報登録部、１４配送先情報データファイル、１５配送計画作成部、１６配送計画データファイル、１７配送計画データ加工部、１８配送計画加工ファイル、１９特殊倉庫処理部。[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a delivery planning system, and more particularly to a delivery planning system configured to load a certain amount of luggage from a specific warehouse.
[0002]
[Prior art]
A conventional delivery planning system generally plans to load a single warehouse and deliver it to a plurality of delivery destinations. This is called a single depot system. Therefore, in the conventional delivery planning system, it is difficult to formulate a delivery plan so as to deliver to a plurality of delivery destinations via a plurality of warehouses called a multi-depot system. It is also difficult to formulate a delivery plan that uses one or a plurality of vehicles to drop in a specific warehouse a specified number of times within a certain period and load the packages.
[0003]
If the quality of goods to be delivered is, for example, cement, gas, crude oil, etc. stocked in multiple warehouses, but the quality does not change much, a certain amount of packing from a specific warehouse is exchanged for a certain period between multiple peers There are times when it operates. If parcels that are in stock in each warehouse are interchanged among traders, the number of warehouse candidates that can be selected according to the delivery route increases, and the overall delivery plan can be formulated efficiently. In addition, there is an advantage that it is easy to manage the inventory of luggage.
[0004]
Further, when the company's warehouses are scattered, a production plan (inventory plan) is determined for each warehouse, for example, every month, and thereby the shipment amount (package load amount) for each warehouse may be determined.
[0005]
However, the current system does not support multi-depot systems, and it is difficult to formulate a plan that takes into account the amount of cargo loaded from a specific warehouse. It was formulated.
[0006]
Also, JP 2000-3609 3 The publication includes (i) creating a set of transportation requests for each on-board capacity, (ii) generating a plurality of routes that satisfy the constraints, (iii) connecting a set of connected sets A delivery apparatus is disclosed that creates a delivery plan in three phases of route selection, in which an appropriate route is selected.
[0007]
[Patent Document 1]
JP 2000-36093 A
[0008]
[Problems to be solved by the invention]
The conventional delivery planning system has not been able to formulate a delivery plan to drop in a specific warehouse a specified number of times within a certain period and load the packages.
[0009]
Moreover, in the vehicle allocation apparatus disclosed in Patent Document 1, a technique is disclosed in which a set for each departure and arrival point is created and an appropriate route is selected from a plurality of route candidates connecting the sets. However, this Patent Document 1 is a vehicle allocation device in the case where the departure and arrival point is fixed, and when there are a plurality of candidates for distribution bases (warehouses), a warehouse corresponding to a delivery destination or a delivery route is selected from the candidates for the warehouse. Is not configured. In addition, it does not correspond to a delivery plan in which one or a plurality of vehicles are used to drop in a specific warehouse for a specified number of times within a certain period of time and load packages.
[0010]
The present invention has been made to solve such a problem, and corresponds to a multi-depot system, and uses one or a plurality of vehicles to drop in a specific warehouse for a specified number of times within a certain period of time. An object of the present invention is to obtain a delivery planning system and a delivery planning method that are configured to be mounted.
[0011]
[Means for Solving the Problems]
The delivery plan system according to the present invention is a delivery plan system that creates a delivery plan that passes through one or a plurality of garages, warehouses, and delivery destinations in a first predetermined period. A warehouse that has determined the loading of a predetermined amount of baggage within the period of time is designated as a special warehouse, the special warehouse code, and a special warehouse number reception unit that receives the specified number of stops to the special warehouse during the first period; The special warehouse number reception part accepts the order data for the specified number of visits, the special warehouse line order data creation part that creates the delivery destination as the special warehouse delivery destination, and the above-mentioned order number of visits based on the order data. A delivery plan creation unit for creating a delivery plan for the first period so as to pass through a special warehouse.
[0012]
In addition, based on the location data registered in the departure and arrival location data file, and the location data registered in the departure and arrival location data file, the location data of the garage, warehouse and delivery destination are moved between the respective location data. When calculating the required time, regarding the data where the departure location is the special warehouse arrival location and special warehouse delivery destination, the requirements other than between the special warehouse arrival location and special warehouse delivery destination, and between the special warehouse delivery destination and special warehouse departure location The time is calculated to be larger than the first period, and the required time between the special warehouse departure place and special warehouse arrival place and between the special warehouse departure place and special warehouse delivery destination is larger than the first period. And the inter-departure / departure route search unit for registering the calculation result in the time / distance data file between the departures / departures. The location data is registered in the departure / arrival location data file as the departure location, special warehouse arrival location, and special warehouse delivery destination, and the delivery plan creation unit determines whether the special warehouse arrival location is based on the time / distance data file between departure / arrival locations. The delivery plan within the first period is created so as to pass in the order of the special warehouse delivery destination and the special warehouse departure place.
[0013]
A delivery plan system for creating a delivery plan via one or a plurality of garages, warehouses and delivery destinations in a predetermined first period, wherein a predetermined amount is reached within a predetermined second period. The warehouse where the load is loaded is designated as a special warehouse, and the special warehouse code and the load amount from the special warehouse loaded within the second period are received, and the load amount is converted into the first period. A special warehouse processing unit that calculates the number of times of visits to the special warehouse in the first period according to the mounted quantity converted into the first period and the loading amount of the vehicle, The special warehouse processing unit calculates the order data for the specified number of stops, the special warehouse line order data creation unit that creates the delivery destination as the special warehouse delivery destination, and the specified number of stops based on the order data. Via warehouse Is characterized in that a delivery plan creation unit that creates a delivery schedule of the first period so that.
[0014]
In addition, when the delivery plan created by the delivery plan creation unit includes a route that passes through the special warehouse arrival location, special warehouse delivery destination, and special warehouse departure location, a delivery plan data processing unit is provided to delete this route. It is characterized by.
[0015]
Further, the delivery plan creation unit is characterized in that a delivery plan for each vehicle is determined according to the outgoing garage or the incoming garage designated for each vehicle.
[0016]
A program for causing a computer according to the present invention to execute a delivery planning method is a warehouse in which a predetermined amount of baggage is loaded within a predetermined second period as a special warehouse, the special warehouse code, and the above The number-of-stops reception step for receiving the specified number of stops to the special warehouse within the first period, and the order data for the specified number of stops received by the stop-number reception step are created with the delivery destination as the special warehouse delivery destination. A special warehouse line order data creation step and a delivery plan creation step for creating a delivery plan within the first period so as to pass through the special warehouse for the number of times specified by the stoppage based on the order data. is there.
[0017]
A program for causing a computer according to the present invention to execute a delivery planning method includes an arrival / departure registration step of registering the location data of the garage, warehouse, and delivery destination in an arrival / departure location data file, and a predetermined second A warehouse in which a predetermined amount of baggage is loaded within a period is designated as a special warehouse, and the number of visits to receive the special warehouse code and the number of visits to the special warehouse within the first period are specified. The location data registration step of registering the special warehouse received in the reception step as the special warehouse departure location, special warehouse arrival location, and special warehouse delivery destination in the departure and arrival location data file, and the departure and arrival location data file Based on the registered location data, when calculating the time required to move between each location data, Regarding the data that will be the warehouse arrival location and special warehouse delivery destination, the required time other than between the special warehouse arrival location and special warehouse delivery destination and between the special warehouse delivery destination and special warehouse departure location is calculated to be larger than the first period. Further, a special warehouse time calculating step for calculating the required time between the special warehouse departure place / special warehouse arrival place and between the special warehouse departure place / special warehouse delivery destination to be larger than the first period, and the special warehouse The result calculated in the time calculation step is registered in the inter-departure / departure time / distance data file, and the order data for the specified number of stops received by the above stop count reception step and the delivery destination as a special warehouse Based on the special warehouse line order data creation step to be created as the delivery destination, the order data and the time / distance data file between the departure and arrival points, Special warehouse destination, so as to pass through in order of special warehouses departure, in which a delivery plan generating step of generating a delivery plan within the first period.
[0018]
A program for causing a computer according to the present invention to execute a delivery planning method includes an arrival / departure registration step of registering the location data of the garage, warehouse, and delivery destination in an arrival / departure location data file, and a predetermined second A warehouse where a predetermined amount of luggage is loaded within a period is designated as a special warehouse, and a special warehouse condition receiving step for receiving the special warehouse code and the loaded quantity from the special warehouse during the second period; The load amount received in the warehouse condition reception step is converted into the first period, and the special warehouse in the first period is further converted according to the load amount and the load amount of the vehicle converted into the first period. Special warehouse processing step that calculates the number of stopovers specified and the order data for the specified number of stops calculated by the above special warehouse processing step, with the delivery destination as the special warehouse delivery destination A special warehouse line order data creation step to be created, and a delivery plan creation step for creating a delivery plan within the first period so as to pass through the special warehouse for the specified number of stops based on the order data It is.
[0019]
Furthermore, after the delivery plan creation step, a delivery plan data processing step is provided for deleting a route that passes through a special warehouse arrival point, a special warehouse delivery destination, and a special warehouse departure point. Is.
[0020]
DETAILED DESCRIPTION OF THE INVENTION
Embodiment 1 FIG.
The delivery plan system according to the present embodiment sets a predetermined period (first period) as one day, loads a package via a plurality of warehouses in one day, and delivers it to a delivery destination. Shall be created. In addition, a one-day delivery plan is created on that day.
[0021]
In addition, for example, cement, gas, crude oil, etc., which are stocked in multiple warehouses, are considered to be of a quality that does not change much, and packing from a specific warehouse is performed between multiple peers over a certain period of time. An example of operation to exchange fixed amounts will be shown. In addition, this fixed period (second period) is one month in this embodiment. In this way, if the parcels of each warehouse are interchanged between the same traders, the number of warehouse candidates that can be selected according to the delivery route increases, and the entire delivery plan can be formulated efficiently. In addition, there is an advantage that it is easy to manage the inventory of luggage.
[0022]
Furthermore, a specific warehouse in which packing from the warehouse (loading amount of the load) is set to a predetermined amount is called a special warehouse, and the loading amount is determined for each special warehouse. For example, it is assumed that there is an X trader having warehouses a, b, and c in the A district and a Y trader having warehouses d, e, and f in the B district. When delivering goods in the vicinity of District A, the Trader X only needs to load packages from the warehouse owned by Trader X. However, when delivering goods in the vicinity of District B, the Trader X can also load goods from the warehouse owned by Trader X. As a result, the delivery route becomes inefficient. The same applies to the Y trader, which is good when delivering around the B district, but inefficient when delivering around the A district. For this reason, a contract may be made between the X trader and the Y trader to allow the luggage to be accommodated from the warehouses owned by each. For example, suppose Y dealer loads 100t / month from warehouse a, 200t / month from warehouse b, 300t / month from warehouse c, X trader 200t / month from warehouse d, 200t / month from warehouse e. It is determined that a load of 200 tons / month will be loaded from the f warehouse. By comprising in this way, each contractor can formulate a delivery plan efficiently.
[0023]
Also, what is characteristic in the present embodiment is that, for example, the amount of 200 tons mounted on the moon is determined by the number of times the truck (vehicle) stops. Assuming that the load of the maximum load capacity of the truck is loaded by one stop, the load amount per month is calculated. At this time, the amount of luggage per month can be allocated in advance to the average in a day, and the number of stops per day can be determined according to the amount of the day and the loading capacity of the truck. It is also possible to set a different number of visits for each day. This is arbitrarily determined by the delivery planner.
[0024]
FIG. 1 shows a system configuration diagram in the present embodiment. In FIG. 1, the arrival / departure registration unit 1 registers position data (departure / departure code, latitude / longitude) of a garage, a delivery destination, and a warehouse in advance in a departure / arrival position data file 2. Based on the information registered in the departure / arrival location registration data file 2, the inter-departure / arrival route search unit 3 calculates the time (required time) required to move between the departure and arrival points and the travel distance at that time, and the result is calculated. It is registered in the time / distance data file 4 between the departure and arrival points. The delivery condition registration unit 5 registers delivery conditions in the delivery condition data file 6, and the order information registration unit 7 receives a slip code, a delivery date, a delivery destination code, and delivery content information (delivery destination code, product type, The delivery contents such as delivery weight) are registered in the order data file 8.
[0025]
The special warehouse number reception unit 9 receives the designation of the special warehouse and the number of stoppages of the day from the delivery plan maker, and registers the position data of the special warehouse in the departure / arrival position data file 2. At this time, the special warehouse is designated as “special warehouse departure place”, “special warehouse arrival place”, and “special warehouse delivery destination”, and the same position data having different departure and arrival codes are registered in the departure and arrival position data file 2. Also, special warehouse line order data creation Part 10 creates order data for the designated number of stops accepted by the special warehouse number reception unit 9 with the delivery destination as the “special warehouse delivery destination”.
[0026]
The vehicle information registration unit 11 registers vehicle information in the vehicle information data file 12, and the delivery destination information registration unit 13 registers delivery destination information in the delivery destination information data file 14. The delivery plan creation unit 15 is based on the shortest route based on the time / distance data file 4 between arrival and departure, the delivery condition data file 6, the order data file 8, the vehicle information data file 12, and the delivery destination information data file 14. And a delivery plan data file 16 is created based on the result. Further, the delivery plan creation unit 15 creates a route so that the special warehouse is routed in the order of “special warehouse arrival place”, “special warehouse delivery destination”, and “special warehouse departure place”. The shortest condition adopted by the delivery plan creation unit 15 is arbitrarily determined by the required time or the travel distance.
[0027]
Further, the delivery plan data processing unit 17 has a route in the order of “special warehouse arrival place”, “special warehouse delivery destination”, and “special warehouse departure place” in the delivery plan data file 16. The route is deleted, and a delivery plan processing file 18 is created as a route on which the vehicle actually travels. By printing the delivery plan processing file 18 on paper or transmitting the contents of the delivery plan processing file 18 to each vehicle, the delivery plan is transmitted to each vehicle.
[0028]
The configuration for stopping by a specified number of times in a special warehouse in the present embodiment will be briefly described as follows.
[0029]
(1) The special warehouse number reception unit 9 designates the special warehouse as “special warehouse departure place”, “special warehouse arrival place”, and “special warehouse delivery destination”, and the same location data having different departure and arrival codes respectively. Register in data file 2.
[0030]
(2) Special warehouse line order data creation Part 10 creates order data corresponding to the number of times of drop-in, with the delivery destination as the “special warehouse delivery destination”.
[0031]
(3) For the special warehouse, the delivery plan creation unit 15 creates a route so as to pass through in the order of “special warehouse arrival place”, “special warehouse delivery destination”, and “special warehouse departure place”.
[0032]
Further, FIG. 2 shows the data of the above-described departure / arrival position data file 2, inter-departure time / distance data file 4, delivery condition data file 6, order data file 8, vehicle information data file 12 and delivery destination information data file 14. The structure of is shown. In FIG. 2, the departure / arrival position data file 2 includes data of “departure / departure code (ID)” and “latitude / longitude” of the departure / arrival place. Further, the time / distance data file 4 between the departure and arrival points includes data of “departure place code”, “arrival place code”, “required time”, and “travel distance”. The “departure code” and “arrival code” are the “departure code” indicating the place of departure and the place of arrival, respectively, “departure code”, “arrival code” and “departure code”. Are the same code.
[0033]
Furthermore, in FIG. 2, the delivery condition data file 6 includes a “destination / departure code (delivery destination)” of the delivery destination, “product information” such as the type of product to be delivered, and “departure / arrival place” of the warehouse where the product is stored. "Code" information. Multiple warehouses may be targeted for the same delivery destination and product information. At that time, different “departure / departure codes ( Warehouse) ”is registered as multiple records. The order data file 8 includes “slip code”, “delivery date”, “departure / arrival code (delivery destination)”, and “delivery content information” which is product information such as the type of product to be delivered.
[0034]
The vehicle information data file 12 includes a vehicle type, a vehicle type, a delivery time, a maximum load capacity, a belonging garage (incoming garage, outgoing garage), operation mode, and the like as “vehicle code” and “vehicle attribute information” ( In FIG. 2, “vehicle attribute information” is described as “attribute data 1” to “attribute data n”). The delivery destination information data file 14 includes a deliverable vehicle type, a deliverable vehicle type, a deliverable time zone, and the like as “departure / arrival code” and “delivery destination attribute information” (in FIG. 2, “delivery destination attribute information” , “Attribute data 1” to “attribute data n”).
[0035]
Next, the process flow for creating the delivery plan data file 16 and the delivery plan processing file 18 will be described in order. FIG. 3 shows a process in which the landing / registration registration unit 1 registers the departure / landing position data file 2, and the inter-departure / landing route search unit 3 registers the inter-departure / landing time / distance data file 4 based on the landing / landing position data 2. It is the flowchart which showed the flow of the process. The departure / arrival registration unit 1 accepts new registration of position data relating to the departure / arrival (step S1), and registers the received position information in the departure / arrival position data file 2 (step S2). The process of the arrival / departure registration unit 1 is performed as needed when a new delivery plan is to be created or when a departure / arrival point is added.
[0036]
The inter-departure / departure route search unit 3 refers to the depot / departure location data file 2 and uses the same code as the “departure / departure code” as the “departure code” and “arrival code” in the inter-departure time / distance data file 4. (Step S11). Thereafter, the route search unit 3 between departures and arrivals calculates the required time and travel distance between the “departure point code” and the “arrival point code” registered in the time / distance data file 4 between departures and arrivals (step S12). The calculation result is registered in the time / distance data file 4 between departure and arrival (step S13). The processes of the arrival / departure registration unit 1 and the inter-departure / departure route search unit 3 can be linked, and the process of the inter-departure / departure route search unit 3 can also be configured to be performed under certain conditions. .
[0037]
FIG. 4 shows the inter-departure / departure route search unit 3 that calculates the time (required time) required to move between the depots and the travel distance at that time and registers the results for all the inter-departure / departure points. It is explanatory drawing of the time and distance data file. The inter-departure time / distance data file 4 shown in FIG. 2 indicates the departure place by “departure code”, the arrival place by “arrival place code”, and the “required time” and “travel distance” of the route. Registered. If this inter-departure / landing time / distance data file 4 is shown in another form, it can be a matrix table as shown in FIG. In the example shown in FIG. 4, the row direction (described as “From” in FIG. 4, rows 1 to 11) is the departure point, and the column direction (described as “To” in FIG. 4, columns A to K) arrives. As the ground, numerical values obtained by calculating the required time and travel distance required for movement between the garage α, the delivery destinations (A to E), and the warehouses (a to c) are registered. FIG. 4A is a matrix table based on the required time between landings, and FIG. 4B is a matrix table based on the travel distance between the landings. 4A and 4B show frame names (A1 to K11) defined by rows and columns. Actually, the required time or travel distance is registered. In addition, since the route is not normally selected when the departure and arrival points are the same, “0” is written as an example in the frame where the departure and arrival points are the same. As will be described later, the route where the required time is usually “0” is not selected, but for special warehouses, “Special warehouse arrival place” → “Special warehouse delivery destination” and “Special warehouse delivery destination” → “Special Since the route is in the order of “warehouse departure place”, the route whose required time is “0” is selected.
[0038]
Among the warehouses (a to c), the warehouse b is a special warehouse with a specified number of stopovers. Therefore, for one special warehouse warehouse b, “special warehouse arrival place”, “special warehouse delivery destination” Three “departure / departure code” of “special warehouse departure place” are registered in each of “departure place code” and “arrival place code”. In FIG. 4, “special warehouse arrival place”, “special warehouse delivery destination”, and “special warehouse departure place” are described as “b arrival”, “b delivery destination”, and “b departure”.
[0039]
Further, FIG. 5A is an example in which the actual required time is input to the time-distance data file 4 shown in FIG. The inter-departure / departure route search unit 3 calculates the time (required time) required to move between the departures / departments, except when the special warehouse is the depot, and registers it in the inter-departure / departure time / distance data file 4. The required time and travel distance are registered in the time / distance data file 4 between departures and arrivals, and the delivery plan creation unit 15 creates a route so as to be the shortest, but the “special warehouse delivery destination” is the delivery destination. For order data, the shortest time is calculated using the required time.
[0040]
For delivery destinations other than order data for which the “special warehouse delivery destination” is the delivery destination, the shortest condition is determined by the required time or travel distance. At this time, the shortest is the following (1) ~ (5) Can be considered.
(1) The shortest mileage of empty cars (without luggage) from the garage or delivery destination to the warehouse
(2) The shortest traveling distance of the actual vehicle (with luggage) from the warehouse to the delivery destination
(3) The shortest mileage of the entire route including the empty vehicle and the actual vehicle
(4) Minimum time required for empty vehicles (no luggage) from the garage or delivery location to the warehouse
(5) The shortest time required for an actual vehicle (with luggage) from the warehouse to the delivery destination
Then, the delivery plan creation unit 15 operates as follows when the special warehouse is a departure / arrival place to stop at the special warehouse for the designated number of times.
[0041]
(1) Regarding the data where the departure points are “Special warehouse arrival place” and “Special warehouse delivery destination”, “Special warehouse arrival place” and “Special warehouse delivery destination” and “Special warehouse delivery destination” and “Special warehouse” For the required time other than between “Departure points”, enter a time longer than the daily operating time.
Enter “0” between “Special warehouse arrival place” and “Special warehouse delivery destination” and between “Special warehouse delivery destination” and “Special warehouse departure place”.
(2) Enter the time required between “special warehouse departure place” and “special warehouse arrival place”, and between “special warehouse departure place” and “special warehouse delivery destination”, which is longer than the daily operation time. Enter “0” between “Special warehouse departure place” and “Special warehouse departure place”. Otherwise, if the departure location is "Special warehouse departure location", calculate and enter the required time.
If the daily operation time is 8 hours, inputting a time larger than the operation time means, for example, inputting 9 hours, and the delivery plan creating unit 15 thereby sets “9 hours”. The registered route is not selected. In FIG. 5 (a), the time calculated larger than the operation time is described as “∞”, but in actuality, a time larger than the operation time (for example, 9 hours) is fixedly registered. .
The above (1) and (2) will be described with reference to FIG. 5 (a) as follows (3) and (4).
(3) When the departure place is “arrival at b”, the required time between the arrival places “b delivery destination” is “0”, and other arrival places are “∞”. When the departure place is “b delivery destination”, the required time between the arrival places “b departure” is “0”, and the other arrival places are “∞”.
(4) The required time between “b departure” and “b arrival” and between “b departure” and “b delivery destination” is “∞”. The distance between “b departure” and “b departure” is “0”. For other routes starting from “b departure”, the required time is calculated and input.
As described above, by constructing the time / distance data file 4 between the departure and arrival points, regarding the route passing through the special warehouse, “special warehouse arrival place”, “special warehouse delivery destination”, “special warehouse departure place” You can make a mechanism to go through in order.
[0042]
Moreover, when the route search part 3 between departures and arrivals calculates a travel distance and required time, the method similar to a navigation system can be used. In the navigation system, all intersections on the map are indicated by points called nodes with the latitude and longitude as x and y coordinates, and the road between the intersections is indicated by a line called a link. Has been. Additional information such as the distance between intersections, the shape (curve, straight line, etc.), the type of national road or highway, one-way (direction), average speed data, etc. is given to the link. Information on these nodes and links is a database of the navigation system. If these pieces of information are used, the above-described time-distance data file 4 can be obtained by calculation.
[0043]
By taking the order data file 8 into consideration in the process of registering the time / distance data file 4 between the departure and arrival based on the departure / arrival position data 2 shown in FIG. It can also be configured to register the time / distance data file 4 between the departure and arrival for the day. At this time, in the process of step S11, the route search unit 3 between departures and arrivals refers to the departure / arrival position data file 2 and the order data file 8, and is registered as the delivery destination for the current day of the order data file 8. Further, the “departure code” and “arrival code” are registered in the inter-departure time / distance data file 4. If comprised in this way, the delivery plan data file 16 can be created with data exacting the required time and travel distance of the day.
[0044]
FIG. 6 is a flowchart showing the processing flow of the delivery condition registration unit 5, the order information registration unit 7, the vehicle information registration unit 11, and the delivery destination information registration unit 13. The delivery condition registration unit 5 accepts delivery condition registration (step S21), and registers the accepted delivery condition in the delivery condition data file 6 (step S22). The order information registration unit 7 accepts registration of order information (step S31), and registers the accepted order information in the order data file 8 (step S32). The vehicle information registration unit 11 receives registration of vehicle information (step S41), and registers the received vehicle information in the vehicle information data file 12 (step S42). The delivery destination information registration unit 13 accepts registration of delivery destination information (step S51), and registers the accepted delivery destination information in the delivery destination information data file 14 (step S52). The processing of the delivery condition registration unit 5, the order information registration unit 7, the vehicle information registration unit 11, and the delivery destination information registration unit 13 is performed at any time, for example, when receiving order information or when registering new conditions. Since the order data file 8 has an item “delivery date”, it is possible to accept in advance order data for which a delivery date is specified.
[0045]
FIG. 7 shows an example of a reception screen in which the special warehouse number reception unit 9 receives a specified number of stops for each special warehouse. The reception screen 21 receives a special warehouse and the designated number of stops for each special warehouse from the delivery plan maker. As shown in FIG. 7, “warehouse b” is designated 3 times, “warehouse x” is designated twice, “warehouse y” is designated once, and “warehouse z” is designated twice. “Warehouse b”, “Warehouse x”, “Warehouse y”, and “Warehouse z” are already registered special warehouses. To register a new special warehouse, click the “Specify new warehouse” button. Press to specify “Warehouse Name” and “Number of Stops / Day”. After that, press the “Confirm” button to confirm, and the “Cancel” button to cancel the contents once entered.
[0046]
FIG. 8 is a flowchart showing a flow of processing in which the special warehouse number receiving unit 9 receives the specified number of times for each special warehouse. The special warehouse number reception unit 9 displays the reception screen 21 and receives designation of the number of visits for each special warehouse from the delivery plan formulater (step S61). The configuration of the reception screen 21 is as shown in FIG. 7, and the number of visits for each existing and new special warehouse is received. Thereafter, the special warehouse number reception unit 9 stores the received number of visits for each special warehouse as temporary data (step S62), and then extracts storage data for each special warehouse from the temporary data (step S63). The special warehouse number reception unit 9 registers the position data of the special warehouse extracted in step S63 in the departure / arrival position data file 2 (step S64), and the special warehouse line order data creation 10 sets “special warehouse delivery destination” as the delivery destination. As shown, the order data corresponding to the number of times of drop-in is created (step S65). The process shown in step S64 is shown in detail in FIG. 9, and the process shown in step S65 is shown in detail in FIG. Thereafter, in step S66, it is confirmed whether or not the next special warehouse is registered in the temporary data stored in step S62. If there is no next special warehouse, the process is terminated. The process returns to S63.
[0047]
FIG. 9 is a flowchart showing a flow of processing in which the special warehouse number reception unit 9 registers the position data of the special warehouse in the departure / arrival position data file 2. The special warehouse number reception unit 9 refers to the storage data taken out for each special warehouse (step S71), and “special warehouse arrival place”, “special warehouse delivery destination”, and “special warehouse departure place” corresponding to the special warehouse are displayed. It is confirmed whether or not it is registered in the departure / arrival position data file 2 (step S72). If it is already registered, the process is terminated. If it is not registered, the position data is registered in the departure / arrival position data file 2 as “special warehouse arrival place”, “special warehouse delivery destination”, and “special warehouse departure place”, and the process ends (step S73). . As described above, the warehouse b uses “b arrival”, “b delivery destination”, and “b departure”, but specifically, the corresponding arrival / departure code is registered.
[0048]
FIG. 10 is a flowchart showing a flow of processing in which the special warehouse line order data creation unit 10 creates order data. The special warehouse line order data creation unit 10 refers to the storage data taken out for each special warehouse (step S81), reads the number of stoppages specified, refers to the arrival / departure location data file 2, and sets “special warehouse delivery destination” to “ As the “departure / landing code (delivery destination)”, the order data corresponding to the number of times is created (step S82) and stored in the order data file 8 (step S83). End the process.
[0049]
8 to 10, the position data of the special warehouse can be registered in the departure / arrival position data file 2, the order data for the number of times of stopping can be created, and can be registered in the order data file 8.
[0050]
Next, the flow of processing in which the delivery plan creation unit 15 creates the delivery plan data file 16 will be described with reference to FIG. The delivery plan creation unit 15 refers to the delivery condition data file 6, the order data file 8, the vehicle information data file 12, and the delivery destination information data file 14 (step S91), and sequentially extracts the delivery destination and the warehouse. The required time / travel distance is calculated and temporary storage / delivery data is created (step S92). The temporary storage / delivery data is compared with the numerical value already registered in the delivery plan data (step S93). When the temporary storage / delivery data is better than the delivery plan data, that is, close to the shortest condition, the process proceeds to step S94. The restrictions on the order data file 8 and the delivery destination information data 14 are confirmed (step S94). If the restriction is satisfied, the process moves to step S95, and the restriction of the designated warehouse in the delivery condition data file 6 is confirmed (step S95). If the constraints of step S94 and step S95 are satisfied, the temporary storage delivery data is registered in the delivery plan data file 16 (step S96), and the processing from step S92 is repeated. If the temporarily stored delivery data is worse than the data in the delivery plan data file 16 in step S93, the process returns to step S92 if the constraints are not satisfied in steps S94 and S95.
[0051]
In step S93, the temporary storage delivery data is compared with the delivery plan data to determine whether or not it is the shortest. As described above, this “shortest” condition is determined in advance by the required time or the travel distance. . When selecting a warehouse to be routed through, if there is a warehouse specified in the delivery condition data file 6, and if there is no specified warehouse, it will be the shortest in combination with the preceding and following delivery destinations from all warehouses. Select a warehouse to become.
[0052]
The primary storage and delivery data registered in the delivery plan data file 16 in step S96 is called a trip, and when trips are connected, it becomes a delivery route for one day. For example, if trip 1 is “garage → delivery destination A → delivery destination E → warehouse a → delivery destination B → warehouse c”, then the next trip 2 is “warehouse c → delivery destination B → warehouse c”. … ”. The last arrival point of one trip becomes the departure point of the next trip and can thus be configured as one delivery route. As described above, the delivery plan creation unit 15 processes special warehouses and normal delivery destinations in the same manner, and formulates a delivery plan for a plurality of trucks so that all delivery destinations of order data can pass through.
[0053]
FIG. 12 is a flowchart showing a flow of processing in which the delivery plan data processing unit 17 creates the delivery plan processing file 18. The delivery plan data processing unit 17 reads the delivery plan data file 16 (step S101) and takes it out in trip units (step S102). Check if the trip is “Special warehouse arrival location” → “Special warehouse delivery destination” → “Special warehouse departure location”, then “Special warehouse arrival location” → “Special warehouse delivery destination” → “Special warehouse departure location” "When a trip occurs, the process returns to step S102. Otherwise, the corresponding step is added to the delivery plan processing file 18 (step S104). Thereafter, it is confirmed whether or not there is a next trip in the delivery plan data file 16 (step S105). If there is a next trip, the process returns to step S102, and if there is no trip, the process ends. By creating the delivery plan processing file 18 in this way, a route along which the vehicle actually travels can be created. This delivery plan processing file 18 can be printed on paper, or the distribution plan processing file 18 can be stored on each vehicle. By transmitting the contents, the delivery plan is transmitted to each vehicle.
[0054]
As described above, in the delivery planning system according to the present embodiment, a warehouse in which a predetermined amount of baggage is loaded in one month is designated as a special warehouse. Accepting the specified number of stops, and creating the order data for the specified number of stops as the special warehouse delivery destination, and based on this order data, it was routed through the special warehouse for the specified number of stops. It is possible to create an efficient delivery plan that takes into account the installation of a predetermined amount.
[0055]
Further, since the vehicle information data file 12 is configured to reflect the operation mode for each truck, the conditions on the truck side can be taken into consideration when creating a route passing through the special warehouse.
[0056]
By taking the order data file 6 into consideration in the process of registering the time / distance data file 4 between the departure and arrival points based on the departure / arrival position data file 2, as shown in FIG. Further, it can be configured to register the time / distance data file 4 between the departure and arrival for the day. If comprised in this way, the delivery plan data file 16 can be created with data exacting the required time and travel distance of the day.
[0057]
Furthermore, in the present embodiment, the creation of the delivery condition data file 6 is linked with the inventory system, and the delivery condition data is reflected in the delivery condition data for each warehouse and product type, thereby creating a multi-depot delivery plan that takes into account the inventory status. Is also possible.
[0058]
In the present embodiment, an example is shown in which baggage is interchanged between an X trader having warehouses a, b, and c in the A district and a Y trader having warehouses d, e, and f in the B district. This embodiment can also be applied when a production plan (inventory plan) is determined for each warehouse in one company, for example, every month.
[0059]
In the present embodiment, the predetermined period (first period) is one day and the predetermined period (second period) is one month. However, the present invention is not limited to this, and the predetermined period (first period) 2 period) can be arbitrarily set as long as it is equal to or longer than a predetermined period (first period). Also, the daily delivery plan can be created not on the current day but on the previous day.
[0060]
Embodiment 2. FIG.
FIG. 13 shows a system configuration diagram in the present embodiment. Also in the present embodiment, it is assumed that a predetermined period is one day, and a delivery plan is created in which packages are loaded and delivered to a delivery destination via a plurality of warehouses within one day. In addition, a one-day delivery plan is created on that day.
[0061]
This embodiment is different from the first embodiment in that the special warehouse processing unit 19 accepts the amount of packages posted from the special warehouse during one month, converts that amount per day, and specials per day. It is to calculate the specified number of times to drop in to the warehouse and create order data for that number of times. In the first embodiment, the special warehouse number reception unit 9 accepts the number of visits per day, whereas in this embodiment, the special warehouse reception unit 19 accepts designation of the amount of luggage to be loaded in one month. , Convert it per day. As a method of converting per day, for example, if the business day of a month is 20 days, the load amount per month is divided by 20 to obtain the load amount per day. Alternatively, it is determined in advance that a route to a special warehouse is created on a specific day of the month (for example, a day of the week, a date, a period, an interval of every third day, etc.). It can also be configured to create order data only for days.
[0062]
FIG. 13 is a system configuration diagram according to the present embodiment. In FIG. 13, 1 to 18 are the same as those described in FIG. 1 used in the first embodiment. As described above, the special warehouse processing unit 19 receives the amount of luggage to be posted from the special warehouse during one month, converts the amount per day, and calculates the number of times of stop-by designated to the special warehouse per day.
[0063]
FIG. 14 shows a reception screen 22 in which the special warehouse number processing unit 19 accepts the load amount of the package for each special warehouse for one month. On the reception screen 22, the loading amount for one month is received for each special warehouse. The special warehouse number processing unit 19 receives a special warehouse route creation condition in advance from a delivery plan maker, and creates special warehouse order data on a corresponding day based on the route creation condition. As described above, the route creation condition may be, for example, a day designation, a date designation, a period designation, an interval designation such as every third day, etc., for all business days. Input to the reception screen 22 may be performed at the beginning of the month or at the end of the previous month. When a new special warehouse is specified, the “specify new warehouse” button is pressed, and the “warehouse name” and “loading amount / After entering "Month", press the "Confirm" button. Further, the processing procedures and the like regarding 1 to 18 shown in FIG. 13 are as described in the first embodiment.
[0064]
As described above, in the delivery planning system according to the present embodiment, a warehouse in which a predetermined amount of baggage is loaded in one month is designated as a special warehouse, and the special warehouse processing unit 19 starts from the special warehouse in one month. It accepts the amount of packages to be posted, converts the amount per day, calculates the number of times of visit to a special warehouse per day, and creates order data for that number of times. In addition, since route creation conditions can be input in advance, the delivery planner should specify the amount of load from the special warehouse once a month. In addition, when it does not change every month, it is configured to take over the designation that was accepted once, accept the change in the middle of the month, and further specify the period, such as early and late for a month Can also be configured to accept.
[0065]
【The invention's effect】
Since the present invention is configured as described above, the following effects can be obtained.
It is possible to create a delivery plan that is configured to drop in a specific warehouse a specified number of times within a certain period and load the packages.
[Brief description of the drawings]
FIG. 1 is a system configuration diagram for realizing a delivery planning system in a first embodiment.
2 shows a departure / arrival position data file 2, an inter-departure time / distance data file 4, a delivery condition data file 6, an order data file 8, a vehicle information data file 12, and a delivery destination information data file 14 in the first embodiment. It is the block diagram which showed the structure of data.
FIG. 3 is a flowchart showing a processing flow of a departure / arrival registration unit 1 and a route search unit 3 between departures / arrivals.
4 is an explanatory diagram of an inter-departure / departure time / distance data file 4 registered by an inter-departure / departure route search unit 3. FIG.
FIG. 5 is an explanatory diagram in which actual numerical values of a time / distance data file 4 between departure and arrival are input.
6 is a flowchart showing processing for registering a delivery condition data file 6, an order data file 8, a vehicle information data file 12, and a delivery destination information data file 14. FIG.
FIG. 7 is an explanatory diagram of a reception screen in which a special warehouse number reception unit 9 receives a specified number of times for each special warehouse.
FIG. 8 is a flowchart showing a flow of processing in which a special warehouse number receiving unit 9 receives a specified number of times for each special warehouse.
FIG. 9 is a flowchart showing a flow of processing in which the special warehouse number reception unit 9 registers position data of a special warehouse in the departure / arrival position data file 2;
FIG. 10 is a flowchart showing a flow of processing in which special warehouse line order data creation unit 10 creates order data.
FIG. 11 is a flowchart showing a flow of processing in which a delivery plan creation unit 15 creates a delivery plan data file 16;
FIG. 12 is a flowchart showing a flow of processing in which a delivery plan data processing unit 17 creates a delivery plan processing file 18;
FIG. 13 is a system configuration diagram for realizing a delivery planning system in the second embodiment.
FIG. 14 is an explanatory diagram of a reception screen in which the special warehouse number processing unit 19 receives the loading amount for each special warehouse in the second embodiment.
[Explanation of symbols]
1 departure / arrival registration unit, 2 departure / arrival position data file, 3 route search unit between departures / arrivals, 4 time / distance data file between departures / arrivals, 5 delivery condition registration unit, 6 delivery data file, 7 order information registration unit, 8 orders received Data file, 9 Special warehouse number reception part, 10 Special warehouse line order data creation part, 11 Vehicle information registration part, 12 Vehicle information data file, 13 Delivery destination information registration part, 14 Delivery destination information data file, 15 Delivery plan creation part , 16 Delivery plan data file, 17 Delivery plan data processing unit, 18 Delivery plan process file, 19 Special warehouse processing unit.

Claims

A delivery plan system for creating a delivery plan via one or more garages, warehouses and delivery destinations in a first predetermined period,
A delivery plan data file in which the delivery plan for the first period is stored;
A departure / arrival registration unit for registering the position data of the garage, warehouse, and delivery destination in a departure / arrival position data file;
An order information registration unit that accepts registration of order information and registers the delivery date and location data of the delivery destination as order data in the order data file;
A warehouse that determines the loading of a predetermined amount of baggage within a predetermined second period is designated as a special warehouse, and the special warehouse code and the number of times of visit to the special warehouse within the first period are designated, A special warehouse number reception unit for registering the special warehouse as the special warehouse departure place, special warehouse arrival place, and special warehouse delivery destination in the departure / arrival position data file;
A special warehouse line order data creation unit that creates the delivery destination as a special warehouse delivery destination and stores the received order data for the specified number of stops received by the special warehouse number reception unit,
Based on the location data registered in the above departure / arrival location data file, when calculating the time required for movement between each location data, the time required between the special warehouse delivery destinations for the data where the departure location is the special warehouse arrival location Is calculated so that the required time between the other destinations is greater than the first period, and the required time between the special warehouse departure locations is 0 for the data of the special warehouse delivery destination as the departure location, The required time between arrival locations other than is calculated so as to be larger than the first period, and the required time between special warehouse arrival locations and special warehouse delivery destinations for the data of departure location of special warehouse is 1st The time required between the arrival points is calculated using the above arrival / departure location data file, and the special warehouse delivery destination and the special warehouse departure point are used as the arrival point data. The departure time is calculated so that the required time between the departure points other than the special warehouse departure point, the special warehouse arrival point, and the special warehouse delivery destination is larger than the first period. The route search section between departures and arrivals registered in the distance data file,
Reads the order data registered in the order data file, sequentially extracts the delivery destination stored in the order data and the warehouse, creates temporary storage delivery data, and calculates the required time or mileage of the temporary storage delivery data When the required time or travel distance is shorter than the delivery plan stored in the delivery plan data file, the temporary storage delivery data is registered in the delivery plan data file, and the required time is the first time. By operating so as not to select a route that exceeds the period, the special warehouse departure location, special warehouse arrival location, and special warehouse delivery destination registered in the above time-distance time / distance data file must be the departure location or arrival location. When creating a route for a special warehouse based on time data, the special warehouse arrival location, special warehouse delivery destination, special warehouse output As temporary storage distribution data to create a path through the land of the order registered in the delivery plan data file, the path created by connecting the delivery plan the temporary storage delivery data registered in the data file, the delivery plan A delivery plan system comprising a delivery plan creation unit for storing in a data file.

A delivery plan system for creating a delivery plan via one or more garages, warehouses and delivery destinations in a first predetermined period,
A delivery plan data file in which the delivery plan for the first period is stored;
A departure / arrival registration unit for registering the position data of the garage, warehouse, and delivery destination in a departure / arrival position data file;
An order information registration unit that accepts registration of order information and registers the delivery date and location data of the delivery destination as order data in the order data file;
A warehouse that has a predetermined amount of baggage loaded within a predetermined second period is designated as a special warehouse, and this special warehouse code and the loaded amount from the special warehouse loaded during the second period are accepted. The load amount obtained by converting the load load amount into the first period is calculated, and the load to the special warehouse in the first period is calculated according to the load amount converted into the first period and the load amount of the vehicle. A special warehouse processing unit that calculates the number of times of stop-off and registers the position data in the departure / arrival position data file as the special warehouse departure place, special warehouse arrival place, and special warehouse delivery destination;
The special warehouse processing unit calculates the order data for the specified number of stopovers, creates a delivery destination as a special warehouse delivery destination, and saves it in the order data file.
Based on the location data registered in the above departure / arrival location data file, when calculating the time required for movement between each location data, the time required between the special warehouse delivery destinations for the data where the departure location is the special warehouse arrival location Is calculated so that the required time between the other destinations is greater than the first period, and the required time between the special warehouse departure locations is 0 for the data of the special warehouse delivery destination as the departure location, The required time between arrival locations other than is calculated so as to be larger than the first period, and the required time between special warehouse arrival locations and special warehouse delivery destinations for the data of departure location of special warehouse is 1st The time required between the arrival points is calculated using the above arrival / departure location data file, and the special warehouse delivery destination and the special warehouse departure point are used as the arrival point data. The departure time is calculated so that the required time between the departure points other than the special warehouse departure point, the special warehouse arrival point, and the special warehouse delivery destination is larger than the first period. The route search section between departures and arrivals registered in the distance data file,
Reads the order data registered in the order data file, sequentially extracts the delivery destination stored in the order data and the warehouse, creates temporary storage delivery data, and calculates the required time or mileage of the temporary storage delivery data When the required time or travel distance is shorter than the delivery plan stored in the delivery plan data file, the temporary storage delivery data is registered in the delivery plan data file, and the required time is the first time. By operating so as not to select a route that exceeds the period, the special warehouse departure location, special warehouse arrival location, and special warehouse delivery destination registered in the above time-distance time / distance data file must be the departure location or arrival location. When creating a route for a special warehouse based on time data, the special warehouse arrival location, special warehouse delivery destination, special warehouse output As temporary storage distribution data to create a path through the land of the order registered in the delivery plan data file, the path created by connecting the delivery plan the temporary storage delivery data registered in the data file, the delivery plan A delivery plan system comprising a delivery plan creation unit for storing in a data file.

A delivery plan system for creating a delivery plan via one or more garages, warehouses and delivery destinations in a first predetermined period,
A delivery plan data file in which the delivery plan for the first period is stored;
A departure / arrival registration unit for registering the position data of the garage, warehouse, and delivery destination in a departure / arrival position data file;
An order information registration unit that accepts registration of order information and registers the delivery date and location data of the delivery destination as order data in the order data file;
A warehouse that determines the loading of a predetermined amount of baggage within a predetermined second period is designated as a special warehouse, and the special warehouse code and the number of times of visit to the special warehouse within the first period are designated, A special warehouse number reception unit for registering the special warehouse as the special warehouse departure place, special warehouse arrival place, and special warehouse delivery destination in the departure / arrival position data file;
A special warehouse line order data creation unit that creates the delivery destination as a special warehouse delivery destination and stores the received order data for the specified number of stops received by the special warehouse number reception unit,
Based on the location data registered in the above departure / arrival location data file, when calculating the time required for movement between each location data, the time required between the special warehouse delivery destinations for the data where the departure location is the special warehouse arrival location Is calculated so that the required time between the other destinations is greater than the first period, and the required time between the special warehouse departure locations is 0 for the data of the special warehouse delivery destination as the departure location, The required time between arrival locations other than is calculated so as to be larger than the first period, and the required time between special warehouse arrival locations and special warehouse delivery destinations for the data of departure location of special warehouse is 1st The time required between the arrival points is calculated using the above arrival / departure location data file, and the special warehouse delivery destination and the special warehouse departure point are used as the arrival point data. The departure time is calculated so that the required time between the departure points other than the special warehouse departure point, the special warehouse arrival point, and the special warehouse delivery destination is larger than the first period. The route search section between departures and arrivals registered in the distance data file,
Reads the order data registered in the order data file, sequentially extracts the delivery destination stored in the order data and the warehouse, creates temporary storage delivery data, and calculates the required time or mileage of the temporary storage delivery data When the required time or mileage is shorter than the delivery plan stored in the delivery plan data file, the temporary storage delivery data is registered in the delivery plan data file and a route is created for the special warehouse. Refer to the special warehouse departure point, special warehouse arrival point, and the time required for the special warehouse delivery destination to be the departure point or arrival point registered in the time / distance data file. The next route selects a special warehouse delivery destination by operating so as not to select a route whose required time exceeds the first period. For the next route of the delivery destination, the special warehouse departure point is selected by operating so as not to select the route whose required time exceeds the first period, and the special warehouse arrival location, special warehouse delivery destination, special warehouse is selected for the special warehouse. Create a route that goes in the order of the warehouse departure location , register it in the delivery plan data file as temporary storage delivery data, and connect the temporary storage delivery data registered in the delivery plan data file to the order data file A delivery plan creation unit that creates a delivery plan via the delivery destination of the registered order data and stores it in the delivery plan data file;
A delivery planning system that plans delivery corresponding to order data includes the above-mentioned route search section between departures and arrivals and the above delivery plan creation section, and creates order data for special warehouses as delivery destinations for the specified number of stops. A delivery planning system that creates a delivery plan that stops at a special warehouse for a specified number of stops.

A delivery plan system for creating a delivery plan via one or more garages, warehouses and delivery destinations in a first predetermined period,
A delivery plan data file in which the delivery plan for the first period is stored;
A departure / arrival registration unit for registering the position data of the garage, warehouse, and delivery destination in a departure / arrival position data file;
An order information registration unit that accepts registration of order information and registers the delivery date and location data of the delivery destination as order data in the order data file;
A warehouse that has a predetermined amount of baggage loaded within a predetermined second period is designated as a special warehouse, and this special warehouse code and the loaded amount from the special warehouse loaded during the second period are accepted. The load amount obtained by converting the load load amount into the first period is calculated, and the load to the special warehouse in the first period is calculated according to the load amount converted into the first period and the load amount of the vehicle. A special warehouse processing unit that calculates the number of times of stop-off and registers the position data in the departure / arrival position data file as the special warehouse departure place, special warehouse arrival place, and special warehouse delivery destination;
The special warehouse processing unit calculates the order data for the specified number of stopovers, creates a delivery destination as a special warehouse delivery destination, and saves it in the order data file.
Based on the location data registered in the above departure / arrival location data file, when calculating the time required for movement between each location data, the time required between the special warehouse delivery destinations for the data where the departure location is the special warehouse arrival location Is calculated so that the required time between the other destinations is greater than the first period, and the required time between the special warehouse departure locations is 0 for the data of the special warehouse delivery destination as the departure location, The required time between arrival locations other than is calculated so as to be larger than the first period, and the required time between special warehouse arrival locations and special warehouse delivery destinations for the data of departure location of special warehouse is 1st The time required between the arrival points is calculated using the above arrival / departure location data file, and the special warehouse delivery destination and the special warehouse departure point are used as the arrival point data. The departure time is calculated so that the required time between the departure points other than the special warehouse departure point, the special warehouse arrival point, and the special warehouse delivery destination is larger than the first period. The route search section between departures and arrivals registered in the distance data file,
Reads the order data registered in the order data file, sequentially extracts the delivery destination stored in the order data and the warehouse, creates temporary storage delivery data, and calculates the required time or mileage of the temporary storage delivery data When the required time or mileage is shorter than the delivery plan stored in the delivery plan data file, the temporary storage delivery data is registered in the delivery plan data file and a route is created for the special warehouse. Refer to the special warehouse departure point, special warehouse arrival point, and the time required for the special warehouse delivery destination to be the departure point or arrival point registered in the time / distance data file. The next route selects a special warehouse delivery destination by operating so as not to select a route whose required time exceeds the first period. For the next route of the delivery destination, the special warehouse departure point is selected by operating so as not to select the route whose required time exceeds the first period, and the special warehouse arrival location, special warehouse delivery destination, special warehouse is selected for the special warehouse. Create a route that goes in the order of the warehouse departure location , register it in the delivery plan data file as temporary storage delivery data, and connect the temporary storage delivery data registered in the delivery plan data file to the order data file A delivery plan creation unit that creates a delivery plan via the delivery destination of the registered order data and stores it in the delivery plan data file;
A delivery planning system that plans delivery corresponding to order data includes the above-mentioned route search section between departures and arrivals and the above delivery plan creation section, and creates order data for special warehouses as delivery destinations for the specified number of stops. A delivery planning system that creates a delivery plan that stops at a special warehouse for a specified number of stops.

Delivery that creates a delivery plan through one or more garages, warehouses, and delivery destinations in the first period from a computer having a delivery plan data file in which a delivery plan for a predetermined first period is stored A delivery planning program for functioning as a planning system,
A departure / arrival registration unit for registering the position data of the garage, warehouse, and delivery destination in a departure / arrival position data file;
An order information registration unit that accepts registration of order information and registers the delivery date and location data of the delivery destination as order data in the order data file;
A warehouse that determines the loading of a predetermined amount of baggage within a predetermined second period is designated as a special warehouse, and the special warehouse code and the number of times of visit to the special warehouse within the first period are designated, A special warehouse number reception unit for registering the special warehouse as the special warehouse departure place, special warehouse arrival place, and special warehouse delivery destination in the departure / arrival position data file;
A special warehouse line order data creation unit that creates the delivery destination as a special warehouse delivery destination and stores the received order data for the specified number of stops received by the special warehouse number reception unit,
Based on the location data registered in the above departure / arrival location data file, when calculating the time required for movement between each location data, the time required between the special warehouse delivery destinations for the data where the departure location is the special warehouse arrival location Is calculated so that the required time between the other destinations is greater than the first period, and the required time between the special warehouse departure locations is 0 for the data of the special warehouse delivery destination as the departure location, The required time between arrival locations other than is calculated so as to be larger than the first period, and the required time between special warehouse arrival locations and special warehouse delivery destinations for the data of departure location of special warehouse is 1st The time required between the arrival points is calculated using the above arrival / departure location data file, and the special warehouse delivery destination and the special warehouse departure point are used as the arrival point data. The departure time is calculated so that the required time between the departure points other than the special warehouse departure point, the special warehouse arrival point, and the special warehouse delivery destination is larger than the first period. The route search section between departures and arrivals registered in the distance data file,
Reads the order data registered in the order data file, sequentially extracts the delivery destination stored in the order data and the warehouse, creates temporary storage delivery data, and calculates the required time or mileage of the temporary storage delivery data When the required time or travel distance is shorter than the delivery plan stored in the delivery plan data file, the temporary storage delivery data is registered in the delivery plan data file, and the required time is the first time. By operating so as not to select a route that exceeds the period, the special warehouse departure location, special warehouse arrival location, and special warehouse delivery destination registered in the above time-distance time / distance data file must be the departure location or arrival location. When creating a route for a special warehouse based on time data, the special warehouse arrival location, special warehouse delivery destination, special warehouse output As temporary storage distribution data to create a path through the land of the order registered in the delivery plan data file, the path created by connecting the delivery plan the temporary storage delivery data registered in the data file, the delivery plan A delivery plan program which functions as a delivery plan creation unit stored in a data file.

Delivery that creates a delivery plan through one or more garages, warehouses, and delivery destinations in the first period from a computer having a delivery plan data file in which a delivery plan for a predetermined first period is stored A delivery planning program for functioning as a planning system,
A departure / arrival registration unit for registering the position data of the garage, warehouse, and delivery destination in a departure / arrival position data file;
An order information registration unit that accepts registration of order information and registers the delivery date and location data of the delivery destination as order data in the order data file;
A warehouse that has a predetermined amount of baggage loaded within a predetermined second period is designated as a special warehouse, and this special warehouse code and the loaded amount from the special warehouse loaded during the second period are accepted. The load amount obtained by converting the load load amount into the first period is calculated, and the load to the special warehouse in the first period is calculated according to the load amount converted into the first period and the load amount of the vehicle. A special warehouse processing unit that calculates the number of times of stop-off and registers the position data in the departure / arrival position data file as the special warehouse departure place, special warehouse arrival place, and special warehouse delivery destination;
The special warehouse processing unit calculates the order data for the specified number of stopovers, creates a delivery destination as a special warehouse delivery destination, and saves it in the order data file.
Based on the location data registered in the above departure / arrival location data file, when calculating the time required for movement between each location data, the time required between the special warehouse delivery destinations for the data where the departure location is the special warehouse arrival location Is calculated so that the required time between the other destinations is greater than the first period, and the required time between the special warehouse departure locations is 0 for the data of the special warehouse delivery destination as the departure location, The required time between arrival locations other than is calculated so as to be larger than the first period, and the required time between special warehouse arrival locations and special warehouse delivery destinations for the data of departure location of special warehouse is 1st The time required between the arrival points is calculated using the above arrival / departure location data file, and the special warehouse delivery destination and the special warehouse departure point are used as the arrival point data. The departure time is calculated so that the required time between the departure points other than the special warehouse departure point, the special warehouse arrival point, and the special warehouse delivery destination is larger than the first period. The route search section between departures and arrivals registered in the distance data file,
Reads the order data registered in the order data file, sequentially extracts the delivery destination stored in the order data and the warehouse, creates temporary storage delivery data, and calculates the required time or mileage of the temporary storage delivery data When the required time or travel distance is shorter than the delivery plan stored in the delivery plan data file, the temporary storage delivery data is registered in the delivery plan data file, and the required time is the first time. By operating so as not to select a route that exceeds the period, the special warehouse departure location, special warehouse arrival location, and special warehouse delivery destination registered in the above time-distance time / distance data file must be the departure location or arrival location. When creating a route for a special warehouse based on time data, the special warehouse arrival location, special warehouse delivery destination, special warehouse output As temporary storage distribution data to create a path through the land of the order registered in the delivery plan data file, the path created by connecting the delivery plan the temporary storage delivery data registered in the data file, the delivery plan A delivery plan program which functions as a delivery plan creation unit stored in a data file.

Delivery that creates a delivery plan through one or more garages, warehouses, and delivery destinations in the first period from a computer having a delivery plan data file in which a delivery plan for a predetermined first period is stored A delivery planning program for functioning as a planning system,
A departure / arrival registration unit for registering the position data of the garage, warehouse, and delivery destination in a departure / arrival position data file;
An order information registration unit that accepts registration of order information and registers the delivery date and location data of the delivery destination as order data in the order data file;
A warehouse that determines the loading of a predetermined amount of baggage within a predetermined second period is designated as a special warehouse, and the special warehouse code and the number of times of visit to the special warehouse within the first period are designated, A special warehouse number reception unit for registering the special warehouse as the special warehouse departure place, special warehouse arrival place, and special warehouse delivery destination in the departure / arrival position data file;
A special warehouse line order data creation unit that creates the delivery destination as a special warehouse delivery destination and stores the received order data for the specified number of stops received by the special warehouse number reception unit,
Based on the location data registered in the above departure / arrival location data file, when calculating the time required for movement between each location data, the time required between the special warehouse delivery destinations for the data where the departure location is the special warehouse arrival location Is calculated so that the required time between the other destinations is greater than the first period, and the required time between the special warehouse departure locations is 0 for the data of the special warehouse delivery destination as the departure location, The required time between arrival locations other than is calculated so as to be larger than the first period, and the required time between special warehouse arrival locations and special warehouse delivery destinations for the data of departure location of special warehouse is 1st The time required between the arrival points is calculated using the above arrival / departure location data file, and the special warehouse delivery destination and the special warehouse departure point are used as the arrival point data. The departure time is calculated so that the required time between the departure points other than the special warehouse departure point, the special warehouse arrival point, and the special warehouse delivery destination is larger than the first period. The route search section between departures and arrivals registered in the distance data file,
Reads the order data registered in the order data file, sequentially extracts the delivery destination stored in the order data and the warehouse, creates temporary storage delivery data, and calculates the required time or mileage of the temporary storage delivery data When the required time or mileage is shorter than the delivery plan stored in the delivery plan data file, the temporary storage delivery data is registered in the delivery plan data file and a route is created for the special warehouse. Refer to the special warehouse departure point, special warehouse arrival point, and the time required for the special warehouse delivery destination to be the departure point or arrival point registered in the time / distance data file. The next route selects a special warehouse delivery destination by operating so as not to select a route whose required time exceeds the first period. For the next route of the delivery destination, the special warehouse departure point is selected by operating so as not to select the route whose required time exceeds the first period, and the special warehouse arrival location, special warehouse delivery destination, special warehouse is selected for the special warehouse. Create a route that goes in the order of the warehouse departure location , register it in the delivery plan data file as temporary storage delivery data, and connect the temporary storage delivery data registered in the delivery plan data file to the order data file Create a delivery plan that goes through the delivery destination of the registered order data, and function as a delivery plan creation unit that stores it in the delivery plan data file,
For the delivery planning system that plans delivery for order data, the above-mentioned route search unit between departures and arrivals and the above transmission plan creation unit function, so that the order data for which the special warehouse is regarded as the delivery destination is visited A delivery planning program that creates a delivery plan that stops at a special warehouse by the number of times specified by the number of stops.

Delivery that creates a delivery plan through one or more garages, warehouses, and delivery destinations in the first period from a computer having a delivery plan data file in which a delivery plan for a predetermined first period is stored A delivery planning program for functioning as a planning system,
A delivery plan data file in which the delivery plan for the first period is stored;
A departure / arrival registration unit for registering the position data of the garage, warehouse, and delivery destination in a departure / arrival position data file;
An order information registration unit that accepts registration of order information and registers the delivery date and location data of the delivery destination as order data in the order data file;
A warehouse that has a predetermined amount of baggage loaded within a predetermined second period is designated as a special warehouse, and this special warehouse code and the loaded amount from the special warehouse loaded during the second period are accepted. The load amount obtained by converting the load load amount into the first period is calculated, and the load to the special warehouse in the first period is calculated according to the load amount converted into the first period and the load amount of the vehicle. A special warehouse processing unit that calculates the number of times of stop-off and registers the position data in the departure / arrival position data file as the special warehouse departure place, special warehouse arrival place, and special warehouse delivery destination;
The special warehouse processing unit calculates the order data for the specified number of stopovers, creates a delivery destination as a special warehouse delivery destination, and saves it in the order data file.
Based on the location data registered in the above departure / arrival location data file, when calculating the time required for movement between each location data, the time required between the special warehouse delivery destinations for the data where the departure location is the special warehouse arrival location Is calculated so that the required time between the other destinations is greater than the first period, and the required time between the special warehouse departure locations is 0 for the data of the special warehouse delivery destination as the departure location, The required time between arrival locations other than is calculated so as to be larger than the first period, and the required time between special warehouse arrival locations and special warehouse delivery destinations for the data of departure location of special warehouse is 1st The time required between the arrival points is calculated using the above arrival / departure location data file, and the special warehouse delivery destination and the special warehouse departure point are used as the arrival point data. The departure time is calculated so that the required time between the departure points other than the special warehouse departure point, the special warehouse arrival point, and the special warehouse delivery destination is larger than the first period. The route search section between departures and arrivals registered in the distance data file,
Reads the order data registered in the order data file, sequentially extracts the delivery destination stored in the order data and the warehouse, creates temporary storage delivery data, and calculates the required time or mileage of the temporary storage delivery data When the required time or mileage is shorter than the delivery plan stored in the delivery plan data file, the temporary storage delivery data is registered in the delivery plan data file and a route is created for the special warehouse. Refer to the special warehouse departure point, special warehouse arrival point, and the time required for the special warehouse delivery destination to be the departure point or arrival point registered in the time / distance data file. The next route selects a special warehouse delivery destination by operating so as not to select a route whose required time exceeds the first period. For the next route of the delivery destination, the special warehouse departure point is selected by operating so as not to select the route whose required time exceeds the first period, and the special warehouse arrival location, special warehouse delivery destination, special warehouse is selected for the special warehouse. Create a route that goes in the order of the warehouse departure location , register it in the delivery plan data file as temporary storage delivery data, and connect the temporary storage delivery data registered in the delivery plan data file to the order data file Create a delivery plan that goes through the delivery destination of the registered order data, and function as a delivery plan creation unit that stores it in the delivery plan data file,
For the delivery planning system that plans delivery for order data, the above-mentioned route search unit between departures and arrivals and the above transmission plan creation unit function, so that the order data for which the special warehouse is regarded as the delivery destination is visited A delivery planning program that creates a delivery plan that stops at a special warehouse by the number of times specified by the number of stops.