1. Optimal bus stops' allocation : a school bus routing problem with respect to terrain elevationKlemen Prah, Abolfazl Keshavarzsaleh, Tomaž Kramberger, Borut Jereb, Dejan Dragan, 2018, original scientific article Abstract: The paper addresses the optimal bus stops allocation in the Laško municipality. The goal is to achieve a cost reduction by proper re-designing of a mandatory pupils' transportation to their schools. The proposed heuristic optimization algorithm relies on data clustering and Monte Carlo simulation. The number of bus stops should be minimal possible that still assure a maximal service area, while keeping the minimal walking distances children have to go from their homes to the nearest bus stop. The working mechanism of the proposed algorithm is explained. The latter is driven by three-dimensional GIS data to take into account as much realistic dynamic properties of terrain as possible. The results show that the proposed algorithm achieves an optimal solution with only 37 optimal bus stops covering 94.6 % of all treated pupils despite the diversity and wideness of municipality, as well as the problematic characteristics of terrains' elevation. The calculated bus stops will represent important guidelines to their actual physical implementation.
Keywords: logistics, maximal covering problems, optimization, data clustering, Monte Carlo simulation, geographic information system (GIS), reduction of transportation costs, Laško, Slovenia
Published in DKUM: 22.08.2024; Views: 35; Downloads: 13
 Full text (2,40 MB)
This document has many files! More... |
2. Monte Carlo simulation-based approach to optimal bus stops allocation in the Municipality of LaškoDejan Dragan, Tomaž Kramberger, Martin Lipičnik, 2011, original scientific article 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.
Keywords: location problems, maximal covering problems, optimization, Monte Carlo simulation
Published in DKUM: 05.06.2017; Views: 1317; Downloads: 400
Full text (1,01 MB)
This document has many files! More... |
3. Using GIS for the optimization of pupils transportation: The case of Laško municipalityDejan Dragan, Tomaž Kramberger, Andrej Lisec, Marko Intihar, Klemen Prah, 2011, original scientific article Keywords: location, problems, maximal covering problems, optimization, Monte Carlo simulation, geographic information system (GIS), reduction of transportation costs, ArcLogistics
Published in DKUM: 05.06.2012; Views: 2982; Downloads: 125
 Link to full text |
