Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Engineering / 工學院
  3. Industrial Engineering / 工業工程學研究所
  4. Customer Routing Problem for Batching-Time Controlled Service System
 
  • Details

Customer Routing Problem for Batching-Time Controlled Service System

Date Issued
2014
Date
2014
Author(s)
Su, Chia-Hsuan
URI
http://ntur.lib.ntu.edu.tw//handle/246246/261011
Abstract
This work presents a customer routing problem for a batching time controlled service system, CRP4BTCSS for short. The problem originates from the customer guidance operation of a theme park, where batched ride-services are provided for a flock of customers. The batch service starts when the number of customers reaches the batch size or the batching time measuring reaches a prescribed limit. The goal is to rearrange the customers’ routing plans to minimize the total waiting and traveling times. In addition, an augmented problem mode is proposed to include batching time limits as optimization targets to additionally minimize the counts of batch runs. However, the waiting and traveling times of customers and run counts of ride machines can be evaluated only when detailed schedules of customers and machines are available. This work derives a concise simulation algorithm to generate routing schedules of customers and operation schedules of machines as well. Moreover, nonlinear and linear programming models are developed to formulate the optimization problem and illustrate the complexity of the problem. A practical solving method based on discrete event simulation and genetic algorithm optimization techniques is proposed and implemented. Two applications of real theme parks are constructed for numerical tests as well as several benchmarks for specific testing. The implemented software system has effectively carried out the simulation based optimization method and is able to efficiently solve these sample problems of the standard and augmented modes. Numerical results show that the proposed method has significantly reduced the waiting times and an optimal setting of batching time limits will yield a higher customer satisfaction without much additional resource input.
Subjects
顧客路徑規劃問題
遺傳演算法
離散事件模擬演算
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-103-R01546008-1.pdf

Size

23.54 KB

Format

Adobe PDF

Checksum

(MD5):c9cc2ab700724944cb426583789f0b9c

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