130 research outputs found
Contributions to robust and bilevel optimization models for decision-making
Los problemas de optimización combinatorios han sido ampliamente estudiados en la
literatura especializada desde mediados del siglo pasado. No obstante, en las últimas
décadas ha habido un cambio de paradigma en el tratamiento de problemas cada vez
más realistas, en los que se incluyen fuentes de aleatoriedad e incertidumbre en los
datos, múltiples criterios de optimización y múltiples niveles de decisión. Esta tesis
se desarrolla en este contexto. El objetivo principal de la misma es el de construir
modelos de optimización que incorporen aspectos inciertos en los parámetros que
de nen el problema así como el desarrollo de modelos que incluyan múltiples niveles
de decisión. Para dar respuesta a problemas con incertidumbre usaremos los modelos
Minmax Regret de Optimización Robusta, mientras que las situaciones con múltiples
decisiones secuenciales serán analizadas usando Optimización Binivel.
En los Capítulos 2, 3 y 4 se estudian diferentes problemas de decisión bajo incertidumbre
a los que se dará una solución robusta que proteja al decisor minimizando
el máximo regret en el que puede incurrir. El criterio minmax regret analiza el comportamiento
del modelo bajo distintos escenarios posibles, comparando su e ciencia
con la e ciencia óptima bajo cada escenario factible. El resultado es una solución con
una eviciencia lo más próxima posible a la óptima en el conjunto de las posibles realizaciones
de los parámetros desconocidos. En el Capítulo 2 se estudia un problema de
diseño de redes en el que los costes, los pares proveedor-cliente y las demandas pueden
ser inciertos, y además se utilizan poliedros para modelar la incertidumbre, permitiendo
de este modo relaciones de dependencia entre los parámetros. En el Capítulo
3 se proponen, en el contexto de la secuenciación de tareas o la computación grid,
versiones del problema del camino más corto y del problema del viajante de comercio
en el que el coste de recorrer un arco depende de la posición que este ocupa en el
camino, y además algunos de los parámetros que de nen esta función de costes son
inciertos. La combinación de la dependencia en los costes y la incertidumbre en los
parámetros da lugar a dependencias entre los parámetros desconocidos, que obliga a
modelar los posibles escenarios usando conjuntos más generales que los hipercubos,
habitualmente utilizados en este contexto. En este capítulo, usaremos poliedros generales
para este cometido. Para analizar este primer bloque de aplicaciones, en el Capítulo 4, se analiza un modelo de optimización en el que el conjunto de posibles
escenarios puede ser alterado mediante la realización de inversiones en el sistema.
En los problemas estudiados en este primer bloque, cada decisión factible es evaluada
en base a la reacción más desfavorable que pueda darse en el sistema. En los
Capítulos 5 y 6 seguiremos usando esta idea pero ahora se supondrá que esa reacción
a la decisión factible inicial está en manos de un adversario o follower. Estos dos
capítulos se centran en el estudio de diferentes modelos binivel. La Optimización
Binivel aborda problemas en los que existen dos niveles de decisión, con diferentes
decisores en cada uno ellos y la decisión se toma de manera jerárquica. En concreto,
en el Capítulo 5 se estudian distintos modelos de jación de precios en el contexto
de selección de carteras de valores, en los que el intermediario nanciero, que se
convierte en decisor, debe jar los costes de invertir en determinados activos y el
inversor debe seleccionar su cartera de acuerdo a distintos criterios. Finalmente, en
el Capítulo 6 se estudia un problema de localización en el que hay distintos decisores,
con intereses contrapuestos, que deben determinar secuencialmente la ubicación de
distintas localizaciones. Este modelo de localización binivel se puede aplicar en contextos
como la localización de servicios no deseados o peligrosos (plantas de reciclaje,
centrales térmicas, etcétera) o en problemas de ataque-defensa.
Todos estos modelos se abordan mediante el uso de técnicas de Programación
Matemática. De cada uno de ellos se analizan algunas de sus propiedades y se desarrollan
formulaciones y algoritmos, que son examinados también desde el punto de
vista computacional. Además, se justica la validez de los modelos desde un enfoque
de las aplicaciones prácticas. Los modelos presentados en esta tesis comparten la
peculiaridad de requerir resolver distintos problemas de optimización encajados.Combinatorial optimization problems have been extensively studied in the specialized
literature since the mid-twentieth century. However, in recent decades, there
has been a paradigm shift to the treatment of ever more realistic problems, which
include sources of randomness and uncertainty in the data, multiple optimization
criteria and multiple levels of decision. This thesis concerns the development of such
concepts. Our objective is to study optimization models that incorporate uncertainty
elements in the parameters de ning the model, as well as the development of
optimization models integrating multiple decision levels. In order to consider problems
under uncertainty, we use Minmax Regret models from Robust Optimization;
whereas the multiplicity and hierarchy in the decision levels is addressed using Bilevel
Optimization.
In Chapters 2, 3 and 4, we study di erent decision problems under uncertainty
to which we give a robust solution that protects the decision-maker minimizing the
maximum regret that may occur. This robust criterion analyzes the performance
of the system under multiple possible scenarios, comparing its e ciency with the
optimum one under each feasible scenario. We obtain, as a result, a solution whose
e ciency is as close as possible to the optimal one in the set of feasible realizations
of the uncertain parameters. In Chapter 2, we study a network design problem in
which the costs, the pairs supplier-customer, and the demands can take uncertain
values. Furthermore, the uncertainty in the parameters is modeled via polyhedral
sets, thereby allowing relationships among the uncertain parameters. In Chapter
3, we propose time-dependent versions of the shortest path and traveling salesman
problems in which the costs of traversing an arc depends on the relative position
that the arc occupies in the path. Moreover, we assume that some of the parameters
de ning these costs can be uncertain. These models can be applied in the context of
task sequencing or grid computing. The incorporation of time-dependencies together
with uncertainties in the parameters gives rise to dependencies among the uncertain
parameters, which require modeling the possible scenarios using more general sets
than hypercubes, normally used in this context. In this chapter, we use general
polyhedral sets with this purpose. To nalize this rst block of applications, in Chapter 4, we analyze an optimization model in which the set of possible scenarios
can be modi ed by making some investments in the system.
In the problems studied in this rst block, each feasible decision is evaluated
based on the most unfavorable possible reaction of the system. In Chapters 5 and
6, we will still follow this idea, but assuming that the reaction to the initial feasible
decision will be held by a follower or an adversary, instead of assuming the most
unfavorable one. These two chapters are focused on the study of some bilevel models.
Bilevel Optimization addresses optimization problems with multiple decision
levels, di erent decision-makers in each level and a hierarchical decision order. In
particular, in Chapter 5, we study some price setting problems in the context of
portfolio selection. In these problems, the nancial intermediary becomes a decisionmaker
and sets the transaction costs for investing in some securities, and the investor
chooses her portfolio according to di erent criteria. Finally, in Chapter 6, we study
a location problem with several decision-makers and opposite interests, that must
set, sequentially, some location points. This bilevel location model can be applied
in practical applications such as the location of semi-obnoxious facilities (power or
electricity plants, waste dumps, etc.) or interdiction problems.
All these models are stated from a Mathematical Programming perspective, analyzing
their properties and developing formulations and algorithms, that are tested
from a computational point of view. Furthermore, we pay special attention to justifying
the validity of the models from the practical applications point of view. The
models presented in this thesis share the characteristic of involving the resolution of
nested optimization problems.Premio Extraordinario de Doctorado U
Evolutionary Algorithms in Engineering Design Optimization
Evolutionary algorithms (EAs) are population-based global optimizers, which, due to their characteristics, have allowed us to solve, in a straightforward way, many real world optimization problems in the last three decades, particularly in engineering fields. Their main advantages are the following: they do not require any requisite to the objective/fitness evaluation function (continuity, derivability, convexity, etc.); they are not limited by the appearance of discrete and/or mixed variables or by the requirement of uncertainty quantification in the search. Moreover, they can deal with more than one objective function simultaneously through the use of evolutionary multi-objective optimization algorithms. This set of advantages, and the continuously increased computing capability of modern computers, has enhanced their application in research and industry. From the application point of view, in this Special Issue, all engineering fields are welcomed, such as aerospace and aeronautical, biomedical, civil, chemical and materials science, electronic and telecommunications, energy and electrical, manufacturing, logistics and transportation, mechanical, naval architecture, reliability, robotics, structural, etc. Within the EA field, the integration of innovative and improvement aspects in the algorithms for solving real world engineering design problems, in the abovementioned application fields, are welcomed and encouraged, such as the following: parallel EAs, surrogate modelling, hybridization with other optimization techniques, multi-objective and many-objective optimization, etc
A new differential evolution using a bilevel optimization model for solving generalized multi-point dynamic aggregation problems
The multi-point dynamic aggregation problem (MPDAP) comes mainly from real-world applications, which is characterized by dynamic task assignation and routing optimization with limited resources. Due to the dynamic allocation of tasks, more than one optimization objective, limited resources, and other factors involved, the computational complexity of both route programming and resource allocation optimization is a growing problem. In this manuscript, a task scheduling problem of fire-fighting robots is investigated and solved, and serves as a representative multi-point dynamic aggregation problem. First, in terms of two optimized objectives, the cost and completion time, a new bilevel programming model is presented, in which the task cost is taken as the leader's objective. In addition, in order to effectively solve the bilevel model, a differential evolution is developed based on a new matrix coding scheme. Moreover, some percentage of high-quality solutions are applied in mutation and selection operations, which helps to generate potentially better solutions and keep them into the next generation of population. Finally, the experimental results show that the proposed algorithm is feasible and effective in dealing with the multi-point dynamic aggregation problem
International Conference on Continuous Optimization (ICCOPT) 2019 Conference Book
The Sixth International Conference on Continuous Optimization took place on the campus of the Technical University of Berlin, August 3-8, 2019. The ICCOPT is a flagship conference of the Mathematical Optimization Society (MOS), organized every three years. ICCOPT 2019 was hosted by the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) Berlin. It included a Summer School and a Conference with a series of plenary and semi-plenary talks, organized and contributed sessions, and poster sessions.
This book comprises the full conference program. It contains, in particular, the scientific program in survey style as well as with all details, and information on the social program, the venue, special meetings, and more
Co-evolutionary Hybrid Bi-level Optimization
Multi-level optimization stems from the need to tackle complex problems involving multiple decision makers. Two-level optimization, referred as ``Bi-level optimization'', occurs when two decision makers only control part of the decision variables but impact each other (e.g., objective value, feasibility). Bi-level problems are sequential by nature and can be represented as nested optimization problems in which one problem (the ``upper-level'') is constrained by another one (the ``lower-level''). The nested structure is a real obstacle that can be highly time consuming when the lower-level is . Consequently, classical nested optimization should be avoided. Some surrogate-based approaches have been proposed to approximate the lower-level objective value function (or variables) to reduce the number of times the lower-level is globally optimized. Unfortunately, such a methodology is not applicable for large-scale and combinatorial bi-level problems.
After a deep study of theoretical properties and a survey of the existing applications being bi-level by nature, problems which can benefit from a bi-level reformulation are investigated. A first contribution of this work has been to propose a novel bi-level clustering approach. Extending the well-know ``uncapacitated k-median problem'', it has been shown that clustering can be easily modeled as a two-level optimization problem using decomposition techniques. The resulting two-level problem is then turned into a bi-level problem offering the possibility to combine distance metrics in a hierarchical manner. The novel bi-level clustering problem has a very interesting property that enable us to tackle it with classical nested approaches. Indeed, its lower-level problem can be solved in polynomial time. In cooperation with the Luxembourg Centre for Systems Biomedicine (LCSB), this new clustering model has been applied on real datasets such as disease maps (e.g. Parkinson, Alzheimer). Using a novel hybrid and parallel genetic algorithm as optimization approach, the results obtained after a campaign of experiments have the ability to produce new knowledge compared to classical clustering techniques combining distance metrics in a classical manner.
The previous bi-level clustering model has the advantage that the lower-level can be solved in polynomial time although the global problem is by definition -hard. Therefore, next investigations have been undertaken to tackle more general bi-level problems in which the lower-level problem does not present any specific advantageous properties. Since the lower-level problem can be very expensive to solve, the focus has been turned to surrogate-based approaches and hyper-parameter optimization techniques with the aim of approximating the lower-level problem and reduce the number of global lower-level optimizations. Adapting the well-know bayesian optimization algorithm to solve general bi-level problems, the expensive lower-level optimizations have been dramatically reduced while obtaining very accurate solutions. The resulting solutions and the number of spared lower-level optimizations have been compared to the bi-level evolutionary algorithm based on quadratic approximations (BLEAQ) results after a campaign of experiments on official bi-level benchmarks. Although both approaches are very accurate, the bi-level bayesian version required less lower-level objective function calls.
Surrogate-based approaches are restricted to small-scale and continuous bi-level problems although many real applications are combinatorial by nature. As for continuous problems, a study has been performed to apply some machine learning strategies. Instead of approximating the lower-level solution value, new approximation algorithms for the discrete/combinatorial case have been designed. Using the principle employed in GP hyper-heuristics, heuristics are trained in order to tackle efficiently the lower-level of bi-level problems. This automatic generation of heuristics permits to break the nested structure into two separated phases: \emph{training lower-level heuristics} and \emph{solving the upper-level problem with the new heuristics}. At this occasion, a second modeling contribution has been introduced through a novel large-scale and mixed-integer bi-level problem dealing with pricing in the cloud, i.e., the Bi-level Cloud Pricing Optimization Problem (BCPOP). After a series of experiments that consisted in training heuristics on various lower-level instances of the BCPOP and using them to tackle the bi-level problem itself, the obtained results are compared to the ``cooperative coevolutionary algorithm for bi-level optimization'' (COBRA).
Although training heuristics enables to \emph{break the nested structure}, a two phase optimization is still required. Therefore, the emphasis has been put on training heuristics while optimizing the upper-level problem using competitive co-evolution. Instead of adopting the classical decomposition scheme as done by COBRA which suffers from the strong epistatic links between lower-level and upper-level variables, co-evolving the solution and the mean to get to it can cope with these epistatic link issues. The ``CARBON'' algorithm developed in this thesis is a competitive and hybrid co-evolutionary algorithm designed for this purpose. In order to validate the potential of CARBON, numerical experiments have been designed and results have been compared to state-of-the-art algorithms. These results demonstrate that ``CARBON'' makes possible to address nested optimization efficiently
Internationales Kolloquium über Anwendungen der Informatik und Mathematik in Architektur und Bauwesen : 20. bis 22.7. 2015, Bauhaus-Universität Weimar
The 20th International Conference on the Applications of Computer Science and Mathematics in Architecture and Civil Engineering will be held at the Bauhaus University Weimar from 20th till 22nd July 2015. Architects, computer scientists, mathematicians, and engineers from all over the world will meet in Weimar for an interdisciplinary exchange of experiences, to report on their results in research, development and practice and to discuss. The conference covers a broad range of research areas: numerical analysis, function theoretic methods, partial differential equations, continuum mechanics, engineering applications, coupled problems, computer sciences, and related topics. Several plenary lectures in aforementioned areas will take place during the conference.
We invite architects, engineers, designers, computer scientists, mathematicians, planners, project managers, and software developers from business, science and research to participate in the conference
- …