English  |  正體中文  |  简体中文  |  Items with full text/Total items : 65318/65318 (100%)
Visitors : 21744952      Online Users : 822
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: http://ir.lib.ncu.edu.tw/handle/987654321/49805


    Title: A model and a solution algorithm for the car pooling problem with pre-matching information
    Authors: Yan,SY;Chen,CY
    Contributors: 土木工程學系
    Keywords: A-RIDE PROBLEM;TIME WINDOWS;TRANSPORTATION
    Date: 2011
    Issue Date: 2012-03-27 16:17:15 (UTC+8)
    Publisher: 國立中央大學
    Abstract: Most past car pooling studies have focused on the to-work problem (from different origins to a common destination) or the return-from-work problem (from the same origin to different destinations). Pre-matching information, including the carpool partners and the route/schedule for each previously participating vehicle, have rarely been considered. As a result, there has not yet been a suitable method/model developed for solving practical many-to-many car pooling problem with multiple vehicle and person types, as well as pre-matching information, that occur in real-world. In this study we strive to make up this lack by employing a time-space network flow technique to develop a model for this type of car pooling problem with pre-matching information (CPPPMI). The model is formulated as an integer multiple commodity network flow problem. A solution algorithm, based on Lagrangian relaxation and a heuristic for the upper bound solution, is developed to solve the model. To test how well the model and the solution algorithm may be applied to real-world, numerical tests are performed with several problem instances randomly generated based upon data reported from a past study carried out in northern Taiwan. The test results show the effectiveness of the proposed model and solution algorithm. (C) 2011 Elsevier Ltd. All rights reserved.
    Relation: COMPUTERS & INDUSTRIAL ENGINEERING
    Appears in Collections:[土木工程學系 ] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML467View/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 ©   - Feedback  - 隱私權政策聲明