| 研究生: |
洪迎哲 Hung, Ying-Che |
|---|---|
| 論文名稱: |
應用代理人模型模擬具區域限制之動態撥召問題 Agent-based Simulation for the Dynamic Zonal Dial-a-Ride Problem |
| 指導教授: |
沈宗緯
Shen, Tsung-Wei |
| 學位類別: |
碩士 Master |
| 系所名稱: |
管理學院 - 電信管理研究所 Institute of Telecommunications Management |
| 論文出版年: | 2021 |
| 畢業學年度: | 109 |
| 語文別: | 英文 |
| 論文頁數: | 40 |
| 中文關鍵詞: | 代理人模擬 、動態撥召問題 、分區設定 |
| 外文關鍵詞: | dynamic DARP, agent-based simulation, zonal configuration |
| 相關次數: | 點閱:95 下載:0 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
隨著殘障人口旅行需求的增加,需求反應式運輸(DRT)已成為近年來流行的研究主題。目前為止,許多 DRT 服務仍透過人工調度,這導致服務效率低下,並且無法處理動態事件。本研究使用了一種代理人模擬的方法,該方法透過定義了車輛的決策行為及乘客代理人的互動以模擬動態撥召問題。我們應用基於代理的模擬來分析不同的分區設定方案,選擇策略和乘車共享條件等。結果證實我們的模擬可以找到有效的策略組合。此外,我們提出的分區設定方案提供了與沒有分區限制的情境下相近的表現,可供營運單位參考。
As the travel needs of people with disabilities increase, demand response transit (DRT) has become a popular research topic in recent years. Currently, many DRT service is still using manual scheduling, which leads to inefficient and is not able to deal with dynamic events. This study proposes an agent-based method that defines the vehicle's decision-making behavior and passenger interaction to simulate dynamic DARP. We apply agent-based simulation to analyze different zonal restrictions, selection strategies, and ride-sharing conditions, etc. The results confirm that our model can find the efficient strategy combination. Our proposed zoning restriction scheme also presents a performance close to the scenario without zonal constraint, providing operators with a reference.
Agatz, N., Erera, A., Savelsbergh, M., & Wang, X. (2012). Optimization for dynamic ride-sharing: A review. European Journal of Operational Research, 223(2), 295-303.
Attanasio, A., Cordeau, J.-F., Ghiani, G., & Laporte, G. (2004). Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing, 30(3), 377-387.
Barbucha, D., & Jedrzejowicz, P. (2007). An agent-based approach to vehicle routing problem. International Journal of Applied Mathematics and Computer Science, 4(1), 18-23.
Beaudry, A., Laporte, G., Melo, T., & Nickel, S. (2010). Dynamic transportation of patients in hospitals. OR spectrum, 32(1), 77-107.
Beham, A., Kofler, M., Wagner, S., & Affenzeller, M. (2009, 10-12 Sept. 2009). Agent-Based Simulation of Dispatching Rules in Dynamic Pickup and Delivery Problems. Paper presented at the 2009 2nd International Symposium on Logistics and Industrial Informatics.
Bodin, L., Golden, B., Assad, A., & Ball, M. (1983). Routing and scheduling of vehicles and crew. Computer & Operations Research, 10(2), 109-111.
Bonabeau, E. (2002). Agent-based modeling: Methods and techniques for simulating human systems. Proceedings of the national academy of sciences, 99(suppl 3), 7280-7287.
Braekers, K., Caris, A., & Janssens, G.K. (2014). Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transportation Research Part B: Methodological, 67, 166-186.
Čertický, M., Jakob, M., & Píbil, R. (2015). Analyzing on-demand mobility services by agent-based simulation. Journal of Ubiquitous Systems & Pervasive Networks, 6(1), 17-26.
Čertický, M., Jakob, M., Píbil, R., & Moler, Z. (2014). Agent-based Simulation Testbed for On-demand Mobility Services. Procedia Computer Science, 32, 808-815.
Cheng, S.-F., & Nguyen, T.D. (2011). Taxisim: A multiagent simulation platform for evaluating taxi fleet operations. Paper presented at the Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology-Volume 02.
Cordeau, J.-F. (2006). A branch-and-cut algorithm for the dial-a-ride problem. Operations research, 54(3), 573-586.
Cordeau, J.-F., & Laporte, G. (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37(6), 579-594.
Cordeau, J.-F., & Laporte, G. (2007). The dial-a-ride problem: models and algorithms. Annals of operations Research, 153(1), 29-46.
Davidsson, P., Persson, J.A., & Holmgren, J. (2007, 2007//). On the Integration of Agent-Based and Mathematical Optimization Techniques. Paper presented at the Agent and Multi-Agent Systems: Technologies and Applications, Berlin, Heidelberg.
Garaix, T., Artigues, C., Feillet, D., Josselin, D.J.C., & Research, O. (2011). Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation. 38(10), 1435-1442.
Herbawi, W.M., & Weber, M. (2012). A genetic and insertion heuristic algorithm for solving the dynamic ridematching problem with time windows. Paper presented at the Proceedings of the 14th annual conference on Genetic and evolutionary computation.
Ho, S.C., Szeto, W.Y., Kuo, Y.-H., Leung, J.M.Y., Petering, M., & Tou, T.W.H. (2018). A survey of dial-a-ride problems: Literature review and recent developments. Transportation Research Part B: Methodological, 111, 395-421.
Hyytiä, E., Penttinen, A., & Sulonen, R. (2012). Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives. Computers & operations research, 39(12), 3021-3030.
Inturri, G., Le Pira, M., Giuffrida, N., Ignaccolo, M., Pluchino, A., Rapisarda, A., & D'Angelo, R. (2019). Multi-agent simulation for planning and designing new shared mobility services. Research in Transportation Economics, 73, 34-44.
Jaw, J.-J., Odoni, A.R., Psaraftis, H.N., & Wilson, N.H. (1986). A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research Part B: Methodological, 20(3), 243-257.
Kikuchi, S.J.J.o.T.E. (1984). Scheduling of demand-responsive transit vehicles. 110(6), 511-520.
Lois, A., & Ziliaskopoulos, A. (2017). Online algorithm for dynamic dial a ride problem and its metrics. Transportation Research Procedia, 24, 377-384.
Lu, W., Shen, C.-W., & Quadrifoglio, L. (2014). Innovative Operating Strategies for Paratransit Services with Zoning. Transportation Research Record, 2469(1), 120-128.
Maalouf, M., MacKenzie, C.A., Radakrishnan, S., & Court, M. (2014). A new fuzzy logic approach to capacitated dynamic Dial-a-Ride problem. Fuzzy Sets and Systems, 255, 30-40.
Madsen, O.B., Ravn, H.F., & Rygaard, J.M. (1995). A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of operations Research, 60(1), 193-208.
Marković, N., Nair, R., Schonfeld, P., Miller-Hooks, E., & Mohebbi, M. (2015). Optimizing dial-a-ride services in Maryland: Benefits of computerized routing and scheduling. Transportation Research Part C: Emerging Technologies, 55, 156-165.
Miyamoto, T., Nakatyou, K., & Kumagai, S. (2003). Route planning method for a dial-a-ride problem. Paper presented at the SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme-System Security and Assurance (Cat. No. 03CH37483).
Muelas, S., LaTorre, A., & Pena, J.-M. (2015). A distributed VNS algorithm for optimizing dial-a-ride problems in large-scale scenarios. Transportation Research Part C: Emerging Technologies, 54, 110-130.
Nuzzolo, A., Persia, L., & Polimeni, A. (2018). Agent-Based Simulation of urban goods distribution: A literature review. Transportation Research Procedia, 30, 33-42.
Oxley, P. (1980). Dial/a/ride: a review. Transportation Planning and Technology, 6(3), 141-148.
Parragh, S.N., Doerner, K.F., & Hartl, R.F. (2007). A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations, to appear: Journal für Betriebswirtschaft.
Parragh, S.N., Doerner, K.F., & Hartl, R.F. (2008). A survey on pickup and delivery models part ii: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft, 58(2), 81-117.
Parragh, S.N., Doerner, K.F., Hartl, R.F., & Gandibleux, X. (2009). A heuristic two‐phase solution approach for the multi‐objective dial‐a‐ride problem. Networks: An International Journal, 54(4), 227-242.
Psaraftis. (1980). A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science, 14(2), 130-154.
Shen, C.-W., & Quadrifoglio, L. (2012). Evaluation of zoning design with transfers for paratransit services. Transportation Research Record, 2277(1), 82-89.
Solomon, M.M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations research, 35(2), 254-265.
Stein, D.M.J.T.S. (1978). Scheduling dial-a-ride transportation systems. 12(3), 232-249.
Taillandier, P., Vo, D.-A., Amouroux, E., & Drogoul, A. (2012, 2012//). GAMA: A Simulation Platform That Integrates Geographical Information Data, Agent-Based Modeling and Multi-scale Control. Paper presented at the Principles and Practice of Multi-Agent Systems, Berlin, Heidelberg.
Torkjazi, M., & Huynh, N. (2019). Effectiveness of Dynamic Insertion Scheduling Strategy for Demand-Responsive Paratransit Vehicles Using Agent-Based Simulation. Sustainability, 11(19), 5391.
Xiang, Z., Chu, C., & Chen, H. (2008). The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments. European Journal of Operational Research, 185(2), 534-551.
Zidi, I., Mesghouni, K., Zidi, K., & Ghedira, K. (2012). A multi-objective simulated annealing for the multi-criteria dial a ride problem. Engineering Applications of Artificial Intelligence, 25(6), 1121-1131.
校內:2026-02-17公開