資料載入處理中...
臺灣人文及社會科學引文索引資料庫系統
:::
網站導覽
國圖首頁
聯絡我們
操作說明
English
行動版
(3.21.248.47)
登入
字型:
**字體大小變更功能,需開啟瀏覽器的JAVASCRIPT,如您的瀏覽器不支援,
IE6請利用鍵盤按住ALT鍵 + V → X → (G)最大(L)較大(M)中(S)較小(A)小,來選擇適合您的文字大小,
如為IE7以上、Firefoxy或Chrome瀏覽器則可利用鍵盤 Ctrl + (+)放大 (-)縮小來改變字型大小。
來源文獻查詢
引文查詢
瀏覽查詢
作者權威檔
引用/點閱統計
我的研究室
資料庫說明
相關網站
來源文獻查詢
/
簡易查詢
/
查詢結果列表
/
詳目列表
:::
詳目顯示
第 1 筆 / 總合 1 筆
/1
頁
來源文獻資料
摘要
外文摘要
引文資料
題名:
跨校選授課專車排程規劃模式暨演算法之研究
書刊名:
運輸計劃
作者:
顏上堯
/
蕭妃晏
/
謝潤曉
作者(外文):
Yan, Shang-yao
/
Hsiao, Fei-yen
/
Hsieh, Jun-hsiao
出版日期:
2011
卷期:
40:4
頁次:
頁367-392
主題關鍵詞:
跨校專車
;
選授課
;
時空網路
;
多重貨物網路流動問題
;
啟發解法
;
Inter-school bus
;
Class attendance
;
Time-space network
;
Multiple commodity network flow problem
;
Heuristic
原始連結:
連回原系統網址
相關次數:
被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
排除自我引用:0
共同引用:0
點閱:42
近年來各校間選授課行為日益頻繁,於是跨校選授課專車因應而生。 然而,目前國內跨校選授課專車之班表及排程大多以人工的經驗來規劃, 缺乏系統性分析,因此難以掌握排程的績效。緣此,本研究考量合作學校 的立場,並在滿足實務之營運目標及相關限制下,構建一多對多起迄需求 之跨校選授課專車排程模式,期能輔助合作學校有效地規劃專車排程及班 表。本研究模式為一特殊之多重貨物網路流動問題,屬NP-hard 問題。為 有效地求解實務的大型問題,本研究利用問題分解及合併策略,且配合 CPLEX 軟體,發展一有效的啟發解法。最後,本研究以國內某一教學合作 大學系統之跨校選授課專車營運為例,進行範例測試,結果良好,顯示本研究模式及演算法應可為實務界及學術界之參考。
以文找文
In recent years, the cooperation between colleges and the behavior of attending inter-school classes significantly strengthen. In order to service teachers and students for attending inter-school classes, inter-school buses for class attendance arise. However, the inter-school bus route/schedule is manually determined by planning personnel with experience, without optimization from a systemic perspective. Consequently, the effectiveness of the resulting route/schedule is unknown. Therefore, in this research, based on the perspective of the cooperated schools, we develop a bus scheduling model with many-to-many OD demand for inter-school class attendance, subject to the real operating objective and constraints. The model is expected to be an effective planning tool for cooperated schools to decide on a good bus route/schedule for inter-school class attendance. The model is formulated as a special multiple commodity network flow problem, which is characterized as NP-hard. To efficiently solve realistically large problems that occur in practice, we develop a heuristic algorithm by adopting a problem decomposition and collapsing strategy, couple with the use of CPLEX software. Finally, to evaluate how well the model and the solution algorithm could be applied in practice, a case study is performed using the bus operation data for inter-school class attendance from an allied university system in Taiwan. The test results are good, showing that the proposed model and solution algorithm could be useful reference for academics and practices.
以文找文
期刊論文
1.
Bent, R. W.、Hentenryck, P. V.(2004)。Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers。Operations Research,52(6),977-987。
2.
Bowerman, R.、Hall, B.、Calamai, P.(1995)。A Multi-Objective Optimization Approach to Urban School Bus Routing: Formulation and Solution Method。Transportation Research Part A: Policy and Practice,29(2),107-123。
3.
Hsu, C. I.、Hung, S. F.、Li, H. C.(2007)。Vehicle Routing Problem with Time-windows for Perishable Food Delivery。Journal of Food Engineering,80(2),465-475。
4.
Yan, S.、Chen, H. L.(2002)。A Scheduling Model and a Solution Algorithm for Inter-city Bus Carriers。Transportation Research Part A,36(9),805-825。
5.
Yan, S.、Chen, C. H.(2007)。Coordinated Flight Scheduling Models for Allied Airlines。Transportation Research Part C,15,246-264。
6.
Li, L.、Fu, Z.(2002)。The School Bus Routing Problem: A Case Study。Journal of the Operational Research Society,552-558。
7.
Equi, L.、Gallo, G.、Marziale, S.、Weintraub, A.(1997)。A Combined Transportation and Scheduling Problem。European Journal of Operational Research,97(1),94-104。
8.
Bodin, L. D.、Berman, L.(1979)。Routing and Scheduling of School Buses by Computer。Transportation Science,13(2),113-129。
9.
Braca, J.、Bramel, J.、Posner, B.、Simchi-Levi, D.(1997)。A Computerized Approach to the New York City School Bus Routing Problem。IIE Transactions,29,693-702。
10.
Corberan, A.、Fernandez, E.、Laguna M.、Marti, R.(2002)。Heuristic Solutions to the Problem of Routing School Buses with Multiple Objectives。Journal of the Operational Research Society,53(4),427-435。
11.
Psaraftis, H. N.(1980)。A Dynamic Programming Approach to the Singlc-Vehicle, Many-to-Many Immediate Request Dial-a-Ride Problem。Transportation Science,14,130-154。
12.
Melachrinoudis, E.、Ilhan, A. B.、Min, H.(2007)。A Dial-a-Ride Problem for Client Transportation in a Healthcare Organization。Computers and Operations Research,34,742-759。
13.
Diana, M.、Dessouky, M. M.(2004)。A New Regret Insertion Heuristic for Solving Large-Scale Dial-a-Ride Problems with Time Windows。Transportation Research Part B,38,539-557。
14.
Ibaraki, T. et al.(2005)。Effective Local Search Algorithms for the Vehicle Routing Problem with General Time Windows Constraint。Transportaion Science,39,106-232。
15.
Azia, N.、Gendreaua, M.、Potvin, J. Y.(2007)。An Exact Algorithm for A Single-Vehicle Routing Problem with Time Windows and Multiple Routes。European Journal of Operational Research,178(3),755-766。
16.
Desrosiers, J.、Dumas, Y.、Soumis, F.(1986)。A Dynamic Programming Solution of the Large-Scale Single Vehicle Dial-a-Ride Problem with Time Windows。American Journal of Mathematical and Management Sciences,6,301-325。
17.
Cordeau, J. F.、Laporte, G.(2003)。A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem。Transportation Research Part B,37(6),579-594。
18.
Rekiek, B.、Delchambre, A.、Saleh, H. A.(2006)。Handicapped Person Transportation: An Application of the Grouping Genetic Algorithm。Engineering Application of Artificial Intelligence,19,511-520。
19.
Yan, S.、Chen, S. C.、Chen, C. H.(2006)。Air Cargo Fleet Routing and Timetable Setting with Multiple On-Time Demands.。Transportation Research Part E,42,409-430。
會議論文
1.
黃台生、許采蘋(2006)。計程車共乘與撥召計程車可行條件之研究203-224。
延伸查詢
研究報告
1.
申生元(2001)。多趟次車輛途程與排程問題。
延伸查詢
學位論文
1.
陳建都(1997)。校車路線指派問題之研究(碩士論文)。大葉工學院。
延伸查詢
2.
陳文瑞(1990)。交通車之網路設計(碩士論文)。國立臺灣大學。
延伸查詢
3.
張容瑄(2002)。模擬退火法在校車路線問題上的應用(碩士論文)。國立中正大學。
延伸查詢
4.
向美田(1997)。公車動態資訊與撥召系統之研究與建立—以金門縣為例。交通大學。
延伸查詢
5.
Solomon, M. M.(1983)。Vehicle Routing and Scheduling with Time Windows Constraints: Models and Algorithms,USA。
圖書
1.
Garey, Michael R.、Johnson, David S.(1979)。Computers and Intractability: A Guide to the theory of NP-Completeness。W. H. Freeman and Company。
推文
當script無法執行時可按︰
推文
推薦
當script無法執行時可按︰
推薦
引用網址
當script無法執行時可按︰
引用網址
引用嵌入語法
當script無法執行時可按︰
引用嵌入語法
轉寄
當script無法執行時可按︰
轉寄
top
:::
相關期刊
相關論文
相關專書
相關著作
熱門點閱
1.
防災避難疏散排程規劃之研究
2.
短期需求受擾動下動態醫療物資輸配送之研究
3.
單機種機隊排程與班次整合之研究
無相關博士論文
無相關書籍
無相關著作
無相關點閱
QR Code