Smart cities represent a great opportunity to design and implement efficient and sustainable services in different sectors (mobility, energy, health, distributive logistic, ...). In order to have real intelligence in these services it is required to have optimality of design and management with respect to different criteria (energy, risk, cost, impact, ...).
The objective of this project is the design and implementation of new models and algorithms for finding the complete set of efficient solutions for some fundamental bi-criteria network optimization problems underlying the planning and management operations of smart cities logistic and mobility systems. In this context, we will also study new algorithms to analyze the dynamic evolution of smart cities networks.
We believe that in the smart cities context environmental-aware logistics and mobility play a very important role but, due to the complexity of this scenario, more than one criteria has to be optimized simultaneously. The project proposes new algorithms for some of the fundamental bi-objective network optimization problems underlying the planning and management of real logistics systems in smart cities. We wish to apply these algorithms in practical logistic and mobility scenarios and I believe this contribution to be very valuable for the research activity of the Department of Statistical Sciences in the areas of multicriteria decision making and logistics.
[1] Amorosi L., Bi-Criteria Network Optimization: Problems and Algorithms. PhD Thesis, Department of Statistical Sciences, 2017.
[2] R. Ahuja, T. Magnanti, and J. Orlin. Network Flows Theory: Algorithms and Applications. Prentice Hall, 1993.
[3] Shoup D.C. The high cost of free parking, Planners Press Chicago, 2005.
[5] Martins E.Q.V. On a multicriteria shortest path problem. European Journal of Operational Research, Vol. 16: 236¿245, 1984.
[7] Tung C.T., Chew K.L. A multicriteria Pareto-optimal path algorithm. European Journal of Operational Research, Vol. 62: 203¿209, 1992.
[8] Clímaco J.C.N., Martins E.Q.V. A bicriterion shortest path problem. European Journal of Operational Research, Vol. 11: 399 404, 1982.
[9] Serafini P. Some considerations about computational complexity for multi-objective combinatorial problems. In: Jahn J., Krabs W., editors. Recent advances and historical development of vector optimization, Lecture Notes in Economics and Mathematical System. Berlin: Springer, Vol. 294: 222-232, 1986.
[10] E. Ulungu and J. Teghem. The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Foundations of Computing and Decision Sciences, Vol. 20: 149¿165, 1995
[11] Ehrgott M. A discussion of scalarization techniques for multiple objective integer programming. Annals of Operations Research, Vol. 147: 343¿360, 2006.
[12] Ehrgott M. and Gandibleux X. A survey and annotated bibliography on multiobjective combinatorial optimization. OR Spektrum, Vol. 22: 425 460, 2000.
[13] Skriver A.J.V. A classification of bicriterion shortest path (BSP) algorithms. Asia-Pacific Journal of Operational Research, Vol. 17: 199-212, 2000.
[14] Martins E.Q.V., Dos Santos J.L.E. The labelling algorithm for the multiobjective shortest path problem. Technical Report, Departamento de Matématica, Universidade de Coimbra, Portugal, http://www.mat.uc.pt/~eqvm/cientificos/investigacao/mo_papers.html, 2000.
[15] Guerriero F., Musmanno R. Label correcting methods to solve multicriteria shortest path problems. Journal of Optimization Theory and Applications, Vol. 111 (3): 589-613, 2001.
[16] Sastry V.N., Janakiraman T.N., Mohideen S.I. New algorithms for multi objective shortest path problem. Opsearch, Vol. 40 (4): 278-98, 2003.
[17] Corley H.W., Moon I.D. Shortest paths in networks with vector weights. Journal of Optimization Theory and Applications, Vol. 46 (1): 79¿86, 1985.
[18] Müller-Hannemann M., Weihe K. On the cardinality of the Pareto set in bicriteria shortest path problems. Annals of Operations Research, Vol. 147: 269-86, 2006.
[19] Raith A. and Ehrgott M. A comparison of solution strategies for biobjective shortest path problems. Computers & Operations Research, Vol. 36: 1299-1331, 2009.
[20] Carlyle W.M., Wood R.K. Near-shortest and k-shortest simple paths. Networks, Vol. 46 (2): 98-109, 2005.
[21] Mote J., Murthy I., Olson D.L. A parametric approach to solving bicriterion shortest path problems. European Journal of Operational Research, Vol. 53: 81-92, 1991.
[22] Cintrano C., Stolfi D.H., Toutouh J., Chicano F., Alba E. CTPATH: A Real World System to Enable Green Transportation by Optimizing Environmentaly Friendly Routing Paths. International Conference on Smart Cities (Smart-CT), pp. 63-75, 2016.
[23] Kuhn H.W., The Hungarian Method for the Assignment Problem, Naval Research Logistics Quarterly Vol. 2: 83¿97, 1955
[24] Charnes A. ,Cooper W.W., Niehaus R.J., Stredry A. Static and dynamic assignment models with multiple objectives and some remarks on organization design. Management Science, Vol. 15: 365¿375, 1969¿
[25] Bhatia H.L., Malhotra R., Puri M.C. Bicriteria assignment problem. Operations Research, Vol. 19 (2): 84-96, 1982.
[26] Tuyttens D., Teghem J., Fortemps P., Van Nieuwenhuyse K. Performance of the MOSA method for the bicriteria assignment problem. Journal of Heuristics, Vol. 6 (3): 295-310, 2000.
[27] Si-Ping Zhang, Zi-Gang Huang, Jia-Qi Dong, Daniel Eisenberg, Thomas P Seager and Ying-Cheng Lai, Optimization and resilience of complex supply-demand networks, New Journal of Physics, June 2015
[28] Marta C. González, César A. Hidalgo & Albert-László Barabási, Understanding individual human mobility patterns. Nature, volume 453, pages 779¿782 (05 June 2008)