Mathematical programming formulations for transit network design

Cancela, Héctor; Mauttone, Antonio; Urquhart, María E.

doi:10.1016/j.trb.2015.03.006

Cited by 91 publications

(52 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Of all the described types, the most interesting for solving the network transport problems are the first three. In this case, the first two of them are realized using the Dijkstra's algorithm varieties [4], and the third one by using the Floyd algorithm [5].…”

Section: Improvement Of the Methods Of Searching For The Shortest Dismentioning

confidence: 99%

“…The algorithms of mathematical programming for designing a transport network are developed, which allow finding the optimal ways [5]. But such algorithms do not take into account the large number of intermediate points in the transportation network.…”

Section: Literature Review and Problem Statementmentioning

confidence: 99%

“…The problem of maximum flow is conveniently solved by the method of trees [5]. The solution can be extended for the problem with multiple sources and runoffs.…”

Section: Solving the Problems On Maximum Flowmentioning

confidence: 99%

“…Solving the transport problem in TN without limitations of throughput capacity, when production is concentrated in one point while consumption -in all others, we find the shortest path [5]. Potentials in this case determine length of the path from the vertex with the potential equal to zero.…”

Section: Solving the Shortest Path Problemmentioning

confidence: 99%

See 3 more Smart Citations

Improvement of the methods for determining optimal characteristics of transportation networks

Prokudin

Chupaylenko

Dudnik

et al. 2016

EEJET

View full text Add to dashboard Cite

Section: Improvement Of the Methods Of Searching For The Shortest Dismentioning

confidence: 99%

Section: Literature Review and Problem Statementmentioning

confidence: 99%

“…The problem of maximum flow is conveniently solved by the method of trees [5]. The solution can be extended for the problem with multiple sources and runoffs.…”

Section: Solving the Problems On Maximum Flowmentioning

confidence: 99%

Section: Solving the Shortest Path Problemmentioning

confidence: 99%

See 2 more Smart Citations

Improvement of the methods for determining optimal characteristics of transportation networks

Prokudin

Chupaylenko

Dudnik

et al. 2016

EEJET

View full text Add to dashboard Cite

“…The definition of this model determines the particular optimization model of routes and frequencies, since it determines the total travel time for a given solution. This assignment problem has been studied as an isolated problem and also as part of other optimization problems (Cancela et al, 2015). The assignment problem can also be divided into categories of congested and uncongested assignment problems (Farahani et al, 2013).…”

Section: Related Workmentioning

confidence: 99%

And Solution Method to a Simultaneous Route Design and Frequency Setting Problem for a Bus Rapid Transit System in Colombia

2017

Self Cite

View full text Add to dashboard Cite

ABSTRACT. We propose a model and solution method to a simultaneous route design and frequency setting problem on a main corridor from one of the Bus Rapid Transit (BRT) Systems of Colombia. The proposed model considers objectives of users and operators in a combinatorial multi-objective optimization framework and takes into account real constraints on the operation of some Colombian BRT systems not found in previous models. The problem is solved heuristically by a Genetic Algorithm which is tailored from an existing work, to consider specific characteristics of the real scenario. The methodology is validated with current data from one of the most important bus corridors in a Colombian BRT system. The results obtained improve the current solutions for this corridor.

show abstract

Fixed‐route taxi system: route network design and fleet size minimization problems

Babaei

Schmöcker

Khademi

et al. 2016

J of Advced Transportation

View full text Add to dashboard Cite

Summary This paper introduces the taxi route network design problem (TXRNDP) for a fixed‐route taxi service operating in Iran and, in similar form, in various other developing countries. The service operates fairly similar to regular transit services in that vehicles are only permitted to follow a certain predetermined route on the network. The service is provided with small size vehicles and main features are that vehicles only depart if full and that there are no intermediate boarding stops. In Iran the service attracts a high modal share but requires better coordination which is the main motivation for the present study. We develop a mathematical programming model to minimize the total travel time experienced by passengers while constraining the number of taxi lines, the trip transfer ratio and the length of taxi lines. A number of assumptions are introduced in order to allow finding an exact rather than heuristic solution. We further develop a linear programming solution to minimize the number of taxis required to serve the previously found fixed‐route taxi network. Results of a case study with the city of Zanjan, Iran, illustrate the resulting taxi flows and suggest the capability of the proposed model to reduce the total travel time, the total waiting time and the number of taxi lines compared to the current taxi operation. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Mathematical programming formulations for transit network design

Cited by 91 publications

References 42 publications

Improvement of the methods for determining optimal characteristics of transportation networks

Improvement of the methods for determining optimal characteristics of transportation networks

And Solution Method to a Simultaneous Route Design and Frequency Setting Problem for a Bus Rapid Transit System in Colombia

Fixed‐route taxi system: route network design and fleet size minimization problems

Contact Info

Product

Resources

About