請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/21105
標題: | 市區公車路線設計與時刻表整合最佳化 Simultaneous Optimization of Urban Bus Network Design and Timetabling |
作者: | Yi-Ying Lin 林依穎 |
指導教授: | 朱致遠 |
關鍵字: | 大眾運輸,路線設計,時刻表,分支價格切割法(BPC),混合整數規劃(MIP),演算法, Public Transit,Network Design,Timetable,Branch-and-Price-and-Cut (BPC),Mixed integer Programming (MIP),Algorithm, |
出版年 : | 2020 |
學位: | 碩士 |
摘要: | 本研究採用混合整數規劃(MIP)與平行分支價格切割演算法(BPC)求解都市大眾運輸的路線設計和時刻表整合最佳化問題。演算法最主要的關鍵是以路線和發車時間來建構時刻表,研究也開發貪婪演算法求解價格子問題,並動態加入限制式加強下界。接著進行案例分析以評估模式性能,其結果顯示使用平行BPC演算法求解MIP問題效能優於現有的商用MIP求解器,本研究也針對不同的模式參數求解結果做出分析。 This study solves the simultaneous planning problem of network design and timetabling for urban bus systems. An innovative mixed-integer programming (MIP) model is formulated and a parallel branch-and-price-and-cut (BPC) algorithm is proposed to solve the problem. The key idea of the model formulation and the solution algorithm is to represent a bus timetable with a route and a dispatch pattern. An aggregation and greedy algorithm is developed to efficiently solve the pricing subproblem. The cuts of disaggregate coupling inequalities are dynamically added to strengthen the lower bound. A computational study is conducted to evaluate the performance of the proposed methodology. The comparison with alternative solution approaches indicates that the parallel BPC algorithm is superior to solving the MIP formulations with the off-the-shelf MIP solver. Different values of model parameters are also tested, and various statistics of operators and passengers are reported for the cases |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/21105 |
DOI: | 10.6342/NTU202000029 |
全文授權: | 未授權 |
顯示於系所單位: | 土木工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-109-1.pdf 目前未授權公開取用 | 2.87 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。