Vladimir Marianov

dblp:55/4154 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-5343-0106ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Computer networks · 1
YearPublicationVenuePosition
2021 An Integrated Model for Rapid and Slow Transit Network Design (Short Paper)
abstract
Usually, when a rapid transit line is planned a less efficient system already partially covers the demand of the new line. Thus, when the rapid transit starts its regular services, the slow mode (e.g. bus lines) have to be cancelled or their routes modified. Usually this process is planned according to a sequential way. Firstly, the rapid transit line is designed taking into account private and public flows, and possibly surveys on mobility in order to predict the future utilization of the new infrastructure and/or other criteria. Then, in a second stage, the bus route network is redesigned. However, this sequential process can lead to a suboptimal solution, for which reason in this paper a cooperative model for rapid and slow transit network design is studied. The aim is to design simultaneously both networks and the objective is to maximize the number of passengers captured by both public modes against the private mode. We present a mathematical programming formulation and solve the problem by an improved Benders decomposition approach.
Natividad González-Blanco, Antonio Jose Lozano, Vladimir Marianov, Juan A. Mesa
ATMOS3
2015 A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper)
abstract
We present a mixed integer linear program for the rapid transit network design problem with static modal competition. Previous discrete formulations cannot handle modal competition for realistic size instances because of the complexity of modeling alternatives for each flow in the network. We overcome this difficulty by exploiting a pre-assigned topological configuration. Results of a case study will be presented at the conference.
Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, Luigi Moccia
ATMOS3
2005 Multiple path routing algorithm for IP networks
Miguel Rios 0002, Vladimir Marianov, Andres Avagliano
Comput. Commun.2