頁籤選單縮合
題 名 | 物流中心之複數路徑規畫和車班排程--實例研究=Multi-Vehicle Routing and Scheduling Issues in Distribution Centers--A Real Case Study |
---|---|
作 者 | 陳炳雄; 王麗清; | 書刊名 | 東吳經濟商學學報 |
卷 期 | 25 1999.06[民88.06] |
頁 次 | 頁25-38 |
分類號 | 494.57 |
關鍵詞 | 複數路徑規劃問題; 概似演算式; Multi-vehicle routing problem; Approximation algorithm; |
語 文 | 中文(Chinese) |
中文摘要 | 本文根據一個物流中心實例,提出一個以最小化複數路徑中之最大路徑不滿意度為目標之配送路徑規劃問題。我們提出一個包含兩個階段之有效的概似演算式(approximation algorithm),據此重新規劃實例之配送路徑,並與現行路線作比較。最後,並以數學規劃(mathematical programming)技巧,對路徑之發車時間,進行排班調節,進一步降低不滿意度。 |
英文摘要 | We present a multi-vehicle routing problem with a goal of minimizing the maximum of routes' dissatisfactions based on the setting of a well-known distribution center. An effective approximation algorithm is given. The real case is examined and the results suggest that the algorithm offers good solutions. Finally, mathematical programming techniques are used to adjust the vehicle schedules optimally after the vehicle routes are determined. |
本系統中英文摘要資訊取自各篇刊載內容。