Skip to main content

OPTIMIZACION DE LA ROBUSTEZ EN ANALISIS DE LOCALIZACIONES Y DISEÑO DE REDES

MTM2009-14243

•
Funding agency name Ministerio de Ciencia e Innovación
Funding agency acronym MICINN
Program Programa Nacional de Proyectos de Investigación Fundamental
Subprogram Subprograma de Proyectos de Investigación Fundamental no Orientada
Call Proyectos I+D
Call year 2009
State Plan 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Management unit Subdirección General de Proyectos de Investigación
Beneficiary centre UNIVERSIDAD DE SEVILLA

Resultados relacionados

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

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

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
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 that validate their use to compare the connectivity of different networks. © 2013 EDP Sciences and Springer., This work was partially supported by Ministerio de Educacion, Ciencia e Innovacion (Spain)/FEDER under project MTM2009-14243 and by Junta de Andalucia (Spain)/FEDER under excellence proyects P09-TEP-5022 and FQM-5849. Special thanks are due to two anonymous referees for their valuable comments and advice.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Planning rapid transit networks

  • Laporte, G.
  • Mesa, J.A.
  • Ortega, F.A.
  • Perea Rojas Marcos, Federico
[EN] Rapid transit construction projects are major endeavours that require long-term planning by several players, including politicians, urban planners, engineers, management consultants, and citizen groups. Traditionally, operations research methods have not played a major role at the planning level but several tools developed in recent years can assist the decision process and help produce tentative network designs that can be submitted to the planners for further evaluation. This article reviews some indices for the quality of a rapid transit network, as well as mathematical models and heuristics that can be used to design networks. © 2011 Elsevier Ltd., This research was partly funded by the Canadian Natural Sciences and Engineering Research Council under grant no. 39682-10, the Spanish Ministry of Science and Innovation under grant no. MTM 2009-14243 and the Junta de Andalucía, Spain, under grant no. P09-TEP-5022. This support is gratefully acknowledged. Fig. 10 was kindly provided by Giuseppe Bruno. Thanks are due to a referee who provided several valuable comments on an earlier version of this paper.
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)

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
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 three objective functions and the corresponding optimization problems, which are modeled by means of mixed integer non-linear programs. For small instances, the models can be solved directly by a standard solver. For large instances, an enumerative algorithm based on a discretization of the problem is proposed. Computational experiments show that the latter approach yields high quality solutions within short computing times., This research was done while one of the co-authors (Federico Perea) was enjoying a research stay funded by the Spanish Ministerio de Educacion y Ciencia, under program Jose Castillejo. This research was partially funded by the Canadian Natural Sciences and Engineering Research Council under grant 39682-10, by the Spanish Ministerio de Educacion, Ciencia e Innovacion/FEDER under grant MTM2009-14243, by the Spanish Ministerio de Economia y Competitividad/FEDER under grant MTM2012-37048, and by the Junta de Andalucia/FEDER under grants P09-TEP-5022 and FQM-5849. This support is gratefully acknowledged. Special thanks are due to the referees for their valuable comments and to Javier Fernandez and Lorenzo jaro, from the Spanish railway infrastructure management company ADIF, for providing some of the necessary data for the case study.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

GRASP algorithms for the robust railway network design problem

  • García-Archilla, Bosco
  • Lozano, Antonio J.
  • Mesa, Juan A.
  • Perea Rojas Marcos, Federico
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 railway networks maximizing the trip coverage in the presence of a competing mode, both assuming that the network works fine and that links can fail, respectively. Since these problems are computationally intractable for realistic sizes, GRASP heuristics are proposed for finding good feasible solutions. The results obtained in a computational experience indicate that our GRASP algorithms are suitable for railway network design problems. © 2011 Springer Science+Business Media, LLC., We would like to thank the Spanish Ministerio de Fomento under grant PT-2007-003, Ministerio de Ciencia y Educacion under grant MTM2009-14243, the Junta de Andalucia under grant P09-TEP-5022 for supporting this research, the FEDER funds of the European Union and TUSSAM (Seville, Spain). Special thanks are due to two anonymous referees for their valuable comments.