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


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


    題名: A model with a solution algorithm for the cash transportation vehicle routing and scheduling problem
    作者: 顏上堯;Yan, Shangyao;Wang, Sin-Siang;Wu, Ming-Wei
    貢獻者: 工學院土木工程學系
    關鍵詞: Algorithms;Cash transportation;Mathematical programming;Multiple-commodity network flow problem;Network flow problem;Optimization algorithms;Routing;Scheduling;Similarity of time and space;Studies;Time–space network;Transportation industry;Vehicle routing and scheduling
    日期: 2012-09-01
    上傳時間: 2026-04-21 13:29:51 (UTC+8)
    出版者: Elsevier Ltd.;New York: Elsevier Ltd
    摘要: 摘要: ► We develop a model to solve the cash transportation problem. ► A time–space network flow technique is adopted to create the model. ► A heuristic algorithm is developed to solve the model. Cash transportation vehicle routing and scheduling are essential for security carriers to minimize their operating costs and ensure safe cash conveyance. In real operations, to increase cash conveyance safety, there must be significant variation in daily cash transportation vehicle routes and schedules, making such vehicle routes and schedules difficult to formulate. However, for convenient planning purposes, security carriers normally plan such routes and schedules based on personal experience, without considering variations in routes and schedules from a system perspective. As a result, the obtained routes and schedules are neither safe nor efficient for transporting cash. In this study, a model is developed where the time–space network technique is utilized to formulate the potential movements of cash transportation vehicles among all demand points in the dimensions of time and space. This model incorporates a new concept of similarity of time and space for routing and scheduling, which is expected to help security carriers formulate more flexible routing and scheduling strategies. This is helpful to reduce the risk of robbery. Mathematically, the model is formulated as an integer multiple-commodity network flow problem. A solution algorithm, based on a problem decomposition/collapsing technique, coupled with the use of a mathematical programming software, is developed to efficiently solve the problem. The case study results show that our model and solution algorithm could be useful references for security carriers in actual practice.
    出版者: New York: Elsevier Ltd
    出版日期: 2012-09
    出處: Computers & industrial engineering, 2012-09, Vol.63 (2), p.464-473
    資源來源: Elsevier ScienceDirect Journals Complete
    版權: 2012 Elsevier Ltd
    版權: Copyright Pergamon Press Inc. Sep 2012
    識別號: ISSN: 0360-8352
    識別號: EISSN: 1879-0550
    識別號: DOI: 10.1016/j.cie.2012.04.004
    識別號: CODEN: CINDDL
    顯示於類別:[土木工程學系 ] 期刊論文

    文件中的檔案:

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


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