Management of Municipal Public Transport Vehicle Journeys by Using the PERT Method
Abstract
:1. Introduction
- time wasting and hindered access to some destinations as a result of congestion,
- decreased road safety,
- increased air pollution, street noise, and global warming,
- vehicles parked in traffic lanes are often obstacles to pedestrians, cyclists and disabled persons.
- optimising the accessibility of individual parts of the city,
- minimising the travel time,
- reducing the negative environmental impacts.
- application of the PERT (Program Evaluation and Review Technique) method that makes it possible to optimise the travel times (for the purposes of this study, the focus was only on the time from getting on a means of public transport to getting off),
- a survey carried out among users of the municipal collective transportation system, to find out whether it was easy for them to move between various parts of the city.
- approaching analyses of fuzzy networks and projects [13],
- developing linear models for evaluation of contractor data, making it possible to estimate uncertainty of information regarding the contractor’s various criteria [14],
- calculating the statistical algorithms of time analysis, predicting the distribution of probability of a circuit delay, at the same time considering the effects of correlation of spatial changes in intragroup parameters [15],
- designing and perfecting various clinical processes [16],
- business management, project planning control, logistic support [17],
- logical design [18],
- optimisation of time and costs connected with production projects [19],
- modelling the renovation of various building structures [20].
2. The PERT Method in Logistic Management of Collective Passenger Transport
3. Methodological Background
- routes of the individual bus lines, their starting and final points, intermediate points of bus lines, travel time between the initial and final bus terminals (data obtained on the basis of expertise and with application of data bases)
- changes depending on the day of the week (Monday, Tuesday, etc.), time of day (6:00, 8:00, etc.) (data obtained on the basis of expertise)
- preferences of city users with regard to the route, including bus stop locations (data obtained from surveys taken by municipal transport users)
- number of (all the data were obtained from the data bases managed by the city authorities):
- −
- car parks in the given city,
- −
- workplaces,
- −
- kinds of vehicles participating in the urban traffic,
- −
- shopping centres,
- −
- housing estates and city districts,
- −
- recreational facilities,
- −
- educational institutions,
- −
- municipal offices,
- −
- the city population (population density in individual districts).
- indicating whether the travel direction is a significant element of the traffic intensity,
- indicating on which days the city traffic is similar,
- indicating the exact hours of intensified road traffic,
- identifying the roads being the so-called bottlenecks (which constrain the vehicle flow, thus constituting the capacity limit for the whole system).
- dividing the road infrastructure into sections in accordance with the following guidelines: the sections take into account the travel times at least between two intersections, even though there may be shorter sections; the sections account for all changes in the traffic intensity shown on google.maps, any sections considered to be bottlenecks as a result of the traffic flow analysis have been rejected, any sections that are unsuitable for bus travel due to traffic impediments have been rejected, therefore, the permissible speed of 50 km/h was adopted for vehicles driving within the city,
- computation of travel time using the length of a section and velocity at which the vehicle may be driven along the section, by means of Formula (1).
- green (1)—50 km/h,
- yellow (2)—25 km/h,
- orange (3)—10 km/h,
- red (4)—1 km/h,
- repeating the steps enumerated above for, respectively: day of the week—Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday, and hours: 6:00, 8:00, 10:00, 12:00, 14:00, 16:00, 18:00, 20:00, 22:00,
- determination of the most probable time lengths via averaging all values for each section, taking into account the day of the week and the hour (Figure 3).
- specifying the Interchange Point in the city centre (taking the location in the city centre or in the vicinity of the Main Station as the criterion), which should serve as the distribution point for passengers using the collective urban transportation system,
- indicating on the city outskirts all the Extreme points that can be reached by any road (the criterion is met when the shortest (in terms of distance) routes from the Extreme points leading to the Interchange Point will run through all districts in the city).
- computations for the sections forming the critical path, pessimistic time (tb) for which the assumed speed is 10 km/h and optimistic time (ta) for which the assumed speed is 50 km/h), using the data from the traffic flow analysis carried out at Stage 1, item 1.
- drawing up a table showing the entire route made using the PERT method, additionally considering, for all sections in the analysed PERT network, the following values:
- −
- most probable travel time (te):
- −
- standard deviation ():
- −
- variance ( ):
- calculation of the sum of the Most Probable Times (∑tm) on the Critical Path,
- calculation of the sum of Variations (∑σ2) of all times on the Critical Path,
- indication of the Potential Travel Time (D) as the time we want to check as likely for the journey,
- calculation of the Normal Distribution Function (variable Z), where:
- reading from the Normal Distribution tables the probability that the bus covers the route within time D, where D < ∑tm or where D > ∑tm.
- indicating travel time D, for which probability is >80%.
4. Evaluation
Use Case Description
- vehicle tracking system—GPS (aimed at tracking buses to find out their exact location at the moment, and to specify an approximate time of arrival at the next bus stop),
- variable message boards (the latest telematics solution aimed at notifying passengers waiting at a bus stop, at what time any given bus is scheduled to arrive),
- dynamic passenger information system—informing passengers about of time of arrival of the means of transport. The main advantage of this system is that it provides information in real time, telling when a bus of any given bus line is going to arrive at the next bus stop. Unfortunately, the variable message boards and the dynamic passenger information system have not been combined yet, and the boards display the scheduled bus arrival times.
- for the purposes of the study, the direction of vehicle movement in the city is unimportant (the statement was based on the research results in the analysed city (the results were shown in: [32], even though it is probable that the direction of vehicle movement is important in other cities, as one-way streets and time of day may have a significant impact on bus travel time lengths),
- the analysis results have shown that week days from Monday through Friday are similar, so they form one category, whereas the other category comprises Saturday and Sunday,
- the analysis has shown that similarities in terms of particular hours of traffic were diverse and they can be divided into 5 groups: Group 1: 6:00, 20:00, Group 2: 8:00, 14:00, Group 3: 10:00, 12:00, 18:00, Group 4: 16:00, Group 5: 22:00,
- traffic intensity for the above groups, starting from the least congested streets: Group 4, Group 2, Group 3, Group 1, Group 5,
- the most congested streets in Opole are: the Opole ring-road (road no. 46), ul. Bohaterów Monte Casino, ul. Niemodlińska, ul. Wrocławska, ul. Piastowska.
5. Conclusions
Author Contributions
Funding
Institutional Review Board Statement
Informed Consent Statement
Conflicts of Interest
References
- United Nations. Population Division in World Urbanization Prospects: The 2014 Revision, Highlights (ST/ESA/SER.A/352); Department of Economic and Social Affairs: New York, NY, USA, 2014; Volume 12. [Google Scholar]
- Banister, D. Unsustainable Transport. City Transport in the New Century; Routledge: London, UK, 2005. [Google Scholar]
- Yang, L.; Chau, K.W.; Szeto, W.Y.; Cui, X.; Wang, X. Accessibility to transit, by transit, and property prices: Spatially varying relationships. Transp. Res. Part D Transp. Environ. 2020, 85, 102387. [Google Scholar] [CrossRef]
- Yang, L.; Chu, X.; Gou, Z.; Yang, H.; Lu, Y.; Huang, W. Accessibility and proximity effects of bus rapid transit on housing prices: Heterogeneity across price quantiles and space. J. Transp. Geogr. 2020, 88, 102850. [Google Scholar] [CrossRef]
- Eboli, L.; Mazzulla, G. Service Quality Attributes Affecting Customer Satisfaction for Bus Transit. J. Public Transp. 2007, 10, 21–34. [Google Scholar] [CrossRef] [Green Version]
- Nosala, K.; Solecka, K. Application of AHP method for multi-criteria evaluation of variants of the integration of urban public transport. Transp. Res. Procedia 2014, 3, 269–278. [Google Scholar] [CrossRef] [Green Version]
- Liu, S.; Zhu, X. An Integrated GIS Approach to Accessibility Analysis. Trans. GIS 2004, 8, 45–62. [Google Scholar] [CrossRef]
- Cascetta, E.; Carteni, A.; Pagliara, F.; Montanino, M. A new look at planning and designing transportation systems: A decision-making model based on cognitive rationality, stakeholder engagement and quantitative methods. Transp. Policy 2015, 38, 27–39. [Google Scholar] [CrossRef]
- Le Pira, M.; Inturri, G.; Ignaccolo, M.; Pluchino, A. Dealing with the Complexity of Stakeholder Interaction in Participatory Transport Planning. In Advanced Concepts, Methodologies and Technologies for Transportation and Logistics; Zak, J., Hadas, Y., Rossi, R., Eds.; Advances in Intelligent Systems and Computing 572; Springer: Cham, Switzerland, 2018; pp. 54–72. [Google Scholar]
- May, A.D.; Roberts, M. The design of integrated transport strategies. Transp. Policy 1995, 2, 97–105. [Google Scholar] [CrossRef]
- Tsamboulas, D.A. A tool for prioritizing multinational transport infrastructure investments. Transp. Policy 2007, 14, 11–26. [Google Scholar] [CrossRef]
- Le Pira, M.; Inturri, G.; Ignaccolo, M.; Pluchino, A. Modelling consensus building in Delphi practices for participated transport planning. Transp. Res. Procedia 2017, 25, 3725–3735. [Google Scholar] [CrossRef]
- McCahon, C.S. Using PERT as an approximation of fuzzy project-network analysis. IEEE Trans. Eng. Manag. 1993, 40, 146–153. [Google Scholar] [CrossRef]
- Hatush, Z.; Skitmore, M. Assessment and evaluation of contractor data against client goals using PERT approach. Constr. Manag. Econ. 1997, 15, 327–340. [Google Scholar] [CrossRef] [Green Version]
- Chang, H.; Sapatnekar, S.S. Statistical Timing Analysis Considering Spatial Correlations Using a Single PERT-Like Traversal. In Proceedings of the ICCAD-2003 International Conference on Computer Aided Design (IEEE Cat. No.03CH37486), San Jose, CA, USA, 9 November 2003; pp. 621–625. [Google Scholar] [CrossRef]
- Luttman, R.J.; Laffel, G.L.; Pearson, S.D. Using PERT/CPM (Program Evaluation and Review Technique/Critical Path Method) to design and improve clinical processes. Qual. Manag. Health Care 1995, 3, 1–13. [Google Scholar] [CrossRef] [PubMed]
- Shyi-Ming, C.h.; Tao-Hsing, C.h. Finding multiple possible critical paths using fuzzy PERT. IEEE Trans. Syst. Man Cybern. Part B 2001, 31, 930–937. [Google Scholar] [CrossRef] [PubMed]
- Kirkpatrick, T.I.; Clark, N.R. Pert as an Aid to Logic Design. IBM J. Res. Dev. 1966, 10, 135–141. [Google Scholar] [CrossRef]
- Lermen, F.; Morais, M.; Matos, C.; Röder, R.; Röder, C. Optimization of times and costs of project of horizontal laminator production using PERT/CPM technical. Indep. J. Manag. Prod. 2016, 7, 833–853. [Google Scholar] [CrossRef] [Green Version]
- Akpan, N.P.; Agadaga, G.O. Modelling Building Renovation Using PERT. Asian Res. J. Math. 2020, 16, 25–38. [Google Scholar] [CrossRef]
- Lock, D. Podstawy Zarządzania Projektami; PWE: Warszawa, Poland, 2009. [Google Scholar]
- Brandenburg, H. Zarządzanie Projektami; Wydawnictwo Akademii Ekonomicznej w Katowicach: Katowice, Poland, 2002. [Google Scholar]
- Trocki, M.; Grucza, B.; Ogonek, K. Zarządzanie Projektami; PWE: Warszawa, Poland, 2003. [Google Scholar]
- Wysocki, R. Efektywne Zarządzanie Projektami; Helion: Gliwice, Poland, 2013. [Google Scholar]
- Hamilton, A. Managing Projects for Success: A Trilogy; Thomas Telford Publishing Ltd.: London, UK, 2001; pp. 214–223. [Google Scholar]
- Biruk, S.; Jaworski, K.M.; Tokarski, T. Podstawy Organizacji Robót Drogowych; Wydawnictwo Naukowe PWN: Warszawa, Poland, 2009. [Google Scholar]
- Supernat, J. Zarządzanie Strategiczne (Pojęcia i Koncepcje); Kolonia Limited: Wrocław, Poland, 1998; pp. 140–141. [Google Scholar]
- Grześ, A. Wykres Gantta a metoda ścieżki krytycznej (CPM). Czas. Optim. Studia Ekon. 2014, 6. [Google Scholar] [CrossRef] [Green Version]
- Masłowski, D.; Kulińska, E. The Method to Compare Cities to Effective Management of Innovative Solutions. Eur. Res. Stud. J. 2020, XXIII, 309–322. [Google Scholar] [CrossRef]
- Donaldson, W.; Coon, H. The Estimation of the Mean and Variance of a ‘PERT’ Activity Time. Oper. Res. 1965, 13, 382–387. Available online: http://www.jstor.org/stable/16780 (accessed on 7 July 2021). [CrossRef]
- Kulińska, E.; Masłowski, D.; Dendera-Gruszka, M. Analiza PEST/PESTEL jako narzędzie wspomagające rozwój miast. Studium przypadku na podstawie miasta Opola. Studia I Mater. Misc. Oeconomicae 2017, 21, 155–169. [Google Scholar]
- Kulińska, E.; Masłowski, D. Zarządzanie Bezpieczeństwem Miejskiej Komunikacji Zbiorowej; Difin: Warszawa, Poland, 2020. [Google Scholar]
Description | Application of Classical PERT | Application of PERT in Logistic Management of a Collective Urban Transportation System |
---|---|---|
ta—optimistic time | the shortest possible duration of a given activity (it will occur in conditions that are particularly favourable for carrying out the task) | the shortest possible travel time for the given road section (V = 50 km/h) |
tb—pessimistic time | the longest possible duration of a given activity (it will occur in the case of a number difficulties leading to a delay in carrying out the task) | the longest possible travel time for the given road section (V = 1 km/h) |
tm—realistic time | the most probable (or realistic) duration of a given activity (ta < tm < tb) | real averaged travel time for the given road section, resulting from the study |
AoA notation node | A—event number, B—earliest possible moment of event, C—latest possible moment of event, D—differences between the latest and the earliest moments of the event (event slack). | A—number of a given intersection B—earliest time of arrival at the intersection C—latest time of arrival at the intersection D—differences between the latest and the earliest arrival of the bus at the intersection (travel delay) |
Connecting arrow | activity duration | Travel time from intersection to intersection |
Purpose of network solving | determining the shortest time of project completion, accounting for any constraints, logistic dependencies and estimated durations of individual activities | determining the optimal bus route between the specified points within the city, accounting for any dependencies and constraints |
Critical path | a sequence of activities (project subtasks), where a delay of any of them will delay the completion of the whole project. | specified route of a public bus service |
s/n | R | U | tm | ta | tb | to | σ | σ2 |
---|---|---|---|---|---|---|---|---|
1 | 1–2 | STRZ2 | 61.77 | 57.24 | 286.2 | 98.42 | 38.16 | 1456.19 |
2 | 2–3 | Mor | 141.11 | 11.38 | 551.88 | 187.95 | 90.08 | 8115.01 |
3 | 3–4 | Gru-tys | 159.06 | 123.19 | 615.96 | 229.23 | 82.13 | 6745.06 |
4 | 4–6 | Oz3 | 61.05 | 37.08 | 185.4 | 77.78 | 24.72 | 611.08 |
5 | 3–5 | Wsch2 | 143.54 | 95.69 | 0.00 | 0.00 | ||
6 | 2–7 | Strz3-kow | 193.7 | 129.13 | 0.00 | 0.00 | ||
7 | 6–5 | Gło2 | 61.77 | 41.18 | 0.00 | 0.00 | ||
8 | 6–8 | Oz 5, 6, 7, 8 | 112.55 | 79.63 | 398.16 | 154.67 | 53.09 | 2818.37 |
9 | 8–9 | Oz 8, 9 | 63.03 | 42.02 | 0.00 | 0.00 | ||
10 | 8–10 | Rej2 | 44.9 | 33.34 | 166.68 | 63.27 | 22.22 | 493.88 |
11 | 10–11 | Rej1 | 63.52 | 59.26 | 296.28 | 101.60 | 39.50 | 1560.51 |
12 | 5–11 | Wsch1 | 56.73 | 37.82 | 0.00 | 0.00 | ||
13 | 11–7 | MI-1 | 38.04 | 27.36 | 136.8 | 52.72 | 18.24 | 332.70 |
14 | 10–13 | 1Maj 1, 2 | 71.59 | 47.73 | 0.00 | 0.00 | ||
15 | 7–12 | Ak1 | 95.05 | 71.71 | 358.56 | 135.08 | 47.81 | 2285.64 |
16 | 9–13 | Ple | 44.37 | 29.58 | 0.00 | 0.00 | ||
17 | 13–12 | Fab | 46 | 30.67 | 0.00 | 0.00 | ||
18 | 9–14 | Oz 10, 11 | 142.67 | 95.11 | 0.00 | 0.00 | ||
19 | 13–15 | 1Maj 3, 4, 5 | 106.23 | 70.82 | 0.00 | 0.00 | ||
20 | 12–15 | Ak2, 3, 4 | 112.38 | 90.65 | 453.24 | 165.57 | 60.43 | 3651.99 |
21 | 14–15 | Koł 1, 2 | 55.98 | 37.32 | 0.00 | 0.00 | ||
Total: | 889.43 | 590.84 | 3449.16 | 1923.36 | 476.39 | 28,070.42 |
Normal Distribution |
---|
Checked value (D) |
1035 |
Probability |
0.87 |
Value read in the tables |
80.78% |
There is a 80.78% chance that the bus will cover the route running along the critical path within 1035 s, i.e., 17 min |
1. Sosnkowskiego–Mikołajczyka–Okulickiego | 2. Oleska–Chabrów–Batalionów Chłopskich | 3. Ozimska–Reymonta–1 Maja–Plebiscytowa |
---|---|---|
l.p | R | U | t | t | t | Tp | Tnp | O | W |
---|---|---|---|---|---|---|---|---|---|
1 | 20–19 | Puż1 | 131.37 | 101.45 | 507.24 | 246.69 | 189.03 | 67.63 | 4574.04 |
2 | 19–18 | Sos7 | 72.14 | 47.74 | 238.68 | 119.52 | 95.83 | 31.82 | 1012.72 |
3 | 18–17 | Mik | 36.97 | 20.52 | 102.6 | 53.36 | 45.17 | 13.68 | 187.14 |
4 | 17–15 | Ole4 | 63.69 | 47.52 | 237.6 | 116.27 | 89.98 | 31.68 | 1003.62 |
5 | 18–16 | Sos6 | 50.74 | 50.74 | 33.83 | 0.00 | 0.00 | ||
6 | 16–15 | Oku | 31.89 | 31.89 | 21.26 | 0.00 | 0.00 | ||
7 | 15–14 | Ole5,6 | 84.67 | 84.67 | 56.45 | 0.00 | 0.00 | ||
8 | 14–12 | BCh | 50.84 | 50.84 | 33.89 | 0.00 | 0.00 | ||
9 | 15–13 | Cha | 96.94 | 63.94 | 319.68 | 160.19 | 128.56 | 42.62 | 1816.75 |
10 | 13–12 | Lub5,6 | 142.1 | 104.33 | 521.64 | 256.02 | 199.06 | 69.55 | 4837.43 |
11 | 12–11 | Nł1,2KsO3 | 49.7 | 37.58 | 187.92 | 91.73 | 70.72 | 25.06 | 627.84 |
12 | 11–10 | Sad, Sie2,1 | 59.29 | 44.28 | 221.4 | 108.32 | 83.81 | 29.52 | 871.43 |
13 | 10–9 | Ole9 | 14.48 | 9.86 | 49.32 | 24.55 | 19.52 | 6.58 | 43.25 |
14 | 9–8 | Gr2Żer1Rey6-Pk | 74.2 | 32.9 | 164.52 | 90.54 | 82.37 | 21.94 | 481.22 |
15 | 8–7 | Oz12,11,10 | 124.02 | 68.94 | 344.52 | 179.16 | 151.59 | 45.93 | 2109.56 |
16 | 7–5 | Ple | 44.37 | 32.47 | 162.36 | 79.73 | 62.05 | 21.65 | 468.65 |
17 | 8–6 | Rey 3,4,5 | 64.31 | 64.31 | 42.87 | 0.00 | 0.00 | ||
18 | 6–5 | 1Maj 4,5 | 86.78 | 86.78 | 57.85 | 0.00 | 0.00 | ||
19 | 5–4 | 1Maj2,1 | 41.59 | 38.52 | 247.68 | 109.26 | 75.43 | 34.86 | 1215.22 |
20 | 4–3 | Rej1 | 63.52 | 59.26 | 296.28 | 139.69 | 101.60 | 39.50 | 1560.51 |
21 | 3–2 | MI1 | 38.04 | 27.36 | 136.8 | 67.40 | 52.72 | 18.24 | 332.70 |
22 | 2–1 | AP2-JAG | 157.76 | 126.5 | 632.52 | 305.59 | 231.68 | 84.34 | 7112.67 |
Total: | 1210.18 | 863.17 | 4370.76 | 2517.27 | 1925.26 | 584.60 | 28,254.77 |
Normal Distribution |
---|
Checked value (D) |
1353 |
Probability |
0.85 |
Value read in the tables |
80.23% |
There is a 80.23% chance that the bus will cover the route running along the critical path within 1353 s, i.e., 23 min |
Mean Actual Bus Travel Time before the Optimisation (min) | Mean Optimised Bus Travel Time (min) | Passenger Car Travel Time (at 13.30, Tuesday) (min) | |
---|---|---|---|
Bus travel time (including the time of stopping at the bus stops) | 36 | ||
Number of bus stops | 23 | ||
Time of stopping at the bus stops | 11.5 | ||
Bus driving time | 25 | 23 | 21 |
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Masłowski, D.; Kijewska, K.; Kulińska, E. Management of Municipal Public Transport Vehicle Journeys by Using the PERT Method. Energies 2021, 14, 4403. https://doi.org/10.3390/en14154403
Masłowski D, Kijewska K, Kulińska E. Management of Municipal Public Transport Vehicle Journeys by Using the PERT Method. Energies. 2021; 14(15):4403. https://doi.org/10.3390/en14154403
Chicago/Turabian StyleMasłowski, Dariusz, Kinga Kijewska, and Ewa Kulińska. 2021. "Management of Municipal Public Transport Vehicle Journeys by Using the PERT Method" Energies 14, no. 15: 4403. https://doi.org/10.3390/en14154403
APA StyleMasłowski, D., Kijewska, K., & Kulińska, E. (2021). Management of Municipal Public Transport Vehicle Journeys by Using the PERT Method. Energies, 14(15), 4403. https://doi.org/10.3390/en14154403