phone +7 (3412) 91 60 92
mail imi@udsu.ru
ru-RU Russian
Home » Issues » Archive of Issues » 2013 - 3 issue » pp. 88-113

Archive of Issues

Russia Yekaterinburg
Year
2013
Issue
3
Pages
88-113
<<
>>
Section Mathematics
Title The iterations method in generalized courier problem with singularity in the definition of cost functions
Author(-s) Chentsov A.A.a, Chentsov A.G.a
Affiliations Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciencesa
Abstract The problem of sequential megalopolis circuit with constraints in the form of preceding conditions and (interior) works realized in the megalopolises is considered. The singularity is a dependence of costs of exterior permutations and interior works on the task list. The iteration method with elements of decompositions of the joint solution defined as a pair “route-trace” is constructed.
Keywords route, iteration method, preceding conditions
UDC 519.6
MSC 28A33
DOI 10.20537/vm130308
Received 10 April 2013
Language Russian
Citation Chentsov A.A., Chentsov A.G. The iterations method in generalized courier problem with singularity in the definition of cost functions, Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2013, issue 3, pp. 88-113.
References
  1. Melamed I.I., Sergeev S.I., Sigal I.Kh. Traveling salesman problem. Problems of theory, Avtomatika i Telemekhanika, 1989, no. 9, pp. 3-34.
  2. Melamed I.I., Sergeev S.I., Sigal I.Kh. Traveling salesman problem. Exact algorithms, Avtomatika i Telemekhanika, 1989, no. 10, pp. 3-29.
  3. Melamed I.I., Sergeev S.I., Sigal I.Kh. Traveling salesman problem. Approximate algorithms, Avtomatika i Telemekhanika, 1989, no. 11, pp. 3-26.
  4. Tashlykov O.L., Sesekin A.N., Shcheklein S.E., Chentsov A.G. The implementation of optimal algorithms of decommissioning of nuclear power station by means of methods of mathematical modeling, Izv. Vyssh. Uchebn. Zaved. Yadern. Energ., 2009, no. 2, pp. 115–120.
  5. Sesekin A.N., Tashlykov O.L., Shcheklein S.E., Kuklin M.Yu., Chentsov A.G., Kadnikov A.A. Using of dynamic programming method for the optimization of trajectory of workers movement in radiationally dangerous zones for the purpose of minimization of radioactive irradiation, Izv. Vyssh. Uchebn. Zaved. Yadern. Energ., 2006, no. 2, pp. 41-48.
  6. Bellman R. Application of dynamic programming method for the traveling salesman problem, Kibernet. Sb., Moscow: Mir, 1964, vol. 9, pp. 219-228.
  7. Kheld M., Karp R.M. Application of dynamic programming method for the sorting problems, Kibernet. Sb., Moscow: Mir, 1964, vol. 9, pp. 202-218.
  8. Little J., Murty K., Sweeney D., Karel C. An algorithm for the traveling salesman problem, Ekonom. Mat. Met., 1965, vol. 1, no. 1, pp. 90-107.
  9. Chentsov A.G. Ekstremal’nye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii (Extremal problems of routing and assignment of tasks: questions of theory), Moscow-Izhevsk: Institute of Computer Science, 2008, 238 p.
  10. Chentsov A.A., Chentsov A.G., Chentsov P.A. The method of iterations in the problem of routing with internal losses, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 2009, vol. 15, no. 4, pp. 268-287.
  11. Chentsov A.A., Chentsov A.G. To the question about solution of problem of sequential circuit of sets by means of “unclosed” traveling salesman problem, Avtomatika i Telemekhanika, 2002, no. 11, pp. 151-166.
  12. Chentsov A.A., Chentsov A.G. Reduction of route optimization problems, Avtomatika i Telemekhanika, 2000, no. 10, pp. 136-150.
  13. Chentsov A.A. The method of iterations in the problem of sequential circuite of sets (generalized bottleneck traveling salesman problem), Algoritmy i programmnye sredstva parallel'nykh vychislenii: sb. nauchn. tr. (Algorithms and software for parallel computations: Transactions), Ekaterinburg: Ural Branch of RAS, 2002, issue 6, pp. 209-230.
  14. Sesekin A.N., Chentsov A.A., Chentsov A.G. Generalized courier problem with cost function that depends on the job list, Izv. Ross. Akad. Nauk Teor. Sist. Upr., 2010, no. 2, pp. 68-77.
  15. Kuratovskii K., Mostovskii A. Teoriya mnozhestv (Theory of sets), Moscow: Mir, 1970, 416 p.
  16. Dieudonne J. Osnovy sovremennogo analiza (Foundations of modern analysis), Мoscow: Mir, 1964, 430 p.
  17. Kormen T., Leizerson Ch., Rivest R. Algoritmy. Postroenie i analiz (The algorithms. Construction and analysis), Moscow: Moscow Center for Continuous Mathematical Education, 1990, 960 p.
  18. Tashlykov O.L. Organizatsiya i tekhnologiya yadernoi energetiki (Organization and technology of nuclear energetics), Ekaterinburg: USTU-UPI, 2005, 149 p.
Full text
/doc/issues-2013/13-03-08.pdf
<< Previous article
Next article >>