淡江大學機構典藏:Item 987654321/109385
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62822/95882 (66%)
Visitors : 4027789      Online Users : 938
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/109385


    Title: The Problem of Distribution of Park-and-Ride Car Parks in Warsaw
    Authors: Sta´nczak, Jaros law;Barski, Aleksy;S¸ep, Krzysztof;Owsi´nski, Jan W.
    Keywords: Park and ride;hub and spoke;evolutionary algorithm
    Date: 2016
    Issue Date: 2017-01-17 11:38:10 (UTC+8)
    Publisher: 淡江大學出版中心
    Abstract: 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.
    Relation: International Journal of Information and Management Sciences 27 (2), pp.179-190
    DOI: 10.6186/IJIMS.2016.27.2.6
    Appears in Collections:[International Journal of Information and Management Sciences] v.27 n.2

    Files in This Item:

    File Description SizeFormat
    index.html全文連結0KbHTML477View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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