Skip to main content
SpringerLink
Log in

Stable cooperation in dynamic vehicle routing problems

  • Mathematical Game Theory and Applications
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

This paper explores transportation cost minimization in the vehicle routing problem under carriers’ cooperation on large-scale transport networks. The underlying model is a dynamic cooperative game with transferable utility (TU) functions. We propose a heuristic iterative algorithm for constructing the subadditive characteristic function of the corresponding static game. The algorithm is modified in order to construct the characteristic function of the dynamic routing game. The Shapley value and the subcore concept serve to form the optimal solutions. And finally, we describe a cost distribution procedure in the dynamic game, which guarantees the strong time consistency of the subcore and the dynamic stability of the cooperation agreement.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Petrosjan, L.A. and Zenkevich, N.A., Principles of Stable Cooperation, Mat. Teor. Igr Pril., 2009, vol. 1, no. 1, pp. 106–123.

    Google Scholar 

  2. Baldacci, R., Mingozzi, A., and Roberti, R., Recent Exact Algorithms for Solving the Vehicle Routing Problem under Capacity and Time Window Constraints, Eur. J. Operat. Res., 2012, vol. 218, pp. 1–6.

    Article  MATH  MathSciNet  Google Scholar 

  3. Ergun, Ö., Kuyzu, G., and Savelsbergh, M.W.P., Shipper Collaboration, Comput. Operat. Res., 2007, vol. 34, pp. 1551–1560.

    Article  MATH  Google Scholar 

  4. Kallehauge, B., Formulations and Exact Algorithms for the Vehicle Routing Problem with Time Windows, Comput. Operat. Res., 2008, vol. 35, pp. 2307–2330.

    Article  MATH  MathSciNet  Google Scholar 

  5. Krajewska, M.A., Kopfer, H., Laporte, G., Ropke, S., and Zaccour, G., Horizontal Cooperation among Freight Carriers: Request Allocation and Profit Sharing, J. Operat. Res. Soc., 2008, vol. 59, pp. 1483–1491.

    Article  MATH  Google Scholar 

  6. Ropke, S. and Pisinger, D., An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows, Transport. Sci., 2006, vol. 40, pp. 455–472.

    Article  Google Scholar 

  7. Zakharov, V. and Dementieva, M., Multistage Cooperative Games and Problem of Time-Consistency, Int. Game Theory Rev., 2004, vol. 6, no. 1, pp. 1–14.

    Article  MathSciNet  Google Scholar 

  8. Zakharov, V. and Kwon, O-Hun, Selectors of the Core and Consistency Properties, Game Theory Appl., 1999, vol. 4, pp. 237–250.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Saint Petersburg State University, St. Petersburg, Russia

    V. V. Zakharov & A. N. Shchegryaev

Authors
  1. V. V. Zakharov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. N. Shchegryaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. V. Zakharov.

Additional information

Original Russian Text © V.V. Zakharov, A.N. Shchegryaev, 2012, published in Matematicheskaya Teoriya Igr i Priloszheniya, 2012, No. 2, pp. 39–56.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zakharov, V.V., Shchegryaev, A.N. Stable cooperation in dynamic vehicle routing problems. Autom Remote Control 76, 935–943 (2015). https://doi.org/10.1134/S0005117915050173

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117915050173

Keywords

Search

Navigation