Geoinformation system for managing non-regular passenger transportation

Andrii Yefimenko; Alex Kuzmenko; Halina Marchuck; Roman Petriv; Inna Suhoniak

doi:10.1051/e3sconf/202016605002

All issues

Volume 166 (2020)

E3S Web Conf., 166 (2020) 05002

References

Open Access

Issue		E3S Web Conf. Volume 166, 2020 The International Conference on Sustainable Futures: Environmental, Technological, Social and Economic Matters (ICSF 2020)


Article Number		05002
Number of page(s)		7
Section		Sustainable Computing
DOI		https://doi.org/10.1051/e3sconf/202016605002
Published online		22 April 2020

S. Ardekani, B. Jamei, R. Herman. A taxicab fare policy formula based on fuel consumption consumption observation. Transportation Research Record 11(3), 33–39 (1989) [Google Scholar]
T. Chang, T. Chu. Optimal taxi market control operated with a flexible initial fare policy. Networking, Sensing and Control 2(1), 1335–1440 (2004) [Google Scholar]
X. Zou, S. Zheng, X. Ban, X. Lian. Optimal path algorithm for road network with traffic capacity limits. Journal of Highway and Transportation Research Development 19(4), 82–84 (2002) [Google Scholar]
L. Wang, Discussion on static and dynamic sharing mode of taxis in big cities, Master Dissertation, Changsha University of Science & Technology, 2012 [Google Scholar]
X. Yun, Research on Traveling Salesman Problem Algorithm. Advanced Materials Research 694–697, 2901-2904 (2013) [Google Scholar]
M. Friedrich, M. Hartl, C. Magg. A modeling approach for matching ridesharing trips within macroscopic travel demand models. Transportation 45(6), 16–39 (2018) [Google Scholar]
M. Tamannaei, I. Irandoost, Carpooling problem: A new mathematical model, branch-and-bound, and heuristic beam search algorithm. Journal of Intelligent Transportation Systems 23(3), 203–215 (2019) [Google Scholar]
P. Kalczynski, M. Miklas-Kalczynska, A decentralized solution to the car pooling problem, International Journal of Sustainable Transportation 13(2), 81–92 (2019) [Google Scholar]
D. Blystone, The Story of Uber: How a Snowy Night in Paris Created a Behemoth (Investopedia, 2018), https://www.investopedia.com/articles/personal-finance/111015/story-uber.asp. Accessed 11 Feb 2019 [Google Scholar]
P.M. d’Orey, R. Fernandes, M. Ferreira, Reducing the environmental impact of taxi operation: the taxisharing use case, in in: 2012 12th International Conference on ITS Telecommunications, pp. 319–323 (2013). doi:10.1109/ITST.2012.6425191 [Google Scholar]
S.S. Semenov, A.V. Pedan, V.S. Volovikov, I.S. Klimov, Analysis of the Labor Intensity of Various Algorithmic Approaches for Solving the Traveling Salesman Problem. Systems of Control, Communication and Security 1, 116–131 (2017), http://sccs.intelgr.com/archive/2017-01/08-Semenov.pdf. Accessed 31 Mar 2020 [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.

[1] S. Ardekani, B. Jamei, R. Herman. A taxicab fare policy formula based on fuel consumption consumption observation. Transportation Research Record 11(3), 33–39 (1989) [Google Scholar]

[2] T. Chang, T. Chu. Optimal taxi market control operated with a flexible initial fare policy. Networking, Sensing and Control 2(1), 1335–1440 (2004) [Google Scholar]

[3] X. Zou, S. Zheng, X. Ban, X. Lian. Optimal path algorithm for road network with traffic capacity limits. Journal of Highway and Transportation Research Development 19(4), 82–84 (2002) [Google Scholar]

[4] L. Wang, Discussion on static and dynamic sharing mode of taxis in big cities, Master Dissertation, Changsha University of Science & Technology, 2012 [Google Scholar]

[5] X. Yun, Research on Traveling Salesman Problem Algorithm. Advanced Materials Research 694–697, 2901-2904 (2013) [Google Scholar]

[6] M. Friedrich, M. Hartl, C. Magg. A modeling approach for matching ridesharing trips within macroscopic travel demand models. Transportation 45(6), 16–39 (2018) [Google Scholar]

[7] M. Tamannaei, I. Irandoost, Carpooling problem: A new mathematical model, branch-and-bound, and heuristic beam search algorithm. Journal of Intelligent Transportation Systems 23(3), 203–215 (2019) [Google Scholar]

[8] P. Kalczynski, M. Miklas-Kalczynska, A decentralized solution to the car pooling problem, International Journal of Sustainable Transportation 13(2), 81–92 (2019) [Google Scholar]

[9] D. Blystone, The Story of Uber: How a Snowy Night in Paris Created a Behemoth (Investopedia, 2018), https://www.investopedia.com/articles/personal-finance/111015/story-uber.asp. Accessed 11 Feb 2019 [Google Scholar]

[10] P.M. d’Orey, R. Fernandes, M. Ferreira, Reducing the environmental impact of taxi operation: the taxisharing use case, in in: 2012 12th International Conference on ITS Telecommunications, pp. 319–323 (2013). doi:10.1109/ITST.2012.6425191 [Google Scholar]

[11] S.S. Semenov, A.V. Pedan, V.S. Volovikov, I.S. Klimov, Analysis of the Labor Intensity of Various Algorithmic Approaches for Solving the Traveling Salesman Problem. Systems of Control, Communication and Security 1, 116–131 (2017), http://sccs.intelgr.com/archive/2017-01/08-Semenov.pdf. Accessed 31 Mar 2020 [Google Scholar]