TW201140474A - Management system, management method and computer program product thereof - Google Patents
Management system, management method and computer program product thereof Download PDFInfo
- Publication number
- TW201140474A TW201140474A TW99114927A TW99114927A TW201140474A TW 201140474 A TW201140474 A TW 201140474A TW 99114927 A TW99114927 A TW 99114927A TW 99114927 A TW99114927 A TW 99114927A TW 201140474 A TW201140474 A TW 201140474A
- Authority
- TW
- Taiwan
- Prior art keywords
- vehicles
- schedule
- time
- vehicle
- schedules
- Prior art date
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
201140474 六、發明說明： 【發明所屬之技術領域】 本發明係關於一種管理系統、管理方法及其電腦程式產品；更 詳細地說，本發明係關於一種用以排程一貨櫃場之複數個車輛以 及至少一堆棧設備之移動之管理系統、管理方法及其電腦程式產 品0 【先前技術】 近年來’隨著自動化系統日益成熟，其在現代的日常生活中應 用的層面也愈來愈廣泛，例如應用於物流、休閒及競賽等方面之 自動化管理，以提升整體之作業效率以及減少人力需求。 目前常見的貨櫃場通常仍採用人卫作業之方式進行管理，例如 當貨櫃車抵達貨櫃場時’先將卸㈣/領_單交給㈣場之操作 人員’再由諸場之操作人貞操作械設備直接根據卸貨植/領貨 櫃單進行卸貨櫃與取貨櫃之作業。而較先進之屬於大型港口的貨 櫃場’則通常採用自動化作業之方式進行管理，例如具有自動化 堆棧設備之貨櫃場可事先輸人卸f櫃/領貨櫃單資訊以及各貨概之 ,置資訊，當貨櫃車抵達前述具有自動化堆機設備之貨權場時， 貨櫃场之操作人員僅需辨識貨櫃車之卸貨櫃/領貨櫃單的單號，便 可交由自動化堆棧設備進行卸貨櫃/領貨櫃之作業。 然而’前段所述之貨樞場的人工作業/自動化作業方式皆不具有 乍業排程之概心，即皆未考慮貨櫃場整體作業時間之最佳化。具 體而言’不論是人工作業或是自動化作f，㈣車之卸fM/取貨 之作業白疋知用先進先出之作業原則，即先到達之貨櫃車先進 201140474 行作業’後達到之貨櫃車則需等待先到達之貨榧車作業完成後才 能進行作業。如此一來，將造成各貨櫃車不必要的等候時間，同 時延長貨櫃場的整體作業時間。此外，前段所述之貨櫃場的人工 作業/自動化作業方式亦未能考量高優先權貨櫃（如冷凍貨櫃）之 卸/取的優先順序問題。 综上所述，如何在不大幅增加貨櫃場營運成本的情況下，提供 一種可減少貨櫃場之整體作業時間與考量不同優先權貨櫃之優先 順序的管理系統，以提供最佳化之排程，俾貨櫃場之車輛以及堆 棧設備可根據被選擇之最佳化的排程移動，仍係業界所要努力達 成之目標。 【發明内容】 本發明之一目的在於提供一種用於一貨櫃場之管理系統。該管 理系統係用以排程該貨櫃場之複數個車輛以及至少一堆棧設備之 移動，且包含一輸入裝置、一傳輸介面、一微處理器以及一計算 單元。各該車輛包含一定位設備。該管理系統之傳輸介面電性連 接各該車輛之定位設備以及該至少一堆棧設備。該管理系統之微 處理器電性連接該輸入裝置。該管理系統之計算單元電性連接該 微處理器以及該傳輸介面。 具體而言，該輸入裝置用以接收該等車輛之複數個工作指示資 汛。該傳輸介面用以接收各該車輛之一車輛位置資訊以及至少一 堆棧設備位置資訊。該微處理器根據該等工作指示資訊產生複數 個排程。該計算單元則根據各該車輛之車輛位置資訊以及該至少 —堆棧設備位置資訊計算各該排程之一總作業時間❶最後，該微 5 201140474 處理器即根據各該排程之總作業時間選擇該等排程其中之一，並 藉由該傳輸介面將被選擇之該排程傳送至各該車輛以及該至少一 堆棧設備，俾該貨櫃場之複數個車輛以及該至少一堆棧設備根據 被選擇之該排程移動。 本發明之另一目的在於提供一種用於一貨櫃場之管理方法。該 管理方法係藉由一管理系統排程該貨櫃場之複數個車輛以及至少 一堆棧設備之移動。各該車輛包含一定位設備。該管理系統包含 一輸入裝置、一傳輸介面、一微處理器以及一計算單元。該管理 系統之傳輸介面電性連接各該車輛之定位設備以及該至少一堆棧 設備。該微處理器電性連接該輸入裝置。該計算單元電性連接該 微處理器以及該傳輸介面。 該管理方法則包含下列步驟：令該輸入裝置接收該等車輛之複 數個工作指示資訊；令該傳輸介面接收各該車輛之一車輛位置資 訊以及至少一堆棧設備位置資訊；令該微處理器根據該等工作指 示資訊產生複數個排程；令該計算單元根據各該車輛之車輛位置 資訊以及該至少一堆棧設備位置資訊計算各該排程之一總作業時 間；令該微處理器根據各該排程之總作業時間選擇該等排程其中 之一；以及令該傳輸介面將被選擇之該排程傳送至各該車輛以及 該至少一堆棧設備，俾該貨櫃場之複數個車輛以及該至少一堆棧 設備根據被選擇之該排程移動。 本發明之又一目的在於提供一種電腦程式產品，其内儲一種用 於一貨櫃場之管理方法之程式。當該程式被載入管理系統後可執 行並完成前段所述之適用於該貨櫃場之管理方法。 201140474 綜上所述，本發明係藉由貨櫃場之複數個車輛的工作指示資訊 產生複數個排程。隨後根據前述各車輛的車輛位置資訊以及堆棧 設備的堆棧設備位置資訊，計算各個排程之一總作業時間，並根 據前述各個排程之總作業時間，選擇該等排程其中之一。最後則 將被選擇之該排程傳送至前述各車輛以及堆棧設備，俾該貨櫃場 之複數個車輛以及堆棧設備根據前述被選擇之該排程移動，如此 一來，將能有效地降低貨櫃場之整體作業時間，並同時有效地解 決不同優先權貨櫃之優先順序所產生的問題。 在參閱圖式及隨後描述之實施方式後，所屬技術領域具有通常 知識者便可瞭解本發明之其它目的、優點以及本發明之技術手段 及實施態樣。 【實施方式】 以下將透過實施例來解釋本發明内容，本發明的實施例並非用 以限制本發明須在如實施例所述之任何特定的環境、應用或特殊 方式方能實施。因此，關於實施例之說明僅為闡釋本發明之目的， 而非用以限制本發明。須說明者，以下實施例及圖式中，與本發 明非直接相關之元件已省略而未繪示；且圖式中各元件間之尺寸 關係僅為求容易瞭解，非用以限制實際比例。 本發明之第一實施例如第1圖以及第2圖所示。第1圖係為用 於一貨櫃場之一管理系統1之示意圖；第2圖則為前述貨櫃場2 之示意圖。管理系統1包含一輸入裝置11、一微處理器13、一計 算單元15及一傳輸介面17。微處理器13係電性連接輸入裝置11; 計算單元15係電性連接微處理器13以及傳輸介面17。 201140474 貨櫃場2則包含複數個車輛201、203、一儲區21、一堆棧設備 211、一作業位置213、以及複數個貨櫃215、217。為簡易說明起 見，於本實施例中，前述複數個車輛201、203係一第一車輛201 以及一第二車輛203，其各自皆包含一定位設備（圖未繪示）；前 述複數個貨櫃215、217係一第一貨櫃215以及一第二貨櫃217。 管理系統1之傳輸介面17係以一無線方式電性連接第一車輛201 之定位設備以及第二車輛203之定位設備，並以一有線方式以及 一無線方式其中之一電性連接堆棧設備211。 當第一車輛201以及第二車輛203抵達貨櫃場2之後，輸入裝 置11將接收第一車輛201之一第一工作指示資訊201a、第一車輛 201之一第一等候參數201b、第二車輛203之一第二工作指示資 訊203a以及第二車輛203之一第二等候參數203b，並將第一工作 指示資訊201a、第一等候參數201b、第二工作指示資訊203a以 及第二等候參數203b傳送至微處理器13。 傳輸介面17則藉由第一車輛201之定位設備接收第一車輛201 之一第一車輛位置資訊201c ;藉由第二車輛203之定位設備接收 第二車輛203之一第二車輛位置資訊203c ;並藉由堆棧設備211 接收一堆棧設備位置資訊211a，並將第一車輛位置資訊201c、第 二車輛位置資訊203c及堆棧設備位置資訊211a傳送至計算單元 15。 微處理器13將根據第一工作指示資訊201a以及第二工作指示 資訊203a產生一第一排程110以及一第二排程112，其中第一排 程110具有以一第一序列安排之該等工作指示資訊（即順序為第 201140474 一工作指示資訊201a及第二工作指示資訊2〇3a)，第二排程112 具有以一第二序列安排之該等工作指示資訊（即順序為第二工作 指示資訊203a及第一工作指示資訊20U) ’隨後微處理器13將 第一排程110、第二排程U2、第一等候參數2〇lb以及第二等候 參數203b傳送至計算單元15。 接著，計算單元15根據第一車輛位置資訊201c、第二車輛位置 資訊203c以及第-排程U〇 (以第一序列安排之第—工作指示資 訊20U及第二工作指示資訊2〇3a)分別計算第一車輛扣1之—第 -移動時間以及第二車輛203之一第二移動時間，同時根據堆棧 備位置資訊211以及第一排程11〇(以第一序列安排之第一工作 指示資訊馳及第二I作指示資訊⑽）計算—第—堆棧設 ^時間餐，計算單元15即根據第一車請之第—移動時間、 -車輛203之第二移動時間以及第一堆棧設備作業時間計 一排程110之一第一總作業時間114。 隨後，計算單幻5根據第—車輛位„訊2仏、第二車輛 資訊203C以及第二排程112 (以第二序列安排之第二卫肿干次 錢33及第一工作指示資訊咖）分別計算第二車_2 二移動時間以及第一車輛2〇1之一第四移動時間 設備位置資訊211以及第二排程112(以第二序列之據堆拽 指示資訊胸及第—工作指示f訊魏）計算―第^第二工作 業時間。最後，計算單元15即根據第二車辆加之=棧設備作 第-車輛2(H之第四移動時間以及第二堆機—移動時間、 二排程112之-第二總作業時間116。 & ”日夺間計算第 9 201140474 當計算單元15計算出第一總作業時間114以及第二總作業時間 Π6之後，即將第一總作業時間U4及第二總作業時間lb傳送至 微處理器13。微處理器13將比較第—總作業時間114以及第二總 作業時間116,同時根據比較結果選擇第-排程110以及第二排程 H2其中之一，並將被選擇之排程丨18傳送至傳輸介面Η。最後， 傳輸介® 17將前述被選擇之排程118分別傳送至第一車輛2⑴、 第二車輛203以及堆棧設傷211，使得第—車柄2G卜第二車輛203 以及堆棧設備2Π根據前述被選擇之排程118移動。 一須特別㈣者’當輸人裝置u接收到複數個車輛的η個工作指 不資Α時’微處理H 13將根據前述η個工作指 ⑻個排程，而前述續乘⑻個排程中，將包含有不可^ 。舉例而言’當一車輛進入貨櫃場時，若前述車輛裝載 匕-概，必然要先將前述車輛裝載之貨概卸下，才能取用另一 貨报’並裝載至該車輛。據此，前述n階乘（n!)個齡中可能 ==個先取用一貨櫃，並裝載至該車柄;隨後將該車輛裝 二如此一來，即為無法實現之排程。為避免 、：^選擇-無法實狀馳，微處㈣13將預先把無 》貫現之排程排除’僅傳送可實現之排程至計算單元15，最後再 透過微處理H 13根據前述各個可實現之排程 2 -最佳且可實現之排程。 乍業時間’選擇 以下將進-步舉例說明本發明之管理系統 實施例中’第-車…第一工作指示資訊二： -裝載第二貨植2心苐二車輛如之第二=第:車輛 日不資訊203a 201140474 為「第二車輛203裝載第一貨櫃215」。輸入裝置11於接收第一工 作指示資訊201a、第一等候參數201b、第二工作指示資訊203a 以及第二等候參數203b之後，將其傳送至微處理器13。同時，傳 輸介面17接收第一車輛201之一第一車輛位置資訊201c、第二車 輛203之一第二車輛位置資訊2〇3c以及堆棧設備位置資訊211a， 並將其傳送至計算單元15。 隨後，微處理器13根據第一工作指示資訊201a以及第二工作 指示資訊203a產生一第一排程ι10以及一第二排程丨12。第一排 程110具有以一第一序列安排之工作指示資訊2〇la、2〇3a ;第二 排程112則具有以一第二序列安排之工作指示資訊2〇la、2〇3a。 詳言之，第一排程110具有一第一工作及一第二工作，第一排程 110之第一工作係第一工作資訊指示201 a，第一排程11 〇之第二 工作係第二工作資訊指示203a ;第二排程112具有一第三工作及 一第四工作，第二排程112之第三工作係第二工作資訊指示2〇3a， 第二排程112之第四工作係第一工作資訊指示2〇ια。 接著’微處理器13將第一排程11〇、第二排程η]、第一等候 參數201b以及第二等候參數203b傳送至計算單元15。計算單元 15將根據第一排程11〇、第二排程112、第一等候參數2〇ib、第 二等候參數203b、第-車輛位置資訊201c、第二車輛位置資訊2〇3c 以及堆棧設備位置資訊2Ua分別計算第一難u〇之第一總作業 時間H4以及第二排程112之第二總作業時間丨‘為冑楚:述計 算單元15之計算過程，以下將以英文代碼及數學式表示計算單元 15之計算過程，且於本實施例中，各相值皆為相對於—時間: 201140474 點之相對時間值。 首先，計算單元15枳μ你 * ., 根據第一車輛位置資訊201c以及第一排程 110之第一工作’即「第—車輛201裝載第二貨櫃217」，計算第 一車輛201之第一移動 t算第 動時間Vpi，ni，其中V代表移動時間，P1 _ 排程UG ’ Nl代表第—排程110之第-工作N卜且體 =第—-車^位置資訊脈為貨櫃場2之人口座標，第一排程 卫作為「第一車輛2〇1裝載第二貨植217」，而當第一 車輛2〇1欲裝载第二貨櫃217,則第一車鲕2m & 置213。 單輛201必須移動至作業位 於本實施例中，-車輛由貨#場2之入 φ η* λ λλ. _ 移動至作業位置213 Π 計算單元15根據第—車輛位置資訊⑽以及 第一排程1Η)之第一工作N1，計算 乂及 間Vpum=3。須特別說明者 之第一移動時 據-杳表方式w 例中，車輛之移動時間係根 -表方式作而得，但於其它實 可依據其它料計算而得之，故在此不再㈣車輛之移動時間亦 接著’計算單元15根據公式⑴計算—車她達時間：201140474 6. Technical Description: The present invention relates to a management system, a management method and a computer program product thereof; more particularly, the present invention relates to a plurality of vehicles for scheduling a container yard And a management system, a management method, and a computer program product of at least one stacking device. [Prior Art] In recent years, as automation systems have become more mature, their application in modern daily life has become more and more extensive, for example, It is used for automated management of logistics, leisure and competition to improve overall operational efficiency and reduce manpower requirements. At present, the common container yards are usually managed by means of human security operations. For example, when the container truck arrives at the container yard, the operator will be handed over (four)/collective _ single to the operator of the field. The machinery and equipment directly carries out the operations of unloading containers and picking up containers according to the unloading plant/container container list. The more advanced container yards belonging to large ports are usually managed by means of automated operation. For example, container yards with automated stacking equipment can be pre-loaded with unloading counters/container information and various information. When the container truck arrives at the cargo yard with the automatic stacker equipment, the operator of the container yard only needs to identify the single number of the unloading container/collecting container list of the container truck and can then hand over the automated stacking equipment to the unloading container/collector Homework. However, the manual operation/automated operation of the cargo yard described in the preceding paragraph does not have the essence of the business schedule, that is, the optimization of the overall operation time of the container yard is not considered. Specifically, 'whether it is manual work or automation, f (4) unloading fM/removing work of the car, knowing the principle of first-in-first-out operation, that is, the container that arrives first after the container truck advanced 201140474 The car needs to wait for the first arrival of the goods to complete the operation before the operation can be carried out. As a result, unnecessary waiting time for each container truck will be caused, and the overall operation time of the container yard will be extended. In addition, the manual/automated operation of the container yards mentioned in the preceding paragraph fails to consider the priority of unloading/removal of high priority containers (eg frozen containers). In summary, how to provide a management system that can reduce the overall operating time of the container yard and prioritize different priority containers without significantly increasing the operating cost of the container yard to provide an optimized schedule. The vehicles in the container yard and the stacking equipment can be moved according to the selected optimized schedule, which is still the goal that the industry has to work hard to achieve. SUMMARY OF THE INVENTION One object of the present invention is to provide a management system for a container yard. The management system is for scheduling movement of a plurality of vehicles of the container yard and at least one stacking device, and includes an input device, a transmission interface, a microprocessor, and a computing unit. Each of the vehicles includes a positioning device. The transmission interface of the management system is electrically connected to each of the positioning devices of the vehicle and the at least one stacking device. The microprocessor of the management system is electrically coupled to the input device. The computing unit of the management system is electrically coupled to the microprocessor and the transmission interface. Specifically, the input device is configured to receive a plurality of work instruction assets of the vehicles. The transmission interface is configured to receive vehicle location information of each of the vehicles and at least one stack device location information. The microprocessor generates a plurality of schedules based on the work instruction information. The calculation unit calculates a total operation time of each of the schedules according to the vehicle location information of each of the vehicles and the at least—stack device location information. Finally, the micro 5 201140474 processor selects according to the total operation time of each schedule. One of the schedules, and the selected one of the schedules is transmitted to each of the vehicles and the at least one stacking device by the transport interface, the plurality of vehicles of the container yard and the at least one stacking device being selected according to The schedule moves. Another object of the present invention is to provide a management method for a container yard. The management method schedules movement of a plurality of vehicles of the container yard and at least one stacking device by a management system. Each of the vehicles includes a positioning device. The management system includes an input device, a transmission interface, a microprocessor, and a computing unit. The transmission interface of the management system is electrically connected to each of the positioning devices of the vehicle and the at least one stack device. The microprocessor is electrically connected to the input device. The computing unit is electrically coupled to the microprocessor and the transmission interface. The management method includes the steps of: receiving, by the input device, a plurality of work instruction information of the vehicles; and causing the transmission interface to receive vehicle location information of each of the vehicles and at least one stack device location information; The work instruction information generates a plurality of schedules; the calculation unit calculates a total operation time of each of the schedules according to the vehicle location information of each of the vehicles and the at least one stack device location information; Selecting one of the schedules for the total work time of the schedule; and transmitting the schedule to which the transport interface is to be selected to each of the vehicles and the at least one stacking device, the plurality of vehicles of the container yard, and the at least A stack device moves according to the schedule selected. It is still another object of the present invention to provide a computer program product in which a program for managing a container yard is stored. When the program is loaded into the management system, the management method applicable to the container yard described in the preceding paragraph can be executed and completed. In summary, the present invention generates a plurality of schedules by means of work instruction information for a plurality of vehicles in a container yard. Then, based on the vehicle location information of each of the aforementioned vehicles and the stack device location information of the stack device, one of the total schedules of each schedule is calculated, and one of the schedules is selected according to the total operation time of each of the schedules described above. Finally, the selected schedule is transmitted to each of the aforementioned vehicles and the stacking device, and the plurality of vehicles and stacking devices of the container yard are moved according to the selected schedule, so that the container yard can be effectively reduced. The overall working time, and at the same time effectively solve the problems caused by the priority order of different priority containers. Other objects, advantages, and technical means and embodiments of the present invention will become apparent to those skilled in the <RTIgt; The present invention will be explained by way of examples, and the embodiments of the present invention are not intended to limit the invention to any specific environment, application or special mode as described in the embodiments. Therefore, the description of the embodiments is merely illustrative of the invention and is not intended to limit the invention. It should be noted that in the following embodiments and drawings, components that are not directly related to the present invention have been omitted and are not shown; and the dimensional relationships between the components in the drawings are merely for ease of understanding and are not intended to limit the actual ratio. The first embodiment of the present invention is shown in Figs. 1 and 2 . Figure 1 is a schematic diagram of a management system 1 for one of the container yards; and Figure 2 is a schematic view of the aforementioned container yard 2. The management system 1 includes an input device 11, a microprocessor 13, a computing unit 15, and a transmission interface 17. The microprocessor 13 is electrically connected to the input device 11; the computing unit 15 is electrically connected to the microprocessor 13 and the transmission interface 17. 201140474 Container yard 2 includes a plurality of vehicles 201, 203, a storage area 21, a stacking device 211, a working position 213, and a plurality of containers 215, 217. For the sake of simplicity, in the present embodiment, the plurality of vehicles 201, 203 are a first vehicle 201 and a second vehicle 203, each of which includes a positioning device (not shown); the plurality of containers 215, 217 are a first container 215 and a second container 217. The transmission interface 17 of the management system 1 is electrically connected to the positioning device of the first vehicle 201 and the positioning device of the second vehicle 203 in a wireless manner, and is electrically connected to the stack device 211 in one of a wired manner and a wireless manner. After the first vehicle 201 and the second vehicle 203 arrive at the container yard 2, the input device 11 will receive the first work instruction information 201a of the first vehicle 201, the first waiting parameter 201b of the first vehicle 201, and the second vehicle 203. One of the second work instruction information 203a and the second waiting parameter 203b of the second vehicle 203, and transmits the first work instruction information 201a, the first waiting parameter 201b, the second work instruction information 203a, and the second waiting parameter 203b to Microprocessor 13. The transmission interface 17 receives the first vehicle location information 201c of the first vehicle 201 by the positioning device of the first vehicle 201; the second vehicle location information 203c of the second vehicle 203 is received by the positioning device of the second vehicle 203; A stack device location information 211a is received by the stack device 211, and the first vehicle location information 201c, the second vehicle location information 203c, and the stack device location information 211a are transmitted to the computing unit 15. The microprocessor 13 generates a first schedule 110 and a second schedule 112 according to the first work instruction information 201a and the second work instruction information 203a, wherein the first schedule 110 has the first sequence arranged in a first sequence. The work instruction information (ie, the order is 201140474, the work instruction information 201a and the second work instruction information 2〇3a), and the second schedule 112 has the work instruction information arranged in a second sequence (ie, the order is the second work) The indication information 203a and the first work instruction information 20U) 'The microprocessor 13 then transmits the first schedule 110, the second schedule U2, the first waiting parameter 2〇1b, and the second waiting parameter 203b to the calculation unit 15. Next, the calculating unit 15 respectively according to the first vehicle location information 201c, the second vehicle location information 203c, and the first-scheduled U〇 (the first-scheduled work instruction information 20U and the second work instruction information 2〇3a arranged in the first sequence) Calculating the first moving time of the first vehicle buckle 1 and the second moving time of the second vehicle 203, and according to the stacking position information 211 and the first scheduling 11〇 (the first working instruction information arranged in the first sequence) The second I is used to indicate the information (10)) the calculation - the first stack is set to the time meal, the calculation unit 15 is based on the first car request - the moving time, - the second moving time of the vehicle 203, and the first stacking device working time One of the first total operating hours 114 of one of the schedules 110 is counted. Subsequently, the calculation of the single magic 5 is based on the first-vehicle position, the second vehicle information 203C, and the second schedule 112 (the second-order swollen money 33 and the first work instruction information coffee arranged in the second sequence) Calculating a second vehicle _2 second moving time and a fourth moving time device position information 211 and a second scheduling 112 of the first vehicle 2〇1 respectively (using the second sequence of data indicating the information chest and the first working instruction) f) Wei) calculation - the second work time. Finally, the calculation unit 15 is based on the second vehicle plus the stack device as the first - vehicle 2 (the fourth movement time of H and the second stacker - movement time, The second schedule 112 - the second total work time 116. & "Day Interim Calculation 9 201140474 When the calculation unit 15 calculates the first total work time 114 and the second total work time Π 6, the first total work time U4 and the second total operating time lb are transmitted to the microprocessor 13. The microprocessor 13 compares the first total operating time 114 with the second total operating time 116 while selecting the first scheduling 110 and the second scheduling based on the comparison result. One of H2 and will be selected for scheduling 18 is transferred to the transmission interface. Finally, the transmission medium 17 transmits the selected schedule 118 to the first vehicle 2(1), the second vehicle 203, and the stack injury 211, respectively, so that the first handle 2G is the second vehicle 203. And the stacking device 2 moves according to the selected schedule 118. The special (four) person 'when the input device u receives n jobs of a plurality of vehicles is not eligible, the micro-processing H 13 will work according to the aforementioned n Refers to (8) schedules, and the above-mentioned continuation (8) schedules will contain no. For example, when a vehicle enters the container yard, if the vehicle is loaded, it is necessary to load the vehicle first. If the goods are unloaded, another goods report can be taken and loaded onto the vehicle. Accordingly, the n-th order (n!) ages may be == one container is first taken and loaded to the handle; If the vehicle is installed in such a way that it is impossible to achieve the schedule, in order to avoid, : ^ select - can not be real, the micro (four) 13 will pre-empt the "distributed schedule" in advance - only the achievable row Go to the calculation unit 15, and finally pass through the micro-processing H 13 according to the foregoing Configurable schedule 2 - optimal and achievable schedule. The following is an example of the management system in the embodiment of the present invention. The second cargo plant 2, the second car, the second vehicle = the second: the vehicle day information 203a 201140474 is the "second vehicle 203 loading the first container 215." The input device 11 receives the first work instruction information 201a, the first waiting After the parameter 201b, the second work instruction information 203a, and the second waiting parameter 203b, it is transmitted to the microprocessor 13. At the same time, the transmission interface 17 receives the first vehicle position information 201c of the first vehicle 201 and the second vehicle 203. A second vehicle position information 2〇3c and stack device position information 211a are transmitted to the calculation unit 15. Then, the microprocessor 13 generates a first schedule ι 10 and a second schedule 根据 12 according to the first work instruction information 201a and the second work instruction information 203a. The first schedule 110 has work instruction information 2〇la, 2〇3a arranged in a first sequence; the second schedule 112 has work instruction information 2〇la, 2〇3a arranged in a second sequence. In detail, the first schedule 110 has a first work and a second work, and the first work of the first schedule 110 is the first work information indication 201 a, and the first work schedule is 11 Second work information indication 203a; second schedule 112 has a third work and a fourth work, and the third work of the second schedule 112 is the second work information indicating 2〇3a, the fourth work of the second schedule 112 The first work information indicates 2〇ια. Next, the microprocessor 13 transmits the first schedule 11 〇, the second schedule η], the first waiting parameter 201b, and the second waiting parameter 203b to the calculation unit 15. The calculation unit 15 will according to the first schedule 11〇, the second schedule 112, the first waiting parameter 2〇ib, the second waiting parameter 203b, the first-vehicle position information 201c, the second vehicle position information 2〇3c, and the stacking device. The location information 2Ua calculates the first total working time H4 of the first difficulty and the second total working time 第二' of the second scheduling 112 respectively: the calculation process of the calculating unit 15, the following will be in English code and mathematics The equation represents the calculation process of the calculation unit 15, and in this embodiment, each phase value is a relative time value relative to the time: 201140474 point. First, the calculating unit 15枳μ*., according to the first vehicle position information 201c and the first work of the first schedule 110, that is, the “the first vehicle 201 loads the second container 217”, calculates the first of the first vehicle 201. Move t to calculate the first moving time Vpi,ni, where V represents the moving time, P1 _ scheduling UG ' Nl represents the first-ranking of the first-ranking 110 and the body = the first - the car position information pulse for the container yard 2 The population coordinates, the first row of Guards as "the first vehicle 2 〇 1 loading the second cargo 217", and when the first vehicle 2 〇 1 wants to load the second container 217, the first rut 2m & 213. The single unit 201 must be moved to the work in the present embodiment, the vehicle is moved from the cargo # field 2 into φ η* λ λλ. _ to the work position 213 Π the calculation unit 15 is based on the first vehicle position information (10) and the first schedule 1Η) The first work N1, calculate 乂 and Vpum=3. In the case of the first movement, the movement time of the vehicle is obtained from the root-table method, but it can be calculated based on other materials, so it is no longer here (4). The movement time of the vehicle is also followed by the calculation unit 15 calculating according to the formula (1).
A=Ek+V A . (1) 、中，A代表一車輛抵達時間，k 車輪之累#作時間。於本實施例中，代表第k 工作時間為〇,因此E,=〇。隨後，叶算單第f車輛201目前之累計 一車辆-於第一排程U0之第工^15根據公式⑴計算第 ApW=E1+Vpi>Nl=Q+3=3 β N1 中’車輛抵達時間 12 201140474 接著，計算單元15根據公式(2)計算-堆棧設備作業時間： T=Lm+Lg+max(A,Tm) 其中，τ代表堆棧設備作業時間，Lm代表—堆棧設備之移動時 間’ Lg代表—堆棧設備之升降時間，^代表一儲區之作業完成時 間。於本實施例中，堆棧設備211由啟始位置移動至第二貨樞川 之位置的時間為5分鐘，因此，堆機設備2ιι取用第二 貨櫃217之升降時間為2分鐘’因此W=2，儲區21目前無執 仃中之作業’因此Tm=Ge隨後，計算單元15根據公式⑺計 一排程 110 之笫一 丁从 λτ1 丁 _ 第工作N1之堆棧設備作業時間 接著，計算單元15根據公式⑺計算—累計等候時間： WNi=WN(i.1)+(T-Ek)xCk (3) C 表第1卫作’〜代表完成第；卫作之累計等候時間， 2表讀參數，k代表第k車輛。於本實_中， Γ〇一 ΓΓ數為卜即^1，累計等候時間之初始值為〇,即 工0作後，計算單元15根據公式⑶計算第-排程110之第一 丨：。…計等候時間〜一〜·。,娜· 接著，計算單元15根據公式⑷計算—累計作業時間：A=Ek+V A . (1) , medium, A represents the arrival time of a vehicle, and the accumulation of k wheels is time. In this embodiment, it represents that the kth working time is 〇, so E, =〇. Subsequently, the leaf count f vehicle 201 currently accumulates a vehicle - the first work of the first schedule U0 ^ 15 calculates the first ApW = E1 + Vpi > Nl = Q + 3 = 3 β N1 'vehicle according to formula (1) Arrival time 12 201140474 Next, the calculation unit 15 calculates the stacking device working time according to the formula (2): T=Lm+Lg+max(A, Tm) where τ represents the stacking device working time and Lm represents the stacking device moving time. 'Lg stands for the lifting time of the stacking device, and ^ represents the job completion time of a storage area. In the present embodiment, the time for the stacking device 211 to move from the starting position to the second cargo hub is 5 minutes. Therefore, the stacking device 2 ιι takes the second container 217 for 2 minutes. Therefore, W= 2. The storage area 21 is currently not in operation. Therefore, the Tm=Ge is subsequently calculated by the calculation unit 15 according to the formula (7). The stacking unit 110 is 从 从 λ τ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 15 Calculated according to formula (7) - cumulative waiting time: WNi=WN(i.1)+(T-Ek)xCk (3) C Table 1st Guardian '~ represents completion; cumulative waiting time for guards, 2 reading The parameter, k represents the kth vehicle. In the present embodiment, the first parameter is 卜, that is, the initial value of the accumulated waiting time is 〇, that is, after the job 0 is performed, the calculating unit 15 calculates the first 丨: of the first schedule 110 according to the formula (3). ...the waiting time ~ one ~. , Na · Next, the calculation unit 15 calculates according to the formula (4) - cumulative work time:
S (4)S (4)
Ni=max(SN(i.I)}T) 其中’ 1代表第i工作，s代士 代表70成第1工作之累計作業時間。 於本實施财，料料相 作業時間 始值為0，即S〇=〇。隨後，計 13 201140474 j 算單元15根據公式⑷計算第一排程n〇之第— 業時間 SP1，Ni=max(S〇，Tpi分max(〇 i〇)=i〇。 之累計^ = ⑽之後，計算單元^將 第輛201之累計工作時間&更新為累計作業 值，即_，同時_區21之作^ 時間SPI，N1之值，即Tm,。 阳更新為累计作業 當第一排程11〇之笸―τ从XT1 m 作N1之累計等候時間w 作業時間Sp丨川計算6 ％ _ P丨，N丨以及累计 丫算凡成之後，計算單元15接著 之第二工作N2之累舛犛値拄門w 第排耘110 相時間Wpi，N2以及累計作業BU1SP1,N2。 f算單兀15將根據第二車辅位置資訊加。以及 之第二工作，即「第_ 排程110 第一車輛203裝載第一貨櫃21 輛203之第二移動時 冲算第一車 秒動時間VP1，N2’N2代表第一排程u N2。於本實施例中， 第一工作 標，車•由貨櫃場入:Γ 訊2°3c為—貨櫃場之八口座 w貝很％入口移動至作業位置 算單元15根據第-由匕“直13需時3分鐘，因此計 象第一車輛位置資訊2〇3c 工作N2,計算宽_由± 次弟排程110之第二 卞算第一車輛203之移動時間Vn,N2=3。 接者，計算單元ls根據公 11〇之第二工作± Η异第一車輛203於第—排程 之車輛抵達時間，於本實施例中第_ 目前之累計I作_ A n 輪2〇3 作時間為0，因此E2=〇 ,車 AP1，N2=E2+VP丨,N2=:〇+3=3。 -達時間 隨後，計算單元15根據公式(2) N2之堆桡畔供从 掛狂第二工作 °備作業時間’於本實施例中’堆機設備211由第 201140474 櫃217之位置移動至第一貨櫃215之位置的時間為3分鐘，因此 1^，1>1，犯=3’堆棧設備211取用第一貨櫃215之升降時間為2分鐘， 因此Lg，P1，N2=2，儲區21執行完第一排程11〇之第一工作ni之作 業時間為10 ，因此Tm=i〇 ，堆棧設備作業時間 TP1’N2=Lm，p,，N2+Lg，pi 犯他叫〜丨 N2，Tm)=3+2+腿叩，1〇片5。 計算單幻5更根據公式(3)計算第一排程11〇之第二Ni=max(SN(i.I)}T) where '1 represents the i-th work and s represents the cumulative work time of 70% of the first job. In this implementation, the starting time of the material phase operation time is 0, that is, S〇=〇. Subsequently, the calculation unit 13 201140474 j calculates the first business time SP1 of the first schedule n〇 according to formula (4), Ni=max (S〇, Tpi points max(〇i〇)=i〇. The cumulative ^ = (10) After that, the calculating unit ^ updates the accumulated working time & of the first 201 to the accumulated working value, that is, _, and the value of the time SPI, N1, that is, Tm, is the first time of the cumulative operation. 〇 〇 笸 τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ Tired door w The first row 耘 110 phase time Wpi, N2 and the cumulative operation BU1SP1, N2. The f calculation unit 15 will be added according to the second vehicle auxiliary position information, and the second work, that is, "the _ scheduling 110. The first vehicle 203 loads the first container 21 and the second movement of the vehicle 203 calculates the first vehicle second time VP1, and N2'N2 represents the first schedule u N2. In this embodiment, the first working standard, the vehicle • From the container yard: 2 2°3c is the container bay of the eight-seat w bay. The entrance is moved to the working position calculation unit 15 according to the 13 takes 3 minutes, so the first vehicle position information 2〇3c works N2, and the calculation width _ is calculated by the second calculation of the second child schedule 110. The movement time Vn of the first vehicle 203 is N2=3. The calculation unit ls according to the second work of the public ± Η 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一 第一It is 0, so E2=〇, car AP1, N2=E2+VP丨, N2=:〇+3=3. - After the time, the calculation unit 15 is based on the formula (2) N2 In the present embodiment, the time when the stacker device 211 is moved from the position of the 201140474 cabinet 217 to the position of the first container 215 is 3 minutes, so 1^, 1>1, commit = 3' The lifting time of the first container 215 by the stacking device 211 is 2 minutes, so Lg, P1, N2=2, and the working time of the first working of the storage area 21 after executing the first scheduling 11 is 10, so Tm= I〇, stack device operation time TP1'N2=Lm,p,,N2+Lg,pi is called him~丨N2, Tm)=3+2+ leg 叩, 1 55. Calculate the single magic 5 and calculate the second of the first schedule according to formula (3)
二=。=”，第二一第二心 時門為1" 一排程U〇之第一工作N1之累計等候 時間格，累計等候時料 xC2=10+(l5_0)xl=25。 ，ni (!Pi,N2-E2)Two =. =", the second and second heart time gates are 1" the cumulative waiting time of the first job N1 of a schedule U〇, the cumulative waiting time is expected to be xC2=10+(l5_0)xl=25. ,ni (!Pi ,N2-E2)
幻升平7L 佩A 叶算第一排程11〇之第二工 累計作業時間，於本實施例中，執行完第—排 2之 N1之累計作業時間^州，累計作業時間s第—工作 丁？1，扪)=111狀（10,丨5)=15。於 Pi.N2~max(sPI Nl> 元15將笛& 、°十算出累計作業時間^2後，計笪留 兀15將第二車輛203之累計 ，2俊冲算車 s⑽之值，即E2=15，以及 a 2更新為累計作業時間 累計作業時間SPI，N2之值1 τ ^ 1之作業完成時間L更新為 最後’計算單元15根據 飞（5)叶算一總作業時間：The magical Shengping 7L Pei A leaves counts the second work cumulative operation time of the first schedule 11〇, in this embodiment, the cumulative operation time of the N1 of the first row 2 is performed, the cumulative operation time s is the first work ? 1, 扪) = 1111 (10, 丨 5) = 15. After Pi.N2~max(sPI Nl> element 15 calculates the accumulated operation time ^2 from the flute & °, ten, the accumulation of the second vehicle 203 is calculated, and the value of the second vehicle s (10) is E2=15, and a 2 is updated to the accumulated work time cumulative work time SPI, and the job completion time L of the value 1 τ ^ 1 of N2 is updated to the last 'calculation unit 15 calculates a total operation time according to the fly (5) leaf:
Xj=WNi+sN. 其幻代表帛遍㈣彳 （5) 累計等候時間㈣之第二卫作N2後， 110之第-總作業時間Xi, P1’Nr~15’因此第-排程 pi.N2 SP1,N2=25+15=40 〇 15 201140474 當計算單元is計算完第 計算單 ^程U0之第一總作業時間144後， 早疋15以相同方式斗贫& 146，第1 式°十算第二排程112之第二總作業時間 弟一排程112具有第— 作資处Μ 冑L工作以及第四工作，第三工作係為工 F貝。μ日不203a，即「筮-* ± 工作, 第—車辆2G3裝載第—貨櫃2!5」，第四 作係為工作資訊指示2〇 217 ,〇 即第一車輛2〇1裝載第二貨櫃 首先’計算單元15根據笛_ 112之笛— 第—車輛位置資訊203c以及第二排系 4第三工作N3，計算笫_Xj=WNi+sN. Its magical representation 帛 ( (4) 彳 (5) Cumulative waiting time (four) after the second guard N2, 110 of the first - total working time Xi, P1 'Nr ~ 15 ' therefore the first - scheduling pi. N2 SP1, N2=25+15=40 〇15 201140474 When the calculation unit is calculated the first total working time 144 of the first calculation unit U0, the early 15 is in the same way as the poor & 146, the first type ° The second total operation time of the second schedule 112 is 112. The first work 112 has the first work and the fourth work, and the third work is the work F. μ day is not 203a, that is, "筮-* ± work, the first - vehicle 2G3 loading the first container - 2! 5", the fourth work is the work information indication 2〇217, that is, the first vehicle 2〇1 is loaded with the second The container first calculates the 笫_ according to the flute _ 112 flute - the first vehicle position information 203c and the second row 4 third work N3
接 第一車輛203之第三移動時間VP2,N3=3 接者，叶算單元15根據公 (十算第一車輛203於第二排程u 义 作N3之車輛抵達時間，於本實施例中，第二車輛203 e :之累計工作時間4 〇,因此E2=〇,車柄抵達日“The third movement time VP2, N3=3 of the first vehicle 203 is connected, and the leaf calculation unit 15 calculates the vehicle arrival time of the first vehicle 203 in the second schedule u as N3, in this embodiment. , the second vehicle 203 e: the accumulated working time is 4 〇, so E2 = 〇, the handle arrival date "
Ap2,m=E2+vP2,N3=〇+3=3。 計算單元！5更根據公式⑺計算第二排程112之第三工作犯之 堆拽設備作業時間，於本實施例中，堆機設備2ιι由啟始位置移 動至第—貨櫃215之位置的時間為2分鐘，因此^ N3=2，堆機 设備2U取用第一貨櫃215之升降時間為2分鐘，因此Lg，P2,N3=2。 严由於儲區21目前無執行中之作業，因此Tm=()，堆機設備作業時 間 Τρ2,Ν3=Ι^，Ρ2,Ν3+Ι^，Ρ2，Ν3+_(Αρ2 N3，Tm)=2+2+max(3,〇)=7。 β十算單tl 15根據公式（3)計算第二排程112之第三工作N3之累 。十等候時間，於本實施例中，第二車輛2〇3之第二等候參數為1 j 即C2=l，累計等候時間之初始值為〇，即w〇=〇，累計等候時間 WP2，N3=W〇+(TP2，N3-E2)xC2=0+(7-0)xl=7。 汁算單元15根據公式（4)計算第二排程丨〗2之第三工作N3之累 16 201140474 業時間t中)，作業時間之初始值為0，累計作 sP2，N3後，計算單元二。於計算出累計作業時間 累計作業時間s 車柄203之累計工作時間e2更新為 P2，N3之值，即p —1 間L更新為累計作_ 2' ’以及將儲區21之作業完成時 τ忭菜時間SP2，N3之值，即Tm=7。 於5十算完第二排程112之第： 及累計作業時間s 二工作N3之累計等候時間wP2,N3 第四工作’叶算單元15接著計算第二排程112之 、。候時間Wp2，N4及累計作業時間SP2，N4。 首先’計算單元15根據第 夕筮 旱輛位置資§fL 201c以及第二拙鉬 ⑴之第四工作⑽，計算第 弟-排 接著，計, 車輛201之第四移動時間VP2N4=3。 ^指單^根據公式⑴計算第， 程 之第四工作⑽之車辆 第-排程U2 前之累計工作時間為〇，：Γ: ’鱼01目 A-.-=Ei+VP2iN4=〇+3=3 〇 1 ，車輛抵達時間 棧元15根據公式(2)計算第：排程112之第四工作N4之堆 棧6又備作業時間，於本m π ^ 之位置移動至第1桶217 備由第一貨植215 •/王乐一；^櫃217之位署沾主Ap2, m=E2+vP2, N3=〇+3=3. Calculation unit! 5 further calculating the stacking device operation time of the third work of the second schedule 112 according to the formula (7). In the embodiment, the stacker device 2 is moved from the start position to the position of the first container 215 for 2 minutes. Therefore, ^ N3 = 2, the stacking machine 2U takes the first container 215 for 2 minutes, so Lg, P2, N3 = 2. Strictly, since the storage area 21 currently has no operations in progress, Tm=(), stacker equipment operation time Τρ2, Ν3=Ι^, Ρ2, Ν3+Ι^, Ρ2, Ν3+_(Αρ2 N3, Tm)=2 +2+max(3,〇)=7. The β-th order t15 calculates the fatigue of the third work N3 of the second schedule 112 according to the formula (3). Ten waiting time, in this embodiment, the second waiting parameter of the second vehicle 2〇3 is 1 j, that is, C2=l, and the initial value of the accumulated waiting time is 〇, that is, w〇=〇, cumulative waiting time WP2, N3 =W〇+(TP2,N3-E2)xC2=0+(7-0)xl=7. The juice calculation unit 15 calculates the third work N3 of the second schedule 丨2 according to formula (4) 16 201140474 industry time t), the initial value of the work time is 0, and after the cumulative operation is sP2, N3, the calculation unit 2 . In the calculation of the accumulated work time cumulative work time s, the accumulated work time e2 of the handle 203 is updated to the value of P2, N3, that is, the interval between the p-1 and the L is updated to the cumulative work _ 2' ' and the work of the storage area 21 is completed τ The value of amaranth time SP2, N3, ie Tm=7. After the fifth schedule 112 is completed: and the accumulated work time s is the cumulative waiting time wP2 of the work N3, and the N3 fourth work unit 14 then calculates the second schedule 112. Waiting time Wp2, N4 and accumulated working time SP2, N4. First, the calculation unit 15 calculates the fourth-time movement time VP2N4=3 of the vehicle 201 based on the 第fL 201c and the fourth operation (10) of the second 拙mo (1). ^ refers to the single ^ according to the formula (1) calculation, the fourth working of the fourth work (10) of the vehicle before the scheduled work time of U2 is 〇,: Γ: '鱼01目 A-.-=Ei+VP2iN4=〇+ 3=3 〇1, the vehicle arrival time stack element 15 is calculated according to the formula (2): the stack 6 of the fourth work N4 of the schedule 112 is further prepared for the operation time, and moved to the first bucket 217 at the position of the m π ^ By the first goods 215 • / Wang Leyi; ^ cabinet 217
Lm,P2，N4=3,堆棧設備2U ’、、、/刀鐘’因此 ^^w-2^.21 ； bU2^ 業時間為7，因Γτ 之第三工作奶之作 T m 堆棧设備作業時間 PH m，p2，N4+Lg，p2，N4+max(AP2N4，Tm)=3+2+max(3,7)A。 計算單元！5根據公式(3)計算第二排程112之第四工作 計等候時間，於本實施例中，第一車輛201之第一等候參數為^ 17 201140474 即c,=i，執行完第二排程li2 7，即WP2 -7 g i 第一工作奶之累計等候時間為 ’ Wp2，^7，累計等候時間w 馬 0,=7.(12-0)^=^. WP2>N4-WP2,N3+(Tp2N4,Ei))< 計算單元】5根據公式⑷計算第二排程ιΐ2之第 計作業時間，於太眘尬加士 乍N4之累 州於本實施财，執行完第二排程112 之累計作業時間SP2’N3=7 ，累叶 N3 後，計算單元15將第一車辆2〇1之累計工作時間仏更新= 累計作業時間S一’…，以及將储區21之作業完： 時間Tm更新為累計作業時間s’之值即Vi 、 一最後》十算單π 15根據公式(5)計算一總作業時間，於執行完第 二排程112之第四工作Ν4後，累計等候時間WP2，N4=19，累計作 業時間SP2，N4=12’因此第二排程112之第二總作業時間 X2=WP2,N4+sP2，N4=19+12=31。 於計算出第一總作業時間114及第二總作業時間116後，計算 單^ 15將第—總作業時間114及第二總作業時間U6傳送至微處 理器13。微處理器13將比較第一總作業時間ιΐ4 (即以及第 二總作業時間116 (即31)，並得到第二總作業時間116小於第 -總作業時間114之結果。據此’微處理器13將根據前述之比較 結果選擇第二排程112為被_之排程118，並將闕擇之排程 118傳送至傳輸介面17。 ， 最後’傳輸介面17將被選擇之排程118傳送至第一車輛2〇1、 第二車輛203以及堆棧設備211，俾第一車輛2〇1、第二車輛2〇3 201140474 以及堆棧設備211可根據第二排程112(即以第二序列安排之第二 工作指示資訊203a及第一工作指示資訊201a)移動。 a須特別說明者’㈣參數Ck_以評估第k車柄所對應之貨植 是否優先處理，具體而言，若第k車輛所對應之貨櫃，即第^車 輛所預定裝載或卸載之貨櫃，為一高優先權貨植，例如冷陳貨植， 則該高優先權貨櫃所對應之工作必須愈快被執行， 植場内等候之時間。因此，於計算—排程之總作業時間時:^ •據各個待處理貨櫃之優先程度，設定一第k車輛之等候來數仏之 值，以使管理系統i可據以產生一最佳之排程。 " 為更加突顯等候參數Ck於計算一排程之總作業時間時的影響， =另1卜舉例進行說明。於本實施例中，假設第-貨櫃為-冷 第=貨櫃為一普通貨樞，據此，將預定裝載第-貨櫃之 ::第=之等候參數設為10, 一將預定裝載第二貨 =-車柄201之等候參數設為丨，即c1=1 作業時間m及第二總作業時間116。 算第總 首先針對第-排程UG重新計算第—總作業時間η4，第一排程 之第-工作N1之累計等候時間應修正為w xc,，10_0)xl0=100，第一排程n〇之第二工作(二响 時間應修正為Wp ~ W 之累汁等候 -總作業時：二:Γ:Ε— 巧入| wPI,N2+sP1，N2=115+I5=請。 相同地’針對第二排程112重新計算第二總作 排程112之第三卫作犯之累計等候時間 w第一 xC2=0+(7-0)x1=7 別。（TP2，N3-E2) 排程112之第四Lm, P2, N4=3, stack device 2U ', , , / knife clock 'so ^^w-2^.21 ; bU2^ industry time is 7, because Γτ the third working milk T m stack device Working time PH m, p2, N4 + Lg, p2, N4 + max (AP2N4, Tm) = 3 + 2 + max (3, 7) A. Calculation unit! 5 Calculating the fourth work meter waiting time of the second schedule 112 according to the formula (3). In the embodiment, the first waiting parameter of the first vehicle 201 is ^ 17 201140474, that is, c,=i, and the second row is executed. The cumulative waiting time of the first working milk of process li2 7, WP2 -7 gi is ' Wp2, ^7, cumulative waiting time w horse 0,=7.(12-0)^=^. WP2>N4-WP2,N3+ (Tp2N4, Ei)) < Calculation unit] 5 Calculate the second operation time of the second schedule ιΐ2 according to the formula (4), and execute the second schedule 112 in the implementation of the Taishang 尬 士 乍 乍 N4 The accumulated operation time SP2'N3=7, after the leaf N3, the calculation unit 15 updates the accumulated working time 第一 of the first vehicle 2〇1 = the accumulated operation time S_', and completes the operation of the storage area 21: The time Tm is updated to the value of the accumulated operation time s', that is, Vi, and the last tenth calculation π 15 calculates a total operation time according to the formula (5), and after the execution of the fourth work Ν 4 of the second schedule 112, the cumulative waiting Time WP2, N4 = 19, cumulative work time SP2, N4 = 12' so the second total work time of the second schedule 112 is X2 = WP2, N4 + sP2, N4 = 19 + 12 = 31. After calculating the first total operation time 114 and the second total operation time 116, the calculation unit 15 transmits the first total operation time 114 and the second total operation time U6 to the microprocessor 13. The microprocessor 13 will compare the first total operating time ι 4 (i.e., and the second total operating time 116 (i.e., 31) and obtain a result that the second total operating time 116 is less than the first total operating time 114. Accordingly, the microprocessor 13 will select the second schedule 112 as the scheduled 118 according to the foregoing comparison result, and transmit the selected schedule 118 to the transmission interface 17. Finally, the 'transport interface 17 will transmit the selected schedule 118 to the first The vehicle 2〇1, the second vehicle 203, and the stacking device 211, the first vehicle 2〇1, the second vehicle 2〇3 201140474, and the stacking device 211 may be arranged according to the second schedule 112 (ie, the second sequence is arranged in the second sequence) The work instruction information 203a and the first work instruction information 201a) are moved. a special note '(4) parameter Ck_ is to evaluate whether the plant corresponding to the kth handle is prioritized, specifically, if the kth vehicle corresponds to The container, that is, the container that the vehicle is scheduled to load or unload, is a high priority cargo, such as cold cargo, the faster the work corresponding to the high priority container must be executed, and the waiting time within the plant. Therefore, in the calculation - scheduling During the operation time: ^ • According to the priority of each container to be processed, set the value of the waiting number of the kth vehicle so that the management system i can generate an optimal schedule. " To further highlight the waiting The influence of the parameter Ck on the calculation of the total operation time of a schedule, = another example is explained. In the present embodiment, it is assumed that the first container is - cold number = the container is a general cargo hub, according to which, it will be predetermined The loading of the first container: the first = the waiting parameter is set to 10, the predetermined loading of the second goods = - the waiting parameter of the handle 201 is set to 丨, that is, c1 = 1 working time m and the second total working time 116. The first total calculation time η4 is first calculated for the first-scheduled UG, and the cumulative waiting time of the first-work N1 of the first schedule should be corrected to w xc, 10_0)xl0=100, the first schedule n The second work of the cockroach (the second ringing time should be corrected to the Wp ~ W tired juice waiting - the total operation time: two: Γ: Ε - smart into | wPI, N2+sP1, N2 = 115 + I5 = please. Same as ' The cumulative waiting time for the third defender of the second master schedule 112 is recalculated for the second schedule 112. The first xC2=0+(7-0)x1=7. (TP2, N3 -E2) Fourth of schedule 112
I 201140474 應G 正為 WP2N4=Wp2N3+(Tp2N4_Ei)xCi=7+(l2 〇⑽：⑵，第二總 ^ ^ X2=Wp2,N4+Sp2(N4=127+12=139 〇 ;新十算《灸，根據计算結果可得知第一總作業時帛114係小 於=二總作業時間116,據此，於本實施例中，若第一貨植為= 東貨櫃第一貨櫃為一普通貨櫃，則最佳之排程為第一排程11〇 , 而非第二排程112。 ， 須補充說明者，前段所述之公式⑺係為基於一般貨擓場之安全 ^業原則而進行計算’具體而言，—般貨櫃場基於安全作業之考 量’堆棧設備必需等車輛到達作業位置後才可移動，即堆射備· 與車輛不可同時移動，因而公式⑺係為考量此—安全作業原則而 設計。若-貨櫃場並無此一安全作業之顧慮，即堆棧設備與車輛 可同時移動，則上述之公式⑺應修正為：T= Lg+max(A，Tm+Lm)， 以符合實際之作業情況。 本發明之第二實施例如第3A_3B圖所示，其係為一種用於如第 -實施例所述之管理线之管理方法，該管理线係可用於一如 第-實施例所述之貨櫃場，該管理方法係藉由一管理系統排程該# 貨櫃場之複數個車輛以及至少—堆棧設備之移動，各該車輛包含 -定位設備。詳言之’該管理系統包含—輸人裝置、—傳輸介面、 一微處理器以及-計算單元，該傳輸介面以—無線方式分別電性 連接各該車輛之定位設備，並以一有線方式以及一無線方式其中 之-電性連接該至少-堆棧設備’微處理器係電性連接輸入裝 置，計算單元係電性連接微處理器以及傳輸介面。 此外’第二實施例所描述之管理方法可由—電腦程式產品執 20 201140474 行，當管理系統經由一電腦載入該電腦程式產品並執行該電腦程 式產品所包含之複數個程式指令後，即可完成第二實施例所述之 管理方法。前述之電腦程式產品可儲存於電腦可讀取記錄媒體 中，例如唯讀記憶體（read only memory ; ROM)、快閃記憶體、 軟碟、硬碟、光碟、隨身碟、磁帶、可由網路存取之資料庫或熟 習此項技藝者所習知且具有相同功能之任何其它儲存媒體中。 第二實施例之管理方法包含以下步驟，請先參閱第3A圖，此管 理方法執行步驟3(H，令輸入裝置接收複數個車輛之複數個工作指 示資訊以及各車輛之一等候參數。接著，執行步驟302，令傳輸介 面藉由各車輛之定位設備接收各車輛之一車輛位置資訊並藉由至 少一堆棧設備接收至少一堆棧設備位置資訊。接著，執行步驟 303，令微處理器根據工作指示資訊產生一第一排程以及一第二排 程。 之後，此管理方法執行步驟304,令計算單元根據各車輛之車輛 位置資訊以及以第一序列安排之工作指示資訊計算各車輛之一移 動時間。接著，執行步驟305，令計算單元根據至少一堆棧設備位 置資訊以及以第一序列安排之工作指示資訊計算至少一堆棧設備 作業時間。接著，執行步驟306，令計算單元根據各車輛之移動時 間、至少一堆棧設備作業時間以及等候參數計算第一排程之一第 一總作業時間。 之後，此管理方法執行步驟307，令計算單元根據各車輛之車輛 位置資訊以及以第二序列安排之工作指示資訊計算各車輛之一移 動時間。接著，執行步驟308，令計算單元根據至少一堆棧設備位 21 201140474 置資訊以及以第二序列安排之工作指示資訊計算至少一堆棧<備 作業時間。接著，執行步驟3〇9,令計算單元根據各車輛之移動時 間、至少一堆棧設備作業時間以及等候參數計算第二排程之一第 二總作業時間。 之後，此管理方法執行步驟310,令微處理器比較第—總作業時 間以及第二總作業時間。接著，執行步驟311，令微處理器根據比 較結果選擇第一排程以及第二排程其中之一。最後，執行步驟312 中，令傳輸介面將被選擇之排程傳送至各車輛以及至少一堆機設 備，俾貨櫃場之複數個車輛以及至少一堆棧設備根據被選擇之排 程移動。 除了上述步驟，第二實施例亦能執行第一實施例所描述之操作 及功能’所屬技術領域具有通常知識者可直接瞭解第一實施例如 何基於上述第一實施例以執行此等操作及功能’故不贅述。 綜上所述’本發明係藉由一管理系統與一貨櫃場之複數個車輛 以及至少一堆棧設備電性連接’以接收該等車輛之複數個工作指 示資訊，該管理系統根據該等工作指示資訊產生複數個排程，並 計算各該排程之一總作業時間，以及根據各該排程之總作業時間 選擇該等排程其中之一，最後將被選擇之該排程傳送至各該車輛 以及該至少一堆棧設備，俾該貨櫃場之複數個車輛以及該至少一 堆棧設備根據被選擇之該排程移動，以克服習知技術無法考量貨 櫃場整體作業時間以及貨櫃優先處理之缺點。 上述之實施例僅用來例舉本發明之實施態樣，以及闡釋本發明 之技術特徵，I非用來限制本發明之保護範疇。任何熟悉此技術 22 201140474 者可輕易完成之改變或均等性之安排均屬於本發明所主張之範 圍，本發明之權利保護範圍應以申請專利範圍為準。 【圖式簡單說明】I 201140474 should be G WP2N4=Wp2N3+(Tp2N4_Ei)xCi=7+(l2 〇(10):(2), second total ^ ^ X2=Wp2, N4+Sp2(N4=127+12=139 〇; new ten calculations According to the calculation result, it can be known that the first total operation time 114 is less than the second total operation time 116. Accordingly, in the present embodiment, if the first shipment is = the first container of the east container is a common container, then The best schedule is 11〇 for the first schedule, not for the second schedule 112. It must be added that the formula (7) described in the previous paragraph is based on the safety principle of the general cargo market. In general, the general container yard is based on the consideration of safe operation. The stacking equipment must wait for the vehicle to reach the working position before it can move, that is, the stacking equipment and the vehicle cannot move at the same time. Therefore, formula (7) is designed to consider this principle of safety operation. If the container yard does not have the concern of this safe operation, that is, the stacking device and the vehicle can move at the same time, the above formula (7) should be corrected to: T = Lg + max (A, Tm + Lm), in order to meet the actual operation. The second embodiment of the present invention is shown in FIG. 3A-3B, which is used in a first embodiment. The management method of the management line, which can be used in a container yard as described in the first embodiment, the management method is to schedule a plurality of vehicles of the #9 yard and at least a stacking device by a management system For the movement, each of the vehicles includes a positioning device. In detail, the management system includes an input device, a transmission interface, a microprocessor, and a computing unit, and the transmission interface is electrically connected to each other in a wireless manner. The positioning device of the vehicle is electrically connected to the at least one-stack device' microprocessor-electrically connected input device in a wired manner and in a wireless manner, and the computing unit is electrically connected to the microprocessor and the transmission interface. The management method described in the second embodiment can be executed by the computer program product 20 201140474. When the management system loads the computer program product through a computer and executes a plurality of program instructions included in the computer program product, the The management method described in the second embodiment, wherein the computer program product can be stored in a computer readable recording medium, for example, reading only Read only memory (ROM), flash memory, floppy disk, hard drive, compact disc, flash drive, tape, library accessible by the Internet, or any of the same as those skilled in the art and having the same function In the other storage medium, the management method of the second embodiment includes the following steps. Please refer to FIG. 3A first. The management method performs step 3 (H, and causes the input device to receive a plurality of work instruction information of a plurality of vehicles and one of the vehicles. Waiting for the parameter. Then, step 302 is executed to enable the transmission interface to receive vehicle position information of each vehicle by the positioning device of each vehicle and receive at least one stack device position information by at least one stacking device. Then, step 303 is executed to enable the microprocessor to generate a first schedule and a second schedule according to the work instruction information. Thereafter, the management method executes step 304 to cause the computing unit to calculate the movement time of one of the vehicles based on the vehicle location information of each vehicle and the work instruction information arranged in the first sequence. Next, step 305 is executed to enable the computing unit to calculate at least one stack device operating time based on the at least one stack device location information and the work instruction information arranged in the first sequence. Next, step 306 is executed to enable the calculating unit to calculate one of the first total working hours of the first schedule according to the moving time of each vehicle, the at least one stacking device operating time, and the waiting parameter. Thereafter, the management method executes step 307 to cause the calculation unit to calculate the movement time of one of the vehicles based on the vehicle position information of each vehicle and the work instruction information arranged in the second sequence. Next, step 308 is executed to enable the computing unit to calculate at least one stack < standby time according to at least one stack device bit 21 201140474 and the second sequence of work instruction information. Next, step 3〇9 is executed to cause the calculating unit to calculate one of the second total working hours of the second schedule according to the moving time of each vehicle, the at least one stacking device operating time, and the waiting parameter. Thereafter, the management method performs step 310 to cause the microprocessor to compare the first total operation time with the second total operation time. Next, step 311 is executed to enable the microprocessor to select one of the first schedule and the second schedule according to the comparison result. Finally, in step 312, the transmission interface transmits the selected schedule to each of the vehicles and the at least one stack of equipment, and the plurality of vehicles of the container yard and the at least one stacking device move according to the selected schedule. In addition to the above steps, the second embodiment can also perform the operations and functions described in the first embodiment. Those skilled in the art can directly understand how the first embodiment is based on the above-described first embodiment to perform such operations and functions. 'So I will not repeat them. In summary, the present invention receives a plurality of work instructions for a plurality of vehicles and at least one stack device by a management system to receive a plurality of work instruction information of the vehicles, and the management system according to the work instructions The information generates a plurality of schedules, and calculates a total operation time of each of the schedules, and selects one of the schedules according to the total operation time of each schedule, and finally transmits the selected schedule to each of the schedules. The vehicle and the at least one stacking device, the plurality of vehicles at the container yard and the at least one stacking device are moved according to the selected schedule to overcome the shortcomings of the prior art that the overall operating time of the container yard and the priority handling of the container cannot be considered. The embodiments described above are only intended to illustrate the embodiments of the present invention, and to explain the technical features of the present invention, and I do not limit the scope of protection of the present invention. Any changes or equivalents that can be easily made by those skilled in the art are intended to be within the scope of the invention. The scope of the invention should be determined by the scope of the claims. [Simple description of the map]
第1圖係為本發明第一實施例之管理系統之示意圖； 第2圖係為本發明第一實施例之貨櫃場之示意圖；以及 第3A-3B圖係為本發明第 二實施例之流程圖。 【主要元件符號說明】 1 :管理系統 11 :輸入裝置 110 :第一排程 112 :第二排程 114 :第一總作業時間 116 :第二總作業時間 :選擇之排程 13 :微處理器 15 :計算單元 17 .傳輸介面 2 :貨櫃場 201 .第一車輛 201a :工作指示資訊 201b :等候參數 201c :車輛位置資訊 203 :第二車輛 203a:工作指示資訊 203b :等候參數 203 c.車輛位置資訊 21 :儲區 211 :堆棧設備 211 a :堆棧設備位置資 213 :作業位置 〇1 v 215:第一貨櫃 217 :第二貨榧 231 is a schematic view of a management system according to a first embodiment of the present invention; FIG. 2 is a schematic view of a container yard according to a first embodiment of the present invention; and FIG. 3A-3B is a flow of a second embodiment of the present invention Figure. [Main component symbol description] 1 : Management system 11 : Input device 110 : First schedule 112 : Second schedule 114 : First total operation time 116 : Second total operation time : Selected schedule 13 : Microprocessor 15: calculation unit 17. Transmission interface 2: container yard 201. First vehicle 201a: work instruction information 201b: waiting parameter 201c: vehicle position information 203: second vehicle 203a: work instruction information 203b: waiting parameter 203 c. vehicle position Information 21: Storage area 211: Stacking device 211a: Stacking device position 213: Working position 〇1 v 215: First container 217: Second item 23
Claims (1)
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| TW99114927A TWI408613B (en) | 2010-05-11 | 2010-05-11 | Management system, management method and computer program product thereof |
| ITRM2010A000509A IT1402632B1 (en) | 2010-05-11 | 2010-09-30 | MANAGEMENT SYSTEM, MANAGEMENT METHOD AND PRODUCT OF A COMPUTER PROGRAM |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| TW99114927A TWI408613B (en) | 2010-05-11 | 2010-05-11 | Management system, management method and computer program product thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| TW201140474A true TW201140474A (en) | 2011-11-16 |
| TWI408613B TWI408613B (en) | 2013-09-11 |
Family
ID=43739118
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| TW99114927A TWI408613B (en) | 2010-05-11 | 2010-05-11 | Management system, management method and computer program product thereof |
Country Status (2)
| Country | Link |
|---|---|
| IT (1) | IT1402632B1 (en) |
| TW (1) | TWI408613B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI557659B (en) * | 2015-12-01 | 2016-11-11 | 財團法人工業技術研究院 | Evaluation system and method for logistics distribution efficiency |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6711496B2 (en) * | 2001-11-01 | 2004-03-23 | Jack A. Denton | System and method of monitoring cargo container mobility and efficiency |
| TW200620027A (en) * | 2004-12-10 | 2006-06-16 | Ind Tech Res Inst | Real-time development management system of integrated inland containerization |
| TW200941362A (en) * | 2008-03-21 | 2009-10-01 | Geo Inf Ormatics Inc | System and method for transportation resource management |
-
2010
- 2010-05-11 TW TW99114927A patent/TWI408613B/en active
- 2010-09-30 IT ITRM2010A000509A patent/IT1402632B1/en active
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI557659B (en) * | 2015-12-01 | 2016-11-11 | 財團法人工業技術研究院 | Evaluation system and method for logistics distribution efficiency |
Also Published As
| Publication number | Publication date |
|---|---|
| ITRM20100509A1 (en) | 2011-11-12 |
| IT1402632B1 (en) | 2013-09-13 |
| TWI408613B (en) | 2013-09-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102573892B1 (en) | Conveyor Adjustment in Automated Systems | |
| AU2019273336A1 (en) | Order processing method and device, server, and storage medium | |
| CN107153940A (en) | Order processing method and apparatus | |
| JP2020181282A (en) | Transportation planning device, transportation planning system, and transportation planning method | |
| BRPI0708917A2 (en) | asynchronous failure handling in process-centric programs | |
| WO2021137924A1 (en) | Improved asset loading system | |
| WO2019231996A1 (en) | Systems and methods for improving packaging and delivery of products in association with travel | |
| CN112700177A (en) | Warehouse selection method and device for transporting transportation center and storage medium | |
| WO2017072611A2 (en) | Freight capacity maximization system | |
| Marković et al. | Dispatching trucks for drayage operations | |
| CN113807759A (en) | Deep learning-based freight rate determination method and device | |
| TW201140474A (en) | Management system, management method and computer program product thereof | |
| Ou et al. | Scheduling truck arrivals at an air cargo terminal | |
| US20220405697A1 (en) | Systems And Methods For Dynamic Management Of Consolidation Orders | |
| Abu Salem et al. | Impact of Figures of Merit Selection on Hybrid–Electric Regional Aircraft Design and Performance Analysis | |
| CN116307573B (en) | Green energy-saving treatment method, equipment and medium for building site materials | |
| CN103679409A (en) | Automation method for warehouse management | |
| EP3583569B1 (en) | Vending system and method of automatically vending | |
| Truong et al. | A General Overview of Overhead Multi-Station Multi-Shuttle Systems and the Innovative Applications Trend in Vietnam | |
| Yan et al. | Simultaneous batch splitting and scheduling on identical parallel production lines | |
| JP2015117097A (en) | Delivery registration system, radio reader, and registration method | |
| Chen et al. | An Adaptive Large Neighborhood Search Algorithm for Equipment Scheduling in the Railway Yard of an Automated Container Terminal | |
| JP2005194103A (en) | Sorting support device | |
| Zhongyue et al. | Vehicle routing problem based on object-oriented discrete event simulation | |
| CN113822614A (en) | Method and device for providing delivery service based on loading and unloading site state |