JPH04317168A - Allocating device for delivery baggage - Google Patents
Allocating device for delivery baggageInfo
- Publication number
- JPH04317168A JPH04317168A JP3084220A JP8422091A JPH04317168A JP H04317168 A JPH04317168 A JP H04317168A JP 3084220 A JP3084220 A JP 3084220A JP 8422091 A JP8422091 A JP 8422091A JP H04317168 A JPH04317168 A JP H04317168A
- Authority
- JP
- Japan
- Prior art keywords
- delivery
- carrier
- transport
- destination
- destinations
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 claims description 13
- 239000000969 carrier Substances 0.000 abstract 2
- 238000010586 diagram Methods 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 238000007796 conventional method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000000446 fuel Substances 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Landscapes
- Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
【０００１】0001
【産業上の利用分野】本発明は配送基地から複数の配送
先に搬送車を用いて指定された各荷物を配送する配送シ
ステムに係わり、特に各搬送車に効率よく各荷物を割付
ける配送荷物割付装置に関する。[Industrial Application Field] The present invention relates to a delivery system for delivering specified packages from a delivery base to a plurality of delivery destinations using carrier vehicles, and particularly relates to a delivery system that efficiently allocates each package to each carrier vehicle. Regarding an allocation device.
【０００２】0002
【従来の技術】例えば工場の出荷倉庫から各販売店の倉
庫へ商品を配送する場合や、運送業者が配送基地に収集
した各荷物を仕分けして別の各配送基地に配送する場合
等の配送システムにおいては、一般に、各配送先毎に１
台以上のトラック等の搬送車が割付けられている。そし
て、各搬送車は自己に割付られた配送先へ配送する各荷
物を積込んで配送先へ配送する。[Prior Art] For example, delivery is carried out when products are delivered from a factory's shipping warehouse to each retailer's warehouse, or when a carrier sorts packages collected at a delivery base and delivers them to different delivery bases. In the system, there is generally one
Transport vehicles such as trucks or more are allocated. Then, each transport vehicle loads each package to be delivered to the delivery destination assigned to it and delivers it to the delivery destination.
【０００３】0003
【発明が解決しようとする課題】各配送先毎に多くの荷
物が存在して常に各搬送車は最大積載重量一杯の荷物を
積載して配送基地を出発する場合は特に問題がない。[Problem to be Solved by the Invention] There is no particular problem when there are many packages for each delivery destination and each transport vehicle always leaves the delivery base with the cargo loaded to its maximum carrying weight.
【０００４】しかし、各配送先毎に、常に１台分以上の
荷物が存在するとは限らない。また、２台半分の荷物が
存在する場合もある。このような場合には、例えば最大
積載重量の半分の重量の荷物しか積載しないで出発する
搬送車が多発する。その結果、配送システム全体として
は無駄な配車を行うことになり、非常に非能率的でかつ
不経済である。[0004] However, there is not always more than one carload of cargo for each delivery destination. In addition, there may be cases where there are two and a half pieces of luggage. In such a case, many transport vehicles depart with only half of the maximum load weight loaded, for example. As a result, the delivery system as a whole ends up making unnecessary dispatches, which is extremely inefficient and uneconomical.
【０００５】本発明はこのような事情に鑑みてなされた
ものであり、１台の搬送車で複数の配送先を経由する複
数の搬送経路を設定することによって、積載容量に余裕
のある場合は、その搬送経路に含まれる複数の配送先の
荷物を積むことができ、運行される各搬送車の積載率を
上昇でき、少ない搬送車で効率的に各荷物を目的とする
各配送先へ搬送できる配送荷物割付装置を提供すること
を目的とする。[0005] The present invention has been made in view of the above circumstances, and by setting a plurality of transport routes via a plurality of delivery destinations using one transport vehicle, if there is sufficient loading capacity, , it is possible to load cargo for multiple delivery destinations included in the transport route, increasing the loading rate of each transport vehicle being operated, and efficiently transporting each cargo to each destination with a small number of transport vehicles. The purpose of the present invention is to provide a delivery baggage allocation device that can be used.
【０００６】[0006]
【課題を解決するための手段】上記課題を解消するため
に本発明は、配送基地から複数の配送先に搬送車を用い
て指定された各荷物を配送する配送システムにおける各
搬送車に各荷物を割付ける配送荷物割付装置において、
複数の配送先のうちの所定の複数の配送先を経由する複
数の搬送経路を設定する搬送経路設定手段と、各搬送経
路に含まれる各配送先の荷物を、遠方の配送先から近い
配送先へ順番に、該当搬送経路に割付けられた搬送車に
割付ける荷物割付手段と、その割付過程において、割付
済荷物の合計量が該当搬送車の最大積載量を越えると、
新規の搬送車を同一搬送経路に割付ける搬送車追加割付
手段とを備えたものである。[Means for Solving the Problems] In order to solve the above-mentioned problems, the present invention provides a delivery system for delivering each specified cargo from a delivery base to a plurality of delivery destinations using a transport vehicle. In the delivery baggage allocation device that allocates
A transport route setting means for setting a plurality of transport routes passing through predetermined plurality of delivery destinations among the plurality of delivery destinations; In the allocation process, if the total amount of allocated luggage exceeds the maximum loading capacity of the applicable conveyance vehicle,
The present invention also includes a conveyance vehicle additional allocation means for allocating a new conveyance vehicle to the same conveyance route.
【０００７】[0007]
【作用】このように構成された配送荷物割付装置におい
ては、各搬送車は配送基地を出発すると自己に割付けら
れた搬送経路に存在する各配送先を経由して各配送先で
該当配送先に指定された荷物を下ろして元の配送基地へ
戻る。[Operation] In the delivery baggage allocation device configured in this way, when each transport vehicle departs from the delivery base, it passes through each delivery destination that exists on the transport route assigned to it, and then returns to the corresponding delivery destination at each delivery destination. Unload the specified cargo and return to the original delivery base.
【０００８】この場合、配送基地を出発する時点で、該
当搬送経路に存在する各配送先のうち最も遠方の配送先
の荷物から順番に割付けられていく。したがって、最も
遠方の配送先の荷物を積込んだ後に、まだ積載量に余裕
がある場合には、次に近い位置の配送先の荷物が同一搬
送車に割付けられる。したがって、同一搬送経路内にお
ける積載量に余裕がある搬送車を１台まで減少できる。[0008] In this case, at the time of departure from the delivery base, the parcels are allocated in order from the farthest delivery destination among the delivery destinations existing on the corresponding transport route. Therefore, if there is still room for loading after loading the cargo for the farthest delivery destination, the cargo for the next closest delivery destination is allocated to the same transport vehicle. Therefore, it is possible to reduce the number of transport vehicles with sufficient loading capacity within the same transport route to one.
【０００９】[0009]
【実施例】以下本発明の一実施例を図面を用いて説明す
る。DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings.
【００１０】第２図は実施例の配送荷物割付装置が組込
まれた配送システム全体を示す模式図である。FIG. 2 is a schematic diagram showing the entire delivery system incorporating the delivery package allocation device of the embodiment.
【００１１】配送基地１には、この配送基地１が管轄す
る各配送先２に配送するための多数の荷物が集積されて
いる。そして、複数の配送先２は近接するものどうしで
ブロックを形成し、同一ブロック内の各配送先２を経由
する複数の搬送経路３が設定されている。この搬送経路
３は各搬送車が最も効率的に巡回できるように設定され
ている。A large number of packages are accumulated in the delivery base 1 to be delivered to each delivery destination 2 under the jurisdiction of the delivery base 1. A plurality of delivery destinations 2 are arranged adjacent to each other to form a block, and a plurality of transport routes 3 passing through each delivery destination 2 within the same block are set. This transport route 3 is set so that each transport vehicle can circulate most efficiently.
【００１２】図１は実施例の配送荷物割付装置の概略構
成を示すブロック図である。この配送荷物割付装置は例
えば前記配送システムを構成するコンピュータにおける
一つの制御プログラムで構成されている。FIG. 1 is a block diagram showing a schematic configuration of a delivery package allocation device according to an embodiment. This delivery baggage allocation device is configured, for example, by one control program in a computer configuring the delivery system.
【００１３】図１において、荷物情報ファイル４は配送
基地１に収集されて各配送先２に配送すべき各荷物の荷
物番号Ｎ，重量Ｒ，搬送先番号Ｈ等の荷物情報が記憶さ
れている。なお、各搬送車Ｔに対する割付処理が終了し
た荷物の荷物情報はこの荷物情報ファイル４から自動的
に削除される。また、最大積載重量メモリ５内には、こ
の配送基地２に所属する全ての搬送車について、各搬送
車毎に最大積載重量Ｔｍａｘ が記憶されている。In FIG. 1, a package information file 4 is collected at a delivery base 1 and stores package information such as package number N, weight R, destination number H, etc. of each package to be delivered to each destination 2. . Note that the baggage information of the baggage for which the allocation process for each transport vehicle T has been completed is automatically deleted from the baggage information file 4. Furthermore, in the maximum load weight memory 5, the maximum load weight Tmax is stored for each conveyance vehicle for all the conveyance vehicles belonging to this delivery base 2.
【００１４】さらに、搬送経路メモリ６内には、図２の
各搬送経路３毎に、該当搬送経路３に所属する各搬送先
番号Ｈが記憶されている。Further, in the transport route memory 6, for each transport route 3 in FIG. 2, each transport destination number H belonging to the corresponding transport route 3 is stored.
【００１５】そして、割付演算処理部７は、最大積載重
量メモリ５および搬送経路メモリ６の各制約条件に従っ
て、前記荷物情報ファイル４に登録されている各荷物を
各搬送車に割付けていく割付業務を実行する。割付演算
処理部７は割付結果を例えば印字装置等の割付結果出力
装置８へ出力する。[0015] Then, the allocation calculation processing section 7 performs an allocation operation of allocating each baggage registered in the baggage information file 4 to each conveyance vehicle according to each constraint condition of the maximum load weight memory 5 and the transport route memory 6. Execute. The layout arithmetic processing unit 7 outputs the layout result to an layout result output device 8 such as a printing device.
【００１６】図３は割付演算処理部７における割付処理
動作を示す流れ図である。FIG. 3 is a flowchart showing the allocation processing operation in the allocation calculation processing section 7.
【００１７】外部から割付指令が入力すると、Ｐ１にお
いて、搬送経路メモリ６に記憶されている全ての搬送経
路３に対する各荷物の搬送車に対する割付処理が終了し
たか否かを調べる。まだ終了していなければ、Ｐ２へ進
み、まだ割付が終了していない一つの搬送経路３に属す
る各配送先２に配送すべき全ての荷物の各荷物情報を荷
物情報ファイル４から抽出する。次に、Ｐ３にて該当搬
送経路３に対して最大積載重量メモリ５に登録されてい
るまだ割付けられていない１台の搬送車を該当搬送経路
３に割付ける。When an allocation command is input from the outside, it is checked in P1 whether or not the allocation process for all the transport routes 3 stored in the transport route memory 6 to the transport vehicles for each load has been completed. If the allocation has not been completed yet, the process advances to P2, and the parcel information of all the parcels to be delivered to each delivery destination 2 belonging to one transport route 3 for which allocation has not yet been completed is extracted from the parcel information file 4. Next, in P3, one conveyance vehicle registered in the maximum load weight memory 5 and not yet assigned to the corresponding conveyance route 3 is allocated to the corresponding conveyance route 3.
【００１８】Ｐ４にて、先に抽出した該当搬送経路３に
属する未割付の荷物が存在することを確認する。Ｐ５に
て、該当搬送経路３における未割付の荷物のうち最も遠
い配送先２の１個の荷物を抽出する。Ｐ６にて、抽出さ
れた荷物の重量を既に累積された該当搬送車の積載重量
に加算する。Ｐ７にて加算後の積載重量が最大積載重量
を越えないことを確認すると、Ｐ８にて該当荷物を該当
搬送車へ割付ける。そして、割付済み荷物の荷物情報を
荷物情報ファイル４から削除する。その後、Ｐ４へ進み
、該当搬送経路３に属する未割付の荷物が存在するか否
かを調べる。At P4, it is confirmed that there is an unallocated package belonging to the corresponding transport route 3 extracted earlier. At P5, one package with the farthest delivery destination 2 is extracted from among the unallocated packages on the corresponding transport route 3. At P6, the weight of the extracted cargo is added to the already accumulated loaded weight of the corresponding transport vehicle. If it is confirmed in P7 that the loaded weight after addition does not exceed the maximum loaded weight, the corresponding cargo is allocated to the corresponding transport vehicle in P8. Then, the package information of the assigned package is deleted from the package information file 4. Thereafter, the process advances to P4, and it is checked whether there is any unallocated package belonging to the corresponding transport route 3.
【００１９】そして、Ｐ７にて加算後の積載重量が最大
積載重量を越えると、Ｐ９にて該当搬送車に対する割付
処理を終了する。なお、加算することによって積載重量
が超過した荷物は未割付状態のままである。その後、Ｐ
３へ進み、該当搬送経路３に前記最大積載重量メモリ５
に登録されているまだ割付けられていない１台の搬送車
を割付ける。When the loaded weight after addition exceeds the maximum loaded weight in P7, the allocation process for the corresponding transport vehicle is ended in P9. It should be noted that the cargo whose loaded weight exceeds the weight due to the addition remains in an unallocated state. After that, P
3, and the maximum load weight memory 5 is stored in the corresponding transport route 3.
Allocate one transport vehicle registered in , which has not yet been allocated.
【００２０】また、Ｐ４にて該当搬送経路３に属する未
割付の荷物が無くなると、Ｐ１０へ進み、該当搬送経路
３に対する荷物の割付処理を終了する。そして、Ｐ１へ
進み、全ての搬送経路３に対する荷物の割付処理が終了
したか否かを調べて、まだ、未割付の搬送経路３が存在
すれば、該当搬送経路３を巡回する搬送車に対する各荷
物の割付処理を開始する。[0020] Furthermore, when there are no unallocated packages belonging to the corresponding transport route 3 in P4, the process proceeds to P10, and the process of allocating packages to the corresponding transport route 3 is completed. Then, the process proceeds to P1, and it is checked whether or not the load allocation processing for all transport routes 3 has been completed. If there is still an unallocated transport route 3, each transport route 3 is Start the package allocation process.
【００２１】Ｐ１にて全ての搬送経路３に対する荷物の
割付処理が終了すると、この荷物割付処理全体を終了す
る。[0021] When the load allocation process for all the transport routes 3 is completed at P1, the entire load allocation process is terminated.
【００２２】このように構成された配送荷物割付装置に
よれば、この搬送基地１に配車された全ての搬送車は複
数の配送先２を経由する予め定められた搬送経路３を巡
回する。そして、各搬送車は一つの配送先２に配送する
荷物のみならず、積載重量に余裕のある場合には、同一
搬送経路３内の他の配送先２の荷物も積載して運ぶ。[0022] According to the delivery package allocation device configured as described above, all the transport vehicles allocated to the transport base 1 travel along a predetermined transport route 3 passing through a plurality of delivery destinations 2. Each transport vehicle carries not only cargo to be delivered to one delivery destination 2 but also cargo to other delivery destinations 2 on the same transport route 3 if there is sufficient loading weight.
【００２３】したがって、同一搬送経路３内において、
積載重量に大きな余裕のある搬送車が２台以上連続して
配送基地１を出発することはない。すなわち、各搬送車
の積載効率が大幅に向上して、少ない搬送車でもって多
い荷物を効率的に各搬送先２に配送することが可能とな
る。[0023] Therefore, within the same transport route 3,
Two or more transport vehicles with a large margin for loading weight do not depart from the delivery base 1 in succession. That is, the loading efficiency of each transport vehicle is greatly improved, and it becomes possible to efficiently deliver a large amount of cargo to each transport destination 2 with a small number of transport vehicles.
【００２４】さらに、１台の搬送車に対しては搬送経路
３の各配送先２のうちの最も遠い配送先２の荷物を近い
配送先２の荷物に優先させて搬送車に割付けている。こ
のようにすることによって、遠い配送先２の荷物ができ
るだけ分割されることなく、例えば１台の搬送車でまと
めて配送される。その結果、遠くの配送先２に行く搬送
車の数を低減でき、燃料消費量を低減できる。なお、遠
い配送先２の荷物を積載していなければ、当然、搬送車
が巡回する搬送経路３は短くなる。[0024]Furthermore, for one transport vehicle, among the delivery destinations 2 on the transport route 3, the parcels from the farthest delivery destination 2 are given priority over the parcels from the closest delivery destinations 2, and are assigned to the transport vehicle. By doing this, the packages to be delivered to the far destination 2 are not divided as much as possible, and are delivered together, for example, by one transport vehicle. As a result, the number of transport vehicles traveling to the distant delivery destination 2 can be reduced, and fuel consumption can be reduced. Note that if the delivery vehicle is not loaded with cargo for a distant delivery destination 2, the transport route 3 traveled by the transport vehicle will naturally be shortened.
【００２５】次に、実際に各荷物を割付け場合のシミュ
レーション結果を説明する。図４は荷物情報ファイル４
の記憶内容を示す図である。すなわち、各荷物の荷物番
号Ｎ１，Ｎ２，…，Ｎ７に対して、該当荷物が配送され
るべき搬送先２の搬送先番号Ｈ１〜Ｈ５，各荷物の重量
Ｒ１〜Ｒ７が記憶されている。例えば、荷物（荷物番号
）Ｎ１は配送先（配送先番号）Ｈ１に配送され、かつそ
の重量Ｒ１は２トンである。同様に、荷物Ｎ５は配送先
Ｈ４へ配送され、かつその重量Ｒ５は１トンである。Next, the simulation results when each package is actually allocated will be explained. Figure 4 is baggage information file 4
It is a figure showing the memory contents of. That is, for each package number N1, N2, . . . , N7, the destination number H1 to H5 of the destination 2 to which the corresponding package is to be delivered and the weight R1 to R7 of each package are stored. For example, a package (package number) N1 is delivered to a destination (shipping destination number) H1, and its weight R1 is 2 tons. Similarly, package N5 is delivered to destination H4, and its weight R5 is 1 ton.
【００２６】そして、最大積載重量メモリ５に登録され
た車両番号Ｔ１，Ｔ２，Ｔ３，…を有する各搬送車の最
大積載重量Ｒｍａｘ はすべて共通で例えば１０トンで
ある。The maximum loading weight Rmax of each transport vehicle having vehicle numbers T1, T2, T3, . . . registered in the maximum loading weight memory 5 is the same, for example, 10 tons.
【００２７】さらに、搬送経路メモリ６には、配送基地
１から出発して配送先Ｈ３−Ｈ２−Ｈ１を巡回して元に
戻る搬送経路番号Ｋ１の搬送経路３と、配送基地１から
出発して配送先Ｈ５−Ｈ４を巡回して元に戻る搬送経路
番号Ｋ２の搬送経路３とが登録されている。なお、同一
搬送経路３内においては、配送先番号の小さい配送先が
方が大きい配送先より遠くに位置している。Furthermore, the transport route memory 6 stores a transport route 3 with transport route number K1 that starts from the delivery base 1, goes around delivery destinations H3-H2-H1, and returns, and a transport route 3 that starts from the delivery base 1 and returns to the original location. A transport route 3 with transport route number K2 that goes around delivery destinations H5-H4 and returns is registered. Note that within the same transport route 3, destinations with smaller destination numbers are located farther away than destinations with larger destination numbers.
【００２８】このような搬送経路Ｋ１，Ｋ２および搬送
車Ｔ１，Ｔ２，Ｔ３，…の条件下で図４に示す７個の各
荷物Ｎ１〜Ｎ７を各搬送車Ｔ１，Ｔ２，Ｔ３，…に割付
けると、割付結果出力装置８から図５に示す割付結果レ
ポート９が印字出力される。Under such conditions of the transport routes K1, K2 and the transport vehicles T1, T2, T3, . . . , the seven loads N1 to N7 shown in FIG. When this is done, the layout result report 9 shown in FIG. 5 is printed out from the layout result output device 8.
【００２９】この割付結果レポート９によると、搬送経
路Ｋ１においては２台の搬送車Ｔ１，Ｔ２が割付けられ
、１台目の搬送車Ｔ１に最も遠い配送先Ｈ１に配送すべ
き各荷物Ｎ１，Ｎ２と、次に遠い配送先Ｈ２に配送すべ
き荷物Ｎ３との合計３個の荷物（合計重量９トン）が割
当てられる。また、２台目の搬送車Ｔ２には最も近い配
送先Ｈ３に配送すべき荷物Ｎ４（重量５トン）が割付け
られる。According to this allocation result report 9, two transport vehicles T1 and T2 are allocated to the transport route K1, and each load N1 and N2 to be delivered to the farthest destination H1 is assigned to the first transport vehicle T1. and a package N3 to be delivered to the next farthest destination H2, a total of three packages (total weight 9 tons) are allocated. Further, the second transport vehicle T2 is assigned a cargo N4 (weighing 5 tons) to be delivered to the nearest delivery destination H3.
【００３０】搬送経路Ｋ２においては、３台目の搬送車
Ｔ３に全ての配送先Ｈ４，Ｈ５の各荷物Ｎ５，Ｎ６，Ｎ
７（合計重量６トン）が割付けられる。In the transport route K2, the third transport vehicle T3 carries all the packages N5, N6, N for delivery destinations H4 and H5.
7 (total weight 6 tons) is assigned.
【００３１】すなわち、このシミュレーション結果によ
ると、合計３台の搬送車Ｔ１，Ｔ２，Ｔ３でもって５か
所の各配送先Ｈ１〜Ｈ５へ７個全ての荷物Ｎ１〜Ｎ７を
配送できる。なお、従来手法によると各配送先Ｈ１〜Ｈ
５毎に最低５台の搬送車が必要である。That is, according to the simulation results, all seven parcels N1 to N7 can be delivered to each of the five delivery destinations H1 to H5 using a total of three transport vehicles T1, T2, and T3. In addition, according to the conventional method, each delivery destination H1 to H
A minimum of 5 vehicles are required for every 5.
【００３２】[0032]
【発明の効果】以上説明したように、本発明の配送荷物
割付装置によれば、１台の搬送車で複数の配送先を経由
する複数の搬送経路を設定し、かつ各配送経路内で遠い
方の配送先の荷物から搬送車に優先割付している。した
がって、搬送車の積載容量に余裕のある場合は、その搬
送経路の複数の配送先の荷物を追加して積むことができ
、運行される各搬送車の積載率を上昇でき、少ない搬送
車で効率的に各荷物を目的とする各配送先へ搬送できる
。[Effects of the Invention] As explained above, according to the delivery package allocation device of the present invention, it is possible to set a plurality of transport routes passing through a plurality of delivery destinations using one transport vehicle, and to Priority is assigned to the transport vehicle from the destination of the delivery destination. Therefore, if the transport vehicle has sufficient loading capacity, it is possible to load additional cargo for multiple delivery destinations on that transport route, increasing the loading rate of each transport vehicle being operated, and using fewer transport vehicles. Each parcel can be efficiently transported to each intended destination.
【図１】 本発明の一実施例に係わる配送荷物割付装
置の概略構成を示すブロック図、FIG. 1 is a block diagram showing a schematic configuration of a delivery baggage allocation device according to an embodiment of the present invention;
【図２】 同実施例装置を適用した配送システムを示
す模式図、[Fig. 2] A schematic diagram showing a delivery system to which the same embodiment device is applied;
【図３】 同実施例装置の動作を示す流れ図、[Fig. 3] Flowchart showing the operation of the same embodiment device,
【図４
】 同実施例装置の荷物情報ファイルの記憶内容を示
す図、[Figure 4
] A diagram showing the storage contents of the baggage information file of the same embodiment device,
【図５】 同実施例装置の割付結果出力装置から印字
出力された割付結果レポートを示す図。FIG. 5 is a diagram showing an allocation result report printed out from the allocation result output device of the apparatus of the embodiment.
１…配送基地、２…配送先、３…搬送経路、４…荷物情
報ファイル、５…最大積載重量メモリ、６…搬送経路メ
モリ、８…割付結果出力装置、９…割付結果レポート。1... Delivery base, 2... Delivery destination, 3... Transport route, 4... Package information file, 5... Maximum loading weight memory, 6... Transport route memory, 8... Allocation result output device, 9... Allocation result report.
Claims (1)
用いて指定された各荷物を配送する配送システムにおけ
る前記各搬送車に前記各荷物を割付ける配送荷物割付装
置において、前記複数の配送先のうちの所定の複数の配
送先を経由する複数の搬送経路を設定する搬送経路設定
手段と、前記各搬送経路に含まれる各配送先の荷物を、
遠方の配送先から近い配送先へ順番に、該当搬送経路に
割付けられた搬送車に割付ける荷物割付手段と、その割
付過程において、割付済荷物の合計量が該当搬送車の最
大積載量を越えると、新規の搬送車を同一搬送経路に割
付ける搬送車追加割付手段とを備えた配送荷物割付装置
。1. A delivery cargo allocation device that allocates each of the packages to each of the carrier vehicles in a delivery system that delivers each of the specified packages from a delivery base to a plurality of delivery destinations using a carrier vehicle, wherein the plurality of delivery transport route setting means for setting a plurality of transport routes passing through a plurality of predetermined delivery destinations among the destinations;
A means for allocating cargo to vehicles assigned to a corresponding transportation route in order from a distant delivery destination to a near delivery destination, and in the allocation process, the total amount of the assigned cargo exceeds the maximum loading capacity of the corresponding transportation vehicle. and a conveyance vehicle additional allocation means for allocating a new conveyance vehicle to the same conveyance route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP3084220A JPH04317168A (en) | 1991-04-16 | 1991-04-16 | Allocating device for delivery baggage |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP3084220A JPH04317168A (en) | 1991-04-16 | 1991-04-16 | Allocating device for delivery baggage |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| JPH04317168A true JPH04317168A (en) | 1992-11-09 |
Family
ID=13824401
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP3084220A Pending JPH04317168A (en) | 1991-04-16 | 1991-04-16 | Allocating device for delivery baggage |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPH04317168A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH11282534A (en) * | 1998-03-31 | 1999-10-15 | Nec Kyushu Ltd | Automatic guided vehicle controller, automatic carrying system and carrying schedule allocation method |
| JP2001188984A (en) * | 1999-12-28 | 2001-07-10 | Hitachi Software Eng Co Ltd | Method and system for optimum delivery planning |
| JP2004075289A (en) * | 2002-08-19 | 2004-03-11 | Nti:Kk | Physical distribution control method and physical distribution controller |
| JP2005145688A (en) * | 2003-11-18 | 2005-06-09 | C Uyemura & Co Ltd | Raw material supply-amount control system and its method |
| JP2014126930A (en) * | 2012-12-25 | 2014-07-07 | Toyota Industries Corp | Conveyance system |
| JP2017130027A (en) * | 2016-01-20 | 2017-07-27 | 株式会社ダイヘン | Moving body system and server |
| JP2018106277A (en) * | 2016-12-22 | 2018-07-05 | シャープ株式会社 | Cargo transport system and automatic guided vehicle |
-
1991
- 1991-04-16 JP JP3084220A patent/JPH04317168A/en active Pending
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH11282534A (en) * | 1998-03-31 | 1999-10-15 | Nec Kyushu Ltd | Automatic guided vehicle controller, automatic carrying system and carrying schedule allocation method |
| JP2001188984A (en) * | 1999-12-28 | 2001-07-10 | Hitachi Software Eng Co Ltd | Method and system for optimum delivery planning |
| JP2004075289A (en) * | 2002-08-19 | 2004-03-11 | Nti:Kk | Physical distribution control method and physical distribution controller |
| JP2005145688A (en) * | 2003-11-18 | 2005-06-09 | C Uyemura & Co Ltd | Raw material supply-amount control system and its method |
| JP2014126930A (en) * | 2012-12-25 | 2014-07-07 | Toyota Industries Corp | Conveyance system |
| JP2017130027A (en) * | 2016-01-20 | 2017-07-27 | 株式会社ダイヘン | Moving body system and server |
| JP2018106277A (en) * | 2016-12-22 | 2018-07-05 | シャープ株式会社 | Cargo transport system and automatic guided vehicle |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yano et al. | Vehicle routing at quality stores | |
| CN112678409B (en) | Cargo handling method, apparatus, device, system, storage medium, and program product | |
| CN111598341B (en) | Power material distribution method and system based on material distribution and path optimization | |
| CN106575393A (en) | Parcel sorter system and method | |
| CN110691743A (en) | Method for sorting goods using an efficiently operating dynamic buffer and a storage system | |
| JP2007191296A (en) | Main physical distribution network schedule preparation system | |
| JP7147189B2 (en) | Stowage planning device, stowage planning system, stowage planning method and program | |
| JPH08217209A (en) | Picking system | |
| JP2015005271A (en) | Transport stowage plan creation method and device | |
| JPH04317168A (en) | Allocating device for delivery baggage | |
| CN114529236A (en) | Storage management method and device for goods shelf, electronic equipment and storage medium | |
| CN112387603B (en) | Logistics system for sorting mass commodities and sorting method | |
| JP5382844B2 (en) | Transportation schedule creation system | |
| JP3163286B2 (en) | Vehicle dispatch system | |
| JP2006240794A (en) | Transport schedule preparing system | |
| CN114297565A (en) | Assembly integrated intelligent distribution method and system | |
| JP4940602B2 (en) | Transportation lot creation apparatus and method | |
| JP2002193450A (en) | Physical distribution control method and physical distribution control system for transported cargo | |
| CN114275430A (en) | Storage task processing method, device, equipment and storage medium | |
| JPH07334797A (en) | Route and timetable determining device for load carrying vehicle | |
| US20170147967A1 (en) | Real-time pallet allocation | |
| JP2002370832A (en) | Dispatch control method and dispatch controller for manned conveyance carrier | |
| CN113525980A (en) | Box closing and tallying method and device, warehousing system and electronic equipment | |
| JP3586822B2 (en) | Method and system for creating transport relay plan | |
| JP3350514B2 (en) | Transportation plan creation method and apparatus |