English  |  正體中文  |  简体中文  |  Items with full text/Total items : 56465/90290 (63%)
Visitors : 11710343      Online Users : 73
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/95465

    Title: 動態指派演算法應用於物流配送作業規劃之研究
    Other Titles: A Study on the Application of the Dynamic Assignment Algorithm on the Logistics Delivery Operation Planning
    Authors: 邱顯明
    Contributors: 淡江大學運輸管理學系
    Keywords: 物流配送;隨機性車輛路線問題;禁忌搜尋法;基因演算法;動態指派;Physical distribution;Stochastic vehicle routing;Tabu search;Genetic algorithm;Dynamic assignment
    Date: 2002-11
    Issue Date: 2014-02-12 10:16:24 (UTC+8)
    Abstract: 本研究的主要目的在於探討電子商務出現後,即時訂貨資訊對於物流配送作業的影響,並釐定出配送作業所應具備與過去較為不同的特性。藉由這些特性的釐清,構建出符合此一物流配送特性的問題模式,並結合即時的訂貨資訊與車輛派遣,建立一套能夠處理此一模式的作業規劃方法。最後經由此一方法的應用,幫助物流業者決定出最適的車隊規模,以降低其營運成本。本研究中加入動態的觀點,設計出適用於本研究的演算流程,配合禁忌搜尋法(Tabu Search)與基因演算法(Genetic Algorithm)用以構建路線與作路線的改善,並藉由持續更新的各項資訊,如需求資訊、車輛屬性資料等,不斷的改善車輛繞行路徑,最後以C語言自行撰寫程式用以求解本問題。案例的測試部分,以三種不同的機率分配產生亂數,作為各時段新加入的訂貨數量,加入於各點原有的需求量上,用以比較本研究所提出的演算法於不同情形下的表現情形。最後據模擬出的最大車輛次數分佈情形,幫助決策者決定出其最適的車隊規模。
    The purpose of this study is to develop a dynamic delivery operation plan, which can deal with the real time demand and traffic information in the design of the delivery operation. Due to the dynamic nature of this planning process, the introduction of the robust optimization into the process should be able to reach the most suitable optimization of the process. Based on the characteristics of the electronic commerce, a dynamic route assignment structure will be developed to reach the robust optimization of the delivery operation, which should provide the competition edge for the firm under consideration. Two types of solution procedures were applied in this study, i.e., Genetic Algorithms (GA) and Tabu Search. A series of case studies with different characteristics such as demand density, demand size were used to test the solution capability of the proposed algorithms. Several versions of revised algorithms were developed in these studies. Based on the result of the case studies, a revised GA was identified as the most suitable solution procedure for the problem addressed in this study. The proposed procedure can be used to develop a suitable vehicle routing operations with real-time demand information. In addition, it also provides suitable vehicle requirement information for the decision maker to determine the optimal fleet size.
    Relation: 國科會九十年度管理二學門專題研究計畫成果發表會論文集,6頁
    Appears in Collections:[Graduate Institute & Department of Transportation Management] Proceeding

    Files in This Item:

    File Description SizeFormat
    動態指派演算法應用於物流配送作業規劃之研究_中文摘要.docx摘要18KbMicrosoft Word134View/Open
    動態指派演算法應用於物流配送作業規劃之研究_英文摘要.docx摘要17KbMicrosoft Word71View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback