頁籤選單縮合
| 題 名 | The Problem of Distribution of Park-and-Ride Car Parks in Warsaw=解決華沙停車轉乘地點位置的分布問題 |
|---|---|
| 作 者 | Stańczak, Jarosław; Barski, Aleksy; Sęp, Krzysztof; Owsiński, Jan W.; Owsiński, Jan W.; Sęp, Krzysztof; Barski, Aleksy; Stańczak, Jaroslaw; | 書刊名 | International Journal of Information and Management Sciences |
| 卷 期 | 27:2 2016.06[民105.06] |
| 頁 次 | 頁a11+179-190 |
| 分類號 | 557.81 |
| 關鍵詞 | 停車轉乘; 軸輻路網理論; 進化算化; Park and ride; Hub and spoke; Evolutionary algorithm; |
| 語 文 | 英文(English) |
| 英文摘要 | The development of cities and agglomerations brings new problems to be solved. One of them is the excessive road traffic and the related air pollution. Heavy traffic causes congestions and thus increases the pollution level, because one of the most significant sources of air pollution are car exhaust gases. It is known that the public transport produces less pollution per one passenger then the private one. On the basis of this fact the idea of the Park-and-Ride (P&R or P+R) was developed, where commuters travel to the borders of the city by their cars and from there they continue their trip by public transportation. In this work, we will concentrate on finding the best localizations for P&R points. Our approach is composed of two steps. In the first step, a number of communication hubs is selected where P&R can be located (feasibility analysis). In the second step a subset of hubs is chosen to actually have P&R points built (commuters' convenience analysis). We solve the P&R location problem on the first step using some aspects of the Hub and Spoke method by applying a specialized evolutionary algorithm. As the problem of the second step is rather small, we propose to have it solved by experts. |
本系統中英文摘要資訊取自各篇刊載內容。