地理資訊系統的應用技術目前已經到了十分成熟的階段,不論在軍事、地理研究、城鄉規劃或是生活中的駕駛活動等也已見到它的出現。在運輸成本佔很大比例的物流系統中,能否結合學術上的途程理論和先進的資訊科技來降低企業成本、提高收益與增加競爭力,是產學界所共同努力追求的目標。本研究之目的在應用一般車輛途程問題模式於一結合地理資訊系統與資料庫的路徑規劃系統,使用者能利用此一系統透過地理資訊系統規劃、儲存所需之需求點資料。所提出之新啟發式演算法利用節省法來建構初始途程,以途程間交換和途程間插入法來定義兩個循序使用的禁制搜尋法,最後使用包含三種鄰近解搜尋方式的途程內下降法來求得近似最佳解。此演算法在穩健的參數設計下,和以往文獻中13題例題之最佳解做比較,平均誤差率為3.24%;且進行需求點數量為1000的途程規劃時,需時387秒。未來之後續研究亦在本文中提出。
Nowadays, geographic information system (GIS) is widely used in military, geography, urban planning and development and daily driving. To reduce the cost, raise the benefit and increase the competitive ability with integrating academic theorey and advanced information technology is the common target of both academia and in practice. The aim of this thesis was to develop an application framework which integrated general vehicle routing problem module with geographic information system and database so that users could plan and store the nodes information in routing planning. A new algorithm with saving algorithm, two consecutive tabu searches and inner-route descent method was implemented which needed 387 seconds to execute a test problem with 1,000 nodes. Computational results were reported with an average errror percentage of 3.24% on a sample of thirteen bench mark test problems from the literature. Further researches was also reported in this study.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。