English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 42788817      線上人數 : 710
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/49806


    題名: A Model With a Heuristic Algorithm for Solving the Long-Term Many-to-Many Car Pooling Problem
    作者: Yan,SY;Chen,CY;Lin,YF
    貢獻者: 土木工程學系
    關鍵詞: A-RIDE PROBLEM;TIME WINDOWS;TRANSPORTATION;CONSTRAINTS
    日期: 2011
    上傳時間: 2012-03-27 16:17:16 (UTC+8)
    出版者: 國立中央大學
    摘要: Long-term car pooling is defined as the sharing of a private vehicle by more than one user who need to reach a destination following a semicommon route between the individuals' points of origin and destination in a specific period. In this paper, we employ a network flow technique to systematically develop a long-term many-to-many car pooling model. The model is formulated as a special integer multiple-commodity network flow problem. A Lagrangian relaxation-based algorithm is also developed to solve the model. The performance of the heuristic algorithm is evaluated by carrying out a case study using real data and suitable assumptions. The test results confirm the usefulness of the model and the heuristic algorithm and that they could be useful in practice.
    關聯: IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS
    顯示於類別:[土木工程學系 ] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML619檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 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 ©   - 隱私權政策聲明