Speakers and Courses

Short Courses:

MC1 Iterated Greedy Algorithms: fundamentals, applications, and results.
Rubén Ruiz,
Universitat Politècnica de València, España.

MC2 Production Scheduling Problems: Reducing the theoretical-practical gap.
José Manuel Framiñán,
Universidad de Sevilla, España.

MC3 Optimal and Stable Matchings for Better Health Care.
Roger Z. Ríos,
Universidad Autónoma de Nuevo León, Mexico.

MC4 Applications of Operational Research to problems of social interest.
Hector Cancela,
Universidad de la República, Uruguay.

MC5 Successful applications of Operational Research in Chile and Argentina in the last 15 years.
Guillermo Durán,
Universidad de Buenos Aires, Argentina.

MC6 From workday shifts planning to list-coloring problem.
Graciela L. Nasini,
Universidad Nacional de Rosario, Argentina.

MC7 Operational Research Applications to Circular Economy.
Juan G. Villegas,
Universidad de Antioquia, Colombia.

MC8 Models and Algorithms for the Design of Public Transport Networks.
Antonio Mauttone,
Universidad de la República, Uruguay.

Tutorials:

TT1 Recent optimization algorithms to solve NP-hard problems: decision diagrams, dynamic programming, and CP/IP solver strategies.
Rosiane de Freitas,
Universidade Federal do Amazonas, Brasil.

TT2 In Operational Research practice does matter.
Jaime Miranda,
Universidad de Chile, Chile.

TT3 Optimization in Software-based Communication Networks.
Diego Pinto-Roa,
Universidad Nacional de Asunción, Paraguay.

MC1. Iterated Greedy Algorithms: fundamentals, applications, and results.

The Iterated Greedy Algorithm is a search method that iterates over constructive heuristics repeating two phases: the partial destruction of the current solution and the subsequent reconstruction of a new solution. Besides this simple reconstruction technique, the Iterated Greedy Algorithm can be combined with local search techniques. The simplicity of this method makes it to have a high performance and to get results that are the state of the art for many problems. In this short course we will review the fundamental principles to implement an Iterated Greedy Algorithm and we will present the results obtained for many optimization problems.

Rubén Ruiz
Universitat Politècnica de València, España.

Prof. Rubén Ruiz is a full professor at "Dpto. de Estadística e Investigación Operativa Aplicadas" of the Universitat Politècnica de València, Spain; and he is Head of the Research Group of Systems of Applied Optimization. Prof. Rubén Ruiz is Chief Editor of the Elsevier open-access journal "Operations Research Perspectives" (ORP). He is also Co-Editor of the "European Journal of Industrial Engineering" (EJIE). He is Associate Editor and Editorial Committee Member of journals such as TOP, "European Journal of Operational Research" (EJOR), "Computers and Operations Research" (COR), "Mathematical Problems in Engineering" (MPE), and others. His research interests are scheduling in realistic productive environments, logistics and metaheuristics.
Go to top

MC2. Production Scheduling Problems: Reducing the theoretical-practical gap.

It is known that production scheduling is a source of competitive advantage in the operation of several industrial companies. For many factories, the large amount of data and constraints make these decision problems impossible to solve for humans, needing the support of computer processing. On the other hand, most programming deals with relatively structured data and usually well-defined decision problems, so it should be easy to exploit the advances in the areas of Operational Research, Production Management, and Information Systems to support humans in complex decision-making processes. Despite this, many researchers in the area think that there is still a lot missing to bring the results obtained in the theoretical problems to be applied in real problems. This short course is a reflection on the recognized gap between the programming of theoretical and practical production, where several promising lines of research with high-impact practical applications will be pointed out. The purpose of this short course is to promote research on these topics together with its application in floor practices.

José Manuel Framiñán
Universidad de Sevilla, España.

Prof. José M. Framiñán is a full professor at the "Escuela Técnica Superior de Ingeniería" of the Universidad de Sevilla, Spain; and he is Head of the Research Group on Industrial Organization. His research interests are models and decision systems in the production and services industry, including decision processes related to the design and optimization of planning and scheduling in production and supply chains, as well as information systems as support infrastructure. Prof. José M. Framiñán is Chief Editor of the "European Journal of Industrial Engineering (EJIE)", and he is Scheduling Area Editor of the "Flexible Services and Manufacturing Journal".
Go to top

MC3. Optimal and Stable Matchings for Better Health Care.

Matching problems are an important class of discrete optimization problems involving assignment decisions among vertices in an underlying graph. Important applications in traditional areas such as transportation, routing, and scheduling, to name a few, rely on adequate modeling and efficient solution approaches to matching problems. More recently, areas such as health care management have also found a significant and important outlet among matching applications.
In this short course, a particular class of matching problems that have a direct and significant impact on health care management applications will be covered. In the first part of the course, stable matching problems and their impact on medical resident assignment will be discussed. This will cover the definition and fundamentals of the stable matching problem, the Gale-Shapley solution algorithm, and its application in a real-world large scale problem such as the US National Resident Matching Program. In the second part of the course, kidney exchange problems and their influence in developing successful kidney paired donation programs will be discussed. After defining the basics and fundamentals of the kidney exchange problem, several models, solution algorithms, and their impact in significantly reducing waiting times for renal-disease patients will be highlighted.

Roger Z. Ríos
Universidad Autónoma de Nuevo León, México.

Prof. Roger Ríos is a full professor of Operations Research at the Graduate Program in Systems Engineering of the Universidad Autónoma de Nuevo León, México. He holds a Ph.D. in Operations Research from the University of Texas at Austin. He has held Visiting Scholar positions at the University of Texas at Austin (OR/IE Program), Barcelona Tech (Department of Statistics and Operations Research), University of Colorado (Leeds School of Business), and University of Houston (High Performance Computing Center). His research interests are mainly in the design and development of efficient solution methods for hard discrete optimization problems. He has addressed applied decision-making problems on districting, location, health care, natural gas transportation systems, and scheduling. His research has been published in leading journals in the field. He is an Editor for Computers & Operations Research and he is a member of the Editorial Board of Operations Research Perspectives. More about his work can be found at http://yalma.fime.uanl.mx/~roger/.
Go to top

MC4. Applications of Operational Research to problems of social interest.

In this short course we will show how operational research techniques are applied to some problems of social interest, such as: the problem of home assignment to members of cooperatives, the programming of public shows such as the Carnival Contest in Montevideo in which they participate groups of children and adolescents, etc. The short course will explain the differentiated context of these real problems, where the objective functions do not seek to optimize costs or times, but are focused on increasing the satisfaction of the involved people while maintaining certain criteria of justice. The definition and mathematical modeling of these problems will also be explained, in addition to the process of building useful tools to solve these real problems in the practice.

Hector Cancela
Universidad de la República, Uruguay.

Prof. Héctor Cancela is a full professor at the "Departamento de Investigación Operativa" of the "Instituto de Computación", "Facultad de Ingeniería" of the Universidad de la República, Uruguay. He is a Level five Researcher of the Program of Development of Basic Sciences (PEDECIBA) and Level III Researcher of the National System of Researchers of Uruguay. His research work within the area of Operational Research are focused into the use of models of stochastic processes and networks, and their joint application with Monte Carlo simulation techniques and optimization techniques to solve problems in diverse areas such as: communications, transportation, agribusiness, production, biological applications, etc.
Go to top

MC5. Successful applications of Operational Research in Chile and Argentina in the last 15 years.

In this short course we will examine the application of modern techniques of Operational Research to solve real-world problems in Argentina and Chile in the last 15 years. Among the examples we will consider the design and algorithmic solution of combinatorial auctions, the programming of sports leagues and other sports analytical problems, garbage collection and street cleaning in several cities, and logistics, transportation, and production planning in the industry of the Salmon. In each case, we will review the employed techniques and the difficulties that we faced to find solutions to a variety of daily situations that arise in private, public, and non-profit organizations.

Guillermo Durán
Universidad de Buenos Aires, Argentina; Universidad de Chile, Chile.

Prof. Guillermo Durán is a full profesor at the "Departamento de Matemática" of the "Facultad de Ciencias Exactas y Naturales", and he is Head of the Calculus Institute of the Universidad de Buenos Aires, Argentina. Prof. Guillermo Durán is Main Researcher of the "Consejo Nacional de Investigaciones Científicas y Técnicas" (CONICET) of Argentina. He is also a partial-time professor at the "Departamento de Ingeniería Industrial" and Associate Researcher of the "Instituto Sistemas Complejos de Ingeniería" (ISCI) of the Universidad de Chile. He is an Operational Research Consultant for many public and private organizations from Argentina and Chile. His Research interest is the Operational Research area with focus on Graph Theory and Combinatorial Optimization.
Go to top

MC6. From workday shifts planning to list-coloring problem..

This course is divided in two parts: The first part presents the experience of the modeling process through different models that we evolved for a concrete real problem, the workday shift planning. This process produced a model based on the graph list-coloring problem. The second part of this course presents methods to solve the list-coloring problem with a Branch & Price algorithm and how to solve also the workday shifts planning problem.

Graciela L. Nasini
Universidad Nacional de Rosario, Argentina.

Prof. Graciela Nasini is a full professor at the "Departamento de Matemática" of the "Facultad de Ciencias Exactas, Ingeniería y Agrimensura" and she is Head of the Doctorate Program in Mathematic of the Universidad Nacional de Rosario, Argentina. Her research interests are focused in Combinatorial Optimization and Graph Theory. She has more than 60 publications in international scientific journals and congresses. She has directed four doctorate thesis and two master dissertations, and she has co-directed three doctorate thesis. Likewise, she is reviewer of journals of this area, and scientific research project evaluator for argentinean and foreign entities.
Go to top

MC7. Operational Research Applications to Circular Economy.

Circular economy raises the need to rethink current open systems (in which resources are extracted, to make new products, which are discarded at the end of their life cycle) to replace them with systems that reuse resources and conserve energy. This new way of conceiving the economy, production, and consumption brings along many challenges for the management of company operations. These challenges include among others the (re)design of products, the management of reverse flows and the creation of new business models. This short course present those topics in three parts: (i) the fundamental principles and strategies of the circular economy; (ii) some of the challenges and opportunities that it offers for the application of analytical tools and operational research; and finally, (iii) real examples of the application of operational research tools for the design of reverse flows and industrial symbiosis.

Juan G. Villegas
Universidad de Antioquia, Colombia.

Prof. Juan G. Villegas is a full professor at the "Departamento de Ingeniería Industrial" at the Universidad de Antioquia, Colombia. His research interests include the use of exact, heuristic and metaheuristic methods for the optimization (mono and multiobjective) and their applications in logistics, transport, healthcare, energy and insurances. Prof. Juan G. Villegas is member of the Research Group of Innovation and Supply Chain Management (INCAS). Between October 2014 and August 2017 he was president of the Colombian Association of Operational Research (ASOCIO). He is member of the editorial committee of the journal Operations Research Perpectives, a new open-access journal in Operational Research and Management Sciences.
Go to top

MC8. Models and Algorithms for the Design of Public Transport Networks.

This short course will present the application of Operational Research methods to some network design problems applied to the strategic and tactical planning of public transportation. It will present a unified vision of the existing models and algorithms for the optimization of public transportation networks. It will address problems related to infrastructure construction (bus corridors, trains, subways) and service design (routes and frequencies). It will explain several mathematical programming formulations, paying attention to the modeling of physical and economic constraints as well as the modeling of the system's performance from the point of view of the different actors involved. Finally, It will present specific developments regarding the optimization of paths and frequencies, including exact and heuristic approaches, as well as applications to several real cases.

Antonio Mauttone
Universidad de la República, Uruguay.

Prof. Antonio Mauttone is an associate professor at the "Instituto de Computación" of the Universidad de la República, Uruguay; and he is Researcher of the Program of Development of Basic Sciences (PEDECIBA) and of the National Agency of Research and Innovation of Uruguay. His research interests are the application of optimization and simulation techniques to problems of planning and operation of Urban Transportation Systems.
Go to top

TT1. Recent optimization algorithms to solve NP-hard problems: decision diagrams, dynamic programming, and CP/IP solver strategies.

Combinatorial optimization problems in which no algorithms are known that solve large-scale instances of them exactly in a reasonable computational time (polynomial time) belong to the NP-hard class of computational problems. Recently, advances in solving such problems have been reported through revisiting some classic exact algorithmic strategies, such as decision diagrams, dynamic programming, Algorithm X with dancing links (DLX) and other types of smart backtracking algorithms. In this lecture, it will be given an overview of such algorithmic methods and their application of hybrid strategies in CP/IP solvers. In CP (constraint programming), to reduce variable domain, to enhance constraint propagation techniques and generate additional global constraints. In IP (integer programming), to generate primal heuristics, provide better bounds and relaxations, reduce the branching process, enhance dynamic programming techniques, among others. A summary of the main results involving Operational Research and Artificial Intelligence problems, since classical applications of exact cover models (tiling, Sudoku, and N-Queens), maximum flow computation in large-scale networks, learning in (meta)heuristic techniques, Markov decision problems, and mainly, in single-machine (sequencing) and parallel-machine scheduling problems will be presented.

Rosiane de Freitas,
Universidade Federal do Amazonas, Brasil.

Prof. Rosiane de Freitas is a Brazilian computer scientist, full research Professor at Institute of Computing of the Federal University of Amazonas (IComp/UFAM), with a Ph.D. in Computer Science and Systems Engineering from the Federal University of Rio de Janeiro (UFRJ), and a Master degree in Computer Science from the University of Campinas (UNICAMP), Brazil. She is the Research Group Leader of the Brazilian National Council for Scientific and Technological Development (CNPq) on "Optimization, Algorithms and Computational Complexity"; developing theoretical and applied CS/OR/IA research, besides acting in graduate and undergraduate courses in Computer Science and Engineering, also acting in the training of Brazilian elementary and high school teachers. She has expertise in combinatorial optimization, acting on the following subjects: exact and approximate combinatorial algorithms, mathematical programming, scheduling theory, computational complexity, and graph theory, also involving large-scale networks, distributed and parallel systems, coloring in graphs, bioinformatics, with emphasis on planning and control of production, telecommunications, forest dynamics, and smart digital entertainment. She partners with renowned researchers and institutions around the world, currently serving as VP IFORS/ALIO - Vice President representing Latin America at the International Federation of Operational Research Societies (IFORS), and also a member of the steering committee on The Association of Latin-Iberoamerican Operational Research Societies (ALIO). She is also currently Brazil's representative at CLEI, the Latin-American Center for Informatics Studies. She coordinates scientific and technological (hackathons) programming contests as a member of the national board of the Brazilian Computer Society (SBC) and member of The ICPC International Collegiate Programming Contest. She is member of SBC Digital Girls program and international women scientific associations, co-founder of "Cunhantã Digital", with actions focused on the northern region of Brazil, assisting in advancing the careers and goals of women in STEM (Science, Technology, Engineering, and Mathematics). She is co-founder of a smart digital entertainment startup, FunTechShow.
Go to top

TT2. In Operational Research practice does matter.

In this seminar we will examine the application of various techniques based on Operational Research to solve real problems as part of the team of the University of Chile in the last 10 years. Through the use of cases, we will discuss the design of different solution approaches to solve real problems related to public transportation, scheduling of sports events, shift design, optimization of university infrastructure and long-term capacity planning, among others. In each case, we will analyze the used techniques and the main difficulties that we faced to find the best solution to the problem, both for public organizations, private companies and non-profit organizations.

Jaime Miranda
Universidad de Chile, Chile.

Prof. Jaime Miranda is a full professor and Head of the "Departamento de Control de Gestión y Sistemas de Información" of the Universidad de Chile, and he is academic principal of the lato sensu graduate courses in Business Intelligence and Operations and Logistics Management of the "Escuela de Educación Ejecutiva". He has been president of the "Asociación Latino-Ibero-Americana de Investigación Operativa" (ALIO) and of the Chilean Institute of Operational Research (ICHIO). He has published many papers in international scientific journals on Operational Research and Analytics. He has actively participated in projects of research and development (R+D) in many companies. Those projects have implemented many Decision Support Systems (DSS).
Go to top

TT3. Optimization in Software-based Communication Networks.

In this tutorial we will review some of the main paradigms of software controlled communications (softwarized networks) such as EON, SDN, VFN; and the need to propose solutions to their main problems in the areas of design, administration and failure protection. The tutorial is divided into (i) an introduction to the technological layers of communication networks, (ii) the types of services and communication restrictions that determine the main optimization challenges, (iii) proposals for current exact, heuristic, and metaheuristic solutions, and finally (iv) research challenges and opportunities. The objective of this tutorial is to show the impact of optimization for the success of communication technologies and consequently encourage its approach.

Diego Pinto-Roa
Universidad Nacional de Asunción, Paraguay.

Prof. Diego Pinto-Roa is a full professor and researcher at the "Facultad Politécnica" at "Universidad Nacional de Asunción" (FPUNA). He is vice-president of the Paraguayan Mathematical Society (SMP), director of the Center for Research in Applied Mathematics (CIMA), and researcher (PRONII Level 2) of the National System of Researchers Conacyt of Paraguay. Among his research interests are classic and modern optimization techniques applied to combinatorial and machine learning problems.
Go to top