JP2003034440A - Planning system for allocating vehicles and its method - Google Patents

Planning system for allocating vehicles and its method

Info

Publication number
JP2003034440A
JP2003034440A JP2001221525A JP2001221525A JP2003034440A JP 2003034440 A JP2003034440 A JP 2003034440A JP 2001221525 A JP2001221525 A JP 2001221525A JP 2001221525 A JP2001221525 A JP 2001221525A JP 2003034440 A JP2003034440 A JP 2003034440A
Authority
JP
Japan
Prior art keywords
vehicle
transportation
allocation
amount
order
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
Application number
JP2001221525A
Other languages
Japanese (ja)
Inventor
Shigemasa Tamura
繁昌 田村
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
JSR Corp
Original Assignee
JSR Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by JSR Corp filed Critical JSR Corp
Priority to JP2001221525A priority Critical patent/JP2003034440A/en
Publication of JP2003034440A publication Critical patent/JP2003034440A/en
Pending legal-status Critical Current

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)

Abstract

PROBLEM TO BE SOLVED: To provide a planning system for allocating vehicles and a planning method for allocating vehicles in which the processing is improved in efficiency and speed and required vehicles are decreased in the number by combining and lading freight efficiently when transport orders are allocated to vehicles. SOLUTION: The planning system 1 for allocating vehicles includes a vehicle table storage part 3 for storing a plurality of vehicle data; a transport order table storage part 2 for storing a transport order table in which a plurality of transport orders are sorted in descending order of the transport quantities; and an allocation file storage part 7 for storing allocation result files as allocation results (planning for allocating vehicles). Further, in this system, a vehicle determinate order allocation part 6 allocates transport orders, in which vehicle are limited, to the determined vehicles. A vehicle reading part 4 reads unallocated vehicle data from the vehicle table one by one in order of decreasing maximum loading, and a transport order allocation part 5 allocates the transport orders to the read vehicle data in order of decreasing the transport quantities within a range not exceeding the maximum loading to perform the planning for allocating the vehicles.

Description

【発明の詳細な説明】Detailed Description of the Invention

【0001】[0001]

【発明の属する技術分野】本発明は、複数の倉庫から集
荷して、複数の出荷先へ納入するために、作業性がよ
く、輸送コストを低減した、効率のよい配車計画を作成
することができる配車計画作成システム及び配車計画作
成方法に関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention collects cargo from a plurality of warehouses and delivers it to a plurality of shipping destinations. Therefore, it is possible to create an efficient dispatch plan with good workability and reduced transportation cost. The present invention relates to a vehicle allocation plan creating system and a vehicle allocation plan creating method.

【0002】[0002]

【従来の技術】まず、本発明の背景を説明する。通常、
見込生産型の製品は、あらかじめ販売計画及び生産計画
を作成して、見込み生産を行い、生産した製品を在庫品
として倉庫に保管する。ユーザから、受注を受けると、
まず、在庫数量の確認をおこない、納期を回答する。輸
送日の前日など出荷作業前に、先入れ先出しを原則とし
た、製造番号(以下、製番と略す)などの詳細な在庫を
受注オーダに引き当てる。この在庫引当においては、長
期在庫による製品の劣化を防止するため、古い製番から
順に出荷する先入れ先出しを原則とする。このため、同
一ユーザの同一製品の受注オーダであっても、製番や、
出荷倉庫などが異なることがある。
2. Description of the Related Art First, the background of the present invention will be described. Normal,
For a make-to-stock type product, a sales plan and a production plan are created in advance, make-to-stock production is performed, and the produced product is stored in the warehouse as an inventory item. When an order is received from a user,
First, check the inventory quantity and reply the delivery date. Prior to shipping work such as the day before the transportation date, a detailed inventory such as a manufacturing number (hereinafter abbreviated as a manufacturing number), which is a first-in first-out basis, is allocated to an order order. In order to prevent product deterioration due to long-term inventory, in principle this inventory allocation is first-in-first-out, in which products are shipped in order from the oldest serial number. Therefore, even if an order is placed for the same product by the same user,
The shipping warehouse may be different.

【0003】出庫倉庫から納入先までの輸送は、自社・
傭車でのトラック輸送、路線便利用などいくつかの輸送
手段がある。トラック輸送においては、製品の積み合わ
せを行い、複数の倉庫から集荷して、複数の出荷先へ納
入するために、作業性がよく、輸送コストを低減した、
効率のよい配車計画の作成が望まれている。ここでは、
多数の輸送オーダを多数の車両に、短時間で効率よく積
みあわせ、かつ、輸送に必要な車両台数をより少なくす
る、配車計画作成システムの構築方法について記載す
る。従来の配車計画作成方法を説明する前に、在庫引き
当ての具体例と、輸送方法について説明する。
Transportation from the warehouse to the delivery destination
There are several modes of transportation such as truck transportation by merchandise and convenient routes. In truck transportation, products are stacked, collected from multiple warehouses, and delivered to multiple shipping destinations, which improves workability and reduces transportation costs.
It is desired to create an efficient dispatch plan. here,
A method for constructing a vehicle allocation planning system that efficiently loads a large number of transportation orders on a large number of vehicles in a short time and reduces the number of vehicles required for transportation will be described. Before explaining the conventional vehicle allocation planning method, a specific example of stock allocation and a transportation method will be described.

【0004】[0004]

【表1】 表1に示すような現在庫があり、UA出荷先から、H製
品6〔t〕の受注オーダがあったとする。在庫引き当て
は、特にユーザなどから、製番指定がないときは、先入
れ先出しを原則とする。したがって、H製品の一番古い
製番を引き当てると、A倉庫に製番“N1“が4
〔t〕、D倉庫に同じ製番の在庫が3〔t〕あるため、
A倉庫から4〔t〕、D倉庫から2〔t〕、合計6
〔t〕を引き当てる。この在庫引当により、上記受注オ
ーダに基づいて、A倉庫からUA出荷先へH製品を4
〔t〕、D倉庫からUA出荷先へH製品を2〔t〕、と
いう2つの出荷オーダが生じる。
[Table 1] It is assumed that there is a current warehouse as shown in Table 1 and an order for H product 6 [t] is received from the UA shipping destination. In principle, the stock allocation should be first-in first-out, unless the user specifies the product number. Therefore, if the oldest product number of the H product is assigned, the product number “N1” is 4 in the A warehouse.
[T], because there is 3 [t] of the same serial number in D warehouse,
4 [t] from A warehouse, 2 [t] from D warehouse, total 6
Allot [t]. By this inventory allocation, 4 H products from A warehouse to UA shipping destination based on the above-mentioned order order.
There are two shipping orders of [t], 2 [t] of H products from the D warehouse to the UA shipping destination.

【0005】倉庫の積み荷が、輸送車両の最大積載量に
満たない場合、同一地区の他の倉庫の輸送オーダを積み
合わせる。一受注オーダに在庫を引き当てた結果、一倉
庫で充当できなく、同一地区の複数の倉庫にまたがって
在庫を引き当てた場合も、引き当てた他の倉庫に立ち寄
り、積み合わせる。したがって上記の受注の例では、A
倉庫から4〔t〕、D倉庫から2〔t〕積み合わせる。
同一出荷先地域内の複数の出荷先に対する出荷オーダ
は、一車両に積み合わせて納入することができる。ある
出荷オーダが輸送車両の最大積載量に満たない場合、同
一地域の他の出荷先の出荷オーダを積み合わせる。積み
合わせ地域は、納入先の所在地、過去の実績などから、
地域マスタ、納入先品名マスタへ、あらかじめ登録す
る。
When the load of the warehouse is less than the maximum load of the transportation vehicle, the transportation orders of other warehouses in the same area are stacked. As a result of allocating inventory to one order order, if it cannot be allocated in one warehouse and inventory is allocated to multiple warehouses in the same area, the other warehouses that have been allocated will be stopped and piled up. Therefore, in the example of the order received above, A
Stack 4 [t] from the warehouse and 2 [t] from the D warehouse.
Shipping orders for a plurality of shipping destinations within the same shipping destination area can be delivered by being stacked on one vehicle. If a shipping order is less than the maximum capacity of the transportation vehicle, the shipping orders of other shipping destinations in the same area are stacked. The accumulation area is based on the location of the delivery destination, past results, etc.
Register in advance in the area master and delivery destination product name master.

【0006】ところで、倉庫から出荷先までの道路事
情、出荷先の構内事情などにより、小回りの利く車両、
例えば4トン車限定など、最大積載量の制限が出荷オー
ダに付与されることがある。また、出荷先の荷卸し設備
事情などにより、荷卸し用クレーンを備えたユニック車
限定など、車種制限がある。さらに、輸送する製品の特
性により、−18℃冷凍車、+5℃保冷車など、車種指
定がある。
By the way, depending on the road conditions from the warehouse to the shipping destination, the premises conditions of the shipping destination, etc.
For example, a maximum load capacity may be given to a shipping order, such as a limitation of a 4-ton vehicle. In addition, there are restrictions on vehicle types, such as only Unic vehicles equipped with an unloading crane, depending on the unloading equipment situation at the shipping destination. Furthermore, depending on the characteristics of the products to be transported, there are vehicle types such as -18 ° C refrigerated cars and + 5 ° C refrigerated cars.

【0007】次に、従来の配車計画作成方法を説明す
る。配車計画作成の前処理として、車両限定と最大積載
量クラス分け、及び出荷オーダの集計を行う。車両限定
のある出荷オーダは、指定車両に引き当てる必要があ
り、指定車両の引き当てを優先する。車両は、最大積載
量の多いクラス順に引き当てるが、最大積載量のクラス
毎に引当可能な車両には、台数制限があり、制限を超え
た場合、次の積載量の多いクラスの車両に引き当てる。
また、自社車両、傭車車両など、利用可能な台数を超え
る場合は、人間の判断により、ダミーの車両を割り付け
るなどで対処する。ダミーの車両の手配などは、他の輸
送業者に委託するなど、別途対応する。
Next, a conventional vehicle allocation plan creating method will be described. As a pre-processing for creating a vehicle allocation plan, vehicle limitation, maximum load capacity classification, and shipment order aggregation are performed. The vehicle-limited shipping order needs to be assigned to the designated vehicle, and the assignment of the designated vehicle is prioritized. The vehicles are assigned in the order of the class with the largest load capacity. However, there is a limit to the number of vehicles that can be allocated for each class with the maximum load capacity. If the limit is exceeded, the vehicle with the next highest load capacity is assigned.
In addition, if the number of available vehicles, such as own vehicle or mercenary vehicle, exceeds the available number, a dummy vehicle will be assigned according to human judgment. Arrangement of dummy vehicles will be handled separately by outsourcing to other carriers.

【0008】同一の輸送日(或いは、発送日または納品
日)を有し、同一倉庫から同一出荷先へ出荷される複数
の出荷オーダは、オーダ毎の製品が異なっていても輸送
の面からみれば、出発地及び到着地が同じである一口の
輸送に取り纏めることができるので、同一の車両に積み
合わせすることができる。このように、取り纏めた出荷
オーダを輸送オーダと呼ぶことにする。但し、受注オー
ダが最大積載量を上回っている場合は、最大積載量を限
度として複数の出荷オーダに分割(分納)する。取り纏
めた一口の輸送オーダも、最大積載量を限度とする。出
発地が同一地区の倉庫であり、かつ到着地が同一地域内
の納入先の場合には、複数の輸送オーダを同一車両に積
み合わせることができるものとする。
[0008] A plurality of shipping orders having the same transportation date (or shipping date or delivery date) and shipped from the same warehouse to the same shipping destination can be seen from the viewpoint of transportation even if the products for each order are different. For example, since it is possible to put together a single-portion transportation in which the departure place and the arrival place are the same, it is possible to load them in the same vehicle. In this way, the collected shipping order is called a transportation order. However, when the order load exceeds the maximum load capacity, the maximum load capacity is used as a limit and the shipment is divided into multiple shipping orders (payment). The maximum shipping capacity is limited to the combined shipping order. If the departure place is a warehouse in the same area and the arrival place is a delivery destination in the same area, multiple freight orders can be stacked on the same vehicle.

【0009】従来の配車計画作成方法は、利用可能な車
両のリストを作成する車両リスト作成、車両リストか
ら引当対象の車両データを読み込む未確定車両読み込
み、未確定車両の引当可能量を初期化する引当可能量
初期化、車両に引き当てられていない未引き当ての輸送
オーダを読み込む未引き当て輸送オーダ読み込み、読
み込んだ輸送オーダが引当対象の車両に引当可能か否か
を判定する引当可能量チェック、引当可能ならば、こ
の輸送オーダを引当対象車両に引き当てるとともに引当
可能量を更新する引き当て処理、更新した引当可能量
が0か否かを判定する引当可能量のチェックからな
る。
In the conventional vehicle allocation plan creating method, a vehicle list is created to create a list of available vehicles, an undetermined vehicle is read from the vehicle list to read vehicle data to be allocated, and an available allocation amount of the undetermined vehicle is initialized. Allowable amount initialization, read unassigned freight orders that have not been assigned to vehicles, read unassigned freight orders, determine whether or not the loaded freight orders can be assigned to vehicles that are to be allocated. In this case, the allocation process allocates this transportation order to the allocation target vehicle and updates the allocation possible amount, and the allocation possible amount is checked to determine whether the updated allocation possible amount is 0 or not.

【0010】次に、従来の配車計画作成方法を図8のフ
ローチャートを参照して説明する。 車両リスト作成 まず、輸送に使用可能な車両のリストを作成する。例え
ば、図示しない車両マスタファイルから輸送日にスケジ
ュールが空きの車両を抽出し、これら利用可能な車両の
車両リストを作成し、車両マスタファイルを参照して、
車両リストの各車両データに最大積載量及び車両車種を
付与する(ステップS101)。 未確定車両読み込み 次いで、未確定車両のデータを最大積載量の順に読み込
む(ステップS102)。車両限定の輸送オーダがある
場合は、限定車両を優先する。未確定車両があったかど
うかを判定し(ステップS103)、未確定車両が無く
なったにもかかわらず、未引き当て輸送オーダが残って
いる場合は、未引き当て輸送オーダありのメッセージを
出力して(ステップS104)、引き当て処理を終了
し、車両台数などを調整してから、最初からやり直すな
ど、未引き当て輸送オーダをなくす。
Next, a conventional vehicle allocation planning method will be described with reference to the flowchart of FIG. Creating a vehicle list First, create a list of vehicles that can be used for transportation. For example, a vehicle with an empty schedule is extracted from a vehicle master file (not shown), a vehicle list of these available vehicles is created, and the vehicle master file is referred to.
The maximum load capacity and vehicle type are added to each vehicle data in the vehicle list (step S101). Reading Undetermined Vehicles Next, the data of undetermined vehicles is read in the order of the maximum load (step S102). If there is a transportation order limited to vehicles, priority is given to limited vehicles. It is determined whether or not there are unconfirmed vehicles (step S103), and if there are unconfirmed vehicles, but there are still unassigned transportation orders, a message indicating that there are unassigned transportation orders is output (step S104). ), End the assigned processing, adjust the number of vehicles, etc., and then start over from the beginning to eliminate unassigned transportation orders.

【0011】引当可能量初期化 未確定車両が存在し、読み込みが成功した場合(ステッ
プS103の判定がYesのとき)、この車両の引当可
能量を最大積載量に初期化する(ステップS104)。 未引き当て輸送オーダ読み込み 次いで、未引き当て輸送オーダを読み込む(ステップS
106)。未引き当て輸送オーダがあったかどうかを判
定し(ステップS107)、未引き当て輸送オーダが無
くなったら、配車計画作成処理は完了し、正常終了す
る。 引当可能量チェック ステップS107の判定がYesのとき、すなわち未引
き当て輸送オーダがあれば、読み込んだ未引き当て輸送
オーダの輸送量が、当該車両の引当可能量以下か否かを
判定する(ステップS108)。当該輸送オーダの輸送
量が車両の引当可能量を超えた場合、この輸送オーダは
当該車両に積載不可であるので、読み飛ばし、次の未引
き当て輸送オーダを読み込むべく、ステップS106へ
戻る。ステップS108の判定で、輸送オーダの輸送量
が車両の引当可能量以下のときは、この輸送オーダを車
両に引き当てる引当処理を行うべく、ステップS109
へ進む。
If there is an undetermined vehicle for which the allocatable amount has been initialized and the reading has succeeded (when the determination in step S103 is Yes), the allocatable amount of this vehicle is initialized to the maximum load amount (step S104). Read unassigned transportation order Next, read the unassigned transportation order (step S
106). It is determined whether or not there is an unassigned transportation order (step S107), and when the unassigned transportation order is exhausted, the vehicle allocation plan creation processing is completed and ends normally. If the determination in the available allocation check step S107 is Yes, that is, if there is an unassigned transportation order, it is determined whether or not the read transportation amount of the unassigned transportation order is less than or equal to the available allocation amount of the vehicle (step S108). . When the transportation amount of the transportation order exceeds the allocation possible amount of the vehicle, the transportation order cannot be loaded on the vehicle, so the operation is skipped and the process returns to step S106 to read the next unassigned transportation order. If it is determined in step S108 that the transportation amount of the transportation order is less than or equal to the vehicle allocation possible amount, step S109 is performed to perform allocation processing for allocating the transportation order to the vehicle.
Go to.

【0012】引き当て処理 ステップS109の引き当て処理では、輸送オーダを車
両に引き当てるため、車両データと引き当てた輸送オー
ダとを関連づけ、引き当てた輸送オーダの引当済みへの
変更、及び車両の引当可能量の更新を行う。車両データ
と引き当てた輸送オーダとの関連づけの方法は各種あ
り、車両データのレコードに引き当てた輸送オーダを追
加してもよいし、輸送オーダのレコードに引き当てられ
た車両データ(車両ID)を追加してもよいし、或い
は、車両データと引き当てた輸送オーダとを配車計画デ
ータとして作成してもよい。また、引き当てた輸送オー
ダの属性を引当済みに変更し、車両の引当可能量から引
き当てた輸送オーダの輸送量を差し引き、引当可能量を
更新する。
In the allocation process of the allocation process step S109, in order to allocate the transportation order to the vehicle, the vehicle data is associated with the allocated transportation order, the allocated transportation order is changed to allocated, and the allocation possible amount of the vehicle is updated. I do. There are various methods of associating the vehicle data with the assigned transportation order. The assigned transportation order may be added to the vehicle data record, or the assigned vehicle data (vehicle ID) may be added to the transportation order record. Alternatively, the vehicle data and the assigned transportation order may be created as the vehicle allocation plan data. In addition, the attribute of the allocated transportation order is changed to allocated, the transportation amount of the allocated transportation order is subtracted from the allocation capacity of the vehicle, and the allocation capacity is updated.

【0013】引当可能量のチェック 引当可能量を更新した後、引当可能量が0か否かを判定
する(ステップS110)。引当可能量が0であれば、
その車両は最大積載量まで輸送オーダの引当が完了した
ので、次の未確定車両に輸送オーダの引当処理を行うべ
く、ステップS102へ戻る。ステップS110の判定
で、引当可能量が0でなければ、最大積載量まで積み合
わせるために、次の未引き当て輸送オーダを読み込むた
めに、ステップS106へ戻る。
After checking the available allocation amount, it is determined whether the available allocation amount is 0 (step S110). If the available allocation is 0,
Since the transportation order allocation for the vehicle has been completed up to the maximum load capacity, the process returns to step S102 to perform the transportation order allocation process for the next undetermined vehicle. If it is determined in step S110 that the available allocation amount is not 0, the process returns to step S106 to read the next unassigned transportation order in order to load the maximum loading amount.

【0014】上記従来の配車計画作成方法における具体
的な引当例を説明する。出庫倉庫別及び出荷先別に出荷
オーダを集計した結果、次の表2に示す輸送オーダリス
トが得られたとする。尚、引当フラグは、引当済みの輸
送オーダと、未引き当ての輸送オーダとを区別するため
の2値フラグである。以下説明の簡単化のために、すべ
ての車両の最大積載量を10〔t〕とする。
A specific example of allocation in the conventional vehicle allocation plan creating method will be described. It is assumed that the shipping order list shown in Table 2 below is obtained as a result of totaling the shipping orders for each shipping warehouse and each shipping destination. The allocation flag is a binary flag for distinguishing the allocated transportation order and the unallocated transportation order. In order to simplify the description below, the maximum load capacity of all vehicles is set to 10 [t].

【0015】[0015]

【表2】 第1車両 最大積載量が10〔t〕であるので、引当可能量の初期
値は、10〔t〕となる。まず、未引き当て輸送オーダ
として、輸送オーダNo.1の輸送量10〔t〕を読み
込む。この輸送量は引当可能量以下なので、輸送オーダ
No.1の引き当て処理が行われ、引当可能量は10−
10=0〔t〕に更新される。更新後の引当可能量が0
となったので、これで第1車両の引当処理は終了する。
[Table 2] Since the first vehicle maximum load amount is 10 [t], the initial value of the available allocation amount is 10 [t]. First, as an unassigned transportation order, the transportation order number. The transport amount 10 [t] of 1 is read. Since this transportation amount is less than the amount that can be allocated, the transportation order number. Allocation processing of 1 is performed, and the available allocation amount is 10-
It is updated to 10 = 0 [t]. Available capacity after renewal is 0
Therefore, the allocation process for the first vehicle is completed.

【0016】第2車両 第1車両と同様に最大積載量が10〔t〕であるので、
引当可能量の初期値は、10〔t〕となる。まず、未引
き当て輸送オーダとして、輸送オーダNo.2の輸送量
2〔t〕を読み込む。この輸送量は引当可能量以下なの
で、輸送オーダNo.2の引き当て処理が行われ、引当
可能量は10−2=8〔t〕に更新される。次いで、未
引き当て輸送オーダをリストの上から順次読み込み、引
当可能量8〔t〕以下の輸送量か否かを判定する。輸送
オーダNo.3は、輸送量が10〔t〕であるので、引
当不可である。輸送オーダNo.4の輸送量4〔t〕
は、引当可能量8〔t〕以下であるので、輸送オーダN
o.4の引当処理を行う。これにより引当可能量は、4
〔t〕に更新される。輸送オーダNo.5の輸送量1
〔t〕は、引当可能量4〔t〕以下であるので、輸送オ
ーダNo.5の引当処理を行う。これにより引当可能量
は、3〔t〕に更新される。以下、輸送オーダNo.6
〜11の輸送量は、いずれも引当可能量を超えるので引
当不可である。輸送オーダNo.12の輸送量2〔t〕
は、引当可能量3〔t〕以下のであるので、輸送オーダ
No.12の引当処理を行う。これにより引当可能量
は、1〔t〕に更新される。以後、輸送オーダNo.1
3〜17の輸送量は、いずれも引当可能量を超えるので
引当不可である。この結果、第2車両には、輸送オーダ
No.2,4,5,12が引き当てられ、引当総輸送量
は9〔t〕となった。
Second vehicle Since the maximum loading capacity is 10 [t] as in the first vehicle,
The initial value of the available allocation amount is 10 [t]. First, as an unassigned transportation order, the transportation order number. The transport amount 2 [t] of 2 is read. Since this transportation amount is less than the amount that can be allocated, the transportation order number. The allocation process of No. 2 is performed, and the available allocation amount is updated to 10-2 = 8 [t]. Next, the unassigned transportation orders are sequentially read from the top of the list, and it is determined whether the transportation amount is 8 [t] or less. Transportation order No. No. 3 cannot be allocated because the transportation amount is 10 [t]. Transportation order No. 4 transportation amount 4 [t]
Is less than the available allocation amount 8 [t], the transportation order N
o. 4 allocation processing is performed. As a result, the available allocation is 4
Updated to [t]. Transportation order No. Transport volume 1 of 5
Since [t] is less than the available allocation amount 4 [t], the transportation order number. 5 allocation processing is performed. As a result, the available allocation amount is updated to 3 [t]. Below, the transportation order number. 6
All of the transportation amounts of ~ 11 cannot be allocated because they exceed the allocation possible amount. Transportation order No. Transport amount of 12 2 [t]
Is less than the available allocation amount 3 [t], the transportation order number. 12 allocation processes are performed. As a result, the available allocation amount is updated to 1 [t]. After that, the transportation order number. 1
The transportation amounts of 3 to 17 are all unacceptable because they exceed the amount that can be allocated. As a result, the second vehicle has a transportation order number. 2, 4, 5 and 12 were allotted, and the total transport volume for allocation was 9 [t].

【0017】第3車両以降の引き当て 上記同様、輸送オーダ、車両リストの未割付車両が無く
なるまで、繰り返す。
Allocation of third vehicle and thereafter As in the above case, the process is repeated until there are no unassigned vehicles in the transportation order and vehicle list.

【0018】以上の引当処理を完了した結果を表3に示
す。
Table 3 shows the result of completing the above allocation process.

【0019】[0019]

【表3】 表3の引当車両欄のi−jは、iが車両を区別する番号
であり、jはその車両に引き当てられた輸送オーダの順
番を示している。この引当の結果、輸送車両は合計11
台を必要とし、第1車両から第11車両までの各引当量
は順に、10,9,10,8,9,8,9,8,7,
6,5〔t〕となった。
[Table 3] In the reserved vehicle column of Table 3, i-j is a number by which i distinguishes a vehicle, and j indicates the order of transportation orders assigned to the vehicle. As a result of this allocation, transportation vehicles total 11
A table is required, and the respective allocation amounts from the first vehicle to the eleventh vehicle are 10, 9, 10, 8, 9, 8, 8, 9, 8, 7,
It became 6, 5 [t].

【0020】[0020]

【発明が解決しようとする課題】しかしながら、上記従
来の配車計画作成方法によれば、No.11の輸送オー
ダは、繰り返し読み込まれたが、第8車両まで引き当て
出来なかった。このように、従来の配車計画方法によれ
ば、同じ輸送オーダを繰り返し読み込み、引当可能量
(残りの積み込み可能数量)と比較チェックをしてお
り、作業手順が多くなり、引当を完了するまでの処理が
非効率であるという問題点があった。また、各車両に対
して輸送オーダ順に引き当て可能な輸送オーダを引き当
てるため、残りの積み込み数量を、効率よく積載できる
という保証がなく、車両必要台数が増加し輸送コストが
増大するという問題点があった。
However, according to the above-mentioned conventional vehicle allocation plan creating method, the No. The 11th transportation order was read repeatedly, but could not be assigned to the 8th vehicle. In this way, according to the conventional vehicle allocation planning method, the same freight order is repeatedly read, and the comparison with the available capacity (remaining available quantity) is checked. There is a problem that the processing is inefficient. In addition, since a transportation order that can be allocated to each vehicle in the transportation order is allocated, there is no guarantee that the remaining loading quantity can be efficiently loaded, and there is a problem that the required number of vehicles increases and the transportation cost increases. It was

【0021】以上の問題点に鑑み本発明の目的は、輸送
オーダを車両に引き当てる際に、引当可能な輸送オーダ
検索処理の効率を高め、高速に処理することができる配
車計画作成システム及び配車計画作成方法を提供するこ
とである。また本発明の目的は、効率よく積み合わせを
行って車両必要台数を減少させることができる配車計画
作成システム及び配車計画作成方法を提供することであ
る。さらに本発明の目的は、同一地区内の異なる出庫倉
庫からの輸送オーダや、同一地域内の異なる出荷先への
輸送オーダを効率よく積み合わせることができる配車計
画作成方法を提供することである。
In view of the above-mentioned problems, an object of the present invention is to improve the efficiency of the allocation order search processing that can be allocated when allocating a transportation order to a vehicle, and a vehicle allocation plan creating system and a vehicle allocation plan that can be processed at high speed. It is to provide a creation method. Another object of the present invention is to provide a vehicle allocation plan creation system and a vehicle allocation plan creation method that can efficiently perform stacking and reduce the number of vehicles required. A further object of the present invention is to provide a vehicle allocation plan creation method capable of efficiently accumulating transportation orders from different shipping warehouses within the same area and transportation orders to different shipping destinations within the same area.

【0022】[0022]

【課題を解決するための手段】上記目的を達成するた
め、請求項1記載の発明は、出庫倉庫及び出荷先毎に出
荷オーダを集計した輸送オーダに基づいて第1の地域内
の複数の倉庫から第2の地域内の複数の出荷先へ出荷す
る際に、複数の車両に前記輸送オーダを引き当てる配車
計画作成システムであって、前記複数の車両のそれぞれ
に対応する車両データからなる車両テーブルを記憶する
車両テーブル記憶手段と、複数の輸送オーダを輸送量の
降順にソートした輸送オーダテーブルを記憶する輸送オ
ーダテーブル記憶手段と、輸送オーダが未割付の車両デ
ータを前記車両テーブル記憶手段から1台分づつ読み込
む車両読込手段と、前記読み込んだ車両データに最大積
載量を超えない範囲で輸送量が多い順に前記輸送オーダ
テーブルから輸送オーダを引き当てて配車計画を作成す
る輸送オーダ引当手段と、を備えたことを要旨とする配
車計画作成システムである。
In order to achieve the above object, the invention according to claim 1 is a plurality of warehouses in a first area based on a shipping warehouse and a shipping order in which shipping orders are aggregated for each shipping destination. Is a vehicle allocation plan creation system that allocates the transportation order to a plurality of vehicles when shipping from the vehicle to a plurality of shipping destinations in the second area, and a vehicle table including vehicle data corresponding to each of the plurality of vehicles. Vehicle table storage means for storing, transportation order table storage means for storing a transportation order table in which a plurality of transportation orders are sorted in descending order of transportation amount, and vehicle data to which transportation orders have not been assigned from the vehicle table storage means Vehicle reading means for reading the data in a divided manner, and transportation order from the transportation order table in descending order of the amount of transportation in the loaded vehicle data in a range not exceeding the maximum load capacity. A transport order provision means for creating a dispatch plan provisions da, further comprising a a dispatch planning system to subject matter.

【0023】上記目的を達成するため、請求項2記載の
発明は、請求項1記載の配車計画作成システムにおい
て、前記複数の車両が最大積載量の異なる車両を含む場
合、前記車両テーブル記憶手段は、複数の車両データを
最大積載量の降順にソートした車両テーブルを記憶し、
前記車両読込手段は、未割付の車両データを前記車両テ
ーブルから最大積載量が大きい順に1台分づつ読み込む
ことを要旨とする。
In order to achieve the above object, the invention according to claim 2 is the vehicle allocation planning system according to claim 1, wherein when the plurality of vehicles include vehicles having different maximum loads, the vehicle table storage means , Stores a vehicle table that sorts multiple vehicle data in descending order of maximum load,
The gist of the vehicle reading means is to read unallocated vehicle data from the vehicle table for each one in descending order of maximum load capacity.

【0024】上記目的を達成するため、請求項3記載の
発明は、請求項1または請求項2記載の配車計画作成シ
ステムにおいて、前記輸送オーダ引当手段は、前記車両
読込手段で読み込まれた車両データの最大積載量を前記
車両の引当可能量の初期値とする引当可能量初期化手段
と、前記車両の引当可能量以下の輸送量を有する未引き
当て輸送オーダがあるか否かを判定し、この判定で前記
車両の引当可能量以下の輸送量を有する未引き当て輸送
オーダがなければ前記車両の引き当てを完了する引当可
否判定手段と、前記判定結果が前記車両の引当可能量以
下の輸送量を有する未引き当て輸送オーダがあれば、前
記車両の引当可能量以下で最大の輸送量を有する輸送オ
ーダを前記車両に引き当てる引当手段と、前記引当手段
で引き当てられた輸送オーダの輸送量を前記車両の引当
可能量から減じる引当可能量更新手段と、を備えたこと
を要旨とする。
In order to achieve the above object, the invention according to claim 3 is the vehicle allocation plan creating system according to claim 1 or 2, wherein the transportation order allocation means is vehicle data read by the vehicle reading means. It is determined whether or not there is an unallocated transportation order having a transportation capacity less than the allocatable amount of the vehicle, and an allocatable amount initialization means for setting the maximum load capacity of the vehicle as an initial value of the allocatable amount of the vehicle, and If there is no unassigned transportation order having a transportation amount less than the allocatable amount of the vehicle in the determination, the allocation availability determination means that completes the allocation of the vehicle, and the determination result has a transportation amount less than the allocatable amount of the vehicle. If there is an unassigned transportation order, the allocation means for allocating the transportation order having the maximum transportation amount equal to or less than the allocable amount of the vehicle to the vehicle, and the allocation means assigned by the allocation means. And reservable amount updating means for reducing the transport of feed order from reservable amount of the vehicle, is summarized as further comprising a.

【0025】上記目的を達成するため、請求項4記載の
発明は、請求項1ないし請求項3のいずれか1項記載の
配車計画システムにおいて、前記輸送オーダ中に車両を
限定する輸送オーダがある場合に、限定車両を優先して
引き当てる限定車両引当手段を備えたことを要旨とす
る。
In order to achieve the above-mentioned object, the invention according to claim 4 is the vehicle allocation planning system according to any one of claims 1 to 3, wherein there is a transportation order for limiting vehicles in the transportation order. In this case, it is a gist to provide a limited vehicle allocation means for giving priority to limited vehicles.

【0026】上記目的を達成するため、請求項5記載の
発明は、請求項1ないし請求項4のいずれか1項記載の
配車計画作成システムにおいて、前記輸送量、前記最大
積載量、及び前記引当可能量は、重量単位または容積単
位のいずれか一方であることを要旨とする。
In order to achieve the above object, the invention according to claim 5 is the vehicle allocation planning system according to any one of claims 1 to 4, wherein the transportation amount, the maximum load amount, and the allocation are provided. The gist is that the possible amount is either a weight unit or a volume unit.

【0027】上記目的を達成するため、請求項6記載の
発明は、請求項1ないし請求項4のいずれか1項記載の
配車計画作成システムにおいて、前記輸送量、前記最大
積載量、及び前記引当可能量は、重量及び容積単位であ
り、これ以上の輸送オーダを割り当てると重量または容
積のいずれか一方または双方が最大積載量を超える場合
に、前記車両の引当を完了することを要旨とする。
In order to achieve the above object, the invention according to claim 6 is the vehicle allocation planning system according to any one of claims 1 to 4, wherein the transportation amount, the maximum loading amount, and the allocation are provided. The possible amount is a unit of weight and volume, and it is a gist to complete the allocation of the vehicle when one or both of the weight and / or volume exceeds the maximum load amount when a transportation order larger than this is assigned.

【0028】上記目的を達成するため、請求項7記載の
発明は、出庫倉庫及び出荷先毎に出荷オーダを集計した
輸送オーダに基づいて第1の地域内の複数の倉庫から第
2の地域内の複数の出荷先へ出荷する際に、複数の車両
に前記輸送オーダを引き当てる配車計画作成方法であっ
て、前記複数の車両に最大積載量の異なる車両を含む場
合に複数の車両データを最大積載量の降順にソートして
車両テーブルを作成する車両テーブル作成過程と、複数
の輸送オーダを輸送量の降順にソートして輸送オーダテ
ーブルを作成する輸送オーダテーブル作成過程と、未割
付の車両データを前記車両テーブルから最大積載量が大
きい順に1台分づつ読み込む車両読込過程と、前記読み
込んだ車両データに最大積載量を超えない範囲で輸送量
が多い順に輸送オーダを引き当てて配車計画を作成する
輸送オーダ引当過程と、を備えたことを要旨とする配車
計画作成方法である。
In order to achieve the above-mentioned object, the invention according to claim 7 is based on a shipping order in which a shipping order is aggregated for each of a delivery warehouse and a shipping destination, and a plurality of warehouses within the first area A method of creating a vehicle allocation plan for assigning the transportation order to a plurality of vehicles when shipping to a plurality of shipping destinations, wherein the plurality of vehicle data are loaded to the maximum load when the plurality of vehicles include vehicles having different maximum load amounts. A vehicle table creation process that creates a vehicle table by sorting in descending order of quantity, a shipping order table creation process that creates a shipping order table by sorting multiple shipping orders in descending order of shipping quantity, and an unassigned vehicle data A vehicle reading process of reading from the vehicle table one by one in descending order of the maximum loading amount, and a transportation operation in order of increasing loading amount within a range not exceeding the maximum loading amount in the read vehicle data. A transport order provision process of creating a dispatch plan provisions da, a dispatch planning method for summarized as further comprising a.

【0029】上記目的を達成するため、請求項8記載の
発明は、請求項7記載の配車計画作成方法において、前
記輸送オーダ引当過程は、前記車両読込過程で読み込ま
れた車両データの最大積載量を前記車両の引当可能量の
初期値とする引当可能量初期化過程と、前記車両の引当
可能量以下の輸送量を有する未引き当て輸送オーダがあ
るか否かを判定し、この判定で前記車両の引当可能量以
下の輸送量を有する未引き当て輸送オーダがなければ前
記車両の引き当てを完了する一方、未引き当て輸送オー
ダが残れば次の車両データを読み込むべく前記車両読込
過程へ戻る引当可否判定過程と、前記判定結果が前記車
両の引当可能量以下の輸送量を有する未引き当て輸送オ
ーダがあれば、前記車両の引当可能量以下で最大の輸送
量を有する輸送オーダを前記輸送オーダテーブルから取
り出して前記車両に引き当てる引当過程と、前記引当過
程で引き当てられた輸送オーダの輸送量を前記車両の引
当可能量から減じて前記判定過程へ戻る引当可能量更新
過程と、を備えたことを要旨とする。
In order to achieve the above-mentioned object, the invention according to claim 8 is the vehicle allocation plan creating method according to claim 7, wherein the transportation order allocation step is the maximum load amount of the vehicle data read in the vehicle reading step. A process of initializing the available allocation amount of the vehicle is determined, and it is determined whether or not there is an unassigned transportation order having a transportation amount equal to or less than the available allocation amount of the vehicle. If there is no unassigned transportation order having a transportation amount less than or equal to the available allocation amount, the allocation of the vehicle is completed, while if there is an unallocated transportation order, the process returns to the vehicle reading process to read the next vehicle data. If there is an unassigned transportation order whose determination result is a transportation amount that is less than or equal to the allocation amount of the vehicle, a transportation option that has a maximum transportation amount that is less than or equal to the allocation amount of the vehicle. An allocation process of taking out data from the transportation order table and allocating it to the vehicle, and an allocation possible amount updating process of subtracting the transportation amount of the transportation order allocated in the allocation process from the allocation amount of the vehicle and returning to the determination process. The summary is that

【0030】[0030]

【発明の実施の形態】次に、図面を参照して本発明の実
施の形態を詳細に説明する。図1は、本発明に係る配車
計画作成システムの構成を説明するシステム構成図であ
る。同図において、配車計画作成システム1は、複数の
車両データを記憶した車両テーブル記憶部3と、複数の
輸送オーダを輸送量の降順にソートした輸送オーダテー
ブルを記憶した輸送オーダテーブル記憶部2と、未割付
の車両データを前記車両テーブルから最大積載量が大き
い順に1台分づつ読み込む車両読込部4と、読み込んだ
車両データに最大積載量を超えない範囲で輸送量が多い
順に輸送オーダを引き当てて配車計画を作成する輸送オ
ーダ引当部5と、車両限定オーダを限定車両に引き当て
る車両限定オーダ引当部6と、引当結果(配車計画)で
ある引当結果ファイルを格納する引当ファイル記憶部7
と、を備えている。
BEST MODE FOR CARRYING OUT THE INVENTION Next, embodiments of the present invention will be described in detail with reference to the drawings. FIG. 1 is a system configuration diagram illustrating the configuration of a vehicle allocation plan creation system according to the present invention. In the figure, a vehicle allocation planning system 1 includes a vehicle table storage unit 3 that stores a plurality of vehicle data, and a transportation order table storage unit 2 that stores a transportation order table in which a plurality of transportation orders are sorted in descending order of transportation amount. , A vehicle reading unit 4 that reads unallocated vehicle data from the vehicle table one by one in descending order of maximum load capacity, and a transportation order is assigned to the read vehicle data in descending order of the maximum load capacity and in descending order of transport volume. A transportation order allocation unit 5 that creates a vehicle allocation plan by a vehicle, a vehicle limited order allocation unit 6 that allocates a vehicle limited order to a limited vehicle, and an allocation file storage unit 7 that stores an allocation result file that is an allocation result (vehicle allocation plan).
And are equipped with.

【0031】ここで輸送オーダとは、出庫倉庫及び出荷
先毎に出荷オーダを集計して、ある出庫倉庫からある出
荷先へどれだけの輸送量があるかを示すものである。通
常、出荷オーダは、出荷日又は納入日、出荷する製品の
品名、数量、包装形態、出庫倉庫、出荷先(納入先)等
の情報を含むものであるが、輸送オーダは、同一出荷
日、同一出庫倉庫から同一出荷先への一つ以上の出荷オ
ーダによる輸送量を集計したものである。但し、各輸送
オーダの輸送量が車両の最大積載量を超えないように、
輸送オーダは最大積載量毎に分割されているものとす
る。そして、配車計画作成システム1は、第1の地域内
の複数の倉庫から第2の地域内の複数の出荷先へ輸送す
る際に、可能な積み合わせを行って、複数の車両に輸送
オーダを引き当てて輸送効率の高い配車計画を作成する
ものである。
Here, the transportation order indicates the amount of transportation from a certain shipping warehouse to a certain shipping destination by totalizing shipping orders for each shipping warehouse and shipping destination. Usually, the shipping order includes information such as shipping date or delivery date, product name of the product to be shipped, quantity, packaging form, delivery warehouse, and shipping destination (delivery destination), but the shipping order includes the same shipping date and the same shipping. This is a summary of the amount of transportation from a warehouse to the same destination by one or more shipping orders. However, in order that the transportation volume of each transportation order does not exceed the maximum loading capacity of the vehicle,
The transportation order shall be divided according to the maximum load capacity. Then, the vehicle allocation planning system 1 performs possible stacking when transporting from a plurality of warehouses in the first region to a plurality of shipping destinations in the second region, and transport orders to a plurality of vehicles. This is to allocate a vehicle allocation plan with high transportation efficiency.

【0032】車両テーブル記憶部3は、最大積載量の異
なる車両データを含む場合、複数の車両データを最大積
載量の降順にソートした車両テーブルを記憶するもので
ある。輸送オーダ引当部5は、車両読込部4で読み込ま
れた車両データの最大積載量を車両の引当可能量の初期
値とする引当可能量初期化部8と、車両の引当可能量以
下の輸送量を有する未引き当て輸送オーダがあるか否か
を判定し、この判定で車両の引当可能量以下の輸送量を
有する未引き当て輸送オーダがなければ車両の引き当て
を完了する引当可否判定部9と、判定結果が前記車両の
引当可能量以下の輸送量を有する未引き当て輸送オーダ
があれば、車両の引当可能量以下で最大の輸送量を有す
る輸送オーダを前記輸送オーダテーブルから取り出して
前記車両に引き当てる引当部10と、引当部10で引き
当てられた輸送オーダの輸送量を車両の引当可能量から
減じる引当可能量更新部11と、を備えている。
The vehicle table storage unit 3 stores a vehicle table in which a plurality of pieces of vehicle data are sorted in descending order of the maximum load amount when the vehicle data having different maximum load amounts are included. The freight order allocation unit 5 includes a reproducible amount initialization unit 8 that sets the maximum load amount of the vehicle data read by the vehicle reading unit 4 as an initial value of the reproducible amount of the vehicle, and a transport amount that is less than or equal to the reproducible amount of the vehicle. And whether or not there is an unassigned transportation order that has the allocation, and if there is no unassigned transportation order that has a transportation amount less than or equal to the allocation amount of the vehicle in this determination, the allocation availability determination unit 9 that completes the allocation of the vehicle and the determination If there is an unassigned freight order with a transportation amount that is less than or equal to the allocation amount of the vehicle, a transportation order having a maximum transportation amount that is less than or equal to the allocation amount of the vehicle is retrieved from the freight order table and allocated to the vehicle. The system includes a unit 10 and an available allocation amount updating unit 11 that subtracts the transportation amount of the transportation order assigned by the allocation unit 10 from the vehicle available amount.

【0033】次に、図1の配車計画作成システム1の動
作を説明する。以下の説明では、輸送オーダテーブル記
憶部2に記憶された輸送オーダテーブルも輸送オーダテ
ーブル2と呼ぶことにする。同様に、車両テーブル記憶
部3に記憶された車両テーブルを車両テーブル3,引当
結果ファイル記憶部7に記憶された引当結果ファイルを
引当結果ファイル7と呼ぶ。
Next, the operation of the vehicle allocation planning system 1 of FIG. 1 will be described. In the following description, the transportation order table stored in the transportation order table storage unit 2 will also be referred to as the transportation order table 2. Similarly, the vehicle table stored in the vehicle table storage unit 3 is referred to as a vehicle table 3, and the allocation result file stored in the allocation result file storage unit 7 is referred to as an allocation result file 7.

【0034】本実施形態における配車計画作成システム
1の動作概要は以下の通りである。まず、複数の輸送オ
ーダが降順にソートされた輸送オーダテーブル2と、複
数の車両データが格納された車両テーブル3が準備され
る。車両テーブル3は、最大積載量の異なる車種が含ま
れる場合には、最大積載量で降順にソートされているも
のとする。これにより、車両読込部4が車両テーブル3
から未割付車両を読み込む場合、最大積載量の大きい車
両から読み込むことができるので、最大積載量の多い車
両から優先して輸送オーダ引き当てを行うことができ、
輸送に使用する車両台数を減少させることができる。ま
た、輸送オーダテーブルから未引き当て輸送オーダを読
み出す場合、輸送量の多い輸送オーダから読み出される
ことになり、車両に輸送オーダを引き当てる際に、輸送
量の大きい輸送オーダを先に引当て、最大積載量に達す
るまで順次輸送量の小さい輸送オーダを引き当てること
ができるので、車両の最大積載量を有効に利用した積み
合わせを行うことができる。
The outline of the operation of the vehicle allocation planning system 1 in this embodiment is as follows. First, a transportation order table 2 in which a plurality of transportation orders are sorted in descending order and a vehicle table 3 in which a plurality of vehicle data are stored are prepared. The vehicle table 3 is sorted in descending order by the maximum load amount when the vehicle types having different maximum load amounts are included. As a result, the vehicle reading unit 4 makes the vehicle table 3
When loading an unassigned vehicle from, the vehicle with the largest maximum load can be loaded, so the transportation order can be assigned with priority to the vehicle with the maximum maximum load.
The number of vehicles used for transportation can be reduced. When unassigned freight orders are read from the freight order table, they are read from freight orders with a large freight volume.When allocating freight orders to vehicles, freight orders with a large freight volume are allocated first and the maximum load is loaded. It is possible to allocate transportation orders with smaller transportation amounts until reaching the amount, so that it is possible to perform stacking that effectively uses the maximum loading amount of vehicles.

【0035】次に、図2のフローチャートを参照して、
本発明に係る配車計画作成システムの動作を説明する。
但し、図2には輸送オーダテーブル2および車両テーブ
ル3を作成する前処理の内容も記載されている。まず、
輸送オーダテーブル2の作成処理(ステップS10〜S
14)と、車両テーブル3の作成処理(ステップS16
〜S20)が前処理として行われる。これらの作成処理
は、いずれか一方の処理を先に行ってもよいし、両方の
処理を並列に行ってもよい。輸送オーダテーブル2の作
成処理は、まず、出荷オーダファイル12から処理対象
の出荷オーダを抽出する(ステップS10)。この出荷
オーダの抽出には、出庫日、納入日、輸送手段コード等
をキイとして行う。
Next, referring to the flowchart of FIG.
The operation of the vehicle allocation planning system according to the present invention will be described.
However, FIG. 2 also shows the contents of the preprocessing for creating the transportation order table 2 and the vehicle table 3. First,
Creation processing of the transportation order table 2 (steps S10 to S
14) and the process of creating the vehicle table 3 (step S16).
~ S20) is performed as pre-processing. As for these creation processes, either one of the processes may be performed first, or both processes may be performed in parallel. In the process of creating the transportation order table 2, first, a shipping order to be processed is extracted from the shipping order file 12 (step S10). This shipping order is extracted by using the delivery date, delivery date, transportation means code, etc. as keys.

【0036】図3は、出荷オーダファイル12の構成例
を示す図である。出荷オーダファイル12の各レコード
は、出荷オーダ番号フィールド、製品名をコード化して
示す品名コードフィールド、一般的な製品規格に基づく
品質を示す等級コードフィールド、製品の包装形態を示
す包装形態コードフィールド、出荷数量を示す数量フィ
ールド、出庫日を示す出庫日フィールド、製品の出荷倉
庫を示す出庫倉庫コードフィールド、出荷先(納入先)
をコード化して示す出荷先フィールド、納入日を示す納
入日フィールド、貨車やトラック等の輸送手段を示す輸
送手段コードフィールド、及びデータの更新記録フィー
ルドを備えている。
FIG. 3 is a diagram showing a configuration example of the shipping order file 12. Each record of the shipping order file 12 includes a shipping order number field, a product name code field indicating a coded product name, a grade code field indicating quality based on general product standards, a packaging form code field indicating a product packaging form, Quantity field indicating the shipment quantity, issue date field indicating the issue date, issue warehouse code field indicating the shipment warehouse of the product, ship-to party (delivery destination)
A shipping destination field indicating the code, a delivery date field indicating the delivery date, a transportation means code field indicating the transportation means such as a freight car or a truck, and a data update recording field.

【0037】処理対象の出荷オーダを抽出すると、抽出
した出荷オーダを出庫倉庫及び出荷先毎に集計して、輸
送オーダを作成する(ステップS12)。このとき、各
輸送オーダに含む輸送量は、車両の最大積載量を超えな
いように、最大積載量を限度とし、これを超えるものは
別の輸送オーダとする。従って、ある出庫倉庫からある
出荷先へ輸送すべき輸送量の総和が最大積載量を超える
ときは、複数の輸送オーダに集計される。次いで、輸送
オーダを輸送量によって降順にソートして、輸送オーダ
テーブル2に格納する(ステップS14)。
When the shipping orders to be processed are extracted, the extracted shipping orders are totaled for each shipping warehouse and shipping destination to create a transportation order (step S12). At this time, the transportation amount included in each transportation order is limited to the maximum loading amount so as not to exceed the maximum loading amount of the vehicle, and the transportation amount exceeding the maximum loading amount is set to another transportation order. Therefore, when the total amount of transportation to be transported from a certain delivery warehouse to a certain shipping destination exceeds the maximum load amount, it is tabulated in a plurality of transportation orders. Next, the transportation orders are sorted in descending order by the transportation amount and stored in the transportation order table 2 (step S14).

【0038】図4は、輸送オーダテーブル2の構成例を
示す図である。輸送オーダテーブル2の各レコードは、
輸送オーダを識別する輸送オーダ番号フィールド、輸送
オーダが車両に引当済みか否かを区別する引当フラグの
値を示すフィールド、出庫日を示す出庫日フィールド、
製品の出荷倉庫を示す出庫倉庫コードフィールド、出荷
先(納入先)をコード化して示す出荷先コードフィール
ド、輸送量を重量単位で示す輸送量Aフィールド、輸送
量を容積単位で示す輸送量Bフィールド、冷凍車、恒温
車、荷卸用クレーンを装備したユニック車、等の車両限
定輸送オーダの場合の限定条件を示す第1の車両限定フ
ィールド、冷凍車、恒温車等による輸送温度等の輸送条
件を示す輸送条件フィールド、出荷先まで運行可能な車
両の最大積載量制限等を示す第2の車両限定フィールド
を備えている。
FIG. 4 is a diagram showing a configuration example of the transportation order table 2. Each record in the freight order table 2
A freight order number field that identifies freight orders, a field that indicates the value of an allocation flag that distinguishes whether or not a freight order has already been allocated to a vehicle, a delivery date field that indicates a delivery date,
Departure warehouse code field indicating the shipping warehouse of the product, shipping destination code field indicating the shipping destination (delivery destination) by code, transportation amount A field indicating the transportation amount in weight unit, transportation amount B field indicating the transportation amount in volume unit The first vehicle limited field showing the limited conditions in the case of a limited vehicle transportation order such as a refrigerated vehicle, a constant temperature vehicle, a UNIQ vehicle equipped with an unloading crane, and the like. It has a transport condition field shown, and a second vehicle limited field showing the maximum load limit of vehicles that can be operated to the shipping destination.

【0039】尚、本実施形態においては、合成ゴム等の
比較的比重が大きい製品の輸送を対象としており、車両
の容積的な最大積載量より重量的な最大積載量が常に制
限条件となっているので、輸送量を重量単位で示す輸送
量Aフィールドを使用し、輸送量Bフィールドは、空き
フィールドとなっている。一方、車両テーブル3の作成
処理は、まず、車両データを登録することにより車両マ
スタファイル13を作成する(ステップS16)。
In this embodiment, a product having a relatively large specific gravity such as synthetic rubber is intended to be transported, and the maximum load capacity in terms of weight is always the limiting condition rather than the maximum load capacity in volume of the vehicle. Therefore, the transport amount A field indicating the transport amount in weight units is used, and the transport amount B field is an empty field. On the other hand, in the process of creating the vehicle table 3, first, the vehicle data is registered to create the vehicle master file 13 (step S16).

【0040】図5は、車両マスタファイル13の構成例
を示す図である。車両マスタファイル13の各レコード
は、データ番号を示すデータシーケンスフィールドと、
車両を識別する車両IDフィールドと、車種を示す車種
フィールドと、自社の車両か傭車かを区別する自車/傭
車フィールドと、最大積載量を重量単位で示す最大積載
量Aフィールド、最大積載量を容積単位で示す最大積載
量Bフィールド、冷凍車や恒温車の設定可能温度フィー
ルドを備えている。尚、図示しないが、車両IDで識別
される車両毎に、輸送に利用可能な日付を格納した車両
カレンダが準備され、ある輸送日に当該車両が利用可能
か否かを参照できるようになっている。車両マスタファ
イル13が作成されると、次いで、車両マスタファイル
13から利用可能な車両のデータを抽出して、車両リス
トを作成する(ステップS18)。そして、車両リスト
の各車両を最大積載量Aの降順に配列した車両テーブル
3を作成する(ステップS20)。
FIG. 5 is a diagram showing an example of the structure of the vehicle master file 13. Each record of the vehicle master file 13 includes a data sequence field indicating a data number,
Vehicle ID field that identifies the vehicle, vehicle type field that indicates the vehicle type, own vehicle / merchandising field that distinguishes between own vehicle and mercenary vehicle, maximum loading amount A field that indicates the maximum loading amount in weight units, maximum loading It has a maximum load capacity B field that indicates the amount in volume units, and a settable temperature field for a refrigeration vehicle or a constant temperature vehicle. Although not shown, a vehicle calendar storing a date that can be used for transportation is prepared for each vehicle identified by the vehicle ID, and it becomes possible to refer to whether or not the vehicle can be used on a certain transportation day. There is. When the vehicle master file 13 is created, the available vehicle data is then extracted from the vehicle master file 13 to create a vehicle list (step S18). Then, the vehicle table 3 in which the vehicles in the vehicle list are arranged in descending order of the maximum load A is created (step S20).

【0041】図6は、車両テーブル3の構成例を示す図
である。車両テーブル3の各レコードは、データ番号を
示すデータシーケンスフィールドと、車両を識別する車
両IDフィールドと、車種を示す車種フィールドと、最
大積載量を重量単位で示す最大積載量Aフィールド、最
大積載量を容積単位で示す最大積載量Bフィールド、冷
凍車や恒温車の設定可能温度フィールド、当該車両の輸
送オーダ引当が未処理(未割付)か処理済み(割付済
み)かを示す引当フラグフィールドとを備えている。
FIG. 6 is a diagram showing a configuration example of the vehicle table 3. Each record of the vehicle table 3 includes a data sequence field indicating a data number, a vehicle ID field for identifying a vehicle, a vehicle type field indicating a vehicle type, a maximum load amount A field indicating a maximum load amount in weight units, and a maximum load amount. In the unit of volume, a maximum load capacity B field, a settable temperature field for refrigerated vehicles and constant temperature vehicles, and an allocation flag field indicating whether the transportation order allocation for the vehicle is unprocessed (unallocated) or processed (allocated). I have it.

【0042】こうして、輸送オーダテーブル2と車両テ
ーブル3とが準備されると、一般の輸送オーダ引当に先
立って、車両限定オーダの引き当てを行う(ステップS
100)。車両限定オーダの引当は、輸送オーダテーブ
ル2の車両限定フィールドや輸送条件フィールドに限定
条件が付与された車両限定オーダを抽出する一方、抽出
された限定条件に対応する車両を車種、最大積載量、設
定温度等をキイにして車両テーブル3から抽出する。そ
して、抽出した車両限定オーダと抽出した車両との間
で、引当処理を行う。この引当処理そのものは、以下で
説明する引当処理と同様の処理であるので、ここでは説
明を省略する。
In this way, when the transportation order table 2 and the vehicle table 3 are prepared, the vehicle limited order is allocated prior to general transportation order allocation (step S).
100). The allocation of the vehicle limited order is performed by extracting the vehicle limited order in which the limited conditions are added to the vehicle limited field and the transportation condition field of the transportation order table 2 while the vehicle corresponding to the extracted limited condition is the vehicle type, the maximum load amount, The set temperature or the like is set and extracted from the vehicle table 3. Then, allocation processing is performed between the extracted vehicle-only order and the extracted vehicle. The allocation process itself is the same as the allocation process described below, and thus the description thereof is omitted here.

【0043】車両限定オーダの引当処理が済むと、次に
ステップS22ないしステップS42の一般輸送オーダ
の引き当て処理を行う。ステップS22では、車両テー
ブル3の先頭から引当フラグの値が0(未引き当て)で
ある未確定車両の車両データを1台分読み込む。この読
込で未確定車両があったかどうかを判定し(ステップS
24)、未確定車両が無ければ、言い換えれば車両テー
ブル3の全ての車両の引当フラグが1に設定済みであれ
ば、未確定車両は無いので、引き当て未完のメッセージ
を出力して(ステップS26)、処理を終了する。
After the vehicle-limited order allocation processing is completed, the general transportation order allocation processing of steps S22 to S42 is performed. In step S22, the vehicle data of one undetermined vehicle whose allocation flag value is 0 (unassigned) is read from the beginning of the vehicle table 3. This reading determines whether there is an undetermined vehicle (step S
24) If there is no unconfirmed vehicle, in other words, if the allocation flags of all the vehicles in the vehicle table 3 have already been set to 1, there is no unconfirmed vehicle, so a message indicating that allocation has not been completed is output (step S26). , The process ends.

【0044】ステップS24の判定で未確定車両があれ
ば、その車両データの最大積載量を引当可能量の初期値
に設定する(ステップS28)。次いで、輸送オーダテ
ーブル2から引当可能量以下の最大輸送量を有する未引
当輸送オーダを検索する(ステップS30)。ここで、
輸送オーダテーブル2は、輸送量の降順にソートされて
いるので、テーブルの先頭から末尾へ向かって検索し、
最初に検出された引当可能量以下の輸送量を有する輸送
オーダは、引当可能量以下で最大の輸送量であることが
保証されることになる。これにより、本発明における輸
送テーブル検索の効率化及び最も効率的な積み合わせが
実現される。次いで、この検索が成功したかどうか、言
い換えれば、引当可能量以下の最大輸送量を有する未引
当輸送オーダがあったかどうかを判定し(ステップS3
2)、検索に成功しなければ、当該車両に更に積み合わ
せはできないので、当該車両の引当完了処理を行うべく
ステップS40へ移る。
If there is an undetermined vehicle in the determination of step S24, the maximum loading amount of the vehicle data is set to the initial value of the available allocation amount (step S28). Then, an unallocated transportation order having a maximum transportation amount equal to or less than the allocable amount is searched from the transportation order table 2 (step S30). here,
The freight order table 2 is sorted in descending order of freight volume, so search from the top of the table to the end,
A freight order having a freight amount that is equal to or less than the initially-provisionable allocation amount will be guaranteed to be a maximum freight amount that is equal to or less than the feasible allocation amount. As a result, the efficiency of the transportation table search and the most efficient stacking in the present invention are realized. Next, it is determined whether or not this search is successful, in other words, whether or not there is an unallocated transportation order having the maximum transportation amount equal to or less than the allocable amount (step S3).
2) If the search is not successful, the vehicle cannot be piled up further, so the process proceeds to step S40 to perform the allocation completion process for the vehicle.

【0045】ステップS32の判定で、検索に成功すれ
ば、検索した輸送オーダを当該車両に引き当てるため、
該輸送オーダの引き当てフラグを0から1へ変更すると
共に、引き当て結果を引当結果ファイルへ出力する(ス
テップS34)。次いで、引当可能量から該輸送オーダ
の輸送量を減じて引当可能量を更新し(ステップS3
6)、更新後の引当可能量が0か否かを判定し(ステッ
プS38)、0でなければ、更に積み合わせを行うため
に、ステップS30へ戻る。更新後の引当可能量が0で
あれば、この車両は最大積載量まで引当が完了したの
で、当該車両の引当完了処理として、車両テーブルの引
当フラグを1に設定する(ステップS40)。次いで、
未引当輸送オーダが残っているか否かを判定し(ステッ
プS42)、残っていれば、新たな車両に引当を行うべ
く、ステップS22の車両テーブル3から未確定車両の
読み込みへ戻る。ステップS42の判定で未引当輸送オ
ーダが残っていなければ、全ての輸送オーダの引き当て
が正常終了したことになる。
If the retrieval is successful in the determination in step S32, the retrieved transportation order is assigned to the vehicle,
The allocation flag of the transportation order is changed from 0 to 1, and the allocation result is output to the allocation result file (step S34). Then, the transportable amount of the transportation order is subtracted from the transportable amount to update the transportable amount (step S3).
6) Then, it is determined whether or not the available allocation amount after updating is 0 (step S38), and if it is not 0, the process returns to step S30 for further stacking. If the available allocation amount after updating is 0, the allocation has been completed up to the maximum load amount for this vehicle, so the allocation flag of the vehicle table is set to 1 as allocation completion processing for the vehicle (step S40). Then
It is determined whether or not the unallocated transportation order remains (step S42). If the unallocated transportation order remains, the process returns to the reading of the undetermined vehicle from the vehicle table 3 in step S22 so as to allocate the new vehicle. If it is determined in step S42 that there are no unallocated transportation orders, it means that the allocation of all transportation orders has been completed normally.

【0046】図7は、引当結果ファイル7の構成例を示
す図である。引当結果ファイル7の各レコードは、デー
タ番号を示すデータシーケンスフィールドと、車両を識
別する車両IDフィールドと、車種を示す車種フィール
ドと、最大積載量を重量単位で示す最大積載量フィール
ド、引き当てられた輸送オーダを一以上格納する輸送オ
ーダフィールド、製品の出荷倉庫を1つ以上示す出庫倉
庫コードフィールド、出荷先をコード化して1つ以上示
す出荷先コードフィールド、引き当てられた輸送オーダ
の合計輸送量を重量単位で示す輸送量フィールド、冷凍
車、恒温車等による輸送温度等の輸送条件を示す輸送条
件フィールドを備えている。
FIG. 7 is a diagram showing a configuration example of the allocation result file 7. Each record of the allocation result file 7 is assigned a data sequence field indicating a data number, a vehicle ID field for identifying a vehicle, a vehicle type field indicating a vehicle type, and a maximum load amount field indicating a maximum load amount in weight units. A freight order field that stores one or more freight orders, an issue warehouse code field that indicates one or more product shipment warehouses, a ship-to code field that indicates one or more by encoding the shipping destination, and the total freight volume of the assigned freight order. It is provided with a transportation amount field in weight units, and a transportation condition field indicating transportation conditions such as a transportation temperature of a refrigerating vehicle or a constant temperature vehicle.

【0047】以下、本実施形態における具体的な引当例
を説明する。出庫倉庫別及び出荷先別に出荷オーダを集
計した結果、従来例と同様の表2に示した輸送オーダリ
ストが得られたとする。尚、表2の引当フラグは、引当
済みの輸送オーダと、未引き当ての輸送オーダとを区別
するための2値フラグである。以下説明の簡単化のため
に、すべての車両の最大積載量を10〔t〕とする。
Hereinafter, a specific allocation example in this embodiment will be described. As a result of totaling the shipping orders for each shipping warehouse and each shipping destination, it is assumed that the same shipping order list as shown in Table 2 is obtained as in the conventional example. The allocation flag in Table 2 is a binary flag for distinguishing the allocated transportation order and the unallocated transportation order. In order to simplify the description below, the maximum load capacity of all vehicles is set to 10 [t].

【0048】表2の輸送オーダリストを各輸送オーダの
輸送量で降順にソートして得られた輸送オーダテーブル
を表4に示す。ここでは、引当処理に直接関係の無いフ
ィールドは一部省略されている。また、引当処理前なの
で、引当フラグの値は全て0である。
Table 4 shows a transportation order table obtained by sorting the transportation order list in Table 2 in descending order by the transportation amount of each transportation order. Here, some fields that are not directly related to the allocation process are omitted. Further, since the allocation processing has not yet been performed, the values of the allocation flags are all 0.

【0049】[0049]

【表4】 以下、表4の輸送オーダテーブルに基づいて車両に輸送
オーダを引き当てる処理を説明する。 第1車両 最大積載量が10〔t〕であるので、引当可能量の初期
値は、10〔t〕となる。まず、未引き当て輸送オーダ
として、SEQ1の輸送オーダNo.1の輸送量10
〔t〕を読み込む。この輸送量は引当可能量以下なの
で、輸送オーダNo.1の引き当て処理が行われ、引当
可能量は10−10=0〔t〕に更新される。更新後の
引当可能量が0となったので、これで第1車両の引当処
理は終了する。
[Table 4] Hereinafter, a process of assigning a transportation order to a vehicle based on the transportation order table of Table 4 will be described. Since the first vehicle maximum load amount is 10 [t], the initial value of the available allocation amount is 10 [t]. First, as an unassigned transportation order, the transportation order number of SEQ1. Transport volume 1
Read [t]. Since this transportation amount is less than the amount that can be allocated, the transportation order number. The allocation process of 1 is performed, and the available allocation amount is updated to 10-10 = 0 [t]. Since the available allocation amount after updating has become 0, the allocation process for the first vehicle is completed.

【0050】第2車両 第1車両と同様に最大積載量が10〔t〕であるので、
引当可能量の初期値は、10〔t〕となる。まず、未引
き当て輸送オーダとして、SEQ2の輸送オーダNo.
3の輸送量10〔t〕を読み込む。この輸送量は引当可
能量以下なので、輸送オーダNo.3の引き当て処理が
行われ、引当可能量は10−10=0〔t〕に更新され
る。更新後の引当可能量が0となったので、これで第2
車両の引当処理は終了する。
Second vehicle Since the maximum loading capacity is 10 [t] as in the first vehicle,
The initial value of the available allocation amount is 10 [t]. First, as an unassigned transportation order, the transportation order number of SEQ2.
The transport amount 10 [t] of 3 is read. Since this transportation amount is less than the amount that can be allocated, the transportation order number. The allocation process of No. 3 is performed, and the available allocation amount is updated to 10-10 = 0 [t]. Since the available allocation amount after updating has become 0, this is the second
The vehicle allocation process ends.

【0051】第3車両 同様に最大積載量が10〔t〕であるので、引当可能量
の初期値は、10〔t〕となる。まず、未引き当て輸送
オーダとして、SEQ3の輸送オーダNo.6の輸送量
8〔t〕を読み込む。この輸送量は引当可能量以下なの
で、輸送オーダNo.6の引き当て処理が行われ、引当
可能量は10−8=2〔t〕に更新される。次いで、未
引き当て輸送オーダをリストの上から順次読み込み、引
当可能量2〔t〕以下の輸送量か否かを判定する。SE
Q4〜14の各輸送オーダは、輸送量が引当可能量を超
えるので、引当不可である。SEQ15の輸送オーダN
o.2の輸送量2〔t〕は、引当可能量2〔t〕以下で
あるので、輸送オーダNo.2の引当処理を行う。これ
により引当可能量は、0〔t〕に更新され、引当を終了
する。この結果、第3車両には、輸送オーダNo.6,
2が引き当てられ、引当総輸送量は10〔t〕となっ
た。
Since the maximum loading amount is 10 [t] as in the case of the third vehicle, the initial value of the available allocation amount is 10 [t]. First, as an unassigned transportation order, the transportation order number of SEQ3. The transport amount 8 [t] of 6 is read. Since this transportation amount is less than the amount that can be allocated, the transportation order number. The allocation process of No. 6 is performed, and the allocatable amount is updated to 10-8 = 2 [t]. Then, the unassigned transportation orders are sequentially read from the top of the list, and it is determined whether the transportation amount is equal to or less than the available allocation amount 2 [t]. SE
Since the transportation amount of each of the transportation orders of Q4 to 14 exceeds the allocable amount, the allocating is impossible. Transportation order N of SEQ15
o. Since the transportation amount 2 [t] of No. 2 is less than or equal to the available allocation amount 2 [t], the transportation order number. The allocation process of 2 is performed. As a result, the available allocation amount is updated to 0 [t], and the allocation is completed. As a result, for the third vehicle, the transportation order number. 6,
2 was allocated, and the total transport volume for allocation became 10 [t].

【0052】第4車両 同様に最大積載量が10〔t〕であるので、引当可能量
の初期値は、10〔t〕となる。まず、未引き当て輸送
オーダとして、SEQ4の輸送オーダNo.8の輸送量
8〔t〕を読み込む。この輸送量は引当可能量以下なの
で、輸送オーダNo.8の引き当て処理が行われ、引当
可能量は10−8=2〔t〕に更新される。次いで、未
引き当て輸送オーダをリストの上から順次読み込み、引
当可能量2〔t〕以下の輸送量か否かを判定する。SE
Q5〜14の各輸送オーダは、輸送量が引当可能量を超
えるので、引当不可である。SEQ15の輸送オーダN
o.2は、第3車両で引当済みである。SEQ16の輸
送オーダNo.12の輸送量2〔t〕は、引当可能量2
〔t〕以下であるので、輸送オーダNo.12の引当処
理を行う。これにより引当可能量は、0〔t〕に更新さ
れ、引当を終了する。この結果、第4車両には、輸送オ
ーダNo.8,12が引き当てられ、引当総輸送量は1
0〔t〕となった。
Since the maximum loading amount is 10 [t] as in the case of the fourth vehicle, the initial value of the available allocation amount is 10 [t]. First, as an unassigned transportation order, the transportation order number of SEQ4. The transport amount 8 [t] of 8 is read. Since this transportation amount is less than the amount that can be allocated, the transportation order number. The allocation processing of No. 8 is performed, and the allocatable amount is updated to 10-8 = 2 [t]. Then, the unassigned transportation orders are sequentially read from the top of the list, and it is determined whether the transportation amount is equal to or less than the available allocation amount 2 [t]. SE
The transportation orders of Q5 to Q14 cannot be allocated because the transportation amount exceeds the allocation possible amount. Transportation order N of SEQ15
o. No. 2 is already allocated in the third vehicle. Transportation order No. of SEQ16. The transport amount 2 [t] of 12 is the available allocation amount 2
Since it is less than [t], the transportation order number. 12 allocation processes are performed. As a result, the available allocation amount is updated to 0 [t], and the allocation is completed. As a result, for the fourth vehicle, the transportation order number. 8 and 12 are allocated, and the total transportation amount is 1
It became 0 [t].

【0053】第5車両 同様に最大積載量が10〔t〕であるので、引当可能量
の初期値は、10〔t〕となる。まず、未引き当て輸送
オーダとして、SEQ5の輸送オーダNo.15の輸送
量7〔t〕を読み込む。この輸送量は引当可能量以下な
ので、輸送オーダNo.15の引き当て処理が行われ、
引当可能量は10−7=3〔t〕に更新される。次い
で、未引き当て輸送オーダをリストの上から順次読み込
み、引当可能量3〔t〕以下の輸送量か否かを判定す
る。SEQ6〜12の各輸送オーダは、輸送量が引当可
能量を超えるので、引当不可である。SEQ13の輸送
オーダNo.13の輸送量3〔t〕は、引当可能量3
〔t〕以下であるので、輸送オーダNo.13の引当処
理を行う。これにより引当可能量は、0〔t〕に更新さ
れ、引当を終了する。この結果、第5車両には、輸送オ
ーダNo.15,13が引き当てられ、引当総輸送量は
10〔t〕となった。
Since the maximum loading amount is 10 [t] as in the fifth vehicle, the initial value of the available allocation amount is 10 [t]. First, as an unassigned transportation order, a transportation order number of SEQ5. The transportation amount 7 [t] of 15 is read. Since this transportation amount is less than the amount that can be allocated, the transportation order number. 15 allocation processing is performed,
The allocatable amount is updated to 10-7 = 3 [t]. Next, the unassigned transportation order is sequentially read from the top of the list, and it is determined whether or not the transportation amount is 3 [t] or less of the available allocation amount. The transportation orders of SEQ6 to 12 cannot be allocated because the transportation amount exceeds the allocation possible amount. Transportation order No. of SEQ13. The transport amount 3 [t] of 13 is the available allocation amount 3
Since it is less than [t], the transportation order number. 13 allocation processing is performed. As a result, the available allocation amount is updated to 0 [t], and the allocation is completed. As a result, for the fifth vehicle, the transportation order number. 15 and 13 were allotted, and the total transportation amount of allocation became 10 [t].

【0054】以下、同様に引当処理を行って、全ての引
当が完了した状態を表5に示す。
Table 5 shows a state in which the allocation process is performed in the same manner and all allocations are completed.

【0055】[0055]

【表5】 表5の引当車両欄のi−jは、iが車両を区別する番号
であり、jはその車両に引き当てられた輸送オーダの順
番を示している。この引当の結果、必要な輸送車両は合
計9台となり、従来例の11台から2台減少している。
第1車両から第9車両までの各引当量は、すべて10
〔t〕となった。
[Table 5] In the reserved vehicle column of Table 5, i-j is a number for distinguishing the vehicle by i, and j indicates the order of transportation orders assigned to the vehicle. As a result of this allocation, the total number of transportation vehicles required is nine, which is a decrease of two from the conventional 11 vehicles.
All allocations from the first vehicle to the ninth vehicle are 10
It became [t].

【0056】以上好ましい実施の形態について説明した
が、これは本発明を限定するものではない。例えば、実
施形態では、比較的比重が大きい製品の輸送を対象とし
ており、車両の容積的な最大積載量より重量的な最大積
載量が常に制限条件となっているので、輸送量を重量単
位で示す輸送量Aフィールドを使用し、輸送量Bフィー
ルドは、空きフィールドとしたが、比較的比重が小さい
製品を輸送対象にする場合には、輸送量を重量単位で示
す輸送量Aフィールドではなく、輸送量を容積単位で示
す輸送量Bフィールドを使用すればよい。また、重量か
容積かいずれが先に最大積載量に達するか事前に不明な
製品の場合には、輸送量Aフィールドと輸送量Bフィー
ルドとを併用し、いずれか一方が最大積載量に達したと
きに、引当可能量を0として積み合わせを打ち切ればよ
い。
Although the preferred embodiment has been described above, this does not limit the present invention. For example, in the embodiment, the transportation of a product having a relatively large specific gravity is targeted, and the maximum loading capacity in terms of weight rather than the maximum loading capacity in volume of the vehicle is always the limiting condition. Although the transport amount A field shown is used and the transport amount B field is an empty field, when a product having a relatively small specific gravity is to be transported, instead of the transport amount A field indicating the transport amount by weight, A transport amount B field indicating the transport amount in volume units may be used. In the case of a product in which it is unknown in advance whether the weight or the volume will reach the maximum load amount in advance, the transport amount A field and the transport amount B field are used together, and either one reaches the maximum load amount. At this time, the available allocation amount may be set to 0 and the stacking may be terminated.

【0057】[0057]

【発明の効果】請求項1記載の発明によれば、出庫倉庫
及び出荷先毎に出荷オーダを集計した輸送オーダに基づ
いて第1の地域内の複数の倉庫から第2の地域内の複数
の出荷先へ出荷する際に、複数の車両に前記輸送オーダ
を引き当てる配車計画作成システムであって、前記複数
の車両のそれぞれに対応する車両データからなる車両テ
ーブルを記憶する車両テーブル記憶手段と、複数の輸送
オーダを輸送量の降順にソートした輸送オーダテーブル
を記憶する輸送オーダテーブル記憶手段と、輸送オーダ
が未割付の車両データを前記車両テーブル記憶手段から
1台分づつ読み込む車両読込手段と、前記読み込んだ車
両データに最大積載量を超えない範囲で輸送量が多い順
に前記輸送オーダテーブルから輸送オーダを引き当てて
配車計画を作成する輸送オーダ引当手段と、を備えたこ
とにより、輸送オーダの引き当て時に同じ輸送オーダを
繰り返し読み込むことが無くなるので、輸送オーダ検索
処理の効率が向上し短時間で輸送効率の高い配車計画を
作成することが出来るという効果がある。
According to the first aspect of the present invention, a plurality of warehouses in the first area to a plurality of warehouses in the second area are selected based on the shipping order in which the shipping orders are aggregated for each of the shipping warehouse and the shipping destination. A vehicle allocation plan creating system for allocating the transportation order to a plurality of vehicles when shipping to a shipping destination, and vehicle table storage means for storing a vehicle table including vehicle data corresponding to each of the plurality of vehicles, Transportation order table storage means for storing a transportation order table in which the transportation orders are sorted in descending order of transportation amount; vehicle reading means for reading the vehicle data to which the transportation order is not yet assigned from the vehicle table storage means one by one; Create a vehicle allocation plan by assigning freight orders from the freight order table in the order of increasing freight volume within the loaded vehicle data within the maximum load capacity. By providing the freight order allocation means, the same freight order does not need to be read repeatedly when freight orders are allocated, so the freight order search processing efficiency is improved and a dispatch plan with high freight efficiency can be created in a short time. There is an effect that you can.

【0058】また、輸送オーダ引き当て時に輸送量の多
い順に最大積載量まで効率よく積み合わせできるので、
輸送に使用する車両の台数を抑制し、輸送コストを削減
することができるという効果がある。また、出庫倉庫が
異なっても同一地区内の出庫倉庫であれば、積み合わせ
可能であるため、複数の倉庫に分散している在庫であっ
ても、輸送コストを抑制して、古い製番の在庫から順に
引き当てできるようになり、納入製番の逆転防止、不活
性在庫防止などの先入れ先出し在庫管理に寄与すること
ができるという効果がある。さらに、出荷先が異なって
も同一地域内であれば、積み合わせて輸送することがで
きるため、積み合わせ効率を上げて、輸送コストを引き
下げることができるという効果がある。
Further, when allocating a transportation order, it is possible to efficiently stack up to the maximum loading amount in descending order of transportation amount.
This has the effect of reducing the number of vehicles used for transportation and reducing transportation costs. In addition, even if the shipping warehouse is different, as long as it is a shipping warehouse in the same area, it can be stacked, so even if the inventory is distributed in multiple warehouses, the transportation cost can be suppressed and the old serial number can be used. Since the stocks can be allocated in order, it is possible to contribute to the first-in first-out stock management, such as the prevention of the reverse of the delivery manufacturing number and the prevention of the inactive stock. Further, even if the shipping destinations are different, they can be stacked and transported within the same area, so that the stacking efficiency can be increased and the transportation cost can be reduced.

【0059】請求項2記載の発明によれば、請求項1記
載の発明の効果に加えて、前記複数の車両が最大積載量
の異なる車両を含む場合、前記車両テーブル記憶手段
は、複数の車両データを最大積載量の降順にソートした
車両テーブルを記憶し、前記車両読込手段は、未割付の
車両データを前記車両テーブルから最大積載量が大きい
順に1台分づつ読み込むようにしたので、最大積載量の
大きい車両から輸送オーダを引き当てることができ、車
両の最大積載量が同一でない複数の車両を組み合わせる
際にも、使用車両の台数を最小とする効率的な積み合わ
せを実現することができるという効果がある。
According to the second aspect of the invention, in addition to the effect of the first aspect of the invention, when the plurality of vehicles include vehicles having different maximum load capacities, the vehicle table storage means stores the plurality of vehicles. Since the vehicle table in which the data is sorted in descending order of the maximum load capacity is stored, and the vehicle reading means reads the unallocated vehicle data from the vehicle table one by one in descending order of the maximum load capacity, It is possible to allocate transportation orders from vehicles with a large amount, and it is possible to realize efficient stacking that minimizes the number of vehicles used even when combining multiple vehicles that do not have the same maximum load capacity. effective.

【0060】請求項3記載の発明によれば、請求項1ま
たは請求項2記載の発明の効果に加えて、前記輸送オー
ダ引当手段は、前記車両読込手段で読み込まれた車両デ
ータの最大積載量を前記車両の引当可能量の初期値とす
る引当可能量初期化手段と、前記車両の引当可能量以下
の輸送量を有する未引き当て輸送オーダがあるか否かを
判定し、この判定で前記車両の引当可能量以下の輸送量
を有する未引き当て輸送オーダがなければ前記車両の引
き当てを完了する引当可否判定手段と、前記判定結果が
前記車両の引当可能量以下の輸送量を有する未引き当て
輸送オーダがあれば、前記車両の引当可能量以下で最大
の輸送量を有する輸送オーダを前記車両に引き当てる引
当手段と、前記引当手段で引き当てられた輸送オーダの
輸送量を前記車両の引当可能量から減じる引当可能量更
新手段と、を備えたことにより、短時間で効率よく積み
合わせ、かつ、輸送に必要な車両台数をより少なくする
配車計画を作成することが出来るという効果がある。
According to the third aspect of the invention, in addition to the effect of the first or second aspect of the invention, the transportation order allocation means has the maximum load amount of the vehicle data read by the vehicle reading means. It is determined whether or not there is an unallocated transportation order having a transportation amount equal to or less than the allocatable amount of the vehicle, and the allocatable amount initialization means that makes the initial value of the allocatable amount of the vehicle. If there is no unassigned transportation order having a transportation amount less than or equal to the available allocation amount, a provision availability determination means that completes the allocation of the vehicle, and an unassigned transportation order whose determination result is less than the available allocation amount of the vehicle. If there is, the allocation means for allocating the transportation order having the maximum transportation amount less than the allocable amount of the vehicle to the vehicle, and the transportation amount of the transportation order allocated by the allocation means for the vehicle Since the provisionable amount updating means for subtracting from the provisionable amount is provided, there is an effect that it is possible to efficiently stack the vehicles in a short time and create a vehicle allocation plan that reduces the number of vehicles required for transportation. .

【0061】請求項4記載の発明によれば、請求項1な
いし請求項3記載の発明の効果に加えて、前記輸送オー
ダ中に車両を限定する輸送オーダがある場合に、限定車
両を優先して引き当てる限定車両引当手段を備えたこと
により、製品の特性により特別な装備を有する限定車両
でなければ輸送できない輸送オーダや、出荷先の荷卸し
設備事情等により車種限定となる輸送オーダを含む場合
でも配車計画を作成することができるという効果があ
る。
According to the invention of claim 4, in addition to the effects of the invention of claims 1 to 3, when there is a transportation order for limiting a vehicle in the transportation order, the limited vehicle is given priority. Including a transportation order that can be transported only by a limited vehicle with special equipment due to the characteristics of the product, or a transportation order that is limited to the vehicle type due to the unloading facility situation at the shipping destination, etc. However, there is an effect that a dispatch plan can be created.

【0062】請求項5記載の発明によれば、請求項1な
いし請求項4記載の発明の効果に加えて、前記輸送量、
前記最大積載量、及び前記引当可能量は、重量単位また
は容積単位のいずれか一方であるようにしたので、対象
製品が容積の割に重量が嵩む場合には、容積を考慮せず
に重量単位のみで配車計画を作成することができる一
方、対象製品が重量の割に容積が嵩む場合には、重量を
考慮せずに容積単位のみで配車計画を作成することがで
き、いずれの場合も処理を高速化することができるとい
う効果がある。
According to the invention of claim 5, in addition to the effects of the invention of claims 1 to 4, the transport amount,
Since the maximum load capacity and the allocatable quantity are set to either a weight unit or a volume unit, when the target product is heavy relative to the volume, the weight unit is not taken into consideration. While the vehicle allocation plan can be created only by itself, if the target product has a large volume relative to the weight, the vehicle allocation plan can be created only by the volume unit without considering the weight. There is an effect that the speed can be increased.

【0063】請求項6記載の発明によれば、請求項1な
いし請求項4記載の発明の効果に加えて、前記輸送量、
前記最大積載量、及び前記引当可能量は、重量及び容積
単位であり、これ以上の輸送オーダを割り当てると重量
または容積のいずれか一方または双方が最大積載量を超
える場合に、前記車両の引当を完了するようにしたの
で、重量または容積のいずれが先に最大積載量の限度に
達するかが事前に不明である製品の輸送オーダに対して
も、重量及び容積が最大積載量を超えない範囲で最も効
率よく配車計画を作成することができるという効果があ
る。
According to the invention of claim 6, in addition to the effects of the invention of claims 1 to 4, the transport amount,
The maximum load capacity and the allocatable capacity are in units of weight and volume, and if more transportation orders are allocated, the allocation of the vehicle will be allocated when either one or both of weight and volume exceeds the maximum load capacity. Since it has been completed, even if it is unknown in advance whether the weight or volume will reach the maximum load limit in advance, the weight and volume must be within the maximum load range. The effect is that the dispatch plan can be created most efficiently.

【0064】請求項7記載の発明によれば、出庫倉庫及
び出荷先毎に出荷オーダを集計した輸送オーダに基づい
て第1の地域内の複数の倉庫から第2の地域内の複数の
出荷先へ出荷する際に、複数の車両に前記輸送オーダを
引き当てる配車計画作成方法であって、前記複数の車両
に最大積載量の異なる車両を含む場合に複数の車両デー
タを最大積載量の降順にソートして車両テーブルを作成
する車両テーブル作成過程と、複数の輸送オーダを輸送
量の降順にソートして輸送オーダテーブルを作成する輸
送オーダテーブル作成過程と、未割付の車両データを前
記車両テーブルから最大積載量が大きい順に1台分づつ
読み込む車両読込過程と、前記読み込んだ車両データに
最大積載量を超えない範囲で輸送量が多い順に輸送オー
ダを引き当てて配車計画を作成する輸送オーダ引当過程
と、を備えたことにより、短時間で輸送効率の高い配車
計画を作成することが出来るという効果がある。
According to the invention of claim 7, a plurality of warehouses in the first region to a plurality of shipping destinations in the second region are based on a shipping order in which the shipping orders are aggregated for each shipping warehouse and shipping destination. A method of creating a vehicle allocation plan for allocating the transportation order to a plurality of vehicles when shipping to a plurality of vehicles, wherein the plurality of vehicle data are sorted in descending order of the maximum load when the plurality of vehicles include vehicles having different maximum loads. To create a vehicle table, to create a vehicle table, to create a transportation order table by sorting multiple transportation orders in descending order of freight volume, and to allocate unallocated vehicle data from the vehicle table to the maximum. The vehicle reading process of reading the vehicles one by one in descending order of load capacity, and assigning the transportation order to the read vehicle data in order of increasing transport quantity within the range not exceeding the maximum load capacity. A transport order provision process of creating a plan, by having a there is an effect that it is possible to create a high vehicle allocation plan of short time transport efficiency.

【0065】請求項8記載の発明によれば、請求項7記
載の発明の効果に加えて、前記輸送オーダ引当過程は、
前記車両読込過程で読み込まれた車両データの最大積載
量を前記車両の引当可能量の初期値とする引当可能量初
期化過程と、前記車両の引当可能量以下の輸送量を有す
る未引き当て輸送オーダがあるか否かを判定し、この判
定で前記車両の引当可能量以下の輸送量を有する未引き
当て輸送オーダがなければ前記車両の引き当てを完了す
る一方、未引き当て輸送オーダが残れば次の車両データ
を読み込むべく前記車両読込過程へ戻る引当可否判定過
程と、前記判定結果が前記車両の引当可能量以下の輸送
量を有する未引き当て輸送オーダがあれば、前記車両の
引当可能量以下で最大の輸送量を有する輸送オーダを前
記輸送オーダテーブルから取り出して前記車両に引き当
てる引当過程と、前記引当過程で引き当てられた輸送オ
ーダの輸送量を前記車両の引当可能量から減じて前記判
定過程へ戻る引当可能量更新過程と、を備えたことによ
り、短時間で効率よく積み合わせ、かつ、輸送に必要な
車両台数をより少なくした配車計画を作成することが出
来るという効果がある。
According to the invention of claim 8, in addition to the effect of the invention of claim 7, the transportation order allocation process includes:
An allocatable amount initialization process in which the maximum load amount of the vehicle data read in the vehicle reading process is set as an initial value of the allocatable amount of the vehicle, and an unassigned transportation order having a transportation amount less than the allocatable amount of the vehicle If there is no unassigned transportation order having a transportation amount equal to or less than the allocatable amount of the vehicle in this determination, allocation of the vehicle is completed, while if there is an unallocated transportation order, the next vehicle If there is an unapproved transportation order that returns to the vehicle reading process to read data and the determination result is a transportation amount whose transportation amount is less than the vehicle's allocatable amount, the maximum allocation amount of the vehicle is less than the allocatable amount. The allocation process of retrieving a transportation order having a transportation amount from the transportation order table and assigning it to the vehicle, and the transportation amount of the transportation order assigned in the allocation process are With the provisionable amount update process that reduces the available vehicle amount and returns to the determination process, a vehicle allocation plan that efficiently stacks in a short time and reduces the number of vehicles required for transportation is created. The effect is that you can do it.

【図面の簡単な説明】[Brief description of drawings]

【図1】本発明に係る配車計画作成システムの実施形態
の構成を説明するシステム構成図である。
FIG. 1 is a system configuration diagram illustrating a configuration of an embodiment of a vehicle allocation plan creation system according to the present invention.

【図2】配車計画作成システムの動作を説明するフロー
チャートである。
FIG. 2 is a flowchart illustrating the operation of the vehicle allocation plan creation system.

【図3】出荷オーダファイルの例を説明する図である。FIG. 3 is a diagram illustrating an example of a shipping order file.

【図4】出庫倉庫及び出荷先毎に出荷オーダを集計した
輸送オーダテーブルの例を説明する図である。
FIG. 4 is a diagram illustrating an example of a transportation order table in which shipping orders are aggregated for each shipping warehouse and shipping destination.

【図5】車両マスタファイルの例を説明する図である。FIG. 5 is a diagram illustrating an example of a vehicle master file.

【図6】車両テーブルの例を説明する図である。FIG. 6 is a diagram illustrating an example of a vehicle table.

【図7】引当結果ファイルの例を説明する図である。FIG. 7 is a diagram illustrating an example of an allocation result file.

【図8】従来の配車計画作成方法を説明するフローチャ
ートである。
FIG. 8 is a flowchart illustrating a conventional vehicle allocation plan creation method.

【符号の説明】[Explanation of symbols]

1 配車計画作成システム 2 輸送オーダテーブル記憶部 3 車両テーブル記憶部 4 車両読込部 5 輸送オーダ引当部 6 車両限定オーダ引当部 7 引当結果記憶部 8 引当可能量初期化部 9 引当可否判定部 10 引当部 11 引当可能量更新部 1 Vehicle allocation planning system 2 Transportation order table storage 3 Vehicle table storage 4 Vehicle reading section 5 Transportation order allocation department 6 Vehicle-only order allocation section 7 Allocation result storage unit 8 Allowable Allocation Initialization Unit 9 Allocation availability determination unit 10 Allocation Department 11 Available Allocation Update Unit

Claims (8)

【特許請求の範囲】[Claims] 【請求項1】 出庫倉庫及び出荷先毎に出荷オーダを集
計した輸送オーダに基づいて第1の地域内の複数の倉庫
から第2の地域内の複数の出荷先へ出荷する際に、複数
の車両に前記輸送オーダを引き当てる配車計画作成シス
テムであって、 前記複数の車両のそれぞれに対応する車両データからな
る車両テーブルを記憶する車両テーブル記憶手段と、 複数の輸送オーダを輸送量の降順にソートした輸送オー
ダテーブルを記憶する輸送オーダテーブル記憶手段と、 輸送オーダが未割付の車両データを前記車両テーブル記
憶手段から1台分づつ読み込む車両読込手段と、 前記読み込んだ車両データに最大積載量を超えない範囲
で輸送量が多い順に前記輸送オーダテーブルから輸送オ
ーダを引き当てて配車計画を作成する輸送オーダ引当手
段と、 を備えたことを特徴とする配車計画作成システム。
1. When shipping from a plurality of warehouses in a first area to a plurality of shipping destinations in a second area based on a transportation order in which shipping orders are aggregated for each of a delivery warehouse and a shipping destination, A vehicle allocation plan creating system for allocating the transportation orders to vehicles, wherein a vehicle table storage means for storing a vehicle table including vehicle data corresponding to each of the plurality of vehicles, and a plurality of transportation orders sorted in descending order of transportation amount The transportation order table storing means for storing the transportation order table, the vehicle reading means for reading the vehicle data for which the transportation order is not assigned from the vehicle table storage means one by one, and the loaded vehicle data exceeding the maximum load capacity. A transportation order allocation means for allocating transportation orders from the transportation order table in order of increasing transportation volume within a range that does not exist, and creating a vehicle allocation plan; Dispatch planning system which is characterized in that there was example.
【請求項2】 前記複数の車両が最大積載量の異なる車
両を含む場合、 前記車両テーブル記憶手段は、複数の車両データを最大
積載量の降順にソートした車両テーブルを記憶し、 前記車両読込手段は、未割付の車両データを前記車両テ
ーブルから最大積載量が大きい順に1台分づつ読み込む
ことを特徴とする請求項1記載の配車計画作成システ
ム。
2. When the plurality of vehicles include vehicles having different maximum loading capacities, the vehicle table storage means stores a vehicle table in which the plurality of vehicle data are sorted in descending order of the maximum loading capacity, and the vehicle reading means. The vehicle allocation plan creation system according to claim 1, wherein the unallocated vehicle data is read from the vehicle table for each one in descending order of maximum load capacity.
【請求項3】 前記輸送オーダ引当手段は、 前記車両読込手段で読み込まれた車両データの最大積載
量を前記車両の引当可能量の初期値とする引当可能量初
期化手段と、 前記車両の引当可能量以下の輸送量を有する未引き当て
輸送オーダがあるか否かを判定し、この判定で前記車両
の引当可能量以下の輸送量を有する未引き当て輸送オー
ダがなければ前記車両の引き当てを完了する引当可否判
定手段と、 前記判定結果が前記車両の引当可能量以下の輸送量を有
する未引き当て輸送オーダがあれば、前記車両の引当可
能量以下で最大の輸送量を有する輸送オーダを前記車両
に引き当てる引当手段と、 前記引当手段で引き当てられた輸送オーダの輸送量を前
記車両の引当可能量から減じる引当可能量更新手段と、 を備えたことを特徴とする請求項1または請求項2記載
の配車計画作成システム。
3. The freight order allocation means, a feasible allocation amount initialization means for setting the maximum load capacity of the vehicle data read by the vehicle reading means as an initial value of the feasible allocation amount of the vehicle, and the vehicle allocation. It is determined whether or not there is an unassigned transportation order having a transportation amount equal to or less than the possible amount, and if there is no unassigned transportation order having the transportation amount equal to or less than the allocation amount for the vehicle, the assignment of the vehicle is completed. If there is an unassigned transportation order whose allocation result is the allocation availability determination means and the determination result has a transportation amount that is equal to or less than the allocation amount of the vehicle, a transportation order that has the maximum transportation amount that is less than the allocation amount of the vehicle is assigned to the vehicle. Allocation means for allocating, and allocation possible amount updating means for subtracting the transportation amount of the transportation order allocated by the allocation means from the allocation possible amount of the vehicle. 1 or claim 2 dispatch planning system according.
【請求項4】 前記輸送オーダ中に車両を限定する輸送
オーダがある場合に、限定車両を優先して引き当てる限
定車両引当手段を備えたことを特徴とする請求項1ない
し請求項3のいずれか1項記載の配車計画作成システ
ム。
4. The limited vehicle allocation means for preferentially allocating a limited vehicle when there is a transportation order for limiting a vehicle in the transportation order, according to any one of claims 1 to 3. The vehicle allocation planning system described in item 1.
【請求項5】 前記輸送量、前記最大積載量、及び前記
引当可能量は、重量単位または容積単位のいずれか一方
であることを特徴とする請求項1ないし請求項4のいず
れか1項記載の配車計画作成システム。
5. The transport amount, the maximum load amount, and the allocatable amount are one of a weight unit and a volume unit, according to any one of claims 1 to 4. Vehicle dispatch planning system.
【請求項6】 前記輸送量、前記最大積載量、及び前記
引当可能量は、重量及び容積単位であり、これ以上の輸
送オーダを割り当てると重量または容積のいずれか一方
または双方が最大積載量を超える場合に、前記車両の引
当を完了することを特徴とする請求項1ないし請求項4
のいずれか1項記載の配車計画作成システム。
6. The transportation amount, the maximum loading amount, and the allocatable amount are in units of weight and volume, and when a transportation order of more than this is assigned, one or both of the weight and the volume have the maximum loading amount. When the number of vehicles exceeds the limit, the allocation of the vehicle is completed, and the allocation of the vehicle is completed.
The vehicle allocation plan creation system according to any one of 1.
【請求項7】 出庫倉庫及び出荷先毎に出荷オーダを集
計した輸送オーダに基づいて第1の地域内の複数の倉庫
から第2の地域内の複数の出荷先へ出荷する際に、複数
の車両に前記輸送オーダを引き当てる配車計画作成方法
であって、 前記複数の車両に最大積載量の異なる車両を含む場合に
複数の車両データを最大積載量の降順にソートして車両
テーブルを作成する車両テーブル作成過程と、 複数の輸送オーダを輸送量の降順にソートして輸送オー
ダテーブルを作成する輸送オーダテーブル作成過程と、 未割付の車両データを前記車両テーブルから最大積載量
が大きい順に1台分づつ読み込む車両読込過程と、 前記読み込んだ車両データに最大積載量を超えない範囲
で輸送量が多い順に輸送オーダを引き当てて配車計画を
作成する輸送オーダ引当過程と、 を備えたことを特徴とする配車計画作成方法。
7. When shipping from a plurality of warehouses in the first region to a plurality of shipping destinations in the second region, based on the shipping order in which the shipping orders are aggregated for each of the issuing warehouse and the shipping destination, A vehicle allocation plan creating method for allocating the transportation order to a vehicle, wherein a vehicle table is created by sorting a plurality of vehicle data in descending order of the maximum load when the plurality of vehicles include vehicles having different maximum load. Table creation process, freight order table creation process that creates a freight order table by sorting multiple freight orders in descending order of freight volume, and unassigned vehicle data for one vehicle in descending order of maximum load capacity from the vehicle table. The vehicle loading process is performed one by one, and a transportation order is created by assigning transportation orders to the loaded vehicle data in descending order of transportation volume within a range not exceeding the maximum loading capacity. Dispatch planning method characterized by comprising the provision process, the.
【請求項8】 前記輸送オーダ引当過程は、 前記車両読込過程で読み込まれた車両データの最大積載
量を前記車両の引当可能量の初期値とする引当可能量初
期化過程と、 前記車両の引当可能量以下の輸送量を有する未引き当て
輸送オーダがあるか否かを判定し、この判定で前記車両
の引当可能量以下の輸送量を有する未引き当て輸送オー
ダがなければ前記車両の引き当てを完了する一方、未引
き当て輸送オーダが残れば次の車両データを読み込むべ
く前記車両読込過程へ戻る引当可否判定過程と、 前記判定結果が前記車両の引当可能量以下の輸送量を有
する未引き当て輸送オーダがあれば、前記車両の引当可
能量以下で最大の輸送量を有する輸送オーダを前記輸送
オーダテーブルから取り出して前記車両に引き当てる引
当過程と、 前記引当過程で引き当てられた輸送オーダの輸送量を前
記車両の引当可能量から減じて前記判定過程へ戻る引当
可能量更新過程と、 を備えたことを特徴とする請求項7記載の配車計画作成
方法。
8. The freight order allocation step, the allocation possible amount initialization step of setting the maximum load amount of the vehicle data read in the vehicle reading step as an initial value of the allocation possible amount of the vehicle, and the allocation of the vehicle. It is determined whether or not there is an unassigned transportation order having a transportation amount equal to or less than the possible amount, and if there is no unassigned transportation order having the transportation amount equal to or less than the allocation amount for the vehicle, the assignment of the vehicle is completed. On the other hand, if an unassigned transportation order remains, there is an allocation availability determination process that returns to the vehicle loading process to read the next vehicle data, and there is an unassigned transportation order whose determination result has a transportation amount that is less than or equal to the allocation amount of the vehicle. For example, the allocation process of taking out the transportation order having the maximum transportation amount less than the allocation possible amount of the vehicle from the transportation order table and assigning it to the vehicle, Dispatch planning method according to claim 7, wherein the transport amount of the provision is transport order, characterized by comprising a reservable amount updating process returns to the determination process by subtracting from the reservable amount of the vehicle in extent.
JP2001221525A 2001-07-23 2001-07-23 Planning system for allocating vehicles and its method Pending JP2003034440A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2001221525A JP2003034440A (en) 2001-07-23 2001-07-23 Planning system for allocating vehicles and its method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2001221525A JP2003034440A (en) 2001-07-23 2001-07-23 Planning system for allocating vehicles and its method

Publications (1)

Publication Number Publication Date
JP2003034440A true JP2003034440A (en) 2003-02-07

Family

ID=19055178

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2001221525A Pending JP2003034440A (en) 2001-07-23 2001-07-23 Planning system for allocating vehicles and its method

Country Status (1)

Country Link
JP (1) JP2003034440A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008276292A (en) * 2007-04-25 2008-11-13 Senkoo Kk Car dispatch support system
JP2011209960A (en) * 2010-03-29 2011-10-20 Park 24 Co Ltd Car sharing reservation system, car sharing reservation method and car sharing reservation program
CN104616238A (en) * 2015-02-10 2015-05-13 北京嘀嘀无限科技发展有限公司 Method and device for order allocation
CN110070237A (en) * 2019-05-07 2019-07-30 卓集送信息科技(武汉)有限公司 Cargo distribution calculation method based on goods delivery point, measurement of cargo and vehicle
CN111160726A (en) * 2019-12-13 2020-05-15 拉货宝网络科技有限责任公司 Intelligent allocation method for transportation orders

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008276292A (en) * 2007-04-25 2008-11-13 Senkoo Kk Car dispatch support system
JP2011209960A (en) * 2010-03-29 2011-10-20 Park 24 Co Ltd Car sharing reservation system, car sharing reservation method and car sharing reservation program
CN104616238A (en) * 2015-02-10 2015-05-13 北京嘀嘀无限科技发展有限公司 Method and device for order allocation
CN110070237A (en) * 2019-05-07 2019-07-30 卓集送信息科技(武汉)有限公司 Cargo distribution calculation method based on goods delivery point, measurement of cargo and vehicle
CN111160726A (en) * 2019-12-13 2020-05-15 拉货宝网络科技有限责任公司 Intelligent allocation method for transportation orders

Similar Documents

Publication Publication Date Title
US7974891B2 (en) Method and apparatus for processing receptacles of items in a materials handling facility
US9342811B2 (en) System and method for filling an order
US7770792B2 (en) Methods and systems for managing stock transportation
US9336509B1 (en) Crossdocking transshipments without sortation
US8392292B2 (en) Method and process for managing inbound and outbound merchandise shipments
KR102284951B1 (en) Cargo relay and dispatch system
CN111222819A (en) Method for determining cargo vehicle, warehouse management device, system, equipment and medium
JP2003034440A (en) Planning system for allocating vehicles and its method
CN116542599B (en) Multidimensional order merging method
CN111126643B (en) Reservation method and reservation device of platform and readable storage medium
JP2004075319A (en) Cargo reception and shipment control system
JPH1087036A (en) Stock allocating method, and deciding method of distribution mode and stocking position, in physical distribution system
JP3733447B2 (en) Picking list creation system, picking list creation method, and picking list creation program
US20170147967A1 (en) Real-time pallet allocation
JP2005089069A (en) Article receiving and shipping control system
JP4940602B2 (en) Transportation lot creation apparatus and method
JP2000118692A (en) Sorting method
Ahangamage et al. Implementing a Cross-Docking System in a Warehouse–A Systematic Review of Literature
Boysen et al. Put it in the bag: Order fulfillment with a pocket sorter system
US20180012174A1 (en) System and Method for Managing Merchant-Performed Shipment Preparation Operations at a Vendor Facility
US11995604B2 (en) Determination of intermediate sortation or warehousing facility location
JP3462765B2 (en) Product sorting and packing equipment
US20240029011A1 (en) Determination of intermediate sortation or warehousing facility location
CN113762877B (en) Distribution method, device, equipment and medium for warehouse delivery station port
JP7259681B2 (en) Container management device and container management system

Legal Events

Date Code Title Description
RD04 Notification of resignation of power of attorney

Free format text: JAPANESE INTERMEDIATE CODE: A7424

Effective date: 20070906