Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Tatiana Babicheva"'
Publikováno v:
Materials Proceedings, Vol 14, Iss 1, p 31 (2023)
The paper considers the formative processes of chiral nano- and microparticles in solutions of D-aminoglucan chitosan (CS) in L- and D-aspartic acid (AspA) by means of the counterionic condensation of components and the stabilization of particles by
Externí odkaz:
https://doaj.org/article/a4f66b31725144b38df814adf73b3436
Publikováno v:
IEEE Open Journal of Intelligent Transportation Systems, Vol 2, Pp 24-36 (2021)
High-capacity public transport services such as metro and commuter trains are efficient during normal operations but are vulnerable to disruptions. To manage disruptions, bridging buses are commonly called in to replace the rail-based service along t
Externí odkaz:
https://doaj.org/article/6126fddc2207416d8d21d1526e9d1cff
Publikováno v:
ACM/IMS Transactions on Data Science. 2:1-22
In this article, we investigate empty vehicle redistribution algorithms with time windows for personal rapid transit or autonomous station-based taxi services, from a passenger service perspective. We present an Index Based Redistribution Time Limite
Autor:
Wilco Burghout, Tatiana Babicheva
Publikováno v:
EURO Journal on Transportation and Logistics. 8:745-767
In this article, we investigate empty vehicle redistribution algorithms for Personal Rapid Transit (PRT) or autonomous station-based taxi services, from a passenger service perspective. We present a new index-based redistribution (IBR) algorithm that
Publikováno v:
IET Intelligent Transport Systems. 13:677-682
This study investigates empty vehicle redistribution algorithms for personal rapid transit and autonomous taxi services. The focus is on passenger service and operator cost. A new redistribution algorithm is presented in this study: index-based redis
Publikováno v:
ANT/SEIT
This article discusses empty vehicle redistribution algorithms for PRT and autonomous taxi services from a passenger service perspective. In modern literature reactive methods such as nearest neighbours are commonly used. In this article we first for