| DC 欄位 |
值 |
語言 |
| DC.contributor | 土木工程學系 | zh_TW |
| DC.creator | 王領 | zh_TW |
| DC.creator | Ling Wang | en_US |
| dc.date.accessioned | 2012-8-22T07:39:07Z | |
| dc.date.available | 2012-8-22T07:39:07Z | |
| dc.date.issued | 2012 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=993202072 | |
| dc.contributor.department | 土木工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 近年來，由於台灣都市的人口密集、交通機能多元且集中等所衍生出短途、多目的旅次型態。受世界性環保議題與樂活概念之影響，各國政府與民間團體開始積極地鼓勵民眾加入節能減碳的行列，除了使用大眾運輸工具外，亦提倡使用自行車等綠色運具，以改善因汽機車使用造成之廢棄排放量與污染問題。遺憾的是，各縣市政府雖大力推行自行車作為通學、通勤之運具，對於自行車道路網建置卻無一完善、安全且連續性之自行車道路網，以致於自行車之使用率不如預期。
本研究以初期通勤型自行車道規劃者之立場，考量實際營運時需求量固定，整合各區域之旅行時間、安全性等相關額外限制，發展一具方向性之自行車道網路模式，用以協助政府與決策者有效地規劃初期通勤型自行車道路網。在模式求解部分，為有效求解實務之大型問題，本研究針對此模式以C++ 程式語言結合CPLEX發展一拉氏鬆弛演算法進行求解。為評估模式及演算法之績效，本研究參考台北市實務資料，隨機產生若干不同模式之測試範例，進行模式及啟發式解法的測試與方案分析，測試結果良好，最後提出本研究之結論與建議。
| zh_TW |
| dc.description.abstract | Taiwan’’s high population density and busy traffic in urban areas result in the needs of transportation for short-distances or with multi-purposes. To improve the problem of air pollution, the government recommends people choose energy-saving ways of transportations, such as bicycles and public transportations. However, for many bikers and commuters, the construction of safe, continual and connected urban bicycle lane networks are still not yet finished, leading to overestimated utilizations.
This research aims at helping the government with the commuters’ bicycle lane network planning in the first phase, and offering a model designed for people’s safety, integrating the connection to different places, and saving their time.To efficiently solve large-scale problems occurring in real world, we develop a solution algorithm for each model, based on Lagrangian relaxation methods. As for the matching framework and solution algorithm in practice, we perform a case based on the operating date from Taipei city department of transportation study. A computerized random generator is designed to generate different problem instances used for testing. The results show the model could be useful. Finally, conclusions and suggestions are given.
| en_US |
| DC.subject | 網路設計 | zh_TW |
| DC.subject | 自行車道 | zh_TW |
| DC.subject | 通勤 | zh_TW |
| DC.subject | 拉氏鬆弛法 | zh_TW |
| DC.subject | 多重貨物網路流動 | zh_TW |
| DC.subject | commuters | en_US |
| DC.subject | Lagrangian relaxation. | en_US |
| DC.subject | network design | en_US |
| DC.subject | bicycle lane | en_US |
| DC.subject | multiple commodity network flow problem | en_US |
| DC.title | 初期通勤型自行車道規劃模式暨求解演算法之研究 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | The optimal model and Solution Algorithm for Commuter type Bicycle Lane Initial Network Planning | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |