TWI667623B - Computer device and method for arranging freight delivery - Google Patents

Computer device and method for arranging freight delivery Download PDF

Info

Publication number
TWI667623B
TWI667623B TW107135394A TW107135394A TWI667623B TW I667623 B TWI667623 B TW I667623B TW 107135394 A TW107135394 A TW 107135394A TW 107135394 A TW107135394 A TW 107135394A TW I667623 B TWI667623 B TW I667623B
Authority
TW
Taiwan
Prior art keywords
group
shipping
historical
groups
computer device
Prior art date
Application number
TW107135394A
Other languages
Chinese (zh)
Other versions
TW202014947A (en
Inventor
譚志銘
吳建漳
Original Assignee
上上智網系統有限公司
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 上上智網系統有限公司 filed Critical 上上智網系統有限公司
Priority to TW107135394A priority Critical patent/TWI667623B/en
Application granted granted Critical
Publication of TWI667623B publication Critical patent/TWI667623B/en
Publication of TW202014947A publication Critical patent/TW202014947A/en

Links

Abstract

一種安排貨物運送之計算機裝置與方法被揭露。該計算機裝置儲存一歷史運送記錄,所述歷史運送記錄包含多個歷史運送目的地群組,且每一個歷史運送目的地群組包含一或多個歷史運送目的地。該計算機裝置並根據一貨物運送清單而從所述多個歷史運送目的地群組中選出一個或多個目標群組並將被選出的目標群組指派給一車輛,其中每一個被選出的目標群組所包含的歷史運送目的地存在於所述貨物運送清單中。 A computer apparatus and method for arranging the transportation of goods is disclosed. The computer device stores a historical shipping record comprising a plurality of historical shipping destination groups, and each historical shipping destination group includes one or more historical shipping destinations. The computer device selects one or more target groups from the plurality of historical shipping destination groups based on a cargo shipping list and assigns the selected target group to a vehicle, wherein each selected target The historical shipping destinations included in the group are present in the goods shipping list.

Description

安排貨物運送之計算機裝置與方法 Computer device and method for arranging cargo transportation

本揭露關於一種計算機裝置。更具體而言,本揭露關於一種安排貨物運送之計算機裝置與方法。 The present disclosure relates to a computer device. More specifically, the present disclosure relates to a computer apparatus and method for arranging shipment of goods.

在運送貨物的過程中,有許多因素會影響到運送成本,而其中一個重要因素就是運送目的地。舉例而言,若同一車輛的多個運送目的地分散於彼此相距甚遠的多個區域中、這些運送目的地雖然位於同一區域但彼此之間的行車路徑是迂迴的而非直線的、或者同一車輛的運送自的地數量過多,都可能直接或間接增加運送的成本。因此,在安排貨物運送時,原則上都希望將處於同一區域或者彼此之間的行車路徑是直線的多個運送目的地指派給同一車輛,以避免增加運送成本。 In the process of transporting goods, there are many factors that affect the cost of transportation, and one of the important factors is the destination. For example, if a plurality of shipping destinations of the same vehicle are dispersed in a plurality of areas that are far apart from each other, the shipping destinations are located in the same area, but the driving path between them is roundabout rather than straight, or the same vehicle Too many shipments from the site may increase the cost of shipping directly or indirectly. Therefore, in arranging the shipment of goods, it is in principle desirable to assign a plurality of delivery destinations in the same area or between each other with a straight line to the same vehicle, in order to avoid an increase in shipping costs.

為了將處於同一區域或者彼此之間的行車路徑是直線的多個運送目的地指派給同一車輛,傳統的方法必須借助於實時的地圖資訊,惟取得實時的地圖資訊的費用往往更甚於因運送目的地的安排欠妥而產生的額外運送費用。另外,即使擁有了實時的地圖資訊,因貨物以及運送目的地之多樣性,傳統的方法還需要針對不同貨物以及不同運送目的地進行最佳化,而這樣的計算過程是相當複雜且耗時的。有鑑於此,如何提供一種計算 複雜度較低且效率較高之安排貨物運送的方式,正是相關技術領域中相當重要的一個問題。 In order to assign multiple destinations in the same area or between each other with a straight line to the same vehicle, the traditional method must rely on real-time map information, but the cost of obtaining real-time map information is often more than that of shipping. Additional shipping costs incurred due to improper destination arrangements. In addition, even with real-time map information, traditional methods need to be optimized for different goods and different destinations due to the variety of goods and destinations. Such calculations are quite complex and time consuming. . In view of this, how to provide a calculation The less complex and efficient way of arranging the shipment of goods is a very important issue in the relevant technical field.

為了解決至少上述的問題,本揭露提供了一種安排貨物運送之計算機裝置。該計算機裝置可包含一儲存器與一電性連接至所述儲存器的處理器。該儲存器可用以儲存一歷史運送記錄,所述歷史運送記錄包含多個歷史運送目的地群組,且每一個歷史運送目的地群組包含一或多個歷史運送目的地。該處理器可用以根據一貨物運送清單,從所述多個歷史運送目的地群組中選出一個或多個目標群組,並將被選出的目標群組指派給一車輛,其中每一個被選出的目標群組所包含的歷史運送目的地存在於所述貨物運送清單中。 In order to address at least the above problems, the present disclosure provides a computer device for arranging shipment of goods. The computer device can include a memory and a processor electrically coupled to the memory. The storage can be used to store a historical shipping record comprising a plurality of historical shipping destination groups, and each historical shipping destination group includes one or more historical shipping destinations. The processor can be configured to select one or more target groups from the plurality of historical shipping destination groups based on a shipment delivery list, and assign the selected target group to a vehicle, each of which is selected The historical shipping destination included in the target group exists in the cargo shipping list.

為了解決至少上述的問題,本揭露還提供了一種安排貨物運送之方法。所述方法可包含以下步驟:由一計算機裝置儲存一歷史運送記錄,所述歷史運送記錄包含多個歷史運送目的地群組,且每一個歷史運送目的地群組包含一或多個歷史運送目的地;以及由所述計算機裝置根據一貨物運送清單而從所述多個歷史運送目的地群組中選出一個或多個目標群組並將被選出的目標群組指派給一車輛,其中每一個被選出的目標群組所包含的歷史運送目的地存在於所述貨物運送清單中。 In order to solve at least the above problems, the present disclosure also provides a method of arranging the transportation of goods. The method can include the steps of: storing, by a computer device, a historical shipping record, the historical shipping record comprising a plurality of historical shipping destination groups, and each historical shipping destination group comprising one or more historical shipping destinations And selecting, by the computer device, one or more target groups from the plurality of historical shipping destination groups according to a cargo shipping list and assigning the selected target group to a vehicle, wherein each The historical shipping destination included in the selected target group exists in the goods shipping list.

根據上述的計算機裝置與方法,可將歷史上曾經安排給同一車輛運送的多個運送目的地所組成的每一個歷史運送目的地群組記錄下 來,並借助於這樣的歷史運送記錄,來為每一台車輛指派適合之運送目的地,藉此避免將處於不同區域的多個運送目的地或者彼此之間的行車路徑是迂迴的多個運送目的地指派給同一車輛,進而減少運送成本。另外,上述的計算機裝置與方法不需要使用實時的地圖資訊,也不需要對於針對不同貨物以及不同運送目的地進行複雜的最佳化,故可以減少計算複雜度且增加安排效率。 According to the computer apparatus and method described above, each historical shipping destination group composed of a plurality of shipping destinations that have historically been scheduled to be transported to the same vehicle can be recorded. And with such a historical shipping record, each vehicle is assigned a suitable shipping destination, thereby avoiding multiple shipping destinations in different areas or multiple shipping paths between each other Destinations are assigned to the same vehicle, which in turn reduces shipping costs. In addition, the above computer apparatus and method do not need to use real-time map information, and do not need to perform complicated optimization for different goods and different shipping destinations, thereby reducing computational complexity and increasing scheduling efficiency.

以上內容並非為了限制本發明,而只是概括地敘述了本發明可解決的技術問題、可採用的技術手段以及可達到的技術功效,以讓本發明所屬技術領域中具有通常知識者初步地瞭解本發明。根據檢附的圖式及以下的實施方式所記載的內容,本發明所屬技術領域中具有通常知識者便可進一步瞭解本發明的各種實施例。 The above content is not intended to limit the present invention, but merely describes the technical problems that can be solved by the present invention, the technical means that can be adopted, and the achievable technical effects, so that those having ordinary knowledge in the technical field of the present invention can initially understand the present invention. invention. The various embodiments of the present invention can be further understood by those of ordinary skill in the art of the invention.

如下所示: As follows:

1‧‧‧安排貨物運送之計算機裝置 1‧‧‧Computer equipment for transporting goods

11‧‧‧處理器 11‧‧‧ Processor

13‧‧‧儲存器 13‧‧‧Storage

15‧‧‧輸入裝置 15‧‧‧Input device

10‧‧‧歷史運送記錄 10‧‧‧Historical record

12‧‧‧貨物運送清單 12‧‧‧Cargo Shipping List

2‧‧‧運作流程 2‧‧‧Operational process

201~205‧‧‧動作 201~205‧‧‧Action

3‧‧‧運作流程 3‧‧‧Operational process

301~307‧‧‧動作 301~307‧‧‧ action

40‧‧‧歷史運送目的地群組 40‧‧‧Historical destination group

42‧‧‧群組候選者 42‧‧‧Group candidates

14‧‧‧安排結果 14‧‧‧ Arrange the results

D1~D9‧‧‧運送目的地 D1~D9‧‧‧Delivery destination

V1~V3‧‧‧車輛 V1~V3‧‧‧Vehicles

5‧‧‧安排貨物運送之方法 5‧‧‧How to arrange the delivery of goods

501、503‧‧‧步驟 501, 503‧‧ steps

第1圖例示了在本發明某些實施例中一種安排貨物運送之計算機裝置的一示意圖。 Figure 1 illustrates a schematic diagram of a computer device for arranging shipment of goods in certain embodiments of the present invention.

第2圖例示了在本發明某些實施例中第1圖所示的計算機裝置如何安排貨物運送的一示意圖。 Figure 2 illustrates a schematic diagram of how the computer device shown in Figure 1 arranges the shipment of goods in certain embodiments of the present invention.

第3圖例示了在本發明某些實施例中第1圖所示的計算機裝置如何安排貨物運送的另一示意圖。 Figure 3 illustrates another schematic diagram of how the computer device shown in Figure 1 illustrates the delivery of goods in certain embodiments of the present invention.

第4圖例示了在本發明某些實施例中有關貨物運送的安排結果的一示意圖。 Figure 4 illustrates a schematic diagram of the results of an arrangement for the shipment of goods in certain embodiments of the present invention.

第5圖例示了在本發明某些實施例中一種安排貨物運送之方法的一示意圖。 Figure 5 illustrates a schematic diagram of a method of arranging shipment of goods in certain embodiments of the present invention.

以下將透過多個實施例來說明本發明,惟這些實施例並非用以限制本發明只能根據所述操作、環境、應用、結構、流程或步驟來實施。於圖式中,與本發明非直接相關的元件皆已省略。於圖式中,各元件(element)的尺寸以及各元件之間的比例僅是範例,而非用以限制本發明。除了特別說明之外,在以下內容中,相同(或相近)的元件符號可對應至相同(或相近)的元件。在可被實現的情況下,如未特別說明,以下所述的每一個元件的數量是指一個或多個。 The invention is illustrated by the following examples, which are not intended to limit the scope of the invention. In the drawings, elements that are not directly related to the present invention have been omitted. In the drawings, the dimensions of the elements and the ratios between the elements are merely exemplary and are not intended to limit the invention. Unless otherwise stated, the same (or similar) element symbols may correspond to the same (or similar) elements in the following. In the case where it can be realized, the number of each element described below means one or more unless otherwise specified.

第1圖例示了在本發明某些實施例中一種安排貨物運送之計算機裝置1的一示意圖。第1圖所示內容僅是為了舉例說明本發明的實施例,而非為了限制本發明。 Figure 1 illustrates a schematic diagram of a computer device 1 for arranging shipment of goods in certain embodiments of the present invention. The drawings are for illustrative purposes only and are not intended to limit the invention.

參照第1圖,安排貨物運送之計算機裝置1基本上可包含處理器11、儲存器13與輸入裝置15。處理器11、儲存器13與輸入裝置15中的每一個可以直接地電性連接(即,沒有經由其他元件而連接)或者是間接地電性連接(即,經由其他元件而連接)至其他任一者。舉例而言,如第1圖所示,處理器11可分別直接地電性連接至儲存器13與輸入裝置15,而儲存器13可經由處理器11而間接地電性連接至輸入裝置15。 Referring to Fig. 1, a computer device 1 for arranging cargo transportation basically includes a processor 11, a storage 13 and an input device 15. Each of the processor 11, the storage 13 and the input device 15 may be directly electrically connected (ie, not connected via other components) or indirectly electrically connected (ie, connected via other components) to other One. For example, as shown in FIG. 1 , the processor 11 can be directly electrically connected to the storage device 13 and the input device 15 , respectively, and the storage device 13 can be electrically connected to the input device 15 indirectly via the processor 11 .

處理器11可以包含微處理器(microprocessor)或微控制器(microcontroller),用以執行安排貨物運送之計算機裝置1所需的各種運算。微處理器或微控制器是一種可程式化的特殊積體電路,其具有運算、儲存、輸出/輸入等能力,且可接受並處理各種編碼指令,藉以進行各種邏輯運算與算術運算,並輸出相應的運算結果。 The processor 11 may include a microprocessor or microcontroller to perform various operations required by the computer device 1 for arranging shipments. A microprocessor or microcontroller is a programmable special integrated circuit that has the functions of operation, storage, output/input, etc., and can accept and process various coding instructions, thereby performing various logic operations and arithmetic operations, and outputting The corresponding operation result.

儲存器13可包含一般計算機裝置/電腦內所具備的各種儲存裝置,用以儲存安排貨物運送之計算機裝置1所需的各種資料。儲存器13可包含第一級儲存裝置(又稱主記憶體或內部記憶體),且第一級記憶體與處理器11直接連通。處理器11可直接讀取儲存在第一級記憶體的指令集,並在需要時執行這些指令集。儲存器13還可包含第二級儲存裝置(又稱外部記憶體或輔助記憶體),且第二級記憶體透過記憶體的I/O通道來和處理器11連通,並使用資料緩衝器來將資料傳送至第一級記憶體。在不供應電源的情況下,第二級記憶體的資料仍然不會消失(即非揮發性)。第二級記憶體可例如是各種類型的硬碟、光碟等。可選擇地,儲存器13亦可包含第三級儲存裝置,例如可隨插隨拔的隨身碟。 The storage 13 can include various storage devices provided in a general computer device/computer for storing various materials required for the computer device 1 for arranging goods. The storage 13 may include a first level storage device (also referred to as a primary memory or an internal memory), and the first level memory is in direct communication with the processor 11. The processor 11 can directly read the instruction set stored in the first level memory and execute the instruction sets as needed. The memory 13 can also include a second level storage device (also referred to as external memory or auxiliary memory), and the second level memory is connected to the processor 11 through the I/O channel of the memory, and uses a data buffer to Transfer the data to the first level memory. The data of the second level memory will not disappear (ie, non-volatile) without power supply. The second level memory can be, for example, various types of hard disks, optical disks, and the like. Alternatively, the storage 13 may also include a third level storage device, such as a flash drive that can be inserted and removed.

輸入裝置15可以是一般計算機裝置/電腦內所具備的各種輸入裝置/介面,用以將外部資料、訊號、訊息輸入至安排貨物運送之計算機裝置10舉例而言,輸入裝置15可以包含但不限於:滑鼠、軌跡球、觸控板、鍵盤、掃描器、麥克風、使用者介面、與網路介面其中之一或多個等等。 The input device 15 can be any type of input device/interface provided in a general computer device/computer for inputting external data, signals, and messages to the computer device 10 for arranging the shipment. For example, the input device 15 can include, but is not limited to, : One or more of a mouse, trackball, trackpad, keyboard, scanner, microphone, user interface, and web interface.

儲存器13可用以儲存歷史運送記錄10,歷史運送記錄10中可以包含多個歷史運送目的地群組,且每一個歷史運送目的地群組包含一或多個歷史運送目的地。除了歷史運送目的地群組之外,歷史運送記錄10還可包含有關歷史運送目的地群組之其他相關資訊。輸入裝置15可以用以輸入貨物運送清單12,且輸入貨物運送清單12可以包含例如複數運送目的地以及相對應的貨物資訊。舉例而言,輸入貨物運送清單12可以包含複數運送目的地以及相對應的運送材數資訊。 The storage 13 can be used to store a historical shipping record 10, which can include a plurality of historical shipping destination groups, and each historical shipping destination group includes one or more historical shipping destinations. In addition to the historical shipping destination group, the historical shipping record 10 may also contain other relevant information about the historical shipping destination group. The input device 15 can be used to input the goods delivery list 12, and the input goods delivery list 12 can include, for example, a plurality of shipping destinations and corresponding cargo information. For example, the input goods shipping list 12 may include a plurality of shipping destinations and corresponding shipping material number information.

第2圖例示了在本發明某些實施例中第1圖所示的安排貨物 運送之計算機裝置1如何安排貨物運送的一示意圖。第2圖所示內容僅是為了舉例說明本發明的實施例,而非為了限制本發明。 Figure 2 illustrates the arrangement of the goods shown in Figure 1 in certain embodiments of the invention. A schematic diagram of how the computer device 1 of the shipment arranges the shipment of the goods. The illustrations in Figure 2 are only intended to illustrate embodiments of the invention and are not intended to limit the invention.

參照第2圖,安排貨物運送之計算機裝置1之運作流程2可以包含動作201、203以及205。詳言之,首先,輸入裝置15可輸入貨物運送清單12至計算機裝置1(標示為動作201)。接著,處理器11可從貨物運送清單12中取得實際運送目的地,然後比較從貨物運送清單12中取得的實際運送目的地以及歷史運送記錄10中的每一個歷史運送目的地群組所包含的歷史運送目的地,以從歷史運送記錄10中的多個歷史運送目的地群組中選出一個群組候選者(標示為動作203),其中被選出的群組候選者所包含的歷史運送目的地存在於所述貨物運送清單中。然後,處理器11可將該群組候選者選為目標群組,並將該目標群組及其所包含的歷史運送目的地指派給一車輛(標示為動作205)。 Referring to FIG. 2, the operational flow 2 of the computer device 1 for arranging cargo transportation may include actions 201, 203, and 205. In particular, first, the input device 15 can input the cargo shipping list 12 to the computer device 1 (labeled as action 201). Next, the processor 11 can obtain the actual shipping destination from the cargo shipping list 12, and then compare the actual shipping destinations obtained from the cargo shipping list 12 with the historical shipping destinations included in each of the historical shipping records 10 The historical shipping destination selects one group candidate (indicated as action 203) from a plurality of historical shipping destination groups in the historical shipping record 10, wherein the selected group candidate includes a historical shipping destination Present in the cargo shipping list. Processor 11 may then select the group candidate as the target group and assign the target group and the historical shipping destinations it contains to a vehicle (labeled as action 205).

為了便於說明,假設運送成本是基本費用、跨區損失、材數不足損失、補貼損失四者相加之和,其中基本費用是固定的運送費用,跨區損失是因將處於不同區域的多個運送目的地或者彼此之間的行車路徑是迂迴的多個運送目的地指派給同一車輛所產生的額外費用,材數不足損失是因未有效地利用車輛的運載容量所產生的額外費用,而補貼損失是當指派太多運送目的地給同一車輛而需要補貼司機費用所產生的額外費用。因計算機裝置1可借助於歷史運送記錄10來為每一台車輛指派適合之運送目的地,故可避免將處於不同區域的多個運送目的地或者彼此之間的行車路徑是迂迴的多個運送目的地指派給同一車輛,進而移除或降低跨區損失。 For the sake of explanation, it is assumed that the transportation cost is the sum of the basic cost, the trans-regional loss, the insufficient material loss, and the subsidy loss. The basic cost is the fixed transportation cost, and the trans-regional loss is due to multiple regions in different regions. The transportation destination or the driving route between each other is the additional cost incurred by the multiple delivery destinations assigned to the same vehicle, and the insufficient material loss is the additional cost due to the unutilized utilization of the carrying capacity of the vehicle, and the subsidy Loss is the additional cost of subsidizing driver fees when assigning too many shipping destinations to the same vehicle. Since the computer device 1 can assign a suitable shipping destination to each vehicle by means of the historical shipping record 10, it is possible to avoid multiple shipping destinations in different areas or multiple shipping paths between the two. Destinations are assigned to the same vehicle to remove or reduce cross-zone losses.

在某些實施例中,處理器11在從歷史運送記錄10中的多個歷 史運送目的地群組中選出一個群組候選者(即,目標群組)時,除了考慮被選出的群組候選者所包含的歷史運送目的地是否存在於所述貨物運送清單之外,還可考慮被選出的群組候選者的材數總和是否與該車量的運載容量匹配(即,該材數總和是否等於或略小於該運載容量)。在此情況下,還可進一步移除或降低材數不足損失。 In some embodiments, processor 11 is in a plurality of calendars from historical record 10 When one group candidate (ie, target group) is selected from the history shipping destination group, in addition to considering whether the historical shipping destination included in the selected group candidate exists in the goods shipping list, It may be considered whether the sum of the number of materials of the selected group candidate matches the carrying capacity of the vehicle amount (ie, whether the sum of the material numbers is equal to or slightly smaller than the carrying capacity). In this case, the loss of the number of materials can be further removed or reduced.

在某些實施例中,處理器11在從歷史運送記錄10中的多個歷史運送目的地群組中選出一個群組候選者(即,目標群組)時,除了考慮被選出的群組候選者所包含的歷史運送目的地是否存在於所述貨物運送清單之外,還可考慮被選出的群組候選者中的歷史運送目的地的數量是否超過一門檻值。在此情況下,還可進一步移除或降低補貼損失。 In some embodiments, the processor 11 selects one of the group candidates (ie, the target group) from the plurality of historical shipping destination groups in the historical shipping record 10, in addition to considering the selected group candidates. Whether or not the historical shipping destination included in the person exists outside the cargo shipping list may also consider whether the number of historical shipping destinations among the selected group candidates exceeds a threshold. In this case, the subsidy loss can be further removed or reduced.

以下將結合第3圖與第4圖所示內容為例來說明處理器11從歷史運送記錄10中的多個歷史運送目的地群組中選出多個群組候選者之後的後續動作。第3圖例示了在本發明某些實施例中第1圖所示的安排貨物運送之計算機裝置1如何安排貨物運送的另一示意圖。第4圖例示了在本發明某些實施例中有關貨物運送的安排結果的一示意圖。第3圖與第4圖所示內容僅是為了舉例說明本發明的實施例,而非為了限制本發明。 Hereinafter, a subsequent operation after the processor 11 selects a plurality of group candidates from a plurality of historical transport destination groups in the history transport record 10 will be described by taking the contents shown in FIGS. 3 and 4 as an example. Figure 3 illustrates another schematic diagram of how the computer device 1 for arranging cargo shipments, as illustrated in Figure 1 of the present invention, arranges for the transport of goods. Figure 4 illustrates a schematic diagram of the results of an arrangement for the shipment of goods in certain embodiments of the present invention. 3 and 4 are merely illustrative of embodiments of the invention and are not intended to limit the invention.

參照第3圖,安排貨物運送之計算機裝置1之運作流程3可以包含動作301、303、305以及307。詳言之,首先,輸入裝置15可輸入貨物運送清單12至計算機裝置1(標示為動作301)。接著,處理器11可從貨物運送清單12中取得實際運送目的地,然後比較從貨物運送清單12中取得的實際運送目的地以及歷史運送記錄10中的每一個歷史運送目的地群組所包含的歷史運送目的地,以從歷史運送記錄10中的多個歷史運送目的地群組中選 出多個群組候選者(標示為動作303),其中被選出的每一個群組候選者所包含的歷史運送目的地都存在於所述貨物運送清單中。然後,處理器11可從該多個群組候選者中選出要指派給一車輛的一個或多個目標群組(標示為動作305)。最後,處理器11可將被選出的目標群組及其所包含的歷史運送目的地指派給一車輛(標示為動作307)。 Referring to Fig. 3, the operational flow 3 of the computer device 1 for arranging the shipment of goods may include actions 301, 303, 305, and 307. In particular, first, the input device 15 can input the cargo shipping list 12 to the computer device 1 (labeled as action 301). Next, the processor 11 can obtain the actual shipping destination from the cargo shipping list 12, and then compare the actual shipping destinations obtained from the cargo shipping list 12 with the historical shipping destinations included in each of the historical shipping records 10 Historical shipping destination, selected from a plurality of historical shipping destination groups in the historical shipping record 10 A plurality of group candidates (labeled as action 303) are present, wherein the historical shipping destinations included in each of the selected group candidates are present in the shipment list. Processor 11 may then select one or more target groups (labeled as action 305) to be assigned to a vehicle from the plurality of group candidates. Finally, processor 11 may assign the selected target group and its contained historical shipping destination to a vehicle (labeled as action 307).

處理器11可以決定要如何從該多個群組候選者中選出要指派給一車輛的一或多個目標群組。舉例而言,在某些實施例中,歷史運送記錄10可進一步包含每一個歷史運送目的地群組各自的累計次數,且處理器11可僅根據該多個群組候選者的該多個累計次數的高低,從該多個群組候選者中選出要指派給一車輛的一個或多個目標群組。 Processor 11 may decide how to select one or more target groups to assign to a vehicle from among the plurality of group candidates. For example, in some embodiments, the historical shipping record 10 can further include a respective cumulative number of each historical shipping destination group, and the processor 11 can only rely on the plurality of cumulatives of the plurality of group candidates The number of times is selected from one or more target groups to be assigned to a vehicle from the plurality of group candidates.

另舉例而言,在某些實施例中,處理器11也可先根據貨物運送清單12中的實際運送目的地所對應的運送材數以及一車輛的一運載容量,為每一個群組候選者確定一個材數總和,然後僅根據處理器11為該多個群組候選者所確定的該多個材數總和,從該多個群組候選者中選出要指派給該車輛的一個或多個目標群組。 For another example, in some embodiments, the processor 11 may first select each of the group candidates according to the number of shipping materials corresponding to the actual shipping destination in the cargo shipping list 12 and a carrying capacity of a vehicle. Determining a sum of material numbers, and then selecting one or more of the plurality of group candidates to be assigned to the vehicle based only on the sum of the plurality of material numbers determined by the processor 11 for the plurality of group candidates Target group.

又舉例而言,在某些實施例中,處理器11可根據該多個群組候選者的多個累計次數以及其為該多個群組候選者所確定的該多個材數總和二者,從該多個群組候選者中選出要指派給一車輛的一個或多個目標群組。 For example, in some embodiments, the processor 11 may be based on a plurality of accumulated times of the plurality of group candidates and a sum of the plurality of materials determined by the plurality of group candidates. And selecting one or more target groups to be assigned to a vehicle from the plurality of group candidates.

參照第4圖,假設貨物運送清單12包含了六個運送目的地D1、D2、D3、D7、D8、D9以及分別與其對應的運送材數。舉例而言,運送目的地D1所需要的運送材數為「3」個單位,而運送目的地D2所需要的運 送材數為「13」個單位。運送材數的單位可以根據不同的需求而由使用者定義。 Referring to Fig. 4, it is assumed that the cargo transport list 12 includes six transport destinations D1, D2, D3, D7, D8, and D9 and the number of transport materials corresponding thereto. For example, the number of transported materials required for the destination D1 is "3" units, and the transport required for the destination D2. The number of materials to be delivered is "13" units. The unit of the number of materials to be transported can be defined by the user according to different needs.

參照第4圖,歷史運送記錄10可包含多個歷史運送目的地群組40以及各個歷史運送目的地群組40在歷史記錄中的運送累計次數。舉例而言,在歷史運送記錄10中,曾經將包含歷史運送目的地D1、歷史運送目的地D2與歷史運送目的地D3的歷史運送目的地群組(即第4圖所示的組別1)指派給同一車輛的累計次數是十(10)次,而曾經將包含歷史運送目的地D7、與歷史運送目的地D9的歷史運送目的地群組(即第4圖所示的組別7)指派給同一車輛的累計次數是六(6)次。 Referring to FIG. 4, the historical shipping record 10 may include a plurality of historical shipping destination groups 40 and the cumulative number of shipments of the respective historical shipping destination groups 40 in the history. For example, in the history shipping record 10, a historical shipping destination group including the historical shipping destination D1, the historical shipping destination D2, and the historical shipping destination D3 (i.e., group 1 shown in FIG. 4) is once included. The cumulative number of assignments to the same vehicle is ten (10) times, and the historical shipping destination group (ie, group 7 shown in FIG. 4) including the historical shipping destination D7 and the historical shipping destination D9 has been assigned. The cumulative number of times for the same vehicle is six (6) times.

繼續參照第4圖,經由比對貨物運送清單12與歷史運送記錄10,處理器11可判斷出組別「1-3」與「6-8」的歷史運送目的地群組40各自所包含的全部歷史運送目的地都存在於貨物運送清單12中。然後,處理器11記錄可從歷史運送記錄10的多個歷史運送目的地群組40中選出這六個群組候選者42。換言之,處理器11將組別「1-3」與「6-8」的歷史運送目的地群組40選為群組候選者42。在其他實施例中,處理器11也可在某一歷史運送目的地群組40所包含的歷史運送目的地其中之一或一部分(非全部)存在於貨物運送清單12中的情況下,就將該歷史運送目的地群組40選為群組候選者42。 Continuing with reference to FIG. 4, by comparing the cargo shipping list 12 with the historical shipping record 10, the processor 11 can determine the respective historical shipping destination groups 40 of the groups "1-3" and "6-8". All historical shipping destinations are present in the cargo shipping list 12. Then, the processor 11 records the six group candidates 42 that can be selected from the plurality of historical shipping destination groups 40 of the historical shipping record 10. In other words, the processor 11 selects the historical shipping destination group 40 of the groups "1-3" and "6-8" as the group candidate 42. In other embodiments, the processor 11 may also be present in the cargo shipping list 12 when one or a portion (not all) of the historical shipping destinations included in a certain historical shipping destination group 40 are present. The historical shipping destination group 40 is selected as the group candidate 42.

如第3圖所示,在某些實施中,安排貨物運送之計算機裝置1在執行動作305時,處理器11可根據多個群組候選者42的累計次數以及其為多個群組候選者42所確定的材數總和二者,從多個群組候選者中選出要指派給一車輛的一個或多個目標群組。舉例而言,參照第4圖所示的安排結 果14,以車輛V1為例,雖然組別「2」的群組候選者42的累計次數最高,但其相對應的材數總和為「13」,與車輛V1的運載容量為「26」相差過大,而組別「1」的群組候選者42的累計次數次高,且其相對應的材數總和剛好符合車輛V1的運載容量,故較佳地,處理器11可將組別「1」的群組候選者42指派給車輛V1。另舉例而言,參照第4圖所示的安排結果14,以車輛V2為例,雖然組別「8」的群組候選者42的累計次數最高,但其相對應的材數總和為「35」,超出了車輛V2的運載容量為「20」,故處理器11可將組別「7」的群組候選者42指派給車輛V2。在此情況下,處理器11可將剩餘的組別「6」的群組候選者42(其相對應的材數總和為「15」)指派給運載容量為「15」的車輛V3。 As shown in FIG. 3, in some implementations, when the computer device 1 that arranges the shipment of the goods performs the action 305, the processor 11 can be based on the cumulative number of the plurality of group candidates 42 and the plurality of group candidates. 42 determines the sum of the number of materials, and selects one or more target groups to be assigned to a vehicle from among the plurality of group candidates. For example, refer to the arrangement shown in Figure 4. In the case of the vehicle V1, the group candidate 42 of the group "2" has the highest cumulative number of times, but the total number of corresponding materials is "13", which is different from the carrying capacity of the vehicle V1. If the total number of the group candidates 42 of the group "1" is the second highest, and the total number of corresponding materials is exactly the same as the carrying capacity of the vehicle V1, the processor 11 can preferably set the group "1". The group candidate 42 is assigned to the vehicle V1. For example, referring to the arrangement result 14 shown in FIG. 4, taking the vehicle V2 as an example, although the cumulative number of times of the group candidate 42 of the group "8" is the highest, the total number of corresponding materials is "35". Since the carrying capacity of the vehicle V2 is "20", the processor 11 can assign the group candidate 42 of the group "7" to the vehicle V2. In this case, the processor 11 can assign the group candidate 42 of the remaining group "6" (the total number of corresponding materials is "15") to the vehicle V3 having the carrying capacity of "15".

如第3圖所示,在某些實施中,安排貨物運送之計算機裝置1在執行動作305時,處理器11也可以只根據多個群組候選者42的累計次數,就從多個群組候選者中選出要指派給一車輛的一個或多個目標群組。舉例而言,參照第4圖,以車輛V1為例,在不考慮群組候選者42的材數總和是否符合車輛V1的運載容量的情況下,因為組別「2」的群組候選者42的累計次數最高,故處理器11可以將組別「2」的群組候選者42指派給車輛V1。 As shown in FIG. 3, in some implementations, when the computer device 1 that arranges the shipment of the goods performs the action 305, the processor 11 may also follow the cumulative number of times of the plurality of group candidates 42 from the plurality of groups. One or more target groups to be assigned to a vehicle are selected among the candidates. For example, referring to FIG. 4, taking the vehicle V1 as an example, the group candidate 42 of the group "2" is considered regardless of whether or not the total number of materials of the group candidate 42 conforms to the carrying capacity of the vehicle V1. The cumulative number of times is the highest, so the processor 11 can assign the group candidate 42 of the group "2" to the vehicle V1.

如第3圖所示,在某些實施中,安排貨物運送之計算機裝置1在執行動作305時,處理器11也可以只根據多個群組候選者42的材數總和,就從多個群組候選者中選出要指派給一車輛的一個或多個目標群組。舉例而言,假設有一運載容量為「13」的車輛,在不考慮群組候選者42的累計次的累計次數的情況下,處理器11可以將組別「3」的群組候選者42指派給該車輛。 As shown in FIG. 3, in some implementations, when the computer device 1 that arranges the shipment of the goods performs the action 305, the processor 11 may also follow the sum of the number of the plurality of group candidates 42 from the plurality of groups. One or more target groups to be assigned to a vehicle are selected among the group candidates. For example, assuming that there is a vehicle having a carrying capacity of "13", the processor 11 can assign the group candidate 42 of the group "3" regardless of the cumulative number of accumulated times of the group candidate 42. Give the vehicle.

在某些實施例中,處理器11從歷史運送目的地群組40中選出的每一個群組候選者42所包含的歷史運送目的地的數量小於一預設值。該預設值可以根據不同的需求而設定。舉例而言,當同一車輛被指派的運送目的地數量超過四就會造成額外的運送費用而增加運送成本,則可將該預設值設定為四,讓處理器11在從歷史運送目的地群組40中選出群組候選者42時,只會選擇其中所包含的運送目的地的數量小於四個的歷史運送目的地群組來作為群組候選者42。 In some embodiments, the number of historical shipping destinations included by each of the group candidates 42 selected by the processor 11 from the historical shipping destination group 40 is less than a predetermined value. The preset value can be set according to different needs. For example, when the number of shipping destinations assigned to the same vehicle exceeds four, resulting in additional shipping costs and increased shipping costs, the preset value may be set to four, and the processor 11 is in the historical shipping destination group. When the group candidate 42 is selected in the group 40, only the historical shipping destination group in which the number of shipping destinations included therein is less than four is selected as the group candidate 42.

在某些實施例中,若貨物運送清單12中的一或多個實際運送目的地不存在於歷史運送記錄10中,則處理器11還可以根據使用者的指示、或根據預設的規則,將這樣的實際運送目的地指派運載容量未填滿的車輛中。 In some embodiments, if one or more actual shipping destinations in the shipping manifest 12 are not present in the historical shipping record 10, the processor 11 may also follow the instructions of the user or according to preset rules. Such an actual shipping destination is assigned to a vehicle whose carrying capacity is not filled.

當處理器11產生安排結果14並據根據安排結果14對於貨物進行安排之後,處理器11還可以根據安排結果14而對歷史運送記錄10進行更新。以第4圖為例,處理器11可將組別「1、6、7」的歷史運送目的地群組40記錄的累計次數分別加「1」。在某些實施例中,若處理器11指派了一個新的運送目的地群組給一車輛,還可以將這個新的運送目的地群組新增至歷史運送記錄10中。 The processor 11 may also update the historical shipping record 10 based on the scheduling result 14 after the processor 11 produces the scheduling result 14 and arranges for the shipment according to the scheduling result 14. Taking FIG. 4 as an example, the processor 11 can add "1" to the cumulative number of times recorded in the history shipping destination group 40 of the group "1, 6, 7". In some embodiments, if the processor 11 assigns a new shipping destination group to a vehicle, the new shipping destination group can also be added to the historical shipping record 10.

第5圖例示了在本發明某些實施例中一種安排貨物運送之方法的一示意圖。第5圖所示內容僅是為了舉例說明本發明的實施例,而非為了限制本發明。 Figure 5 illustrates a schematic diagram of a method of arranging shipment of goods in certain embodiments of the present invention. The illustrations in Figure 5 are only intended to illustrate embodiments of the invention and are not intended to limit the invention.

參照第5圖,安排貨物運送之方法5基本上可包含以下步驟:由一計算機裝置儲存一歷史運送記錄,所述歷史運送記錄包含多個歷 史運送目的地群組,且每一個歷史運送目的地群組包含一或多個歷史運送目的地(標示為步驟501);以及由所述計算機裝置根據一貨物運送清單而從所述多個歷史運送目的地群組中選出一個或多個目標群組並將被選出的目標群組指派給一車輛,每一個被選出的目標群組所包含的歷史運送目的地存在於所述貨物運送清單中(標示為步驟503)。 Referring to Figure 5, a method 5 of arranging shipments can basically include the steps of: storing a historical shipping record by a computer device, the historical shipping record comprising a plurality of calendars a destination shipping group, and each historical shipping destination group includes one or more historical shipping destinations (labeled as step 501); and from the plurality of history by the computer device based on a shipment shipping list One or more target groups are selected from the delivery destination group and the selected target group is assigned to a vehicle, and the historical delivery destination included in each selected target group exists in the cargo delivery list (labeled as step 503).

在某些實施例中,除了步驟501、503之外,安排貨物運送之方法5還可包含以下步驟:由所述計算機裝置根據所述貨物運送清單從所述多個歷史運送目的地群組中選出一個群組候選者,以作為要指派給所述車輛的所述目標群組,或者由所述計算機裝置根據所述貨物運送清單從所述多個歷史運送目的地群組中選出多個群組候選者,並從所述多個群組候選者中選出要指派給所述車輛的所述目標群組或所述多個目標群組;其中,每一個被選出的群組候選者所包含的歷史運送目的地可以存在於所述貨物運送清單中。 In some embodiments, in addition to steps 501, 503, the method 5 of arranging the shipment of goods may further comprise the step of, by the computer device, from the plurality of historical shipping destination groups based on the shipment manifest Selecting a group candidate as the target group to be assigned to the vehicle, or selecting, by the computer device, a plurality of groups from the plurality of historical shipping destination groups according to the cargo shipping list a group of candidates, and selecting the target group or the plurality of target groups to be assigned to the vehicle from the plurality of group candidates; wherein each selected group candidate includes The historical shipping destination may be present in the cargo shipping list.

在某些實施例中,所述歷史運送記錄還可包含所述多個歷史運送目的地群組各自的累計次數,以及所述計算機裝置可以是根據所述多個群組候選者的累計次數,而從所述多個群組候選者中選出要指派給所述車輛的所述目標群組或所述多個目標群組。 In some embodiments, the historical shipping record may further include a cumulative number of times each of the plurality of historical shipping destination groups, and the computer device may be based on a cumulative number of the plurality of group candidates. And selecting the target group or the plurality of target groups to be assigned to the vehicle from the plurality of group candidates.

在某些實施例中,除了步驟501、503之外,安排貨物運送之方法5還可包含以下步驟: 由所述計算機裝置根據所述貨物運送清單以及所述車輛的一運載容量,為每一個群組候選者確定一材數總和;其中,所述計算機裝置可以是根據其為所述多個群組候選者所確定的所述多個材數總和,從所述多個群組候選者中選出要指派給所述車輛的所述目標群組或所述多個目標群組。 In some embodiments, in addition to steps 501, 503, the method 5 of arranging the shipment of goods may further comprise the following steps: Determining, by the computer device, a sum of materials for each group candidate according to the cargo shipping list and a carrying capacity of the vehicle; wherein the computer device may be the plurality of groups according to the a sum of the plurality of material numbers determined by the candidate, and selecting the target group or the plurality of target groups to be assigned to the vehicle from the plurality of group candidates.

在某些實施例中,所述計算機裝置從所述多個歷史運送目的地群組中選出的每一個群組候選者所包含的歷史運送目的地的數量小於一預設值。 In some embodiments, the number of historical shipping destinations included by each of the group candidates selected by the computer device from the plurality of historical shipping destination groups is less than a predetermined value.

在某些實施例中,除了步驟501、503之外,安排貨物運送之方法5還可包含以下步驟:輸入所述貨物運送清單至所述計算機裝置。 In some embodiments, in addition to steps 501, 503, the method 5 of arranging shipments may further comprise the step of entering the shipment manifest to the computer device.

在某些實施例中,安排貨物運送之方法5的上述全部步驟可以由安排貨物運送之計算機裝置1來執行。在某些實施例中,除了上述步驟之外,安排貨物運送之方法5還可以包含與安排貨物運送之計算機裝置1的上述所有實施例相對應的其他步驟。因本發明所屬技術領域中具有通常知識者可根據上文針對安排貨物運送之計算機裝置1的說明而瞭解這些其他步驟,於此不再贅述。 In some embodiments, all of the above steps of the method 5 of arranging the shipment of goods may be performed by the computer device 1 that arranges the shipment of the goods. In some embodiments, in addition to the steps described above, the method 5 of arranging the shipment of goods may also include other steps corresponding to all of the above-described embodiments of the computer device 1 in which the shipment is scheduled. Those skilled in the art to which the present invention pertains can understand these other steps in light of the above description of the computer device 1 for arranging the shipment, and no further details are provided herein.

上述實施例只是舉例來說明本發明,而非為了限制本發明。任何針對上述實施例進行修飾、改變、調整、整合而產生的其他實施例,只要是本發明所屬技術領域中具有通常知識者不難思及的,都已涵蓋在本發明的保護範圍內。本發明的保護範圍以申請專利範圍為準。 The above-described embodiments are merely illustrative of the invention and are not intended to limit the invention. Any other embodiments which are modified, changed, adjusted, and integrated with the above-described embodiments are not limited to those skilled in the art to which the present invention pertains, and are covered by the scope of the present invention. The scope of protection of the present invention is based on the scope of the patent application.

Claims (12)

一種安排貨物運送之計算機裝置,包含:一儲存器,用以儲存一歷史運送記錄,所述歷史運送記錄包含多個歷史運送目的地群組,且每一個歷史運送目的地群組包含一或多個歷史運送目的地;以及一處理器,電性連接至所述儲存器,且用以根據一貨物運送清單,從所述多個歷史運送目的地群組中選出一個或多個目標群組,並將被選出的目標群組指派給一車輛,每一個被選出的目標群組所包含的歷史運送目的地存在於所述貨物運送清單中。 A computer device for arranging cargo transportation, comprising: a storage for storing a historical shipping record, the historical shipping record comprising a plurality of historical shipping destination groups, and each historical shipping destination group comprising one or more a historical shipping destination; and a processor electrically coupled to the storage and configured to select one or more target groups from the plurality of historical shipping destination groups based on a shipment delivery list The selected target group is assigned to a vehicle, and the historical shipping destination included in each selected target group exists in the cargo shipping list. 如請求項1所述的計算機裝置,其中,所述處理器還用以根據所述貨物運送清單,從所述多個歷史運送目的地群組中選出一個群組候選者,以作為要指派給所述車輛的所述目標群組,或者所述處理器還用以根據所述貨物運送清單,從所述多個歷史運送目的地群組中選出多個群組候選者,並從所述多個群組候選者中選出要指派給所述車輛的所述目標群組或所述多個目標群組;以及其中,每一個被選出的群組候選者所包含的歷史運送目的地存在於所述貨物運送清單中。 The computer device of claim 1, wherein the processor is further configured to select a group candidate from the plurality of historical shipping destination groups according to the cargo shipping list as to be assigned to The target group of the vehicle, or the processor is further configured to select a plurality of group candidates from the plurality of historical shipping destination groups according to the cargo shipping list, and from the plurality of Among the group candidates, the target group or the plurality of target groups to be assigned to the vehicle are selected; and wherein a historical shipping destination included in each selected group candidate exists in the In the cargo delivery list. 如請求項2所述的計算機裝置,其中所述歷史運送記錄還包含所述多個歷史運送目的地群組各自的累計次數,以及 所述處理器是根據所述多個群組候選者的累計次數,從所述多個群組候選者中選出要指派給所述車輛的所述目標群組或所述多個目標群組。 The computer device of claim 2, wherein the historical shipping record further comprises a cumulative number of times of each of the plurality of historical shipping destination groups, and The processor selects, from the plurality of group candidates, the target group or the plurality of target groups to be assigned to the vehicle according to a cumulative number of the plurality of group candidates. 如請求項2所述的計算機裝置,其中所述處理器還用以根據所述貨物運送清單以及所述車輛的一運載容量,為每一個群組候選者確定一材數總和,以及所述處理器是根據為所述多個群組候選者所確定的所述多個材數總和,從所述多個群組候選者中選出要指派給所述車輛的所述目標群組或所述多個目標群組。 The computer device of claim 2, wherein the processor is further configured to determine a sum of materials for each group candidate according to the cargo shipping list and a carrying capacity of the vehicle, and the processing And selecting, from the plurality of group candidates, the target group or the plurality of the plurality of group candidates to be assigned to the vehicle according to the sum of the plurality of materials determined for the plurality of group candidates Target groups. 如請求項2所述的計算機裝置,其中所述處理器從所述多個歷史運送目的地群組中選出的每一個群組候選者所包含的歷史運送目的地的數量小於一預設值。 The computer apparatus according to claim 2, wherein the number of historical shipping destinations included in each of the group candidates selected by the processor from the plurality of historical shipping destination groups is less than a preset value. 如請求項2所述的計算機裝置,更包含一輸入裝置,其中所述輸入裝置電性連接至所述處理器,且用以輸入所述貨物運送清單。 The computer device of claim 2, further comprising an input device, wherein the input device is electrically connected to the processor and configured to input the cargo shipping list. 一種安排貨物運送之方法,包含:由一計算機裝置儲存一歷史運送記錄,所述歷史運送記錄包含多個歷史運送目的地群組,且每一個歷史運送目的地群組包含一或多個歷史運送目的地;以及由所述計算機裝置根據一貨物運送清單而從所述多個歷史運送目的地群組中選出一個或多個目標群組並將被選出的目標群組指派給一車輛,每一個被選出的目標群組所包含的歷史運送目的地存在於所述貨物運送清單中。 A method of arranging shipment of goods comprising: storing, by a computer device, a historical shipping record, the historical shipping record comprising a plurality of historical shipping destination groups, and each historical shipping destination group comprising one or more historical shipping Destinations; and selecting, by the computer device, one or more target groups from the plurality of historical shipping destination groups based on a cargo shipping list and assigning the selected target groups to a vehicle, each The historical shipping destination included in the selected target group exists in the goods shipping list. 如請求項7所述的方法,更包含:由所述計算機裝置根據所述貨物運送清單從所述多個歷史運送目的地群組中選出一個群組候選者,以作為要指派給所述車輛的所述目標群組,或者由所述計算機裝置根據所述貨物運送清單從所述多個歷史運送目的地群組中選出多個群組候選者,並從所述多個群組候選者中選出要指派給所述車輛的所述目標群組或所述多個目標群組;其中,每一個被選出的群組候選者所包含的歷史運送目的地存在於所述貨物運送清單中。 The method of claim 7, further comprising: selecting, by the computer device, one group candidate from the plurality of historical shipping destination groups according to the cargo shipping list as to be assigned to the vehicle The target group, or the plurality of group candidates are selected from the plurality of historical shipping destination groups by the computer device according to the cargo shipping list, and from the plurality of group candidates The target group or the plurality of target groups to be assigned to the vehicle are selected; wherein a historical shipping destination included in each of the selected group candidates exists in the cargo shipping list. 如請求項8所述的方法,其中:所述歷史運送記錄還包含所述多個歷史運送目的地群組各自的累計次數,以及所述計算機裝置是根據所述多個群組候選者的累計次數,而從所述多個群組候選者中選出要指派給所述車輛的所述目標群組或所述多個目標群組。 The method of claim 8, wherein: the historical shipping record further comprises a cumulative number of times of the plurality of historical shipping destination groups, and the computer device is based on the cumulative of the plurality of group candidates The number of times, and the target group or the plurality of target groups to be assigned to the vehicle are selected from the plurality of group candidates. 如請求項8所述的方法,更包含:由所述計算機裝置根據所述貨物運送清單以及所述車輛的一運載容量,為每一個群組候選者確定一材數總和;其中,所述計算機裝置是根據其為所述多個群組候選者所確定的所述多個材數總和,從所述多個群組候選者中選出要指派給所述車輛的所述目標群組或所述多個目標群組。 The method of claim 8, further comprising: determining, by the computer device, a sum of materials for each group candidate according to the cargo shipping list and a carrying capacity of the vehicle; wherein the computer And selecting, by the device according to the sum of the plurality of material numbers determined for the plurality of group candidates, the target group to be assigned to the vehicle or the Multiple target groups. 如請求項8所述的方法,其中所述計算機裝置從所述多個歷史運送目的地 群組中選出的每一個群組候選者所包含的歷史運送目的地的數量小於一預設值。 The method of claim 8, wherein the computer device is from the plurality of historical shipping destinations The number of historical shipping destinations included in each group candidate selected in the group is less than a preset value. 如請求項8所述的方法,更包含:輸入所述貨物運送清單至所述計算機裝置。 The method of claim 8, further comprising: inputting the cargo shipping list to the computer device.
TW107135394A 2018-10-08 2018-10-08 Computer device and method for arranging freight delivery TWI667623B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW107135394A TWI667623B (en) 2018-10-08 2018-10-08 Computer device and method for arranging freight delivery

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW107135394A TWI667623B (en) 2018-10-08 2018-10-08 Computer device and method for arranging freight delivery

Publications (2)

Publication Number Publication Date
TWI667623B true TWI667623B (en) 2019-08-01
TW202014947A TW202014947A (en) 2020-04-16

Family

ID=68316644

Family Applications (1)

Application Number Title Priority Date Filing Date
TW107135394A TWI667623B (en) 2018-10-08 2018-10-08 Computer device and method for arranging freight delivery

Country Status (1)

Country Link
TW (1) TWI667623B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TW201351313A (en) * 2012-04-17 2013-12-16 Taiwan Dev & Construction Co Method of authenticating an electronic tag for a RFID tag item processing system and device and system thereof
TW201826175A (en) * 2017-01-06 2018-07-16 財團法人工業技術研究院 System for managing logistics and method for item consignment
CN108492069A (en) * 2018-03-23 2018-09-04 长汀县安邸家具有限公司 A kind of furniture dispatching intelligent management system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TW201351313A (en) * 2012-04-17 2013-12-16 Taiwan Dev & Construction Co Method of authenticating an electronic tag for a RFID tag item processing system and device and system thereof
TW201826175A (en) * 2017-01-06 2018-07-16 財團法人工業技術研究院 System for managing logistics and method for item consignment
CN108492069A (en) * 2018-03-23 2018-09-04 长汀县安邸家具有限公司 A kind of furniture dispatching intelligent management system

Also Published As

Publication number Publication date
TW202014947A (en) 2020-04-16

Similar Documents

Publication Publication Date Title
US10078463B1 (en) Dynamic memory reallocation for match-action packet processing
Sung et al. Integrated service network design for a cross-docking supply chain network
Le-Duc Design and control of efficient order picking processes
Bögl et al. The school bus routing and scheduling problem with transfers
Pisinger et al. A general heuristic for vehicle routing problems
Hakan Akyüz et al. A mathematical formulation and efficient heuristics for the dynamic container relocation problem
US7454420B2 (en) Data sorting method and system
CN109703969A (en) Shelf management system and shelf management method
CN111126705B (en) Transport path generation method and device for dense storage and electronic equipment
US20220005139A1 (en) Diversified and connected freight allocation system and method
TW201830180A (en) Storage location assignment device and method for storage location assignment
TW542978B (en) System and method for IP-based LSI design
CN109032533A (en) A kind of date storage method, device and equipment
CN104731562A (en) Task Execution In Simd Processing Unit
TWI667623B (en) Computer device and method for arranging freight delivery
US20180322093A1 (en) Method and apparatus for solving a mixed integer programming problem
Alonso-Ayuso et al. On a selection and scheduling problem in automatic storage and retrieval warehouses
Hemmati et al. Evaluating the importance of randomization in adaptive large neighborhood search
US20170293468A1 (en) Efficient handling of sort payload in a column organized relational database
Anily et al. The preemptive swapping problem on a tree
Pham et al. The intermittent travelling salesman problem
US20100205026A1 (en) Incompatibility processing
US9003419B2 (en) Network balancing procedure that includes redistributing flows on arcs incident on a batch of vertices
US9152940B2 (en) Method and apparatus for optimized shipping strategies accounting for endpoint requirements
CN111008796B (en) Computer device and method for arranging goods delivery