phone +7 (3412) 91 60 92
mail imi@udsu.ru
ru-RU Russian
Home » Issues » Archive of Issues » 2018 - 4 issue » pp. 513-530

Archive of Issues

Russia Yekaterinburg
Year
2018
Volume
28
Issue
4
Pages
513-530
<<
>>
Section Mathematics
Title Optimizing multi-inserts in routing problems with constraints
Author(-s) Chentsov A.G.ab, Grigoryev A.M.a
Affiliations Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciencesa, Ural Federal Universityb
Abstract We consider a problem of sequential traversal of megalopolises (nonempty finite sets) with travel cost functions depending on the set of pending tasks and precedence constraints. Its formulation is aimed at engineering problems in fission power generation connected with minimizing the exposure of staff to radiation and in machine engineering (routing of a CNC sheet cutting machine's tool). This discrete optimization problem is assumed to be sufficiently large-scale to necessitate the use of heuristics. We consider a procedure of local improvement for heuristics through a successive application of optimizing multi-inserts-finite disjoint sets of inserts. Each insert is assumed to be optimized by means of a broadly understood dynamic programming procedure. We show that in an “additive” routing problem of this kind (with precedence constraints and complex travel cost functions) the result's improvements are also aggregated additively. The proposed construction admits a parallel implementation for multiprocessor systems; in this case, the inserts are distributed to computational nodes and formed in an independent way.
Keywords dynamic programming, multi-inserts, parallel algorithm
UDC 519.6
MSC 49L20, 90C39
DOI 10.20537/vm180406
Received 17 September 2018
Language Russian
Citation Chentsov A.G., Grigoryev A.M. Optimizing multi-inserts in routing problems with constraints, Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2018, vol. 28, issue 4, pp. 513-530.
References
  1. Chentsov A.A., Chentsov A.G. The problem of megalopolises сonsistent detouring, Vestn. Tambov. Univ. Ser. Estestv. Tekh. Nauki, 2014, vol. 19, issue 2, pp. 454-475 (in Russian).
  2. Petunin A.A., Chentsov A.G., Chentsov P.A. Local dynamiс programming inсuts in routing problems with restriсtions, Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2014, issue 2, pp. 56-75 (in Russian). DOI: 10.20537/vm140204
  3. Chentsov A.G. The Bellmann insertions in the route problem with constraints and complicated cost functions, Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2014, issue 4, pp. 122-141 (in Russian). DOI: 10.20537/vm140410
  4. Chentsov A.G. The Bellmann insertions in route problems with constraints and complicated cost functions. II, Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2016, vol. 26, issue 4, pp. 565-578 (in Russian). DOI: 10.20537/vm160410
  5. Melamed I.I., Sergeev S.I., Sigal I.Kh. The traveling salesman problem. I: Theoretical issues, Automation and Remote Control, 1989, vol. 50, no. 9, pp. 1147-1173.
  6. Melamed I.I., Sergeev S.I., Sigal I.Kh. The traveling salesman's problem. II: Exact methods, Automation and Remote Control, 1989, vol. 50, no. 10, pp. 1303-1324.
  7. Melamed I.I., Sergeev S.I., Sigal I.Kh. The traveling salesman problem. Approximate algorithms, Automation and Remote Control, 1989, vol. 50, no. 11, pp. 1459-1479.
  8. Gutin G., Punnen A.P. The traveling salesman problem and its variations, New York: Springer US, 2007. DOI: 10.1007/b101971
  9. Cook W.J. In pursuit of the traveling salesman: Mathematics at the limits of computation, New Jersey: Princeton University Press, 2012.
  10. Bellman R. Dynamic programming treatment of the travelling salesman problem, Journal of the ACM, 1962, vol. 9, issue 1, pp. 61-63. DOI: 10.1145/321105.321111
  11. Held M., Karp R.M. A dynamic programming approach to sequencing problems, Journal of the Society for Industrial and Applied Mathematics, 1962, vol. 10, no. 1, pp. 196-210. DOI: 10.1137/0110015
  12. Little J.D.C., Murty K.G., Sweeney D.W., Karel C. An algorithm for the traveling salesman problem, Operations Research, 1963, vol. 11, issue 6, pp. 972-989. DOI: 10.1287/opre.11.6.972
  13. Korobkin V.V., Sesekin A.N., Tashlykov O.L., Chentsov A.G. Metody marshrutizatsii i ikh prilozheniya v zadachakh povysheniya bezopasnosti i effektivnosti ekspluatatsii atomnykh stantsii (Routing methods and their applications in problems of improving the safety and efficiency of operation of nuclear power plants), Moscow: Novye Tekhnologii, 2012.
  14. Petunin A.A. About some strategies of the programming of tool route by developing of control programs for thermal cutting machines, Vestnik Ufimskogo Gosudarstvennogo Aviatsionnogo Tekhnicheskogo Universiteta. Seriya: Upravlenie, Vychislitel'naya Tekhnika i Informatika, 2009, vol. 13, no. 2 (35), pp. 280-286 (in Russian).
  15. Frolovskii V.D. Computer-aided design of the control programs for thermal metal cutting on NPC machines, Informatsionnye Tekhnologii v Proektirovanii i Proizvodstve, 2005, no. 4, pp. 63-66 (in Russian).
  16. Ganelina N.D., Frolovskii V.D. On constructing the shortest circuits on a set of line segments, Sib. Zh. Vychisl. Mat., 2006, vol. 9, no. 3, pp. 241-252 (in Russian). http://mi.mathnet.ru/eng/sjvm116
  17. Petunin A.A., Chentsov A.G., Chentsov P.A. On routing tool motion on the sheet cutting NPC machines, St. Petersburg State Polytechnical University Journal. Computer Science. Telecommunication and Control Systems, 2013, issue 2 (169), pp. 103-111 (in Russian).
  18. Verkhoturov M.A.. Tarasenko P.Yu. The software for the problem of the cutting instrument route optimization based on chain cutting when a flat figure is cut, Vestnik Ufimskogo Gosudarstvennogo Aviatsionnogo Tekhnicheskogo Universiteta. Seriya: Upravlenie, Vychislitel'naya Tekhnika i Informatika, 2008, vol. 10, no. 2 (27), pp. 123-130 (in Russian).
  19. Wang G.G., Xie S.Q. Optimal process planning for a combined punch-and-laser cutting machine using ant colony optimization, International Journal of Production Research, 2005, vol. 43, issue 11, pp. 2195-2216. DOI: 10.1080/00207540500070376
  20. Lee M.K.. Kwon K.B. Cutting path optimization in CNC cutting processes using a two-step genetic algorithm, International Journal of Production Research, 2006, vol. 44, issue 24, pp. 5307-5326. DOI: 10.1080/00207540600579615
  21. Ye J., Chen Z.G. An optimized algorithm of numerical cutting path control in garment manufacturing, Advanced Materials Research, 2013, vol. 796, pp. 454-457. DOI: 10.4028/www.scientific.net/AMR.796.454
  22. Chentsov A.G. On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs, Automation and Remote Control, 2012, vol. 73, issue 3, pp. 532-546. DOI: 10.1134/S0005117912030113
  23. Chentsov A.G. A parallel procedure of constructing Bellman function in the generalized courier problem with interior works, Vestnik Yuzhno-Ural'skogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie, 2012, issue 12, pp. 53-76 (in Russian).
  24. Chentsov A.G., Kosheleva M.S. Dynamic programming in the precedence constrained TSP with the costs depending on a list of tasks, Mekhatronika, Avtomatizatsiya, Upravlenie, 2015, vol. 16, no. 4, pp. 232-244 (in Russian). DOI: 10.17587/mau.16.232-244
  25. Chentsov A.G., Grigoryev A.M. Dynamic programming method in a routing problem: a scheme of independent computations, Mekhatronika, Avtomatizatsiya, Upravlenie, 2016, vol. 17, no. 12, pp. 834-846 (in Russian). DOI: 10.17587/mau.17.834-846
  26. Kuratovskii K., Mostovskii A. Teoriya mnozhestv (Theory of sets), Moscow: Mir, 1970, 416 p.
  27. Dieudonne J. Osnovy sovremennogo analiza (Foundations of modern analysis), Moscow: Mir, 1964, 430 p.
  28. Cormen T., Leiserson Ch., Rivest R. Introduction to algorithms (1st ed.), MIT Press and McGraw-Hill, 1990. Translated under the title Algoritmy. Postroenie i analiz (The algorithms. Construction and analysis), Moscow: Moscow Center for Continuous Mathematical Education, 1999, 960 p.
  29. 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: Regular and Chaotic Dynamics, Institute of Computer Science, 2008, 240 p.
  30. Chentsov A.G. Problem of successive megalopolis traversal with the precedence conditions, Automation and Remote Control, 2014, vol. 75, issue 4, pp. 728-744. DOI: 10.1134/S0005117914040122
  31. Chentsov A.G., Chentsov A.A. Route problem with constraints depending on a list of tasks, Doklady Mathematics, 2015, vol. 92, issue 3, pp. 685-688. DOI: 10.1134/S1064562415060083
  32. Chentsov A.A., Chentsov A.G., Chentsov P.A. Extremal routing problem with internal losses, Proceedings of the Steklov Institute of Mathematics, 2009, vol. 264, suppl. 1, pp. 87-106. DOI: 10.1134/S0081543809050071
  33. Chentsov A.G., Chentsov A.A. A model variant of the problem about radiation sources utilization (iterations based on optimization insertions), Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, 2017, vol. 50, pp. 83-109 (in Russian). DOI: 10.20537/2226-3594-2017-50-08
Full text
/doc/issues-2018/18-04-06.pdf
<< Previous article
Next article >>