Antonio Mauttone

Universidad de la República de Uruguay | UdelaR · Facultad de Ingeniería

This chapter focuses on network design methodologies applied to problems arising at the strategic and tactical planning of public transportation systems, including both urban and intercity services. The main problems discussed are the design of bus, rail and metro networks, which involve making decisions over links or groups of links from a given u...

Proceedings of the 2nd International Conference on Agro Big Data and Decision Support Systems in Agriculture (BigDSSAgro 2018). Lleida, July 12-14, 2018. The conference has been organized jointly by the Department of Mathematics of the University of Lleida, Spain, hosting the event, and by the CYTED-funded BigDSSAgro network (Red Iberoamericana d...

This paper introduces a new mathematical optimization problem, inspired in the evolution of fiber optics communication. Real-life implementations must address a cost-robustness tradeoff. Typically, real topologies are hierarchically organized in backbone and access networks. The backbone is two-node-connected, while the access network usually consi...

Frequency setting takes place at the strategic and tactical planning stages of public transportation systems. The problem consists in determining the time interval between subsequent vehicles for a given set of lines, taking into account interests of users and operators. The result of this stage is considered as input at the operational level. In g...

The Capacitated m-Ring Star Problem (CmRSP) consists of finding a set of m rings, each of them including the central depot, a subset of customers, and a set of optional nodes used to diminish the costs of the network design. The rings must be node-disjoint (except for the central depot) in order to provide node-survivability to the network. Custome...

A traditional method to connect multiterminal systems is to use rings. The goal of the Capacitated m Ring Star Problem (CmRSP) is to connect terminals by m rings joined only with a source node, and possibly some pending links, at minimum cost. In this paper, we introduce a relaxation for the CmRSP, called Capacitated m Two-Node Survivable Star Prob...

In this paper, we address the problem of network design with redundant connections, often faced by operators of telephone and internet services. The network connects customers with one master node and it is built by taking into account the rules that shape its construction, such as number of customers, number of components and types of links, in or...

In this work, we study the transit network design problem from the perspective of mathematical programming. More precisely, we consider the problem of defining the number and itinerary of bus routes and their frequencies, for a public transportation system. In this problem, the routes should be defined in terms of a given infrastructure of streets...

We study the transit frequency optimization problem, which aims to determine the time interval between subsequent buses for a set of public transportation lines given by their itineraries, i.e., sequences of stops and street sections. The solution should satisfy a given origin–destination demand and a constraint on the available fleet of buses. We...

This paper studies the Vehicle Scheduling Problem (VSP) in the context of suburban passenger transportation. The problem consists in finding a set of sequences of trips which have to be assigned to the available fleet of buses. The complexity of this problem depends on the number of depots where the fleet is housed. The paper focuses on the resolut...

We study the problem of the optimal design of routes and frequencies in urban public transit systems, the Transit Network Design Problem (TNDP), which is modeled as a multi-objective combinatorial optimization problem. A new heuristic based on the GRASP metaheuristic is proposed to solve the TNDP. As a multi-objective metaheuristic, it produces in...

The transit network design problem (TNDP) aims to determine a set of bus routes for a public transportation system, which must be convenient from the viewpoints of both users (people who use public transportation) and operators (companies who own the resources to give the service). This article presents a constructive algorithm for the TNDP. It is...

The Capacitated m-Ring Star Problem (CmRSP) consists of finding a set of m rings, each of them including the central depot, a subset of customers, and a set of optional nodes used to diminish the costs of the network design. The rings must be node-disjoint (except for the central depot) in order to provide node-survivability to the network. Custome...

RESUMEN Se estudia el problema del diseño óptimo de recorridos y frecuencias para el transporte público urbano colectivo (Transit Network Design Problem). Enfoques anteriores han utilizado, en su mayoría, modelos de objetivo único y algoritmos aproximados (ávidos y genéticos) para su resolución. Este trabajo propone la utilización de un modelo de o...