Pasar al contenido principal

NUEVOS DESAFIOS MATEMATICOS EN PROBLEMAS LOGISTICOS Y DE TRANSPORTE INTEGRADO SOBRE REDES COMPLEJAS: DISEÑO Y OPTIMIZACION

MTM2016-74983-C2-2-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2016
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE CADIZ

Resultados relacionados

Resultados totales (Incluyendo duplicados): 5
Encontrada(s) 1 página(s)

RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

Minmax regret maximal covering location problems with edge demands

  • Baldomero Naranjo, Marta
  • Kalcsics, Jörg
  • Rodríguez Chía, Antonio Manuel
This paper addresses a version of the single-facility Maximal Covering Location Problem on a network where the demand is: (i) distributed along the edges and (ii) uncertain with only a known interval estimation. To deal with this problem, we propose a minmax regret model where the service facility can be located anywhere along the network. This problem is called Minmax Regret Maximal Covering Location Problem with demand distributed along the edges (MMR-EMCLP). Furthermore, we present two polynomial algorithms for finding the location that minimises the maximal regret assuming that the demand realisation is an unknown constant or linear function on each edge. We also include two illustrative examples as well as a computational study for the unknown constant demand case to illustrate the potential and limits of the proposed methodology.
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

Increasing concave orderings of linear combinations of order statistics with applications to social welfare

  • Castaño Martínez, Antonia
  • Pigueiras Voces, Gema
  • Psarrakos, Georgios
  • Sordo Díaz, Miguel Ángel
We provide in this paper sufficient conditions for comparing, in terms of the increasing concave order, some income random variables based on linear combinations of order statistics that are relevant in the framework of social welfare. The random variables under study are weighted average incomes of the poorest and, for some particular weights, their expectations are welfare measures whose integral representations are weighted areas underneath Bonferroni curves.
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

On a family of risk measures based on largest claims

  • Castaño Martínez, Antonia
  • Pigueiras Voces, Gema
  • Sordo Díaz, Miguel Ángel
Given a set of n >= 2 independent and identically distributed claims, the expected average of the n−i largest claims, with 0 <= i<= n−1, is shown to be a distortion risk measure with concave distortion function that can be represented in terms of mixtures of tail value-at-risks with beta mixing distributions. This result allows to interpret the tail value-at-risk in terms of the largest claims of a portfolio of independent claims. As an application, we provide sufficient conditions for stochastic comparisons of premiums in the context of large claims reinsurance.
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

A method for constructing and interpreting some weighted premium principles

  • Castaño Martínez, Antonia
  • López-Blázquez, Fernando
  • Pigueiras Voces, Gema
  • Sordo Díaz, Miguel Ángel
We present a method for constructing and interpreting weighted premium principles. The method is based on modifying the underlying risk distribution in such a way that the risk-adjusted expected value (or premium) is greater than the expected value of some conveniently chosen function of claims, which defines the insurer’s perception of the risk. Under some assumptions on the function of claims, the method produces distortion premium principles. We provide several examples under different assumptions on the claim arrival process and different functions of claims, including record claims and kth record claims.
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Tesis doctoral (DoctoralThesis)

Supervised classification and network location problems via mathematical optimization, Estudio de problemas de clasificación supervisada y de localización en redes mediante optimización matemática

  • Baldomero Naranjo, Marta
This PhD dissertation addresses several problems in the fields of Supervised Classification and Location Theory using tools and techniques coming from Mathematical Optimization. A brief description of these problems and the methodologies proposed for their analysis and resolution is given below. In the first chapter, the principles of Supervised Classification and Location Theory are discussed in detail, emphasizing the topics studied in this thesis. The following two chapters discuss Supervised Classification problems. In particular, Chapter 2 proposes exact solution approaches for various models of Support Vector Machines (SVM) with ramp loss, a well-known classification method that limits the influence of outliers. The resulting models are analyzed to obtain initial bounds of the big M parameters included in the formulation. Then, solution approaches based on three strategies for obtaining tighter values of the big M parameters are proposed. Two of them require solving a sequence of continuous optimization problems, while the third uses the Lagrangian relaxation. The derived resolution methods are valid for the l1-norm and l2-norm ramp loss formulations. They are tested and compared with existing solution methods in simulated and real-life datasets, showing the efficiency of the developed methodology. Chapter 3 presents a new SVM-based classifier that simultaneously deals with the limitation of the influence of outliers and feature selection. The influence of outliers is taken under control using the ramp loss margin error criterion, while the feature selection process is carried out including a new family of binary variables and several constraints. The resulting model is formulated as a mixed-integer program with big M parameters. The characteristics of the model are analyzed and two different solution approaches (exact and heuristic) are proposed. The performance of the obtained classifier is compared with several classical ones in different datasets. The next two chapters deal with location problems, in particular, two variants of the Maximal Covering Location Problem (MCLP) in networks. These variants respond to the modeling of two different scenarios, with and without uncertainty in the input data. First, Chapter 4 presents the upgrading version of MCLP with edge length modifications on networks. This problem aims at locating p facilities on the nodes (of the network) so as to maximize coverage, considering that the length of the edges can be reduced within a budget. Hence, we have to decide on: the optimal location of p facilities and the optimal edge length reductions. To solve it, we propose three different mixed-integer formulations and a preprocessing phase for fixing variables and removing some constraints. Moreover, we analyze the characteristics of these formulations to strengthen them by proposing valid inequalities. Finally, we compare the three formulations and their corresponding improvements by testing their performance over different datasets. The following chapter, Chapter 5, also considers a MCLP, albeit from the perspective of uncertainty. In particular, this chapter addresses a version of the single-facility MCLP on a network where the demand is distributed along the edges and uncertain with only a known interval estimation. We propose a minmax regret model where the service facility can be located anywhere along the network. Furthermore, we present two polynomial algorithms for finding the location that minimizes the maximal regret assuming that the demand realization is an unknown constant or linear function on each edge. We also include two illustrative examples as well as a computational study to show the potential of the proposed methodology.