(Created page with " == Abstract == The paper addresses the problem of optimal bus stop allocation. The aim is to achieve reduction of costs on account of appropriate re-design of the process of...")
 
m (Scipediacontent moved page Draft Content 205815409 to Dragan et al 2012a)
 
(No difference)

Latest revision as of 18:42, 25 January 2021

Abstract

The paper addresses the problem of optimal bus stop allocation. The aim is to achieve reduction of costs on account of appropriate re-design of the process of obligatory transportation of children from their homes to the corresponding schools in the Laško municipality. The proposed algorithm relies on optimization based on the Monte Carlo simulation procedure. The number of calculated bus stops is required to be minimal possible, which can still assure maximal service area within the prescribed radius, while keeping the minimal walking distances pupils have to go across from their homes to the nearest bus stop and vice versa. The main issues of the proposed algorithm are emphasised and the working mechanism is explained. The presentation of calculated results is given and comparison with some other existing algorithms is provided. The positions of the calculated bus stops are going to be used for the purpose of physical bus stops implementation in order to decrease the current transportation costs. V prispevku je predstavljen problem določanja lokacij optimalnih avtobusnih postaj za potrebe zmanjševanja stroškov, nastalih zaradi prevoza otrok v občini Laško. Te je potrebno na osnovi zakonskih predpisov vsak dan razvoziti na pripadajoče šole ter jim zagotoviti vrnitev domov. Algoritem temelji na optimizaciji s pomočjo Monte Carlo simulacijske metode, pri čemer se izračunajo lokacije optimalnih avtobusnih postaj. Algoritem je sposoben izračunati najmanjše možno število avtobusnih postaj, ki pa bodo vseeno zagotavljale največje možno pokritje učencev v okviru predpisanega največjega radija pešačenja. Pri tem bo učencem potrebno prehoditi kar najkrajšo možno pot od doma do najbližje postaje in obratno. V prispevku so opisane glavne značilnosti delovanja mehanizma predlaganega algoritma. Prav tako je podan tudi prikaz vseh pomembnih izračunanih rezultatov in primerjava z nekaterimi drugimi obstoječimi algoritmi. Pozicije izračunanih avtobusnih postaj se bodo uporabile pri njihovi kasnejši fizični implementaciji z namenom kar največjega možnega zmanjšanja transportnih stroškov.


Original document

The different versions of the original document can be found in:

https://doaj.org/toc/0353-5320,
https://doaj.org/toc/1848-4069
https://dk.um.si/Dokument.php?id=112063&dn=,
https://dk.um.si/Dokument.php?id=112062&dn=,
https://plus.si.cobiss.net/opac7/bib/512342333?lang=sl under the license http://creativecommons.org/licenses/by/4.0/
https://hrcak.srce.hr/file/122028
http://dx.doi.org/10.7307/ptt.v23i4.129
https://core.ac.uk/display/14449306,
https://traffic.fpz.hr/index.php/PROMTT/article/view/129,
https://dk.um.si/IzpisGradiva.php?id=66020&lang=slv,
https://traffic.fpz.hr/index.php/PROMTT/article/download/129/36,
https://academic.microsoft.com/#/detail/1981545144
Back to Top

Document information

Published on 01/01/2012

Volume 2012, 2012
DOI: 10.7307/ptt.v23i4.129
Licence: Other

Document Score

0

Views 1
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?