中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/100022
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81587759      Online Users : 2588
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/100022


    Title: A car pooling model and solution method with stochastic vehicle travel times
    Authors: 顏上堯;Yan, Shangyao;Chen, Chun-Ying;Chang, Sheng-Chieh
    Contributors: 工學院土木工程學系
    Keywords: Algorithms;Carpooling;Companies;Delays;Heuristic;multiple commodity network flow problem;Optimization;Schedules;Stochastic processes;stochastic travel time;time-space network;Vehicles
    Date: 2014-02-01
    Issue Date: 2026-04-21 13:45:04 (UTC+8)
    Publisher: Institute of Electrical and Electronics Engineers Inc.;New York: IEEE
    Abstract: 摘要: Carpooling is one method that can be easily instituted and can help resolve a variety of problems that continue to plague urban areas, ranging from energy demands and traffic congestion to environmental pollution. However, most carpooling organizations currently use a trial-and-error process, in accordance with the projected vehicle travel times, for carpooling, which is neither effective nor efficient. In other words, stochastic disturbances arising from variations in vehicle travel times in actual operations are neglected. In the worst case scenario, where vehicle travel times fluctuate wildly during operations, the planned schedule could be disturbed enough to lose its optimality. Therefore, we constructed a stochastic carpooling model that considers the influence of stochastic travel times. The model is formulated as an integer multiple commodity network flow problem. Since real problem sizes can be large, it could be difficult to find optimal solutions within a reasonable period of time. Therefore, we develop a solution algorithm to solve the model. To test how well the model and the solution algorithm can be applied to the real world, we also developed a simulation-based evaluation method. To test the model and the solution algorithm, a case study is performed based upon data reported from a past study carried out in northern Taiwan. The results show that the model and solution algorithm are good and could be useful for carpooling practices.
    其他題名: TITS
    出版者: New York: IEEE
    出版日期: 2014-02
    出處: IEEE transactions on intelligent transportation systems, 2014-02, Vol.15 (1), p.47-61
    資源來源: IEEE Electronic Library (IEL)
    版權: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Feb 2014
    識別號: ISSN: 1524-9050
    識別號: EISSN: 1558-0016
    識別號: DOI: 10.1109/TITS.2013.2272085
    識別號: CODEN: ITISFG
    Appears in Collections:[Department of Civil Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML12View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明