Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Engineering / 工學院
  3. Industrial Engineering / 工業工程學研究所
  4. Genetic Algorithm Based Heuristic Method for Time Window and Capacity Constrained Pickup and Delivery Vehicle Routing Problem
 
  • Details

Genetic Algorithm Based Heuristic Method for Time Window and Capacity Constrained Pickup and Delivery Vehicle Routing Problem

Date Issued
2008
Date
2008
Author(s)
Lai, Ching-Shan
URI
http://ntur.lib.ntu.edu.tw//handle/246246/178493
Abstract
Due to the increasing demand of point-to-point parcel deliveries in metropolitan area, a time window and capacity constrained one-to-one pickup and delivery single vehicle routing problem arises. This paper rigorously defined this problem and then proposed GA-based heuristic methods for the problem. In this problem, pickup and delivery points are exclusively defined and paired with a one-on-one and pickup-delivery relationship. The time window constraint for the pickup/delivery service times imposed on each point is regarded as soft constraints in this problem. Therefore, the goal of the problem is to find a route with a minimal routing distance and a minimal amount of time window violation. To assure a route satisfying the capacity and one-on-one pickup and delivery constraints, this paper presents a heuristic operation named as “guided merge operation (GMO).” GMO can be used to generate hard constraints satisfied routes to serve as the initial population for a GA-based solving model. It can be used to repair constraint-violated routes generated from traditional GA crossover and mutation operations. In addition, GMO is further enhanced to serve as a GA crossover operator that can generate two constraint-satisfied child routes from two parent ones. Without changing the optimal route, several benchmarks from the TSPLIB were adapted and transformed into sample problems for the problem by adding pickup/delivery one-on-one attribute and the earliest and latest service times to each city. Three GA computation models were constructed for the numerical tests: a simple GA, a GA+GMO-based repairing, and a GA with the GMO-crossover operator. Results indicated that the model with GMO repairing model outperformed others. However, the GMO-crossover operation requires further improvement.
Subjects
Time Window Constraints
TSP
Guided Merge Operation
Genetic Algorithm
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-97-R95546018-1.pdf

Size

23.53 KB

Format

Adobe PDF

Checksum

(MD5):29535feeb8258d53fb681bba99326706

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(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