臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：通勤交通車路線問題模式與巨集啟發式解法
書刊名：運輸計劃
作者：韓復華 引用關係／朱政威
作者(外文)：Han, Anthony F.／Chu, Alonzo C.
出版日期：2010
卷期：39:2
頁次：頁133-163
主題關鍵詞：通勤交通車路線問題；整數規劃；門檻接受法；巨集啟發式解法；Commuter bus routing problem；Integer programming；Threshold accepting；Metaheuristics
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(1) 博士論文(1) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:1
  • 共同引用共同引用:14
  • 點閱點閱:45
對員工提供上下班通勤之交通車服務，在許多大型的公司企業，都是很普遍的現象。良好的通勤交通車路線規劃可替公司減少營運成本，亦可減短員工搭乘時間。員工通勤交通車路線問題 (commuter bus routing problem, CBRP) 屬學校交通車路線問題(school bus routing problem, SBRP) 之延伸。相較於SBRP，CBRP 需同時考慮多車種和多迄點的特性，亦歸屬於問題複雜度為NP-hard 的開放式車輛路線問題 (open vehicle routing problem, OVRP) 型態。本文針對CBRP 深入探討，首先以總營運成本最小為目標，對CBRP 構建整數規劃(integer programming, IP) 模式，並提出一套基於門檻接受法(threshold accepting, TA) 的四階段巨集啟發式解法。本研究亦設計不同型態的中小型題庫28 題，以驗證CBRP 模式列式的正確性，並測試巨集啟發式解法之求解績效。結果發現，本研究之巨集啟發式解法，對題庫最佳解的誤差幾乎都在1%之內；個案應用結果方面，約可替個案公司減少年成本29%。
The Commuter Bus Routing Problem (CBRP) is a complicated problem faced by many big companies in their daily operations. A well-planned CBRP can reduce the operational cost, and the employee’s commuting time. The CBRP can be considered as an extension of the conventional School Bus Routing Problem (SBRP). However, the CBRP in general considers a more complicated OD pattern and vehicle fleet mix than the SBRP. In this paper, we proposed an IP formulation for CBRP, and validated our proposed model with a set of test instances. We also designed heuristic solution methods based on a four-stage approach: (1) the farthest neighbor-based method for the solution construction stage; (2) node exchange based on surplus capacity for the fleet improvement stage; (3) inter-route and intra-route exchange for the neighborhood search stage; (4) Threshold Accepting (TA) metaheuristics for the intensification and diversification search stage. Computational results of the proposed metaheuristics on test instances showed that the percentage deviation of the exact solution is within 1%. For real-world applications, our proposed metaheuristics can save up to 29% of the annual cost for the case company.
期刊論文
1.Fleszar, K.、Osman, I. H.、Hindi, K. S.(2009)。A Variable Neighborhood Search Algorithm for the Open Vehicle Routing Problem。European Journal of Operational Research，195(3)，803-809。  new window
2.Fu, Zhuo、Eglese, R.、Li, L. Y. O.(2005)。A New Tabu Search Heuristic for the Open Vehicle Routing Problem。Journal of the Operational Research Society，56(3)，267-274。  new window
3.Li, F.、Golden, B.、Wasil, E.(2007)。The Open Vehicle Routing Problem: Algorithms, Large-scale Test Problems, and Computational Results。Computers and Operations Research，34(10)，2918-2930。  new window
4.Pisinger, D.、Ropke, S.(2007)。A General Heuristic for Vehicle Routing Problems。Computers and Operations Research，34(8)，2403-2435。  new window
5.Schrage, L.(1981)。Formulation and Structure of More Complex / Realistic Routing and Scheduling Problems。Networks，11(2)，229-232。  new window
6.Dueck, G.、Scheuer, T.(1990)。Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing。Journal of Computational Physics，90(1)，161-175。  new window
7.Lin, S.(1965)。Computer Solution of the Traveling Salesman Problem。Bell System Technology Journal，44，2245-2269。  new window
8.林志鴻、陳春益、林育俐、曾智強(20020600)。委外校車路線規劃問題之研究。運輸計劃，31(2)，391-427。new window  延伸查詢new window
9.韓復華、卓裕仁(19960900)。門檻接受法、噪音擾動法與搜尋空間平滑法在車輛路線問題之應用研究與比較分析。運輸學刊，9(3)=33，113-143。new window  延伸查詢new window
10.韓復華、楊智凱、卓裕仁(19970600)。應用門檻接受法求解車輛路線問題之研究。運輸計劃，26(2)，253-280。new window  延伸查詢new window
11.Bodin, L.、Golden, B. L.、Assad, A.、Ball, M.(1983)。Routing and scheduling of vehicles and crews: The state of the art。Computers and Operations Research，10(2)，63-211。  new window
12.Tarantilis, C. D. and Kiranoudis, C. T.(2002)。“Distribution of Fresh Meat”。Journal of Food Engineering，vol. 51,no. 1，85-91。  new window
13.Repoussis, P. P., Tarantilis, C. D., and Ioannou, G.(2007)。“The Open Vehicle Routing Problem with Time Windows”。Journal of the Operational Research Society，vol. 58,no. 3，355-367。  new window
14.Osman, I. H. and Laporte, G.(1996)。“Metaheuristics: A Bibliography”。Annals of Operations Research，vol. 63，513-623。  new window
15.Han, A. F. and Cho, Y. J.(1999)。“A New Meta-Heuristic Approach to the Fleet Size and Mix Vehicle Routing Problem”。Journal of the Eastern Asia Society of Transportation Studies，vol. 3,no. 3，255-269。  new window
16.韓復華、卓裕仁、陳國清(1999)。「五種巨集啟發式方法在VRP問題上的應用與比較」。中華民國第四屆運輸網路研討會論文集，72-82。  延伸查詢new window
17.Christofides, N. and Eilon, S.(1969)。“An Algorithm for Vehicle Dispatching Problem”。Operational Research Quarterly，vol. 20，309-318。  new window
18.Potvin, J. Y. and Rousseau, J. M.(1995)。“An Exchange Heuristic for Routing Problem with Time Windows”。Journal of the Operational Research Society，vol. 46,no. 12，1433-1446。  new window
19.Angel, R. D., Caudle, W. L., Noonan, R., and Whinston, A.(1972)。“Computer-Assisted School Bus Scheduling”。Management Science，vol. 18,no. 6，279-288。  new window
20.Bennett, B. T. and Gazis, D. C.(1972)。“School Bus Routing by Computer”。Transportation Research，vol. 6，317-326。  new window
21.Bodin, L. D. and Berman, L.(1979)。“Routing and Scheduling of School Buses by Computer”。Transportation Science，vol. 13,no. 2，113-129。  new window
22.Bowerman, R., Hall, B., and Calamai, P.(1995)。“A Multi-Objective Optimization Approach to Urban School Bus Routing：Formulation and Solution Method”。Transportation Research Part A：Policy and Practice，Vol. 29A, No. 2，107-123。  new window
23.Li, L. and Fu, Z.(2002)。“The School Bus Routing Problem: A Case Study”。Journal of the Operational Research Society，vol. 53,no. 5，552-558。  new window
24.Corberán A. Fernández E. Laguna M. and Martí R.(2002)。“Heuristic Solutions to the Problem of Routing School Buses with Multiple Objectives”。Journal of the Operational Research Society，vol. 53,no. 4，427-435。  new window
25.Bektaş, T.、Elmastaş, S.(2007)。Solving School Bus Routing Problems through Integer Programming。Journal of the Operational Research Society，58(12)，1599-1604。  new window
26.Braca, J., Bramel, J., Posner, B., and Simchi-Levi, D.(1997)。“A Computerized Approach to the New York City School Bus Routing Problem”。IIE Transactions，vol. 29，pp. 693-702。  new window
27.Spada, M., Bierlaire, M., and Liebling, Th. M.(2005)。“Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem”。Transportation Science，vol. 39,no. 4，477-490。  new window
28.Pacheco J. and Martí R.(2006)。“Tabu Search for a Multi-Objective Routing Problem”。Journal of the Operational Research Society，vol. 57,no. 1，29-37。  new window
29.Park, J. and Kim, B. I.(2009)。“The School Bus Routing Problem: A Review”。European Journal of Operational Research，vol. 202,no. 2，311-319。  new window
30.Sariklis, D. and Powell, S.(2000)。“A Heuristic Method for the Open Vehicle Routing Problem”。Journal of the Operational Research Society，vol. 51,no. 5，564-573。  new window
31.Brandão J.(2004)。“A Tabu Search Heuristic Algorithm for Open Vehicle Routing Problem”。European Journal of Operational Research，vol. 157,no. 3，552-564。  new window
32.Tarantilis, C. D., Ioannou, G., Kiranoudis, C. T., and Prastacos, G. P.(2005)。“Solving the Open Vehicle Routing Problem via a Single Parameter Metaheuristic Algorithm”。Journal of the Operational Research Society，vol. 56,no. 5，588-596。  new window
會議論文
1.韓復華、卓裕仁(2000)。「巨集啟發式方法在TSP 與VRP 上之應用：參數設定與執行機制之探討」72-82。  延伸查詢new window
學位論文
1.陳建都(1997)。校車路線指派問題之研究(碩士論文)。大葉工學院。  延伸查詢new window
2.陳文瑞(1990)。交通車之網路設計(碩士論文)。國立臺灣大學。  延伸查詢new window
3.楊智凱(1995)。以門檻接受法改善TSP及VRP路網成本之研究(碩士論文)。國立交通大學。  延伸查詢new window
4.張容瑄(2002)。模擬退火法在校車路線問題上的應用(碩士論文)。國立中正大學。  延伸查詢new window
5.Or, I.(1976)。“Traveling Sales-type Combinational Problems and Their Relation to the Logistics of Regional Blood Banking”，Evanston, IL。  new window
圖書
1.Williams, H. P.(1999)。Model Building in Mathematical Programming, 4th edition。New York。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：628（臺灣：607，外國：21） ／ 本年度總使用人次：2413552 ／ 訪客人次（自102年09月）：68220838
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上