The Problem of Distribution of Park-and-Ride Car Parks in Warsaw

doi:10.6186/IJIMS.2016.27.2.6

淡江大學機構典藏 > 淡江出版期刊 > 資訊與管理科學期刊 > 第27卷第2期 > Item 987654321/109385

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/109385

題名:	The Problem of Distribution of Park-and-Ride Car Parks in Warsaw
作者:	Sta´nczak, Jaros law;Barski, Aleksy;S¸ep, Krzysztof;Owsi´nski, Jan W.
關鍵詞:	Park and ride;hub and spoke;evolutionary algorithm
日期:	2016
上傳時間:	2017-01-17 11:38:10 (UTC+8)
出版者:	淡江大學出版中心
摘要:	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 ongestions 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 ste 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.
關聯:	International Journal of Information and Management Sciences 27 (2), pp.179-190
DOI:	10.6186/IJIMS.2016.27.2.6
顯示於類別:	[資訊與管理科學期刊] 第27卷第2期

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html	全文連結	0Kb	HTML	475	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....