The Transactions of The Korean Institute of Electrical Engineers (전기학회논문지)

The Korean Institute of Electrical Engineers (대한전기학회)
권호 표지
DOI QR코드

DOI QR Code

A Dispatching and Routing Algorithm for Personal Rapid Transit by Considering Congestion

정체를 고려한 Personal Rapid Transit 배차 및 경로 계획 알고리즘

  • Received : 2015.10.08
  • Accepted : 2015.10.29
  • Published : 2015.11.01
Download PDF
⟨ Previous Next ⟩

Abstract

Personal rapid transit (PRT) is getting attention as a new form of transportation. It is energy efficient and provides the high level of passenger service. In this study, the dynamic PRT dispatching and routing problem is dealt with. Passengers request transportation service on a complex network, and an operating system monitors passenger arrivals and coordinates vehicles in real time. A new online dispatching and routing algorithm is proposed, which minimizes the total travel distance of vehicles and the waiting time of passengers. The algorithm dispatches vehicles by considering multiple vehicles' state and multiple passengers at the same time. In particular, finding the shortest-time path is attempted by taking into account the future congestion on lanes. Discrete-event simulation is employed to validate the performance of the proposed algorithm. The results show the algorithm in this study outperforms others.

Keywords

References

  1. K. Mueller and S. P. Sgouridis, "Simulation-based analysis of personal rapid transit systems: service and energy performance assessment of the Masdar City PRT case", Journal of advanced transportation, vol. 45, No. 4, pp. 252-270, 2011. https://doi.org/10.1002/atr.158
  2. UK Tram, "Advice Note for Promoters Considering Personal Rapid Transit (PRT)", 2012
  3. P. J. Egbelu and J. M. A. Tanchoco, "Characterization of automatic guided vehicle dispatching rules", International Journal of Production Research, vol. 22, No. 3, pp. 359-374, 1984. https://doi.org/10.1080/00207548408942459
  4. S. Lee, "The role of centrality in ambulance dispatching", Decision Support Systems, vol. 54, No. 1, pp. 282-291, 2012. https://doi.org/10.1016/j.dss.2012.05.036
  5. U. Bilge, G. Esenduran, N. Varol, Z. Ozturk, B. Aydin and A. Alp, "Multi-attribute responsive dispatching strategies for automated guided vehicles", International Journal of Production Economics, vol. 100, No. 1, pp. 65-75, 2006. https://doi.org/10.1016/j.ijpe.2004.10.004
  6. Y. Ho and H. Liu, "A simulation study on the performance of pickup-dispatching rules for multiple-load AGVs", Computers & Industrial Engineering, vol. 51, No. 3, pp. 445-463, 2006. https://doi.org/10.1016/j.cie.2006.08.007
  7. B. Zhicheng, M. Weijian, Y. Xiaoming, Z. Ning and M. Chao, "Modified Hungarian Algorithm for Real-Time ALV Dispatching Problem in Huge Container Terminals", Journal of Networks, vol. 9, No. 1, pp. 123-130, 2014.
  8. A. C. Regan, H. S. Mahmassani and P. Jaillet, "Evaluation of Dynamic Fleet Management System: A Simulation Framework", Transportation Research Board, 1998.
  9. B. Kim, J. Shin, S. Jeong and J. Koo, "Effective overhead hoist transport dispatching based on the Hungarian algorithm for a large semiconductor FAB", International Journal of Production Research, vol. 47, No. 10, pp. 2823-2834, 2009. https://doi.org/10.1080/00207540701491090
  10. P. K. Sheridan, E. Gluck, Q. Guan, T. Pickles, B. Balcioglu and B. Benhabib, "The dynamic nearest neighbor policy for the multi-vehicle pick-up and delivery problem", Transportation Research Part A vol. 49, pp. 178-194, 2013.
  11. C. Han, B. Kwon, B. Kim, R. Jeong, H. Lee and B. Ha, "An Online Personal Rapid Transit Dispatching Algorithm Based on Nearest Neighbor Dispatching Rule", Journal of the Korean Society for Simulation, vol. 23, No. 4, pp. 97-109, 2014. https://doi.org/10.9709/JKSS.2014.23.4.097
  12. K. Bartlett, J. Lee, S. Ahmed, G. Nemhauser, J. Sokol and B. Na, "Congestion-aware dynamic routing in automated material handling systems", Computers & Industrial Engineering, vol. 70, pp. 176-182, 2014. https://doi.org/10.1016/j.cie.2014.02.002
  13. B. R. Sarker and S. S. Gurav, "Route planning for automated guided vehicles in a manufacturing facility." International Journal of Production Research, vol. 43, No. 21, pp. 4659-4683, 2005. https://doi.org/10.1080/00207540500140807
  14. C. Kim and J. M. A. Tanchoco, "Conflict-free shortest-time bidirectional AGV routeing", International Journal of Production Research, vol. 29, No. 12, pp. 2377-2391, 1991. https://doi.org/10.1080/00207549108948090
  15. R. H. Mohring, E. Kohler, E. Gawrilow and B. Stenzel, "Conflict-free real-time AGV routing", Operations Research Proceedings, 2004.
  16. N. Smolic-Rocak, S. Bogdan, Z. Kovacic and T. Petrovic, "Time Windows Based Dynamic Routing in Multi-AGV Systems", Automation Science and Engineering, IEEE Transactions on, vol. 7, No. 1, pp. 151-155, 2010. https://doi.org/10.1109/TASE.2009.2016350
  17. S. Rajotia, K. Shanker and J. L. Batra, "A semidynamic time window constrained routeing strategy in an AGV system", International Journal of Production Research, vol. 36, No. 1, pp. 35-50, 1998. https://doi.org/10.1080/002075498193921
  18. C. Oboth, R. Batta and M. Karwan, "Dynamic conflictfree routing of automated guided vehicles", International Journal of Production Research, vol. 37, No. 9, pp. 2003-2030, 1999. https://doi.org/10.1080/002075499190888
  19. Y. Tanaka, T. Nishi, and M. Inuiguchi, "Dynamic Optimization of Simultaneous Dispatching and Conflictfree Routing for Automated Guided Vehicles", Journal of Advanced Mechanical Design, Systems, and Manufacturing, Vo. 4, No. 3, pp. 701-715, 2010. https://doi.org/10.1299/jamdsm.4.701
  20. T. Nishi, Y. Hiranaka and I. E. Grossmann, "A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles", Computers & Operations Research, vol. 38, No. 5, pp. 876-888, 2011. https://doi.org/10.1016/j.cor.2010.08.012
  21. I. F. A. Vis, "Survey of research in the design and control of automated guided vehicle systems", European Journal of Operational Research, vol. 170, No. 3, pp. 677-709, 2006. https://doi.org/10.1016/j.ejor.2004.09.020