M. Grazia Speranza

Last updated
M. Grazia Speranza
NationalityItalian
OccupationProfessor of Operations Research
Known forContributions to mathematical optimization
TitlePresident, International Federation of Operational Research Societies
Academic work
InstitutionsUniversity of Brescia

Maria Grazia Speranza (born 30 March 1957) is an Italian applied mathematician and operations researcher. Her research involves the application of mathematical optimization to problems including portfolio optimization and the combination of inventory management with vehicle routing.

Contents

She is a professor of operations research in the faculty of economics and business of the University of Brescia, a former vice chancellor and dean at the university, the former president of the Association of European Operational Research Societies and the INFORMS Transportation Science and Logistics Society, and the president of the International Federation of Operational Research Societies.

Education and early career

Speranza graduated from the University of Milan with a master's degree in applied mathematics in 1980 and a doctorate in applied mathematics in 1983. She arrived at the University of Brescia in 1990 after working as an assistant professor at the University of Milan from 1983 to 1987 and an associate professor at the University of Udine from 1987 to 1990. In 1994, she was promoted to full professor at the Faculty of Economics and business at the University of Brescia.

Research area and interests

Resource allocation and project scheduling, logistics, portfolio optimization, combinatorial optimization, and vehicle routing have been the key areas of her scientific endeavor. Mixed integer programming models, computational complexity, worst-case analysis, exact (branch-and-cut and branch-and-price) and heuristic algorithms have been her primary areas of research.

She has collaborated on scientific projects with both Italian and foreign colleagues, and she has co-authored publications with some of the greatest scholars like Hans Kellerer and Ulrich Pferschy of the University of Graz (Austria), Zsolt Tuza of the Hungarian Academy of Science - Budapest (Hungary), Dimitri Bertsekas of the Massachusetts Institute of Technology (U.S.A.), Michel Gendreau, Gilbert Laporte, and Alain Hertz of the University of Montreal (Canada), Martin Savelsbergh of the Georgia Institute of Technology (U.S.A. (Canada).

Administrative and society service

Committee appointments

She is a former president of the Association of European Operational Research Societies (EURO) from 2011 to 2012, [1] and president of the INFORMS Transportation Science and Logistics Society (TLS) from 2013. [2] She was the president of the International Federation of Operational Research Societies (IFORS) for 2019–2021. [3]

University appointments

Maria has served as the President of the Research Council at the University of Brescia (1998-2000) and later appointed as the Dean of the Faculty of Economics and business at the same university (2002-2008). She was appointed as the Deputy Rector of the university twice from 2000 to 2002 and again from 2017 to 2020. [2] She has been serving as the president of the Research center on ‘Models for the economy and management of transport and logistics’ since 2006.

Positions in boards of directors

She is the member of the Board of Directors of a2a, a multi-utility company and the 15th largest Italian company. She is also one of the Board of Directors of Fondazione Comunita’ Bresciana and Fondazione Nocivelli.

Other memberships activities

She has coordinated several research initiatives that have received funding from the Ministry of Higher Education, the National Research Council, and the European Union. In specifically, she led a study in "Industrial logistics" involving 12 research units as part of the National Research Council's Finalized Transportation Program 2. From 1990 to 1996, she served on the board of the Italian Operations Research Society.

She has served on committees to evaluate PhD theses from institutions throughout the world, including Troyes (France), Trondheim (Norway), Lausanne (Switzerland), and Lancaster (England) (UK).

Selected publications

She has over 366 articles published in journals with over 13360 citations. [4]

Peer-reviewed articles

Books

Speranza is the co-author, with Renata Mansini and Włodzimierz Ogryczak, of the book Linear and Mixed Integer Programming for Portfolio Optimization (EURO Advanced Tutorials in Operational Research, Springer, 2015). [15] [16]

Some of her other books are:

Related Research Articles

<span class="mw-page-title-main">Ant colony optimization algorithms</span> Optimization algorithm

In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Artificial ants stand for multi-agent methods inspired by the behavior of real ants. The pheromone-based communication of biological ants is often the predominant paradigm used. Combinations of artificial ants and local search algorithms have become a method of choice for numerous optimization tasks involving some sort of graph, e.g., vehicle routing and internet routing.

Data envelopment analysis (DEA) is a nonparametric method in operations research and economics for the estimation of production frontiers. DEA has been applied in a large range of fields including international banking, economic sustainability, police department operations, and logistical applications Additionally, DEA has been used to assess the performance of natural language processing models, and it has found other applications within machine learning.

<span class="mw-page-title-main">Vehicle routing problem</span> Optimization problem

The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?" It generalises the travelling salesman problem (TSP). It first appeared in a paper by George Dantzig and John Ramser in 1959, in which the first algorithmic approach was written and was applied to petrol deliveries. Often, the context is that of delivering goods located at a central depot to customers who have placed orders for such goods. The objective of the VRP is to minimize the total route cost. In 1964, Clarke and Wright improved on Dantzig and Ramser's approach using an effective greedy algorithm called the savings algorithm.

Arc routing problems (ARP) are a category of general routing problems (GRP), which also includes node routing problems (NRP). The objective in ARPs and NRPs is to traverse the edges and nodes of a graph, respectively. The objective of arc routing problems involves minimizing the total distance and time, which often involves minimizing deadheading time, the time it takes to reach a destination. Arc routing problems can be applied to garbage collection, school bus route planning, package and newspaper delivery, deicing and snow removal with winter service vehicles that sprinkle salt on the road, mail delivery, network maintenance, street sweeping, police and security guard patrolling, and snow ploughing. Arc routings problems are NP hard, as opposed to route inspection problems that can be solved in polynomial-time.

<span class="mw-page-title-main">Fred W. Glover</span> American computer scientist

Fred Glover is Chief Scientific Officer of Entanglement, Inc., USA, in charge of algorithmic design and strategic planning for applications of combinatorial optimization in quantum computing. He also holds the title of Distinguished University Professor, Emeritus, at the University of Colorado, Boulder, associated with the College of Engineering and Applied Science and the Leeds School of Business. He is known for his innovations in the area of metaheuristics including the computer-based optimization methodology of Tabu search an adaptive memory programming algorithm for mathematical optimization, and the associated evolutionary Scatter Search and Path Relinking algorithms.

<span class="mw-page-title-main">Iterated local search</span>

Iterated Local Search (ILS) is a term in applied mathematics and computer science defining a modification of local search or hill climbing methods for solving discrete optimization problems.

D-Sight is a company that specializes in decision support software and associated services in the domains of project prioritization, supplier selection and collaborative decision-making. It was founded in 2010 as a spin-off from the Université Libre de Bruxelles (ULB). Their headquarters are located in Brussels, Belgium.

José Luis González Velarde is a professor and researcher with the Tec de Monterrey, Monterrey Campus.

<span class="mw-page-title-main">Association of European Operational Research Societies</span>

The Association of European Operational Research Societies (EURO) is a regional grouping within the International Federation of Operational Research Societies (IFORS) whose aim is to promote Operational Research throughout Europe. It was established in 1975.

The European Journal of Operational Research (EJOR) is a peer-reviewed academic journal in operations research. It was founded in 1977 by the Association of European Operational Research Societies, and is published by Elsevier, with Roman Słowiński as its Co-ordinating Editor. Currently, it publishes at a rate of 24 issues per annual volume, with approximately 250 pages per issue.

Multi-objective linear programming is a subarea of mathematical optimization. A multiple objective linear program (MOLP) is a linear program with more than one objective function. An MOLP is a special case of a vector linear program. Multi-objective linear programming is also a subarea of Multi-objective optimization.

Aurelie or Aurélie Thiele is a French engineering and decision-making professor. She is an associate professor in the engineering management and information and systems department at the Lyle School of Engineering of Southern Methodist University.

<span class="mw-page-title-main">Sally Brailsford</span> British professor of management science (born 1951)

Sally Brailsford is a British professor of management science within Southampton Business School at the University of Southampton. Her research focuses on operational research and healthcare modelling to evaluate treatments and screening programmes, and to improve health service delivery.

<span class="mw-page-title-main">Tamás Terlaky</span> Hungarian mathematician (born 1955)

Tamás Terlaky is a Hungarian-Canadian-American professor of Industrial and Systems Engineering at Lehigh University. He is especially well known for his work on criss-cross algorithms, interior-point methods, Klee-Minty examples for path following algorithms, and optimization.

In mathematics, leximin order is a total preorder on finite-dimensional vectors. A more accurate, but less common term is leximin preorder. The leximin order is particularly important in social choice theory and fair division.

<span class="mw-page-title-main">Michel Bierlaire</span> Belgian-Swiss mathematician

Michel Bierlaire is a Belgian-Swiss applied mathematician specialized in transportation modeling and optimization. He is a professor at EPFL and the head of the Transport and Mobility Laboratory.

Unrelated-machines scheduling is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. We need to schedule n jobs J1, J2, ..., Jn on m different machines, such that a certain objective function is optimized. The time that machine i needs in order to process job j is denoted by pi,j. The term unrelated emphasizes that there is no relation between values of pi,j for different i and j. This is in contrast to two special cases of this problem: uniform-machines scheduling - in which pi,j = pi / sj, and identical-machines scheduling - in which pi,j = pi.

<span class="mw-page-title-main">Philippe Baptiste</span>

Philippe Baptiste is a French engineer, academic and researcher. Baptiste is most well known as the president of the National Centre for Space Studies CNES in addition to his several books and scientific publications and communications in the field of algorithms, combinatorial optimization, operational research and artificial intelligence.

<span class="mw-page-title-main">Ferenc Forgó</span> Hungarian mathematician, economist

Ferenc Forgó (born 16 April 1942 in Pécs) is a Hungarian economist and mathematician. He is a Doctor of the Hungarian Academy of Sciences and professor emeritus at the Corvinus University of Budapest. His main research interests have been mathematical programming and game theory.

Begoña Vitoriano Villanueva is a Spanish applied mathematician and operations researcher whose work concerns the logistics of humanitarian aid and disaster relief. She is an associate professor in the Department of Statistics and Operational Research at the Complutense University of Madrid, and the president of the Spanish Statistics and Operations Research Society.

References

  1. ↑ Previous Members of the Executive Committee, Association of European Operational Research Societies, archived from the original on 2020-12-04, retrieved 2019-09-26
  2. 1 2 Curriculum vitae (PDF), retrieved 2019-09-26
  3. ↑ Officers, International Federation of Operational Research Societies, retrieved 2019-09-26
  4. ↑ "Google Scholar".
  5. ↑ Gu, Wenjuan; Archetti, Claudia; Cattaruzza, Diego; Ogier, Maxime; Semet, Frédéric; Grazia Speranza, M. (2022-01-01). "A sequential approach for a multi-commodity two-echelon distribution problem". Computers & Industrial Engineering. 163: 107793. doi:10.1016/j.cie.2021.107793. ISSN   0360-8352. S2CID   244088262.
  6. ↑ "Optimization models for fair horizontal collaboration in demand-responsive transportation | Request PDF". ResearchGate. Retrieved 2022-01-14.
  7. ↑ Archetti, Claudia; Peirano, Lorenzo; Speranza, M. Grazia (2022-05-16). "Optimization in multimodal freight transportation problems: A Survey". European Journal of Operational Research. 299 (1): 1–20. doi: 10.1016/j.ejor.2021.07.031 . ISSN   0377-2217. S2CID   244217948.
  8. ↑ Filippi, C.; Guastaroba, G.; Huerta-Muñoz, D. L.; Speranza, M. G. (2021-08-01). "A kernel search heuristic for a fair facility location problem". Computers & Operations Research. 132: 105292. doi:10.1016/j.cor.2021.105292. ISSN   0305-0548. S2CID   233592376.
  9. ↑ Archetti, Claudia; Guastaroba, Gianfranco; Huerta-Muñoz, Diana L.; Speranza, M. Grazia (2021). "A kernel search heuristic for the multivehicle inventory routing problem". International Transactions in Operational Research. 28 (6): 2984–3013. doi:10.1111/itor.12945. ISSN   1475-3995. S2CID   234062389.
  10. ↑ Angelelli, E.; Morandi, V.; Savelsbergh, M.; Speranza, M. G. (2021-09-16). "System optimal routing of traffic flows with user constraints using linear programming". European Journal of Operational Research. 293 (3): 863–879. doi: 10.1016/j.ejor.2020.12.043 . ISSN   0377-2217.
  11. ↑ Filippi, C.; Guastaroba, G.; Speranza, M. G. (2021-03-16). "On single-source capacitated facility location with cost and fairness objectives". European Journal of Operational Research. 289 (3): 959–974. doi:10.1016/j.ejor.2019.07.045. ISSN   0377-2217. S2CID   199686321.
  12. ↑ Archetti, Claudia; Speranza, M. Grazia; Boccia, Maurizio; Sforza, Antonio; Sterle, Claudio (2020-05-01). "A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries". European Journal of Operational Research. 282 (3): 886–895. doi:10.1016/j.ejor.2019.09.056. ISSN   0377-2217. S2CID   209995032.
  13. ↑ Archetti, C.; Feillet, Dominique; Mor, A.; Speranza, M. (2020). "Dynamic traveling salesman problem with stochastic release dates". Eur. J. Oper. Res. 280 (3): 832–844. doi:10.1016/J.EJOR.2019.07.062. S2CID   199009721.
  14. ↑ Darvish, Maryam; Archetti, Claudia; Coelho, Leandro C.; Speranza, M. Grazia (2019-09-19). "Flexible two-echelon location routing problem". European Journal of Operational Research. 277 (3): 1124–1136. doi:10.1016/j.ejor.2019.04.002. ISSN   0377-2217. S2CID   132293981.
  15. ↑ Zilinskas, Antanas (February 2017), "Review of Linear and Mixed Integer Programming for Portfolio Optimization", Book Reviews, Interfaces, Institute for Operations Research and the Management Sciences (INFORMS), 47 (1): 108–109, doi: 10.1287/inte.2016.0880
  16. ↑ Mansini, Renata; Ogryczak, Włodzimierz; Speranza, M. Grazia (2015). Linear and Mixed Integer Programming for Portfolio Optimization. EURO Advanced Tutorials on Operational Research. doi:10.1007/978-3-319-18482-1. ISBN   978-3-319-18481-4. ISSN   2364-687X.
  17. ↑ Klose, Andreas; Speranza, M. Gracia; Van Wassenhove, Luk N., eds. (2002). Quantitative Approaches to Distribution Logistics and Supply Chain Management. Lecture Notes in Economics and Mathematical Systems. Vol. 519. doi:10.1007/978-3-642-56183-2. ISBN   978-3-540-43690-4. ISSN   0075-8442.
  18. ↑ Speranza, M. Grazia; Stähly, Paul, eds. (1999). New Trends in Distribution Logistics. Lecture Notes in Economics and Mathematical Systems. Vol. 480. doi:10.1007/978-3-642-58568-5. ISBN   978-3-540-66617-2. ISSN   0075-8442.
  19. ↑ Fleischmann, Bernhard; van Nunen, Jo A. E. E.; Speranza, M. Grazia; Stähly, Paul, eds. (1998). Advances in Distribution Logistics. Lecture Notes in Economics and Mathematical Systems. Vol. 460. doi:10.1007/978-3-642-46865-0. ISBN   978-3-540-64288-6. ISSN   0075-8442.
  20. ↑ Lewandowski, Andrzej; Serafini, Paolo; Speranza, Maria Grazia, eds. (1991). Methodology, Implementation and Applications of Decision Support Systems. CISM International Centre for Mechanical Sciences. Vol. 320. doi:10.1007/978-3-7091-2606-6. ISBN   978-3-211-82297-5. ISSN   0254-1971.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.