[Addor, J.A., Amponsah, S.K., Annan, J. and Sebil, C. (2013). School bus routing: A case study of wood bridge school complex, Sekondi-Takoradi, Ghana, International Journal of Business and Social Research3(12): 26–36.]Search in Google Scholar
[Arias-Rojas, J.S., Jiménez, J.F. and Montoya-Torres, J.R. (2012). Solving of school bus routing problem by ant colony optimization, Revista EIA9(17): 193–208.]Search in Google Scholar
[Azevedo, J.A. and Martins, E.Q.V. (1991). An algorithm for the multiobjective shortest path problem on acyclic networks, Investigação Operacional11(1): 52–69.]Search in Google Scholar
[Bronshtein, E.M. and Vagapova, D.M. (2015). Comparative analysis of application of heuristic and metaheuristic algorithms to the school bus routing problem, Informatics and Its Applications9(2): 56–62.]Search in Google Scholar
[Brumbaugh-Smith, J. and Shier, D. (1989). An empirical investigation of some bicriterion shortest path algorithms, European Journal of Operational Research43(2): 216–224.10.1016/0377-2217(89)90215-4]Search in Google Scholar
[Caceres, H., Batta, R. and He, Q. (2014). School bus routing with stochastic demand and duration constraints, Transportation Research Board 93rd Annual Meeting, Washington, DC, USA, pp. 1–23.]Search in Google Scholar
[Carraway, R.L., Morin, T.L. and Moskowitz, H. (1990). Generalized dynamic programming for multicriteria optimization, European Journal of Operational Research44(1): 95–104.10.1016/0377-2217(90)90318-6]Search in Google Scholar
[Chalkia, E., Grau, J.M.S., Bekiaris, E., Ayfandopoulou, G., Ferarini, C. and Mitsakis, E. (2014). Routing algorithms for the safe transportation of pupils to school using school buses, Transport Research Arena (TRA) 5th Conference: Transport Solutions from Research to Deployment, Paris, France, pp. 1–10.]Search in Google Scholar
[Chen, P. and Nie, Y.M. (2013). Bicriterion shortest path problem with a general nonadditive cost, Transportation Research B: Methodological57: 419–435.10.1016/j.trb.2013.05.008]Search in Google Scholar
[Chen, X., Kong, Y., Dang, L., Hou, Y. and Ye, X. (2015). Exact and metaheuristic approaches for a bi-objective school bus scheduling problem, PLoS ONE10(7): 1–20. DOI:10.1371/journal.pone.0132600.10.1371/journal.pone.0132600]Search in Google Scholar
[Climaco, J.C. and Martins, E.Q.V. (1982). A bicriterion shortest path algorithm, European Journal of Operational Research11(4): 399–404.10.1016/0377-2217(82)90205-3]Search in Google Scholar
[Corley, H.W. and Moon, I.D. (1985). Shortest paths in networks with vector weights, Journal of Optimization Theory and Application46(1): 79–86.10.1007/BF00938761]Search in Google Scholar
[Daellenbach, H.G. and De Kluyver, C.A. (1980). Note on multiple objective dynamic programming, Journal of the Operational Research Society31(7): 591–594.10.1057/jors.1980.114]Search in Google Scholar
[Dell’Olmo, P., Gentili, M. and Scozzari, A. (2005). On finding dissimilar Pareto-optimal paths, European Journal of Operational Research162(1): 70–82.10.1016/j.ejor.2003.10.033]Search in Google Scholar
[Díaz-Parra, O., Ruiz-Vanoye, J.A., Buenabad-Arias, A. and Cocón, F. (2012). A vertical transfer algorithm for the school bus routing problem, 4th World Congress on Nature and Biologically Inspired Computing (NaBIC), Mexico City, Mexico, pp. 66–71.]Search in Google Scholar
[Ehrgott, M. (2000). Multicriteria Optimization, Springer-Verlag, Berlin.10.1007/978-3-662-22199-0]Search in Google Scholar
[Ellegood, W. A., Campbell, J. F. and North, J. (2015). Continuous approximation models for mixed load school bus routing, Transportation Research B77: 182–198.10.1016/j.trb.2015.03.018]Search in Google Scholar
[Euchi, J. and Mraihi, R. (2012). The urban bus routing problem in the Tunisian case by the hybrid artificial ant colony algorithm, Swarm and Evolutionary Computation2: 15–24.10.1016/j.swevo.2011.10.002]Search in Google Scholar
[Garey, M. and Johnson, D. (1990). Computers and Intractibility: A Guide to the Theory of NP-Completeness, W.H. Freeman & Co., New York, NY.]Search in Google Scholar
[Hansen, P. (1980). Bicriterion path problems, in G. Fandel and T. Gal (Eds.), Multiple Criteria Decision Making: Theory and Application, Springer-Verlag, Berlin, pp. 109–127.10.1007/978-3-642-48782-8_9]Search in Google Scholar
[Henig, M.I. (1985). The shortest path problem with two objective functions, European Journal of Operational Research25(2): 281–291.10.1016/0377-2217(86)90092-5]Search in Google Scholar
[Huang, L.C., Guan, W. and Xiong, J. (2014). Routing design optimization of bus joint for passenger transfer centers, in M. Sun and Y. Zhang (Eds.), Renewable Energy and Environmental Technology, Applied Mechanics and Materials, Vol. 448, Trans Tech Publications, Zurich, pp. 4140–4149.]Search in Google Scholar
[Jungnickel, D. (1999). Graphs, Networks and Algorithms, 2nd Edition, Springer-Verlag, Berlin.10.1007/978-3-662-03822-2]Search in Google Scholar
[Kang, M., Kim, S.K., Felan, J.T., Choi, H.R. and Cho, M. (2015). Development of a genetic algorithm for the school bus routing problem, International Journal of Software Engineering and Its Applications9(5): 107–126.10.14257/ijseia.2015.9.5.11]Search in Google Scholar
[Kim, B.I., Kim, S. and Park, J. (2012). A school bus scheduling problem, European Journal of Operational Research218(2): 577–585.10.1016/j.ejor.2011.11.035]Search in Google Scholar
[Kim, T. and Park, B.J. (2013). Model and algorithm for solving school bus problem, Journal of Emerging Trends in Computing and Information Sciences4(8): 596–600.]Search in Google Scholar