참고문헌 (28)

1. de Almeida Correia, G. H. and Antunes, A. P. (2012), Optimization approach to depot location and trip selection in one-way carsharing systems, Transportation Research Part E : Logistics and Transportation Review, 48(1), 233-247. 

   상세보기

2. Berbeglia, G., Cordeau, J., and Laporte, G. (2010), Dynamic pickup and delivery problems, European Journal of Operational Research, 202(1), 8-15. 

   상세보기

3. Bell, M. G. H. and Wong, K. I. (2005), A rolling horizon approach to the optimal dispatching of taxis, Transportation and Traffic Theory, Flow, Dynamics and Human Interaction, 16th International Symposium on Transportation and Traffic Theory, 629-648. 

4. Bent, R. W. and Hentenryck, P. V. (2004), Scenario-Based planning for partially dynamic vehicle routing with stochastic customers, Operations Research, 52(6), 977-987. 

   상세보기

5. Confessore, G., Fabiano, M., and Liotta, G. (2013), A network flow based heuristic approach for optimising AGV movements, Journal of Intelligent Manufacturing, 24(2), 405-419. 

   상세보기

6. Choi, J. H. (2017), PRT(Personal Rapid Transit) run in Sejong New City, Chungbuk Daily. 

7. Chen, Z. L. and Xu, H. (2006), Dynamic column generation for dynamic vehicle routing with time windows, Transportation Science, 40(1), 74-88. 

   상세보기

8. Egbelu, P. J. and Tanchoco, J. M. A. (1984), Characterization of automatic guided vehicle dispatching rules, International Journal of Production Research, 22(3), 359-374. 

   상세보기

9. Fatnassi, E. and Siala, J. C. (2013), Two strategies for real time empty vehicle redistribution for the personal rapid transit system, Intelligent Transportation Systems-(ITSC), 2013 16th International IEEE Conference on. IEEE. 

10. Ferrucci, F. (2013), Pro-active dynamic vehicle routing : real-time control and request-forecasting approaches to improve customer service, Springer Science and Business Media. 

11. Gendreau, M., Laporte, G., and Semet, F. (2001), A dynamic model and parallel tabu search heuristic for real-time ambulance relocation, Parallel Computing, 27(12), 1641-1653. 

    상세보기

12. Haghani, A. and Jung, S. (2005), A dynamic vehicle routing problem with time-dependent travel times, Computers and Operations Research, 32(11), 2959-2986. 

    상세보기

13. Han, C. K., Kwon, B. B., Kim, B. H., Jeong, R. G., Lee, H., and Ha, B. H. (2014), An online personal rapid transit dispatching algorithm based on nearest neighbor dispatching rule, Journal of the Korea Society for Simulation, 23(4), 97-109. 

    원문보기 상세보기

14. Han, C. K., Kim, B. H., Jeong, R. G., and Ha, B. H. (2015), A dispatching and routing algorithm for personal rapid transit by considering congestion, The Transactions of The Korean Institute of Electrical Engineers, 64(11), 1578-1586. 

    원문보기 상세보기

15. Ho, Y. C. and Liu, H. C. (2006), A simulation study on the performance of pickup-dispatching rules for multiple-load AGVs, Computers and Industrial Engineering, 51(3), 445-463. 

    상세보기

16. Ingmar, A. (2003), Reallocation of empty PRT vehicles en route, Transportation Research Record : Journal of the Transportation Research Board, 1838. 

17. Kim, G. G., Kim, S. W., and Cho, S. J. (2013), A simultaneous delivery and pick-up heterogeneous vehicle routing problem with separate loading area, Journal of the Korean Institute of Industrial Engineers, 39(6), 554-561. 

    원문보기 상세보기

18. Lees-Miller, J. D. (2011), Empty vehicle redistribution for personal rapid transit, Thesis for the degree of PhD in the Faculty of Engineering of Bristol University. 

19. Lee, Y., Lee, C., and Park, S. (2011), A branch-and-price algorithm for the vehicle routing problem with time dependent travel times, Journal of the Korean Institute of Industrial Engineers, 37(2), 144-152. 

    원문보기 상세보기

20. Mueller, K. and Sgouridis, S. P. (2011), Simulation-based analysis of personal rapid transit systems : service and energy performance assessment of the Masdar City PRT case, Journal of Advanced Transportation, 45(4), 252-270. 

    상세보기

21. Regan, A. C., Mahmassani, H. S., and Jaillet, P. (1998), Evaluation of dynamic fleet management system : a simulation framework, Transportation Research Record, Journal of the Transportation Research Board, 1645. 

22. Sheridan, P. K., Gluck, E., Guan, Q., Pickles, T., Balcioglu, B., and Benhabib, B. (2013), The dynamic nearest neighbor policy for the multi-vehicle pick-up and delivery problem, Transportation Research Part A : Policy and Practice, 49, 178-194. 

    상세보기

23. Schmid, V. (2011), Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming, European Journal of Operational Research, 219(3), 611-621. 

24. Theis, M. (2015), How a space-faring entrepreneur intends to fix Austin's traffic woes, Austin Business Journal. 

25. Wong, K. I. and Bell, M. G. H. (2006), The optimal dispatching of taxis under congestion : A rolling horizon approach, Journal of Advanced Transportation, 40(2), 203-220. 

    상세보기

26. Weikl, S. and Bogenberger, K. (2013), Relocation strategies and algorithms for free-floating car sharing systems, IEEE Intelligent Transportation Systems Magazine, IEEE, 5(4), 100-111. 

    상세보기

27. Yoon, T. Y. and Lee, S. H. (2011), A heuristic algorithm for the periodic heterogeneous fleet vehicle routing problem, Journal of the Korean Operations Research and Management Science Society, 36(1), 27-38. 

28. Zhicheng, B., Weijian, M., Xiaoming, Y., Ning, Z., and Chao, M. (2014), Modified Hungarian algorithm for real-time ALV dispatching problem in huge container terminals, Journal of Networks, 9(1), 123-130. 

저자의 다른 논문 :

권보배 (2) 하병현 (11)