Skip to main content

Cooperation in Vehicle Routing Game on a Megapolis Network

  • Conference paper
  • First Online:
Stability and Control Processes (SCP 2020)

Abstract

In this work, cooperative multiple depot open vehicle routing problem (MDOVRP) is considered. The underlying model is a time-dependent variant of classic VRP which presents congested traffic in a megapolis more correctly compare to its nontemporal flavor. With the aim to reduce operational expenses on transportation costs or rent for the vehicles, carrier companies can share the customers with each other by forming coalitions. We introduce Direct Coalition Induction Algorithm (DCIA) for constructing the characteristic function of TD-MDOPVR game that satisfies subadditive property. Shapley values calculated for the problem instance of 150 customers and 3 companies are compared with costs before cooperation. All numerical runs are performed on a graph of real road network of Saint-Petersburg which includes 255 nodes and 1251 arcs. Time-dependent travel times are obtained by solving traffic assignment problem in case of Wardrop’s user equilibrium.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6, 80–91 (1959)

    Article  MathSciNet  Google Scholar 

  2. Donati, A.V., Montemanni, R., Casagrande, N., Rizzoli, A.E., Gambardella, L.M.: Time dependent vehicle routing problem with a multi ant colony system. Eur. J. Oper. Res. 185(3), 1174–1191 (2008)

    Article  MathSciNet  Google Scholar 

  3. Eglese, R., Maden, W., Slater, A.: A road timetableTM to aid vehicle routing and scheduling. Comput. Oper. Res. 33(12), 3508–3519 (2006)

    Article  Google Scholar 

  4. Fleischmann, B., Gietz, M., Gnutzmann, S.: Time-varying travel times in vehicle routing. Transp. Sci. 38(2), 160–173 (2004)

    Google Scholar 

  5. Gendreau, M., Ghiani, G., Guerriero, E.: Time-dependent routing problems: a review. Comput. Oper. Res. 64, 189–197 (2015)

    Article  MathSciNet  Google Scholar 

  6. Liu, R., Jiang, Z., Geng, N.: A hybrid genetic algorithm for the multi-depot open vehicle routing problem. OR Spectr. 36, 401–421 (2014). https://doi.org/10.1007/s00291-012-0289-0

    Article  MathSciNet  MATH  Google Scholar 

  7. Krylatov, A.Y., Zakharov, V.V., Malygin, I.G.: Competitive traffic assignment in road networks. Transp. Telecommun. 17(3), 212–221 (2016)

    Google Scholar 

  8. Krylatov, A.Y., Zakharov, V.V.: Competitive traffic assignment in a green transit network. Int. Game Theory Rev. 18(2), 1–14 (2016)

    Article  MathSciNet  Google Scholar 

  9. Malandraki, C., Daskin, M.S.: Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp. Sci. 26, 185–200 (1992)

    Article  Google Scholar 

  10. Mugayskikh, A.V., Tuovinen, T., Zakharov, V.V.: Time-dependent multiple depot vehicle routing problem on megapolis network under wardrop’s traffic flow assignment. In: Proceedings of the 22nd Conference of Open Innovations Association FRUCT pp. 173–178 (2018)

    Google Scholar 

  11. Surekha, P., Sumathi, S.: Solution to multi-depot vehicle routing problem using genetic algorithms. World Appl. Program. 1(3), 118–131 (2011)

    Google Scholar 

  12. Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Inst. Civ. Eng. 2, 325–378 (1952)

    Google Scholar 

  13. Guajardo, M., Ronnqvist, M.: A review on cost allocation methods in collaborative transportation. Int. Trans. Oper. Res. 23(3), 371–392 (2016)

    Article  MathSciNet  Google Scholar 

  14. Verdonck, L., et al.: Collaborative logistics from the perspective of road transportation companies. Transp. Rev. 33(6), 700–719 (2013)

    Article  Google Scholar 

  15. Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge, MA, USA (1994)

    MATH  Google Scholar 

  16. Zakharov, V., Dementieva, M.: Multistage cooperative games and problem of time-consistency. Int. Game Theory Rev. 6(1), 1–14 (2004)

    Article  MathSciNet  Google Scholar 

  17. Zakharov, V.V., Shchegryaev, A.N.: Stable cooperation in dynamic vehicle routing problems. Autom. Remote Control 76(5), 935–943 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The work was jointly supported by a grant from the Russian Science Foundation (No. 19-71-10012 Multi-agent systems development for automatic remote control of traffic flows in congested urban road networks).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander V. Mugayskikh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mugayskikh, A.V. (2022). Cooperation in Vehicle Routing Game on a Megapolis Network. In: Smirnov, N., Golovkina, A. (eds) Stability and Control Processes. SCP 2020. Lecture Notes in Control and Information Sciences - Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-87966-2_41

Download citation

Publish with us

Policies and ethics