This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n7http://localhost/temp/predkladatel/
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/resource/domain/vavai/subjekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
n12http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27230%2F12%3A86083386%21RIV13-MSM-27230___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27230%2F12%3A86083386%21RIV13-MSM-27230___
rdf:type
skos:Concept n15:Vysledek
dcterms: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.
dcterms:title
Optimization of the Urban Line Network Using a Mathematical Programming Approach Optimization of the Urban Line Network Using a Mathematical Programming Approach
skos:prefLabel
Optimization of the Urban Line Network Using a Mathematical Programming Approach Optimization of the Urban Line Network Using a Mathematical Programming Approach
skos:notation
RIV/61989100:27230/12:86083386!RIV13-MSM-27230___
n15:predkladatel
n17:orjk%3A27230
n3:aktivita
n16:S
n3:aktivity
S
n3:cisloPeriodika
3
n3:dodaniDat
n6:2013
n3:domaciTvurceVysledku
n9:2190184 n9:7604335
n3:druhVysledku
n14:J
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
156995
n3:idVysledku
RIV/61989100:27230/12:86083386
n3:jazykVysledku
n18:eng
n3:klicovaSlova
discrete choice model, line-planning problem, mathematical programming, multiple criteria optimization
n3:klicoveSlovo
n8:discrete%20choice%20model n8:multiple%20criteria%20optimization n8:mathematical%20programming n8:line-planning%20problem
n3:kodStatuVydavatele
GB - Spojené království Velké Británie a Severního Irska
n3:kontrolniKodProRIV
[B31815733E4E]
n3:nazevZdroje
International Journal of Sustainable Development and Planning
n3:obor
n11:JO
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
4
n3:rokUplatneniVysledku
n6:2012
n3:svazekPeriodika
2012
n3:tvurceVysledku
Koháni, Michal Blatoň, Martin Jánošíková, Ľudmila Teichmann, Dušan
s:issn
1743-7601
s:numberOfPages
14
n7:organizacniJednotka
27230