請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/73903
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 陳柏華 | |
dc.contributor.author | Yu-Chun Lin | en |
dc.contributor.author | 林俞君 | zh_TW |
dc.date.accessioned | 2021-06-17T08:13:18Z | - |
dc.date.available | 2021-08-28 | |
dc.date.copyright | 2019-08-28 | |
dc.date.issued | 2019 | |
dc.date.submitted | 2019-08-15 | |
dc.identifier.citation | [1] B. Choubane, J. Sevearance, C. Holzschuher, J. Fletcher, and C. (Ross) Wang, “Development and Implementation of a Pavement Marking Management System in Florida,” Transportation Research Record, 2018.
[2] C. Holzschuher, B. Choubane, J. Fletcher, J. Sevearance, and H. S. Lee, “Repeatability of Mobile Retroreflectometer Unit for Measurement of Pavement Markings,” Transp. Res. Rec. J. Transp. Res. Board, 2010. [3] B. Choubane, J. Sevearance, H. S. Lee, P. Upshaw, and J. Fletcher, “Repeatability and Reproducibility of Mobile Retroreflectivity Units for Measurement of Pavement Markings,” Transp. Res. Rec. J. Transp. Res. Board, 2013. [4] G. B. Dantzig and J. H. Ramser, “The Truck Dispatching Problem,” Manage. Sci., 2008. [5] R. V. Kulkarni and P. R. Bhave, “Integer programming formulations of vehicle routing problems,” Eur. J. Oper. Res., 1985. [6] G. Laporte, “The vehicle routing problem: An overview of exact and approximate algorithms,” Eur. J. Oper. Res., 1992. [7] M. Desrochers, J. Desrosiers, and M. Solomon, “A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows,” Oper. Res., 1992. [8] D. Feillet, “A tutorial on column generation and branch-and-price for vehicle routing problems,” 4OR, 2010. [9] R. Baldacci, A. Mingozzi, and R. Roberti, “New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem,” Oper. Res., 2011. [10] N. Christofides, A. Mingozzi, and P. Toth, “State‐space relaxation procedures for the computation of bounds to routing problems,” Networks, 1981. [11] M. Desrochers and F. Soumis, “A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows,” INFOR Inf. Syst. Oper. Res., vol. 26, no. 3, pp. 191–212, Jan. 1988. [12] D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, “An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems,” Networks, 2004. [13] J. Desrosiers, M. Sauvé, and F. Soumis, “Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows,” Manage. Sci., 2008. [14] R. Baldacci, N. Christofides, and A. Mingozzi, “An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts,” Math. Program., 2008. [15] N. Christofides, A. Mingozzi, and P. Toth, “Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations,” Math. Program., vol. 20, no. 1, pp. 255–282, 1981. [16] D. Luxen and C. Vetter, “Real-time routing with OpenStreetMap data,” 2012. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/73903 | - |
dc.description.abstract | 道路標線提供駕駛者道路環境的資訊,和道路使用者的安全息息相關,因此 必須確保道路標線的功能。移動式反光量測車輛能改善原有的人工量測法,降低 量測路段之作業時間。而有效率的道路標線評估計畫,可以減少系統之檢測成本, 亦有機會擴大檢測範圍,確保更多道路使用者的安全。本研究基於車輛路徑問題 模型,建構可應用於道路標線評估的數學模型,並使用美國佛羅里達州移動式反 光量測車輛計劃的資料進行實證分析,結果顯示道路標線評估模型可提供經過最 佳化的道路標線評估時程表,和歷史資料相比,可用較短的行駛距離及較少的量 測車輛數完成所有任務。本研究同時使用最佳化求解器 Gurobi 和列生成和分支 界定演算法求解,在待測任務數小於 17 個時,列生成和分支界定演算法有較高 的求解效率。 | zh_TW |
dc.description.abstract | Lane markings provide drivers information of traffic environment, which is critical to the transport safety. Therefore, ensuring the effectiveness of the lane markings is important. The Mobile Retroreflrctivity Unit (MRU) is more efficient than the traditional approach of manual assessment, and thus reduces the operational cost. An efficient schedule of a system-wide lane marking assessment can reduce the cost and may expand the examination area. As a result, there is a chance to enhance the safety of more road users. This study formulates a VRP-based model for lane marking assessment and use data of Florida Department of Transportation’s MRU program as validation analysis. The result of validation displays that lane marking assessment model provides a more efficient schedule compared with historical schedule, that same tasks can be finished in less vehicle amount and travel distance. In this study, both Gurobi solver and column generation and branch and bound algorithm are used to solve lane marking assessment model, and when task amount is less than 17, column generation and branch and bound algorithm has better efficiency when solving the model. | en |
dc.description.provenance | Made available in DSpace on 2021-06-17T08:13:18Z (GMT). No. of bitstreams: 1 ntu-108-R06521515-1.pdf: 2130046 bytes, checksum: 7d8208b0f99e4e739943b07515c73000 (MD5) Previous issue date: 2019 | en |
dc.description.tableofcontents | 致謝 i
摘要 ii ABSTRACT iii TABLE OF CONTENT iv LIST OF FIGURES vi LIST OF TABLES vi CHAPTER 1 INTRODUCTION 01 1.1 Background 01 1.2 Problem Statement 02 1.3 Research Objective 02 1.4 Thesis Organization 03 CHAPTER 2 LITERATURE REVIEW 04 2.1 Lane Marking Assessment and Mobile Retroreflectivity Unit (MRU) 04 2.2 Vehicle Routing Problem (VRP) 05 2.3 Algorithm of Vehicle Routing Problem 06 2.4 Summary of Literature Review 07 CHAPTER 3 METHDOLOGY 08 3.1 Model Formulation 08 3.1.1 Notation 08 3.1.2 Model 10 3.2 Algorithm Development 14 CHAPTER 4 VALIDATION 22 4.1 Validation Data 22 4.2 Model Adjustment 25 4.3 Implementation Environment 26 4.4 Comparation of Historical Schedule and Lane Marking Assessment Model 26 4.5 Result of Lane Marking Assessment Model and Column Generation with Branch and Bound Algorithm 27 4.6 Discussion of Label Correcting Algorithm 29 4.7 Summary of Validation 31 CHAPTER 5 CONCLUSION AND FUTURE WORK 33 5.1 Conclusions 33 5.2 Future Work 33 REFERENCES 35 | |
dc.language.iso | en | |
dc.title | 基於車輛路徑問題模型規劃使用移動式反光量測車輛之道路標線評估流程 | zh_TW |
dc.title | VRP-based Model for Lane Marking Assessment with MRU Vehicle | en |
dc.type | Thesis | |
dc.date.schoolyear | 107-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 顏上堯,許聿廷 | |
dc.subject.keyword | 車輛路徑問題,道路標線,移動式反光量測車輛,列生成,資源限制下的基本最短路徑問題,標籤修正演算法,分支界定, | zh_TW |
dc.subject.keyword | vehicle routing problem (VRP),pavement markings,mobile retroreflectivity unit (MRU),column generation,elementary shortest path problem with resource constraints (ESPPRC),label correcting algorithm,branch and bound, | en |
dc.relation.page | 36 | |
dc.identifier.doi | 10.6342/NTU201903527 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2019-08-15 | |
dc.contributor.author-college | 工學院 | zh_TW |
dc.contributor.author-dept | 土木工程學研究所 | zh_TW |
顯示於系所單位: | 土木工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-108-1.pdf 目前未授權公開取用 | 2.08 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。