Skip to main content

Resultados relacionados

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

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

Revisiting a game theoretic framework for the robust railway network design against intentional attacks

  • Perea Rojas Marcos, Federico
  • Puerto Albandoz, Justo
This paper discusses and extends some competitive aspects of the games proposed in an earlier work, where a robust railway network design problem was proposed as a non-cooperative zero-sum game in normal form between a designer/operator and an attacker. Due to the importance of the order of play and the information available to the players at the moment of their decisions, we here extend those previous models by proposing a formulation of this situation as a dynamic game. Besides, we propose a new mathematical programming model that optimizes both the network design and the allocation of security resources over the network. The paper also proposes a model to distribute security resources over an already existing railway network in order to minimize the negative effects of an intentional attack. For the sake of readability, all concepts are introduced with the help of an illustrative example., The research activities of the authors have been supported by the projects FQM-5849 (Junta de Andalucia\FEDER) and MTM2010-19576-C02-01 (MICINN, Spain). Special thanks are due to two anonymous referees for their valuable comments and suggestions.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A cooperative location game based on the 1-center location problem

  • Puerto Albandoz, Justo
  • Tamir, Arie
  • Perea Rojas Marcos, Federico
In this paper we introduce and analyze new classes of cooperative games related to facility location models defined on general metric spaces. The players are the customers (demand points) in the location problem and the characteristic value of a coalition is the cost of serving its members. Specifically, the cost in our games is the service radius of the coalition. We call these games the Minimum Radius Location Games (MRLG). We study the existence of core allocations and the existence of polynomial representations of the cores of these games, focusing on network spaces, i.e., finite metric spaces induced by undirected graphs and positive edge lengths, and on the ¿ p metric spaces defined over R d. © 2011 Elsevier B.V. All rights reserved., The research of the authors is partially supported by Spanish grants MTM2007-67433, MTM2010-19576-C02-01 and Junta Andalucia/FEDER grant FQM-5849.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments

  • Koerner, Mark-Christoph
  • Mesa, Juan A.
  • Perea Rojas Marcos, Federico
  • Schoebel, Anita
  • Scholz, Daniel
[EN] In this paper the following facility location problem in a mixed planar-network space is considered: We assume that traveling along a given network is faster than traveling within the plane according to the Euclidean distance. A pair of points (A i, A j) is called covered if the time to access the network from A i plus the time for traveling along the network plus the time for reaching A j is lower than, or equal to, a given acceptance level related to the travel time without using the network. The objective is to find facilities (i.e. entry and exit points) on the network that maximize the number of covered pairs. We present a reformulation of the problem using convex covering sets and use this formulation to derive a finite dominating set and an algorithm for locating two facilities on a tree network. Moreover, we adapt a geometric branch and bound approach to the discrete nature of the problem and suggest a procedure for locating more than two facilities on a single line, which is evaluated numerically. © 2012 Sociedad de Estadística e Investigación Operativa., This work was partially supported by the Future and Emerging Technologies Unit of EC (IST priority-6th FP), under contract no. FP6-021235-2 (project ARRIVAL), by Ministerio de Educacion, Ciencia e Innovacion (Spain)/FEDER under project MTM2009-14243 and by Junta de Andalucia (Spain)/FEDER under excellence projects P09-TEP-5022 and FQM-5849.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A branch-and-cut algorithm for the maximum benefit Chinese postman problem

  • Corberán, Angel
  • Plana, Isaac
  • Rodríguez-Chía, Antonio Manuel
  • Sanchís Llopis, José María|||0000-0002-0039-8122
[EN] The Maximum Benefit Chinese Postman Problem (MBCPP) is an NP-hard problem that considers several benefits associated with each edge, one for each time the edge is traversed with a service. The objective is to find a closed walk with maximum benefit.We propose an IP formulation for the undirected MBCPP and, based on the description of its associated polyhedron, we propose a branch-and-cut algorithm and present computational results on instances with up to 1,000 vertices and 3,000 edges., The authors wish to thank the Ministerio de Innovacion y Ciencia/FEDER of Spain (projects MTM2009-14039-C06-02, MTM2010-19576-C02-02 and DE2009-0057) and Junta de Andalucia/FEDER (grant number FQM-5849) for its support. They also thank two anonymous referees for their careful reading of the manuscript and for their many suggestions and comments that have helped to improve the contents and readability of the paper.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Swath-Acquisition Planning in Multiple-Satellite Missions: An Exact and Heuristic Approach

  • Perea Rojas Marcos, Federico
  • Vázquez, Rafael
  • Galán-Vioque, Jorge
[EN] This paper deals with the swath acquisition planning problem for multisatellite Earth observation missions. Given a set of satellites and a mission time frame, the problem we solve consists of selecting a set of acquisitions from the satellites in order to cover a given region of interest during the requested time frame, optimizing a certain objective function. We show that the planning problem can be modeled as a set covering problem, using basic tools of mathematical programming. The formulation of the model requires the solution of a complex computational geometry problem, and therefore the use of heuristics and metaheuristics applies. In this paper, we discuss the efficiency of the constructive phase of a greedy randomized adaptive search procedure algorithm. Computational results comparing the heuristic algorithms with the exact approach are presented., JGV acknowledges financial support from grant MTM2012-31821 and P12-FQM-1658, and FP from grants FQM-5849, P09-TEP-5022, and MTM2010-19576-C02-01.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

The Railway Line Frequency and Size Setting Problem

  • De-Los-Santos, Alicia
  • Laporte, Gilbert
  • Mesa, Juan A.
  • Perea Rojas Marcos, Federico
[EN] The problem studied in this paper takes as input data a set of lines forming a railway network, and an origin¿destination (OD) matrix. The OD pairs may use either the railway network or an alternative transportation mode. The objective is to determine the frequency/headway of each line as well as its number of carriages, so that the net profit of the railway network is maximized. We propose a mixed integer non-linear programming formulation for this problem. Because of the computational intractability of this model, we develop four algorithms: a mixed integer linear programming (MIP) model, a MIP-based iterative algorithm, a shortest-path based algorithm, and a local search. These four algorithms are tested and compared over a set of randomly generated instances. An application over a case study shows that only the local search heuristic is capable of dealing with large instances., This research was partly funded by the Canadian Natural Sciences and Engineering Research Council under Grant 2015-06189, by the Ministerio de Economía y Competitividad (Spain)/FEDER under projects MTM2012-37048, MTM2015-67706-P and DPI2012-36243-C02-01, and by Junta de Andalucía (Spain)/FEDER under excellence project P10-FQM-5849. Part of this research was done while Federico Perea was enjoying a research visit to CIRRELT, funded by the Universitat Politècnica de València, under program PAID-00-15. This support is gratefully acknowledged. Thanks are due to the referees for their valuable comments.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Finding the nucleolus of any n-person cooperative game by a single linear program

  • Puerto Albandoz, Justo
  • Perea Rojas Marcos, Federico
In this paper we show a new method for calculating the nucleolus by solving a unique minimization linear program with Oð4n Þ constraints whose coefficients belong to f−1; 0; 1g. We discuss the need of having all these constraints and empirically prove that they can be reduced to Oðkmax2n Þ, where kmax is a positive integer comparable with the number of players. A computational experience shows the applicability of our method over (pseudo)random transferable utility cooperative games with up to 18 players, The authors want to thank Javier Arin, Safae El Haj Ben Ali, Guillermo Owen and Johannes H. Reijnierse for their useful and valuable help. The research of the authors has been partially supported by the projects FQM-5849 (Junta de Andalucia \ FEDER), and by the project MTM2010-19576-C02-01 (MICINN, Spain). This paper was written while the second author was enjoying a grant for a short postdoctoral research visit at the Instituto Universitario de Investigacion de Matematicas de la Universidad de Sevilla (IMUS). Special thanks are due to one anonymous referee for his/her valuable comments.
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).