Skip to main content

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

MTM2016-74983-C2-1-R

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos I+D+i Retos de Investigación
Call year 2016
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE SEVILLA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
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)

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)

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.