Skip to main content
SpringerLink
Log in

Dynamic programming method in extremal constrained routing problems

  • Optimal Control
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

The problem of routing movements in a finite system of sets is considered. The problem is constrained by precedence conditions and by necessity of executing several (internal) jobs on the sets. The cost of execution of these jobs is summed up with the cost of performing (external) movements from set to set. The contents of the paper correspond to the presentation made by the author at the Conference on Control of Dynamical Systems (IPM RAS, Moscow, 2009)

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. M. R. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir, Moscow, 1978).

    Google Scholar 

  2. I. I. Melamed, S. I. Sergeev, and I. Kh. Sigal, “Travelling Salesman Problem”, Avtom. Telemekh., No. 9 (1989).

  3. R. Bellman, “Application of Dynamic Programming to the Travelling Salesman Problem”, in Kiberneticheskii Sbornik, Vol. 9 (Mir, Moscow, 1964), Vol. 9 [in Russian].

  4. M. Held and R. M. Karp, “Application of Dynamic Programming to Ordering Problems”, in Kiberneticheskii Sbornik, Vol. 9 (Mir, Moscow, 1964) [in Russian].

    Google Scholar 

  5. L. N. Korotaeva, A. N. Sesekin, and A. G. Chentsov, “On a Modification of Dynamic Programming Method in Problems of Successive Approach”, Zh. Vychisl. Mat. Mat. Fiz. 29(8), (1989).

  6. L. N. Korotaeva, E. M. Nazarov, and A. G. Chentsov, “On an Assignment Problem”, in Zh. Vychisl. Mat. Mat. Fiz. 33(4) (1993).

  7. L. N. Korotaeva and A. G. Chentsov, “On a Generalization of Travelling Salesman Problem to ” Bottlenecks”,” Zh. Vychisl. Mat. Mat. Fiz. 35(7) (1995).

  8. A. A. Chentsov and A. G. Chentsov, “Solving the Routing Optimization Problem Using the Dynamic Programming Method”, Izv. Ross. Akad. Nauk, Teor. Sist. Upr., No. 3, (1999) [Comp. Syst. Sci. 38 (3), 409–420 (1999)].

  9. A. A. Chentsov and A. G. Chentsov, “Reduction of Route Optimization Problems,” Avtom. Telemekh. 61b(10), (2000) [Automat. Remote Control 61b (10), 1708–1722(2000)].

  10. A. A. Chentsov and A. G. Chentsov, “On Solution of the Problem of Successive Round of Sets by the “Non-closed” Travelling Salesman Problem”, Avtom. Telemekh. 69(11), (2002) [Automat. Remote Control 63 (11), 1832–1845(2002)].

    Google Scholar 

  11. A. G. Chentsov, Extremal Problems of Routing and Tasks Allocation: Theoretical Problems (Izhevsk-Moscow, 2008) [in Russian].

  12. J. Little, K. Murty, D. Sweeny, et al., “An Algorithm for the Travelling Salesman Problem” Econ.-Mat. Metody 1(1), (1965).

  13. I. Kh. Sigal and A. P. Ivanova, Introduction to Applied Discrete Programming (Fizmatlit, Moscow, 2007) [in Russian].

    Google Scholar 

  14. S. I. Sergeev, “Hybrid Control Systems and the Dynamic Traveling Salesman Problem”, Avtom. Telemekh. 69(1), (2008) [Automat. Remote Control 69 (1), 42–51 (2008)].

  15. A. N. Sesekin, O. L. Tashlykov, S. E. Shcheklein, et al., “Application of the Dynamic Programming Method for Optimization of Trajectories of Movement of Workers in Radiation-Dangerous Zones to Minimize radiation”, Izv. Vuzov. Yadernaya Energetika, No. 2 (2006).

  16. A. N. Sesekin, A. A. Chentsov, and A. G. Chentsov, “A Generalized Courier Problem with the Cost Function Depending on the List of Tasks”, Izv. Ross. Akad. Nauk, Teor. Sist. Upr., No. 2, (2010) [Comp. Syst. Sci. 49 (2), (2010)].

  17. A. N. Sesekin, O. L. Tashlykov, A. G. Chentsov, et al., “Development of Optimal Algorithms of Withdrawal of NPS with the Use of Mathematical Simulation Methods” Izv. Vuzov. Yadernaya Energetika, No. 2 (2009).

  18. K. Kuratovsky and A. Mostovsky, The Theory of Sets (Mir, Moscow, 1970) [in Russian].

    Google Scholar 

  19. T. Cormen, C. Leiserson, and R. Rivest, Algorithms: Design and Analysis (MTsNMO, Moscow, 2002) [in Russian].

    Google Scholar 

  20. A. A. Chentsov and A. G. Chentsov, “Dynamic Programming Method in the Generalized Courier Problem”, Izv. Ross. Akad. Nauk, Teor. Sist. Upr., No. 3, (2008) [Comp. Syst. Sci. 47 (3), 455–463 (2008)].

  21. A. G. Chentsov, “On Optimal Routing under Condition of Constraints”, Dokl. Akad. Nauk 423(3) (2008).

  22. A. A. Chentsov, A. G. Chentsov, and P. A. Chentsov, “Extremal Routing Problems with Internal Losses”, Tr. Instituta Matematiki i Mekhaniki 14(3) (2008).

  23. N. N. Krasovskii, Game-Theoretic Problems of Motions Rendezvous (Nauka, Moscow, 1970) [in Russian].

    Google Scholar 

  24. N. N. Krasovskii and A. I. Subbotin, Positional Differential Games (Nauka, Moscow, 1974) [in Russian].

    MATH  Google Scholar 

  25. A. A. Chentsov and A. G. Chentsov, “On Implementation of the Dynamic Programming Method in the Generalized Courier Problem”, Tr. Instituta Matematiki i Mekhaniki 13(3) (2007).

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Mechanics, Ural Division, Russian Academy of Sciences, ul. S. Kovalevskoi 16, Yekaterinburg, 620990, Russia

    A. G. Chentsov

Authors
  1. A. G. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © A.G. Chentsov, 2010, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2010, No. 3, pp. 52–66.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chentsov, A.G. Dynamic programming method in extremal constrained routing problems. J. Comput. Syst. Sci. Int. 49, 392–405 (2010). https://doi.org/10.1134/S1064230710030081

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation