Skip to main content

ANALISIS ESTRUCTURAL DE MODELOS MATEMATICOS DE OPTIMIZACION EN LOCALIZACION Y PLANIFICACION DEL TRANSPORTE

MTM2015-67706-P

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2015
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSIDAD DE SEVILLA

Resultados relacionados

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

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.