Skip to main content
SpringerLink
Log in

Dynamic programming in the routing problem with complex dependence of costs on the list of jobs

  • Systems Analysis and Operations Research
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

The problem of visiting megalopolises complicated by precedence constraints and by the dependence of the cost functions (external moves and internal jobs) on the list of subsequent jobs is considered. A modification of the dynamic programming method is proposed and an algorithm based on this modification is developed; this algorithm is implemented on a personal computer.

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, “Traveling salesman problem: Theoretical issues,” Avtom. Telemekh., No. 9, 3–34 (1989).

    Google Scholar 

  2. I. I. Melamed, S. I. Sergeev, and I. Kh. Sigal, “Traveling salesman problem: Exact algorithms,” Avtom. Telemekh., No. 10, 3–29 (1989).

    Google Scholar 

  3. I. I. Melamed, S. I. Sergeev, and I. Kh. Sigal, “Traveling salesman problem: Approximate algorithms,” Avtom. Telemekh., No. 11, 3–26 (1989).

    Google Scholar 

  4. A. N. Sesekin, A. A. Chentsov, and A. G. Chentsov, Routing Problems: Textbook (Lan’, St. Petersburg, 2011) [in Russian].

    Google Scholar 

  5. A. N. Sesekin, A. A. Chentsov, and A. G. Chentsov, “A generalized courier problem with the cost function depending on the list of tasks,” J. Comput. Syst. Sci. Int. 49, 234–243 (2010).

    Article  MathSciNet  Google Scholar 

  6. A. A. Chentsov, A. G. Chentsov, and P. A. Chentsov, “Optimal routing problem with internal losses,” Trudy Inst. Matematiki i Mekhaniki Ural’skogo Otd. Ross. Akad. Nauk 14(3), 183–201 (2008).

    Google Scholar 

  7. A. A. Chentsov, A. G. Chentsov, and P. A. Chentsov, “Constrained optimal routing problem,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 6, 64–81 (2010).

    Google Scholar 

  8. A. A. Chentsov, A. G. Chentsov, and P. A. Chentsov, “Precedence constraints in an optimal routing problem with internal jobs,” Algoritmy i Programmnye Sredstva Parallel’nykh Vychislenii, No. 10, 60–76 (2010).

    Google Scholar 

  9. A. G. Chentsov, “Constrained optimal routing,” Dokl. Math. 78, 859–863 (2008).

    Article  MATH  MathSciNet  Google Scholar 

  10. A. G. Chentsov, “Dynamic Programming Method in Extremal Constrained Routing Problems,” J. Comput. Syst. Sci. Int. 49, 392–405 (2010).

    Article  MATH  MathSciNet  Google Scholar 

  11. A. N. Sesekin, O. L. Tashlykov, S. E. Shcheklein, et al., “The use of dynamic programming method for the optimization of trajectories of personnel in radiation dangerous zones so as to minimize radiation dose,” Izv. Vyssh. Uchebn. Zaved., Yadernaya Energetika, No. 2, 41–48 (2006).

    Google Scholar 

  12. F. A. Balushkin, A. N. Sesekin, O. L. Tashlykov, et al., “The use of dynamic programming method for the optimization of dismantling equipment of generating units of nuclear power plants so as to minimize radiation dose,” Izv. Vyssh. Uchebn. Zaved., Yadernaya Energetika, No. 4, 3–10 (2009).

    Google Scholar 

  13. O. L. Tashlykov, A. N. Sesekin, S. E. Shcheklein, et al., “Development of optimal algorithms for taking nuclear power plants out of service using mathematical modeling,” Izv. Vyssh. Uchebn. Zaved., Yadernaya Energetika, No. 2, 115–120 (2009).

    Google Scholar 

  14. O. L. Tashlykov, Maintenance of Nuclear Power Plant: Textbook, Ed. by S. E. Shcheklein (UMTs UPI, Yekaterinburg, 2003) [in Russian].

  15. R. Bellman, “Dynamic programming treatment of the travelling salesman problem,” J. ACM 9, 61–63 (1962).

    Article  MATH  Google Scholar 

  16. M. Held and R. M. Karp, “A dynamic programming approach to sequencing problems,” in Proc. of the 1961 16th ACM National Meeting (ACM, New York, 1961), pp. 71.201–71.204.

    Google Scholar 

  17. A. G. Chentsov, Optimization Problems of Routing and Job Distribution: Theoretical Issues (RKhD, Moscow, 2008) [in Russian].

    Google Scholar 

  18. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, Mass., 1990; MTs NMO, Moscow, 1999).

    MATH  Google Scholar 

  19. K. Kuratowski and A. Mostowski, Set Theory (North-Holland, Amsterdam, 1967; Mir, Moscow, 1970).

    Google Scholar 

  20. J. Dieudonné, Foundations of Modern Analysis (Academic, New York, 1960; Mir, Moscow, 1964).

    MATH  Google Scholar 

  21. J. Warga, Optimal Control of Differential and Functional Equations (Academic, New York, 1972; Nauka, Moscow, 1977).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    A. A. Chentsov & A. G. Chentsov

  2. Ural State Federal University, Yekaterinburg, Russia

    A. A. Chentsov & A. G. 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

Corresponding author

Correspondence to A. A. Chentsov.

Additional information

Original Russian Text © A.A. Chentsov, A.G. Chentsov, 2014, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2014, No. 2, pp. 26–40.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chentsov, A.A., Chentsov, A.G. Dynamic programming in the routing problem with complex dependence of costs on the list of jobs. J. Comput. Syst. Sci. Int. 53, 172–185 (2014). https://doi.org/10.1134/S1064230714020051

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation