Skip to main content

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm

  • Perea Rojas Marcos, Federico
  • Menezes, Mozart B. C.
  • Mesa, Juan A.
  • Rubio-Del-Rey, Fernando
[EN] In this paper we analyze the computational complexity of transportation infrastructure network design problems, in the presence of a competing transportation mode. Some of these problems have previously been introduced in the literature. All problems studied have a common objective: the maximization of the number of travelers using the new network to be built. The differences between them are due to two factors. The first one is the constraints that the new network should satisfy: (1) budget constraint, (2) no-cycle constraint, (3) both constraints. The second factor is the topology of the network formed by the feasible links and stations: (1) a general network, (2) a forest. By combining these two factors, in total we analyze six problems, five of them are shown to be NP-hard, the sixth being trivial. Due to the NP-hardness of these problems, a genetic algorithm is proposed. Computational experiments show the applicability of this algorithm., Mozart Menezes and Juan A. Mesa were partially supported by project MTM2015- 67706-P (MINECO/FEDER,UE). Federico Perea was partially supported by the Spanish Ministry of Science, Innovation, and Universities, under projects "OPTEP-Port Terminal Operations Optimization" (No. RTI2018-094940-B-I00) and MTM2016-74983, fnanced with FEDER funds, and by the Universitat Politècnica de València under grant SP20180164 of the program Primeros Proyectos de Investigaciòn (PAID-06-18), Vicerrectorado de Investigaciòn, Innovaciòn y Transferencia. All this support is gratefully acknowledged.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Bi-objective parallel machine scheduling with additional resources during setups

  • Yepes-Borrero, Juan C.
  • Perea, Federico
  • Ruiz García, Rubén
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
[EN] We present a bi-objective parallel machine scheduling problem with machine and job sequence dependent setup times, with the additional consideration of resources needed during setups. The availability of such resources is limited. This models many practical situations where setup times imply, for example, cleaning and/or the reconfiguration of productive equipment. These setups are performed by personnel, who are of course limited in number. The objectives considered are the minimization of the makespan and the minimization of the number of resources. Fewer available resources reduce production costs but inevitably increase the makespan. On the contrary, a greater number of resources increase costs but allow for more setups to be done in parallel and a reduced makespan. An algorithm based on iterated greedy approaches is proposed to search for the Pareto front of the problem. This algorithm is compared with state-of-the art methods adapted to the problem. Computational experiments, supported by statistical analyses, indicate that the proposed approach outperforms all other tested procedures., The authors would like to acknowledge the support from "Ministerio de Ciencia, Innovacion y Universidades" under grant "Optimizacion de Operaciones en Terminales Portuarias (OPTEP)" (No. RTI2018-094940-B-100) and grant MTM2016-74983, from the "Universitat Politecnica de Valencia" under grant SP20180164 of the program "Primeros Proyectos de Investigacion (PAID-06-18), Vicerrectorado de Investigacion, Innovacion y Transferencia", and from the "Generalitat Valenciana" under grant "NUevos REtos en SEcuenciacion"(No. AICO/2020/049). Juan C. Yepes-Borrero acknowledges financial support by "El Instituto Colombiano de Credito Educativo y Estudios Tecnicos en el Exterior - ICETEX" under program "Pasaporte a la ciencia - Doctorado", grant number 3568118.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On minimax and Pareto optimal security payoffs in multicriteria games

  • Puerto Albandoz, Justo
  • Perea Rojas Marcos, Federico
[EN] In this paper, we characterize minimax and Pareto-optimal security payoff vectors for general multicriteria zero-sum matrix games, using properties similar to the ones that have been used in the single criterion case. Our results show that these two solution concepts are rather similar, since they can be characterized with nearly the same sets of properties. Their main difference is the form of consistency that each solution concept satisfies. We also prove that both solution concepts can transform into each other, in their corresponding domains. (C) 2017 Elsevier Inc. All rights reserved., We would like to thank Dr. Francisco R. Fernandez for his useful comments on earlier versions of this paper. The authors also want to acknowledge the financial support from grants FQM-5849 (Junta de Andalucia\FEDER) and MTM2016-74983-C02-01, MTM2013-46962-C02-01 (MICINN, Spain).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A heuristic procedure for computing the nucleolus

  • Perea Rojas Marcos, Federico
  • Puerto, Justo
[EN] This paper introduces a row and column generation algorithm for finding the nucleolus, based on a linear programming model proposed in an earlier research. Since this approach cannot return an allocation for large games, we also propose a heuristic approach, which is based on sampling the coalitions space. Experiments over medium sized games show that the proposed heuristic finds allocations which are close to the true nucleolus, in a reasonable amount of time. Experiments over 100-player games show that the proposed heuristic can be applied to games of large size., The authors would like to acknowledge the support from Spanish "Ministerio de Economia y competitividad" throughout grant number MTM2016-74983 and grant "SCHEYARD - Optimization of Scheduling Problems in Container Yards" (No. DPI2015-65895-R) financed by FEDER funds. Special thanks are due to two anonymous referees for their valuable comments.
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Enforcing fair cooperation in production-inventory settings with heterogeneous agents

  • Guardiola, Luis A.
  • Meca, Ana
  • Puerto, Justo
  • Guardiola, Luis A.|||/items/e3a552b3-d66c-4863-b8c2-28bf05e1078d
Production-Inventory settings with heterogeneous agents appear frequently in the study of supply chain management. For instance, there are Production-Inventory situations in which certain agents are essential as they can reduce the costs of other agents (followers) when they cooperate with each other. The study of such a cooperation can be modelled by means of a cooperative game and studied finding fair cost allocations. These class of cooperative games was introduced in Guardiola et al. (in Games Econ Behav 65:205–219, 2009) where it was also proposed the Owen point. This cost allocation is an appealing solution concept that for Production-Inventory games (PI-games) is always stable, in the sense of the core. The Owen point allows all the players in the game to operate at minimum cost but it does not take into account the cost reduction induced by essential players over their followers. Thus, it may be seen as an altruistic allocation for essential players what can be criticized. The aim of this paper is two-fold: to introduce new core allocations for PI-games improving the weaknesses of the Owen point and to study the structure and complexity of set of stable cost allocations (the core) of PI-games.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Unitary Owen Points in Cooperative Lot-Sizing Models with Backlogging

  • Guardiola, Luis A.
  • Meca, Ana
  • Puerto, Justo
  • Guardiola, Luis A.|||/items/e3a552b3-d66c-4863-b8c2-28bf05e1078d
This paper analyzes cost sharing in uncapacitated lot-sizing models with backlogging and heterogeneous costs. It is assumed that several firms participate in a consortium aiming at satisfying their demand over the planning horizon with minimal operating cost. Each individual firm has its own ordering channel and holding technology, but cooperation with other firms consists in sharing that information. Therefore, the firms that cooperate can use the best ordering channels and holding technology among members of the consortium. This mode of cooperation is stable. in that allocations of the overall operating cost exist, so that no group of agents benefit from leaving the consortium. Our contribution in the current paper is to present a new family of cost sharing allocations with good properties for enforcing cooperation: the unitary Owen points. Necessary and sufficient conditions are provided for the unitary Owen points to belong to the core of the cooperative game. In addition, we provide empirical evidence, through simulation, showing that, in randomly-generated situations, the above condition is fulfilled in 99% of the cases. Additionally, a relationship between lot-sizing games and a certain family of production-inventory games, through Owen’s points of the latter, is described. This interesting relationship enables easily constructing a variety of coalitionally stable allocations for cooperative lot-sizing models.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

The effect of consolidated periods in heterogeneous lot-sizing games

  • Guardiola, Luis A.
  • Meca, Ana
  • Puerto, Justo
  • Guardiola, Luis A.|||/items/e3a552b3-d66c-4863-b8c2-28bf05e1078d
We consider a cooperative game defined by an economic lot-sizing problem with heterogeneous costs over a finite time horizon, in which each firm faces demand for a single product in each period and coalitions can pool orders. The model of cooperation works as follows: ordering channels and holding and backlogging technologies are shared among the members of the coalitions. This implies that each firm uses the best ordering channel and holding technology provided by the participants in the consortium. That is, they produce, hold inventory, pay backlogged demand and make orders at the minimum cost of the coalition members. Thus, firms aim at satisfying their demand over the planing horizon with minimal operation cost. Our contribution is to show that there exist fair allocations of the overall operation cost among the firms so that no group of agents profit from leaving the consortium. Then we propose a parametric family of cost allocations and provide sufficient conditions for this to be a stable family against coalitional defections of firms. Finally, we focus on those periods of the time horizon that are consolidated and we analyze their effect on the stability of cost allocations.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

On the multisource hyperplanes location problem to fitting set of points

  • Blanco, V.
  • Japón, A.
  • Ponce, D.
  • Puerto, J.
In this paper we study the problem of locating a given number of hyperplanes minimizing an objective function of the closest distances from a set of points. We propose a general framework for the problem in which norm-based distances between points and hyperplanes are aggregated by means of ordered median functions. A compact Mixed Integer Linear (or Non Linear) programming formulation is presented for the problem and also an extended set partitioning formulation with a huge number of variables is derived. We develop a column generation procedure embedded within a branch-and-price algorithm for solving the problem by adequately performing its preprocessing, pricing and branching. We also analyze geometrically the optimal solutions of the problem, deriving properties which are exploited to generate initial solutions for the proposed algorithms. Finally, the results of an extensive computational experience are reported. The issue of scalability is also addressed showing theoretical upper bounds on the errors assumed by replacing the original datasets by aggregated versions.