Skip to main content
SpringerLink
Log in

An extremal constrained routing problem with internal losses

  • Published:
Russian Mathematics Aims and scope Submit manuscript

Abstract

We consider the following problem: one has to visit a finite number of sets and perform certain work on each of them. The work is accompanied by certain (internal) losses. Themovements from some set to another one are constrained and accompanied by external (aggregated additively) losses. We propose a “through” variant of the dynamic programming method, formulate an equivalent reconstruction problem, and develop an optimal algorithm based on an efficient dynamic programming algorithm.

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. I. I. Melamed, S. I. Sergeev, and I. Kh. Sigal, “The Traveling Salesman Problem. Theoretical Questions,” Avtomatika i Telemekhanika, No. 9, 3–34 (1989).

  2. R. Bellman, “Dynamic Programming Treatment of the Traveling Salesman Problem,” J. ACM 9, 61–63 (1962) (Kibern. Sborn. 9, 219–228 (1964)).

    Article  MATH  Google Scholar 

  3. M. Held and R. M. Karp, “A Dynamic Programming Approach to Sequencing Problems,” J. Soc. Indust. Appl.Math. 10, 196–210 (1962) (Kibern. Sborn. 9, 202–218 (1964)).

    Article  MATH  MathSciNet  Google Scholar 

  4. A. L. Henry-Labordere, “The Record-Balancing Problem: a Dynamic Programming Solution of a Generalized Traveling Salesman Problem,” Rev. Franç. Inform. Rech. Opér. 3(B-2), 43–49 (1969)).

    Google Scholar 

  5. G. Laporte and Y. Nobert, “Generalized Traveling Salesman Problem Through n-Sets of Nodes: An Integer Programming Approach,” INFOR 21(1), 61–75 (1983).

    MATH  Google Scholar 

  6. A. K. Leiten, “Some Modifications of the Traveling Salesman Problem,” Trudy VTs Tart. Univ., No. 28, 44–58 (1973).

  7. L. N. Korotaeva, A. N. Sesekin, and A. G. Chentsov, “On One Modification of the Method of Dynamic Programming in the Sequential Motion Problem,” Zhurn. Vychisl. Matem. iMatem. Fiz. 29(8), 1107–1113 (1989).

    MathSciNet  Google Scholar 

  8. L. N. Korotaeva, E. M. Nazarov, and A. G. Chentsov, “An Assignment Problem,” Zhurn. Vychisl. Matem. i Matem. Fiz. 33(4), 483–494 (1993).

    MATH  MathSciNet  Google Scholar 

  9. A. A. Chentsov and A. G. Chentsov, “On Solution of the Problem of Route Optimization by the Dynamic Programming Method,” Avtomatika i Telemekhanika, No. 9, 117–129 (1998).

  10. A. A. Chentsov and A. G. Chentsov, “On Solution of the Problem on Successive Round of Sets by the ‘Nonclosed’ Traveling Salesman Problem,” Avtomatika i Telemekhanika, No. 11, 151–166 (2002).

  11. A. A. Chentsov and A.G. Chentsov, “Dynamic Programming Method in the Generalized Traveling Salesman Problem: The Influence of Inexact Calculations,” Math. Comput. Modelling 33(8–9), 801–819 (2001).

    Article  MATH  MathSciNet  Google Scholar 

  12. Yu.M. Plotinskii, “The General Delivery Problem,” Avtomatika i Telemekhanika, No. 6, 100–104 (1973).

  13. I. I. Melamed and Yu. M. Plotinskii, “A Heuristic Algorithm for Solving the General Delivery Problem,” Avtomatika i Telemekhanika, No. 12, 167–172 (1979).

  14. A. G. Chentsov and P. A. Chentsov, “The Routing Problem with Precedence Conditions (the Courier Problem): The Dynamic Programming Method,” Vestn. UGTU-UPI, No. 15, 148–151 (2004).

  15. A. A. Chentsov, A. G. Chentsov, and P. A. Chentsov, “A Generalized Version of the Courier Problem,” Algoritmy i Programmnye Sredstva Parallel’nykh Vychislenii, UrO RAN, Ekaterinburg, No. 8, 178–235 (2004).

  16. A. A. Chentsov, A. G. Chentsov, and P. A. Chentsov, “A Generalized Version of the Courier Problem,” Matematicheskii i Prikladnoi Analiz, Tyumen, Tyumensk. Gos. Univ., No. 2, 238–280 (2005).

  17. A. G. Chentsov, “On the Structure of an Extremal Problem of Route Optimization with Constraints in Form of Precedence Conditions,” Vestn. Udmurtsk. Univ. Matematika, No. 1, 127–150 (2006).

  18. A. G. Chentsov, “Extremal Routing Problems with Constraints,” Izv. Inst.Matem. i Informatiki, No. 3, 163–166 (2006).

  19. A. G. Chentsov, Extremal Problems of Route Optimization and Tasks Assignment: Theoretical Questions (RKhD, Moscow-Izhevsk, 2008) [in Russian].

    Google Scholar 

  20. S. I. Sergeev, “Hybrid Control Systems and the Dynamic Traveling Salesman Problem,” Avtomatika i Telemekhanika, No. 1, 45–54 (2008).

  21. J. Little, K. Murty, D. Sweeney, and C. Karel, “An Algorithm for the Traveling Salesman Problem,” Oper. Res. 11(6), 972–989 (1963) (Ekonomika iMatem.Metody 1 (1), 90–107 (1965)).

    Article  MATH  Google Scholar 

  22. I. Kh. Sigal and A. P. Ivanova, Introduction to Applied Discrete Programming: Models and Computational Algorithms (Fizmatlit, Moscow, 2007) [in Russian].

    Google Scholar 

  23. A. A. Chentsov and A. G. Chentsov, “Realization of the Dynamic Programming Method in a Generalized Courier Problem,” Trudy Inst.Matem. iMekhaniki 13(3), 136–160 (2007).

    Google Scholar 

  24. A. N. Sesekin, O. L. Tashlykov, S. E. Shcheklein, M. Yu. Kuklin, A. G. Chentsov, and A.A. Kadnikov, “Using of Dynamic Programming Method for Optimization Trajectory Workers’ Movement at Emission of Rays Threat Zone with the Purpose of Minimization Radiation Processing,” Izv. Vyssh. Uchebn. Zaved. Yadernaya Energetika, No. 2, 41–48 (2006).

  25. K. Kuratowski and A. Mostowski, Set Theory (North-Holland Publ. Comp. 1967; Mir, Moscow, 1970).

    MATH  Google Scholar 

  26. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms (MIT Press and McGraw-Hill, 1990; MTsMNO, Moscow, 2002).

    Google Scholar 

  27. R. Bellman, Dynamic Programming (Dover Publications Inc., 2003; Inostr. Lit., Moscow, 1974).

  28. A. N. Sesekin, A. A. Chentsov, and A. G. Chentsov, A Problem on Sequential Passing Round Sets (Ekaterinburg, UGTU-UPI, 2007) [in Russian].

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Mechanics, Russian Academy of Sciences, Ural Branch, ul. S. Kovalevskoi 16, Ekaterinburg, 620219, Russia

    A. A. Chentsov, A. G. Chentsov & P. A. Chentsov

Authors
  1. A. A. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. G. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. A. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. G. Chentsov.

Additional information

Original Russian Text © A.A. Chentsov, A.G. Chentsov, and P.A. Chentsov, 2010, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2010, No. 6, pp. 64–81.

About this article

Cite this article

Chentsov, A.A., Chentsov, A.G. & Chentsov, P.A. An extremal constrained routing problem with internal losses. Russ Math. 54, 54–68 (2010). https://doi.org/10.3103/S1066369X10060071

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X10060071

Key words and phrases

Search

Navigation