English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 49378/84106 (59%)
造访人次 : 7382772      在线人数 : 77
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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期


    档案 描述 大小格式浏览次数



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈