References
- Bent, R.; Van Hentenryck, P. 2004. A two-stage hybrid local search for the vehicle routing problem with time windows, Transportation Science 38(4): 515–530. http://dx.doi.org/10.1287/trsc.1030.0049
- Chakroborty, P.; Wivedi, T. 2002. Optimal route network design for transit systems using genetic algorithms, Engineering Optimization 34(1): 83–100. http://dx.doi.org/10.1080/03052150210909
- Chiang, W.-C.; Russell, R. A. 1996. Simulated annealing metaheuristics for the vehicle routing problem with time windows, Annals of Operations Research 63(1): 3–27. http://dx.doi.org/10.1007/BF02601637
- Jahangiri, A.; Afandizadeh, S.; Kalantari, N. 2011, The otimization of traffic signal timing for emergency evacuation using the simulated annealing algorithm, Transport 26(2): 133–140. http://dx.doi.org/10.3846/16484142.2011.584959
- Jerby, S.; Ceder, A. 2006. Optimal routing design for shuttle bus service, Transportation Research Record 1971: 14–22. http://dx.doi.org/10.3141/1971-04
- Kirkpatrick, S.; Gelatt, C. D.; Vecchi, M. P. 1983. Optimization by simulated annealing, Science 220: 671–680. http://dx.doi.org/10.1126/science.220.4598.671
- Kuo, Y.; Luo, C.-M. 2011. Optimization of circular-type routes for a shuttle bus service, in TRB 90th Annual Meeting Compendium of Papers DVD, 23–27 January 2011, Washington DC. 12 p. ( DVD).
- Kuo, Y.; Yang, T.; Cho, C.; Tseng, Y.-C. 2008. Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors, Mathematics and Computers in Simulation 78(1): 40–56. http://dx.doi.org/10.1016/j.matcom.2007.06.002
- Lee, D.-H.; Cao, Z.; Meng, Q. 2007. Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm, International Journal of Production Economics 107(1): 115–124. http://dx.doi.org/10.1016/j.ijpe.2006.08.003
- Lundy, M.; Mees, A. 1986. Convergence of an annealing algorithm, Mathematical Programming 34(1): 111–124. http://dx.doi.org/10.1007/BF01582166
- Osman, I. H. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Annals of Operations Research 41(4): 421–451. http://dx.doi.org/10.1007/BF02023004
- Peško, Š. 2003. On closed bus line for disabled passengers, Journal of Information, Control and Management Systems 1(2): 69–74.
- Phadke, M. S. 1989. Quality Engineering Using Robust Design. 1st edition, Prentice Hall. 333 p.
- Tavakkoli-Moghaddam, R.; Safaei, N.; Gholipour, Y. 2006. A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length, Applied Mathematics and Computation 176(2): 445–454. http://dx.doi.org/10.1016/j.amc.2005.09.040
- Teodorović, D. 1986. Transportation Networks: A Quantitative Treatment. Routledge. 232 p.
- Van Breedam, A. 1995. Improvement heuristics for the vehicle routing problem based on simulated annealing, European Journal of Operational Research 86(3): 480–490. http://dx.doi.org/10.1016/0377-2217(94)00064-J
- Zhao, F.; Zeng, X. 2006. Optimization of transit network layout and headway with a combined genetic algorithm and simulated annealing method, Engineering Optimization 38(6): 701–722. http://dx.doi.org/10.1080/03052150600608917