Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Management / 管理學院
  3. Business Administration / 工商管理學系暨商學研究所
  4. An Effective Local Search Algorithm for the Multidepot Cumulative Capacitated Vehicle Routing Problem
 
  • Details

An Effective Local Search Algorithm for the Multidepot Cumulative Capacitated Vehicle Routing Problem

Journal
IEEE Transactions on Systems, Man, and Cybernetics: Systems
Journal Volume
50
Journal Issue
12
Pages
4948-4958
Date Issued
2020
Author(s)
Wang X.
TSAN MING CHOI  
Li Z.
Shao S.
DOI
10.1109/TSMC.2019.2938298
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096648620&doi=10.1109%2fTSMC.2019.2938298&partnerID=40&md5=0df18f4522e7ecafd33f11fdebc93b36
https://scholars.lib.ntu.edu.tw/handle/123456789/612167
Abstract
The cumulative capacitated vehicle routing problem (CCVRP) focuses on minimizing the sum of arrival times at the customers. An important application of the CCVRP arises in the procurement of humanitarian aid when natural disasters occur. In this article, the multidepot CCVRP (MDCCVRP) is investigated, and its mathematical model is developed. Moreover, an effective perturb-based local search (PLS) algorithm is proposed to solve the problem. The proposed PLS algorithm starts from having a feasible solution. Regarding the PLS, the perturbing operators help to explore the searching space, while the six local search operators help to exploit the best solution within each searching basin. To test the performance, the proposed PLS is applied to a set of standard benchmark instances and compared with the recently published algorithms. Extensive computational studies reveal that the proposed PLS algorithm is able to attain better solutions with less computational time for most testing instances, and thus competes very favorably with the previously proposed approaches. A stability analysis is also presented to shed light on the robust behavior of the proposed algorithm. The results of the two-sided Wilcoxon rank sum tests clearly show that the algorithms (our PLS and other published methods) have performed with statistically significant differences. ? 2013 IEEE.
Subjects
Humanitarian aid; local search; multidepot cumulative capacitated vehicle routing problem (MDCCVRP); perturbing operator
Other Subjects
Benchmarking; Disasters; Routing algorithms; Vehicle routing; Capacitated vehicle routing problem; Computational studies; Computational time; Local search algorithm; Local search operators; Natural disasters; Statistically significant difference; Wilcoxon rank sum test; Local search (optimization)
Publisher
Institute of Electrical and Electronics Engineers Inc.
Type
journal article

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science