IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2506.22966.html
   My bibliography  Save this paper

Detection of coordinated fleet vehicles in route choice urban games. Part I. Inverse fleet assignment theory

Author

Listed:
  • Grzegorz Jamr'oz
  • Rafa{l} Kucharski

Abstract

Detection of collectively routing fleets of vehicles in future urban systems may become important for the management of traffic, as such routing may destabilize urban networks leading to deterioration of driving conditions. Accordingly, in this paper we discuss the question whether it is possible to determine the flow of fleet vehicles on all routes given the fleet size and behaviour as well as the combined total flow of fleet and non-fleet vehicles on every route. We prove that the answer to this Inverse Fleet Assignment Problem is 'yes' for myopic fleet strategies which are more 'selfish' than 'altruistic', and 'no' otherwise, under mild assumptions on route/link performance functions. To reach these conclusions we introduce the forward fleet assignment operator and study its properties, proving that it is invertible for 'bad' objectives of fleet controllers. We also discuss the challenges of implementing myopic fleet routing in the real world and compare it to Stackelberg and Nash routing. Finally, we show that optimal Stackelberg fleet routing could involve highly variable mixed strategies in some scenarios, which would likely cause chaos in the traffic network.

Suggested Citation

  • Grzegorz Jamr'oz & Rafa{l} Kucharski, 2025. "Detection of coordinated fleet vehicles in route choice urban games. Part I. Inverse fleet assignment theory," Papers 2506.22966, arXiv.org.
    • Handle: RePEc:arx:papers:2506.22966
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2506.22966
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. von Stengel, Bernhard & Zamir, Shmuel, 2010. "Leadership games with convex strategy sets," Games and Economic Behavior, Elsevier, vol. 69(2), pages 446-457, July.
    2. Patrick T. Harker, 1988. "Multiple Equilibrium Behaviors on Networks," Transportation Science, INFORMS, vol. 22(1), pages 39-46, February.
    3. Timothy C. Y. Chan & Rafid Mahmood & Ian Yihang Zhu, 2025. "Inverse Optimization: Theory and Applications," Operations Research, INFORMS, vol. 73(2), pages 1046-1074, March.
    4. Watling, David, 1996. "Asymmetric problems and stochastic process models of traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 339-357, October.
    5. Cascetta, Ennio, 1984. "Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator," Transportation Research Part B: Methodological, Elsevier, vol. 18(4-5), pages 289-299.
    6. Bierlaire, Michel, 2002. "The total demand scale: a new measure of quality for static and dynamic origin-destination trip tables," Transportation Research Part B: Methodological, Elsevier, vol. 36(9), pages 837-850, November.
    7. Susan Jia Xu & Mehdi Nourinejad & Xuebo Lai & Joseph Y. J. Chow, 2018. "Network Learning via Multiagent Inverse Transportation Problems," Service Science, INFORMS, vol. 52(6), pages 1347-1364, December.
    8. Smith, M. J., 1979. "The existence, uniqueness and stability of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 295-304, December.
    9. Stella C. Dafermos, 1971. "An Extended Traffic Assignment Model with Applications to Two-Way Traffic," Transportation Science, INFORMS, vol. 5(4), pages 366-389, November.
    10. Yang, Hai & Zhang, Xiaoning & Meng, Qiang, 2007. "Stackelberg games and multiple equilibrium behaviors on networks," Transportation Research Part B: Methodological, Elsevier, vol. 41(8), pages 841-861, October.
    11. Clemens Heuberger, 2004. "Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 329-361, September.
    12. Takamasa Iryo & David Watling & Martin Hazelton, 2024. "Estimating Markov Chain Mixing Times: Convergence Rate Towards Equilibrium of a Stochastic Process Traffic Assignment Model," Transportation Science, INFORMS, vol. 58(6), pages 1168-1192, November.
    13. Van Zuylen, Henk J. & Willumsen, Luis G., 1980. "The most likely trip matrix estimated from traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 14(3), pages 281-293, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Menon, Aditya Krishna & Cai, Chen & Wang, Weihong & Wen, Tao & Chen, Fang, 2015. "Fine-grained OD estimation with automated zoning and sparsity regularisation," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 150-172.
    2. Michel Bierlaire & Frank Crittin, 2006. "Solving Noisy, Large-Scale Fixed-Point Problems and Systems of Nonlinear Equations," Transportation Science, INFORMS, vol. 40(1), pages 44-63, February.
    3. Walpen, Jorgelina & Mancinelli, Elina M. & Lotito, Pablo A., 2015. "A heuristic for the OD matrix adjustment problem in a congested transport network," European Journal of Operational Research, Elsevier, vol. 242(3), pages 807-819.
    4. Xuesong Zhou & George F. List, 2010. "An Information-Theoretic Sensor Location Model for Traffic Origin-Destination Demand Estimation Applications," Transportation Science, INFORMS, vol. 44(2), pages 254-273, May.
    5. Fu, Hao & Lam, William H.K. & Shao, Hu & Ma, Wei & Chen, Bi Yu & Ho, H.W., 2022. "Optimization of multi-type sensor locations for simultaneous estimation of origin-destination demands and link travel times with covariance effects," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 19-47.
    6. Minyu Shen & Feng Xiao & Weihua Gu & Hongbo Ye, 2024. "Cognitive Hierarchy in Day-to-day Network Flow Dynamics," Papers 2409.11908, arXiv.org, revised Jun 2025.
    7. Gunnar Flötteröd & Michel Bierlaire & Kai Nagel, 2011. "Bayesian Demand Calibration for Dynamic Traffic Simulations," Transportation Science, INFORMS, vol. 45(4), pages 541-561, November.
    8. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    9. Shen, Wei & Wynter, Laura, 2012. "A new one-level convex optimization approach for estimating origin–destination demand," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1535-1555.
    10. Castillo, Enrique & Menéndez, José María & Sánchez-Cambronero, Santos, 2008. "Predicting traffic flow using Bayesian networks," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 482-509, June.
    11. Bielli, Maurizio & Reverberi, Pierfrancesco, 1996. "New operations research and artificial intelligence approaches to traffic engineering problems," European Journal of Operational Research, Elsevier, vol. 92(3), pages 550-572, August.
    12. Shao, Hu & Lam, William H.K. & Sumalee, Agachai & Chen, Anthony & Hazelton, Martin L., 2014. "Estimation of mean and covariance of peak hour origin–destination demands from day-to-day traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 52-75.
    13. Bierlaire, M. & Toint, Ph. L., 1995. "Meuse: An origin-destination matrix estimator that exploits structure," Transportation Research Part B: Methodological, Elsevier, vol. 29(1), pages 47-60, February.
    14. (Walker) Wang, Wei & Wang, David Z.W. & Sun, Huijun & Feng, Zengzhe & Wu, Jianjun, 2016. "Braess Paradox of traffic networks with mixed equilibrium behaviors," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 95-114.
    15. Hai Yang & Qiang Meng & Michael G. H. Bell, 2001. "Simultaneous Estimation of the Origin-Destination Matrices and Travel-Cost Coefficient for Congested Networks in a Stochastic User Equilibrium," Transportation Science, INFORMS, vol. 35(2), pages 107-123, May.
    16. G. E. Cantarella & D. P. Watling, 2016. "Modelling road traffic assignment as a day-to-day dynamic, deterministic process: a unified approach to discrete- and continuous-time models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 69-98, March.
    17. Sherali, Hanif D. & Narayanan, Arvind & Sivanandan, R., 2003. "Estimation of origin-destination trip-tables based on a partial set of traffic link volumes," Transportation Research Part B: Methodological, Elsevier, vol. 37(9), pages 815-836, November.
    18. Wang, Hua & Meng, Qiang & Zhang, Xiaoning, 2020. "Multiple equilibrium behaviors of auto travellers and a freight carrier under the cordon-based large-truck restriction regulation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    19. Aalami, Soheila & Kattan, Lina, 2022. "Proportionally fair flow markets for transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 24-41.
    20. D E Boyce, 1984. "Urban Transportation Network-Equilibrium and Design Models: Recent Achievements and Future Prospects," Environment and Planning A, , vol. 16(11), pages 1445-1474, November.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2506.22966. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.