Bi-objective methods for road network problems with disruptions and connecting requirements

References

• Ádám, A. (1963). Theory of graphs and its applications. In: Fiedler M (ed) Symp. Smolenice, Academic Press, New York, p. 157.
   Google Scholar
• Bang-Jensen, J., & Gutin, G. Z. (2008). Digraphs: Theory, algorithms and applications, London: Springer-Verlag, Incorporated
   Google Scholar
• Bean, J. C. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2), 154–160. doi:10.1287/ijoc.6.2.154
   Google Scholar
• Bérubé, J. F., Gendreau, M., & Potvin, J. Y. (2009). An exact ϵ-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits. European Journal of Operational Research, 194(1), 39–50. doi:10.1016/j.ejor.2007.12.014
   Web of Science ®Google Scholar
• Boesch, F., & Tindell, R. (1980). Robbins’s theorem for mixed multigraphs. The American Mathematical Monthly, 87(9), 716–719. doi:10.2307/2321858
   Web of Science ®Google Scholar
• Chankong, V., & Haimes, Y. Y. (1983). Multiobjective Decision Making: Theory and Methodology.: North-Holland: Elsevier Science Publishing.
   Google Scholar
• Chvátal, V., & Thomassen, C. (1978). Distances in orientations of graphs. Journal of Combinatorial Theory, Series B, 24(1), 61–75. doi:10.1016/0095-8956(78)90078-3
   Web of Science ®Google Scholar
• Coco, A. A., Duhamel, C., & Santos, A. C. (2019). Modeling and solving the multi-period disruptions scheduling problem on urban networks. Annals of Operations Research, doi:10.1007/s10479-019-03248-5
   Web of Science ®Google Scholar
• Conte, A., Grossi, R., Marino, A., Rizzi, R., & Versari, L. (2016). Directing road networks by listing strong orientations. In: VeliMäkinen, Puglisi SJ, Salmela L (eds) Combinatorial Algorithms – 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17–19, 2016, Proceedings, Springer, Lecture Notes in Computer Science (vol. 9843, pp. 83–95).
   Google Scholar
• Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms (3rd ed.). Cambridge: The MIT Press
   Google Scholar
• De Sousa, E. G., Santos, A. C., & Aloise, D. J. (2015). An exact method for solving the bi-objective minimum diameter-cost spanning tree problem. RAIRO – Operations Research, 49(1), 143–160. doi:10.1051/ro/2014029
   Web of Science ®Google Scholar
• Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182–197. doi:10.1109/4235.996017
   Web of Science ®Google Scholar
• Ehrgott, M., & Gandibleux, X. (2000). A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum, 22(4), 425–460. doi:10.1007/s002910000046
   Google Scholar
• Gonçalves, J. F., & Resende, M. G. C. (2011). Biased random-key genetic algorithms for combinatorial optimization. Journal of Heuristics, 17(5), 487–525. doi:10.1007/s10732-010-9143-1
   Web of Science ®Google Scholar
• Haimes, Y., Lasdon, L., & Wismer, D. (1971). On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Transactions on Systems, Man and Cybernetics SMC-1, (3), 296–297. doi:10.1109/TSMC.1971.4308298
   Google Scholar
• Huang, Y., Santos, A. C., & Duhamel, C. (2016a). A bi-objective model to address disruptions on unidirectional road networks. Paper presented at the 8th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2016, Troyes, France, 12, vol. 49, pp. 1620–1625 doi:10.1016/j.ifacol.2016.07.812
   Google Scholar
• Huang, Y., Santos, A. C., & Duhamel, C. (2016b). Disruptions management in multidirectional road networks. Proceedings of the 9th Triennial Symposium on Transportation Analysis (TRISTAN), Aruba, Netherlands, p. 4
   Google Scholar
• Huang, Y., Santos, A. C., & Duhamel, C. (2018). Methods for solving road network problems with disruptions. Electronic Notes in Discrete Mathematics, 64, 175–184. 8th International Network Optimization Conference - INOC 2017
   Google Scholar
• Huang, Y., Santos, A. C., & Duhamel, C. (2019). Model and methods to address urban road network problems with disruptions. International Transactions in Operational Research, doi:10.1111/itor.12641
   Web of Science ®Google Scholar
• Junior, H. V., & Lins, M. P. E. (2009). A win-win approach to multiple objective linear programming problems. Journal of the Operational Research Society, 60(5), 728–733. doi:10.1057/palgrave.jors.2602589
   Web of Science ®Google Scholar
• Lourenço, H. R., Martin, O. C., & Stützle, T. (2003). Iterated local search. Boston, MA: Springer US, pp. 320–353
   Google Scholar
• Lourenço, H. R., Martin, O. C., & Stützle, T. (2010). Iterated local search: Framework and applications. Boston, MA: Springer US, pp 363–397
   Google Scholar
• Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097–1100. doi:10.1016/S0305-0548(97)00031-2
   Web of Science ®Google Scholar
• Oliveira, S. L. C., & Ferreira, P. A. V. (2000). Bi-objective optimisation with multiple decision-makers: a convex approach to attain majority solutions. Journal of the Operational Research Society, 51(3), 333–340. doi:10.2307/254091
   Web of Science ®Google Scholar
• Pareto, V. (1906). Manuale di economia politica. Milan: Piccola biblioteca scientifica, Società Editrice Libraria
   Google Scholar
• Resende, M. G. C. (2012). Biased random-key genetic algorithms with applications in telecommunications. TOP, 20(3), 130–153. doi:10.1007/s11750-011-0176-x
   Web of Science ®Google Scholar
• Robbins, H. (1939). A theorem on graphs, with an application to a problem on traffic control. The American Mathematical Monthly, 46(5), 281–283. doi:10.2307/2303897
   Google Scholar
• Roberts, F. (1978). Graph theory and its applications to problems of society, CBMS-NSF Regional Conference Series in Applied Mathematics, vol 29. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM),.
   Google Scholar
• Santos, A. C., Duhamel, C., & Prins, C. (2013). Heuristics for setting directions in urban networks. The X Metaheuristics International Conference (MIC), Singapore, pp 1–4
   Google Scholar
• Santos, A. C., Lima, D. R., & Aloise, D. J. (2014). Modeling and solving the bi-objective minimum diameter-cost spanning tree problem. Journal of Global Optimization, 60(2), 195–216. doi:10.1007/s10898-013-0124-4
   Web of Science ®Google Scholar
• Spears, V. M., & Jong, K. A. D. (1991). On the virtues of parameterized uniform crossover. Proceedings of the Fourth International Conference on Genetic Algorithms, pp 230–236
   Google Scholar
• Srinivas, N., & Deb, K. (1994). Multiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput, 2(3), 221–248. doi:10.1162/evco.1994.2.3.221
   Web of Science ®Google Scholar
• Veldhuizen, D. A. V., & Lamont, G. B. (2000). On measuring multiobjective evolutionary algorithm performance. Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512), vol 1, pp 204–211
   Google Scholar
• Zhou, A., Qu, B. Y., Li, H., Zhao, S. Z., Suganthan, P. N., & Zhang, Q. (2011). Multiobjective evolutionary algorithms: A survey of the state of the art. Swarm and Evolutionary Computation, 1(1), 32–49. doi:10.1016/j.swevo.2011.03.001
   Web of Science ®Google Scholar
• Zitzler, E., & Thiele, L. (1998). Multiobjective optimization using evolutionary algorithms — a comparative case study, Berlin: Springer Berlin Heidelberg, pp. 292–301
   Google Scholar
• Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & da Fonseca, V. G. (2003). Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation, 7(2), 117–132. doi:10.1109/TEVC.2003.810758
   Web of Science ®Google Scholar
• Zopounidis, C., & Pardalos, P. (2010). Handbook of multicriteria analysis, applied optimization, vol 103. Berlin: Springer
   Google Scholar