Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por autor "Perea Rojas Marcos, Federico"

Mostrando ítems 1-20 de 30

Página siguiente

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

Puerto Albandoz, Justo; Tamir, Arie; Perea Rojas Marcos, Federico (Elsevier, 2011-04-20)

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 ...
A heuristic procedure for computing the nucleolus

Perea Rojas Marcos, Federico; Puerto, Justo (Elsevier, 2019-12)

[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 ...
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 (Springer, 2012-04)

[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 ...
Adding a new station and a road link to a road-rail network in the presence of modal competition

Perea Rojas Marcos, Federico; Mesa López-Colmenar, Juan Antonio; Laporte, Gilbert (Elsevier, 2014-10)

In this paper we study the problem of locating a new station on an existing rail corridor and a new junction on an existing road network, and connecting them with a new road segment under a budget constraint. We consider ...
Algoritmos genéticos para la selección de redes neuronales

Zaytseva, Valeriya (Universitat Politècnica de València, 2015-03-02)

[EN] In this work genetic algorithms applied to select neural networks The neural networks then used to predict store customers position.
Analyzing connectivity in collective transportation line networks by means of hypergraphs

Barrena, Eva; de-Los-Santos, Alicia; Mesa López-Colmenar, Juan Antonio; Perea Rojas Marcos, Federico (EDP Sciences: EPJSpringer, 2013)

In this paper we will show how hypergraphs and some measures related to them can help in extracting information about Collective Transportation Line Networks. We will also prove that these measures satisfy certain properties ...
Análisis de políticas monetarias: expansión cuantitativa

Marín Querol, Miguel Emilio (Universitat Politècnica de València, 2015-10-02)

[ES] El trabajo pretende analizar los efectos sobre la economía de los países o zonas en las que se ha empleado esta política de expansión monetaria, mediante un análisis estadístico de los cambios producidos sobre ...
Avoiding unfairness of Owen allocations in linear production processes

Perea Rojas Marcos, Federico; Puerto Albandoz, Justo; Fernández García, Francisco Ramón (Elsevier, 2012-07-01)

This paper deals with cooperation situations in linear production problems in which a set of goods are to be produced from a set of resources so that a certain benefit function is maximized, assuming that resources not ...
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 (Elsevier, 2021-07-16)

[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 ...
Flowshop with additional resources during setups: Mathematical models and a GRASP algorithm

Yepes-Borrero, Juan C.; Perea, Federico; Villa Juliá, Mª Fulgencia; Vallada Regalado, Eva (Elsevier, 2023-06)

[EN] Machine scheduling problems arise in many production processes, and are something that needs to be consider when optimizing the supply chain. Among them, flowshop scheduling problems happen when a number of jobs have ...
GRASP algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources

Yepes-Borrero, Juan C.; Villa Juliá, Mª Fulgencia; Perea Rojas Marcos, Federico; Caballero-Villalobos, Juan Pablo (Elsevier, 2020-03-01)

[EN] This paper provides practitioners with new approaches for solving realistic scheduling problems that consider additional resources, which can be implemented on expert and intelligent systems and help decision making ...
GRASP algorithms for the robust railway network design problem

García-Archilla, Bosco; Lozano, Antonio J.; Mesa, Juan A.; Perea Rojas Marcos, Federico (Springer Verlag, 2011-04)

This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological ...
Greedy and K-Greedy algoritmhs for multidimensional data association

Perea Rojas Marcos, Federico; de Waard, Huub. W. (Institute of Electrical and Electronics Engineers (IEEE), 2011-07)

[EN] The multidimensional assignment (MDA) problem is a combinatorial optimization problem arising in many applications, for instance multitarget tracking (MTT). The objective of an MDA problem of dimension $d\in\Bbb{N}$ ...
Lagrangian relaxation in unrelated parallel machines scheduling problem with limited resources

Nicola Naranjo, Daniel Alejandro (Universitat Politècnica de València, 2016-07-08)

[EN] This work presents an unrelated parallel machine problem, solved by an ILP model with 5 contraint sets, which is compared to a model that uses lagrangian relaxation on one of its constraints, in this case, the resource ...
Localización de estaciones de ferrocarril en competencia con otros modos de transporte

Íñigo Arroyo, Miguel (Universitat Politècnica de València, 2015-02-25)

[EN] In this work, a problem consisting of locating two or more stations over a high-speed railway network is proposed and solved. A competing transportation mode is also considered.
Matheurísticas para el problema de secuenciación de máquinas paralelas con necesidad de recursos adicionales en los ajustes

Zhang, Ling (Universitat Politècnica de València, 2018-12-12)

El problema presentado es bien conocido en la literatura, y está clasificado como NP-duro. Por ello, se hacen necesarios algoritmos eficientes para su resolución. En este trabajo se proponen diferentes algoritmos matheurísticos, ...
Metaheurísticas constructivas para la secuenciación de máquinas en paralelo con ajustes entre trabajos y necesidad de recursos adicionales

López Esteve, Axel Javier (Universitat Politècnica de València, 2020-09-16)

[ES] En este trabajo se pretende resolver el problema de secuenciación de máquinas paralelas no relacionadas con ajustes entre trabajos y recursos limitados adicionales. El objetivo del problema es minimizar el tiempo ...
Metaheurísticas para el diseño de redes de ferrocarril en competencia con medio de transporte alternativo

Rubio del Rey, Fernando (Universitat Politècnica de València, 2017-10-19)

El diseño de redes de ferrocarril en competencia con modos de transporte alternativo (RND por sus siglas en inglés) se puede modelar como un problema de optimización combinatoria sobre un grafo dirigido. El objetivo del ...
Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources

Perea Rojas Marcos, Federico; Fanjul Peyró, Luis; Ruiz García, Rubén (Elsevier, 2017)

[EN] In this paper we analyze a parallel machine scheduling problem in which the processing of jobs on the machines requires a number of units of a scarce resource. This number depends both on the job and on the machine. ...
On minimax and Pareto optimal security payoffs in multicriteria games

Puerto Albandoz, Justo; Perea Rojas Marcos, Federico (Elsevier, 2018)

[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. ...