dc.contributor.author | Teichmann, Dušan | |
dc.contributor.author | Dorda, Michal | |
dc.contributor.author | Bínová, Helena | |
dc.contributor.author | Ludvík, Martin | |
dc.date.accessioned | 2015-05-18T13:29:19Z | |
dc.date.available | 2015-05-18T13:29:19Z | |
dc.date.issued | 2015 | |
dc.identifier.citation | PROMET - Traffic&Transportation. 2015, vol. 27, issue 1, p. 69-75. | cs |
dc.identifier.issn | 0353-5320 | |
dc.identifier.issn | 1848-4069 | |
dc.identifier.uri | http://hdl.handle.net/10084/106763 | |
dc.description.abstract | A typical trait of public transport is a spatially scattered demand. A route net that is operated by a carrier (or several carriers) has to be adapted to the demand. Public transport vehicles that are not used during a period of a day are usually parked in defined parking lots that have a given capacity. When the vehicle goes from the place where its schedule ends (usually a terminus of the last connection served by the vehicle) to the place where the vehicle should be parked, a non-productive journey occurs. The same occurs at the beginning of the vehicle schedule as well. The main goal of the paper is to present a mathematical model that enables minimization of the total length of all the non-productive journeys. Functionality of the proposed mathematical model was tested in the conditions of a real bus public transport network. | cs |
dc.language.iso | en | cs |
dc.publisher | University of Zagreb | cs |
dc.relation.ispartofseries | PROMET - Traffic&Transportation | cs |
dc.relation.uri | http://dx.doi.org/10.7307/ptt.v27i1.1593 | cs |
dc.title | Optimization of parking public transport vehicles in Ostrava | cs |
dc.type | article | cs |
dc.identifier.doi | 10.7307/ptt.v27i1.1593 | |
dc.type.status | Peer-reviewed | cs |
dc.description.source | Web of Science | cs |
dc.description.volume | 27 | cs |
dc.description.issue | 1 | cs |
dc.description.lastpage | 75 | cs |
dc.description.firstpage | 69 | cs |
dc.identifier.wos | 000352253600007 | |