| Attributes | Values |
|---|
| rdf:type
| |
| Description
| - The paper deals with the line-planning problem related to urban public transport. Given the transportation network in a city, the origin–destination matrix of travel demands, and the fleet of available vehicles, the goal is to design the routes and frequencies of lines. The proposed solution method is a combination of the exact mathematical programming algorithm and a trip assignment procedure. The solution process consists of three stages: (i) initialization, (ii) designing the line network and setting the initial frequencies of selected lines, (iii) solution improvement. In the first stage, an initial set of feasible lines is proposed. In the second stage, an optimal subset of candidate lines is selected and initial frequencies of lines are computed by solving a mathematical programming model of the line-planning problem. The problem is formulated as a multiple criteria optimization problem, where the criteria reflect travelers’ demand for a high quality service, operator’s interest in an effective service, and the environmental impact of the vehicles. The solution of this problem specifies the number of vehicles of the given mode and type operating on the lines. The lines which are not assigned a vehicle will not operate. The assigned number of vehicles determines the frequency of a given line. At the same time, the solution specifies optimal passengers’ routes in the line network. The third stage consists of an iterative process, which computes new line frequencies with regard to in-vehicle and waiting times, transfers, and passengers’ behavior in a situation when they have multiple travel alternatives. The approach has been verified using real transportation data of a middle-sized city in the Slovak Republic. The paper presents the results of the case study.
- The paper deals with the line-planning problem related to urban public transport. Given the transportation network in a city, the origin–destination matrix of travel demands, and the fleet of available vehicles, the goal is to design the routes and frequencies of lines. The proposed solution method is a combination of the exact mathematical programming algorithm and a trip assignment procedure. The solution process consists of three stages: (i) initialization, (ii) designing the line network and setting the initial frequencies of selected lines, (iii) solution improvement. In the first stage, an initial set of feasible lines is proposed. In the second stage, an optimal subset of candidate lines is selected and initial frequencies of lines are computed by solving a mathematical programming model of the line-planning problem. The problem is formulated as a multiple criteria optimization problem, where the criteria reflect travelers’ demand for a high quality service, operator’s interest in an effective service, and the environmental impact of the vehicles. The solution of this problem specifies the number of vehicles of the given mode and type operating on the lines. The lines which are not assigned a vehicle will not operate. The assigned number of vehicles determines the frequency of a given line. At the same time, the solution specifies optimal passengers’ routes in the line network. The third stage consists of an iterative process, which computes new line frequencies with regard to in-vehicle and waiting times, transfers, and passengers’ behavior in a situation when they have multiple travel alternatives. The approach has been verified using real transportation data of a middle-sized city in the Slovak Republic. The paper presents the results of the case study. (en)
|
| Title
| - Optimization of the Urban Line Network Using a Mathematical Programming Approach
- Optimization of the Urban Line Network Using a Mathematical Programming Approach (en)
|
| skos:prefLabel
| - Optimization of the Urban Line Network Using a Mathematical Programming Approach
- Optimization of the Urban Line Network Using a Mathematical Programming Approach (en)
|
| skos:notation
| - RIV/61989100:27230/12:86083386!RIV13-MSM-27230___
|
| http://linked.open...avai/riv/aktivita
| |
| http://linked.open...avai/riv/aktivity
| |
| http://linked.open...iv/cisloPeriodika
| |
| http://linked.open...vai/riv/dodaniDat
| |
| http://linked.open...aciTvurceVysledku
| |
| http://linked.open.../riv/druhVysledku
| |
| http://linked.open...iv/duvernostUdaju
| |
| http://linked.open...titaPredkladatele
| |
| http://linked.open...dnocenehoVysledku
| |
| http://linked.open...ai/riv/idVysledku
| - RIV/61989100:27230/12:86083386
|
| http://linked.open...riv/jazykVysledku
| |
| http://linked.open.../riv/klicovaSlova
| - discrete choice model, line-planning problem, mathematical programming, multiple criteria optimization (en)
|
| http://linked.open.../riv/klicoveSlovo
| |
| http://linked.open...odStatuVydavatele
| - GB - Spojené království Velké Británie a Severního Irska
|
| http://linked.open...ontrolniKodProRIV
| |
| http://linked.open...i/riv/nazevZdroje
| - International Journal of Sustainable Development and Planning
|
| http://linked.open...in/vavai/riv/obor
| |
| http://linked.open...ichTvurcuVysledku
| |
| http://linked.open...cetTvurcuVysledku
| |
| http://linked.open...UplatneniVysledku
| |
| http://linked.open...v/svazekPeriodika
| |
| http://linked.open...iv/tvurceVysledku
| - Koháni, Michal
- Teichmann, Dušan
- Blatoň, Martin
- Jánošíková, Ľudmila
|
| issn
| |
| number of pages
| |
| http://localhost/t...ganizacniJednotka
| |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)