Skip to main content
SpringerLink
Log in

Routing under constraints: Problem of visit to megalopolises

  • Topical Issue
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Consideration was given to the problems of routing transfers under conditions of precedence and dynamic constraints including the dependence of the list of jobs both already completed by the instant of transfer or, on the contrary, not yet completed. The transfer costs also can be dependent on the list of jobs. The megalopolises (nonempty finite sets) are the objects of visits, which corresponds to the possible multiple-choice of transfers. The widely understood dynamic programming in a realization not requiring (under the precedence conditions) construction of the entire array of the Bellman function values is used as the basic method of study. The procedure of constructing a “complete” solution including determination of the optimal solution route and track (trajectory) and the procedure determining the problem value (global extremum) can be used separately to test the heuristic algorithms. An efficient heuristic algorithm was constructed to solve the routing problems of great dimension complicated by the constraints typical of the sheet cutting on the machines with computerized numerical control. For moderate problems, the results obtained were compared with the optimal result provided by the dynamic programming.

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. Petunin, A.A., On some Strategies of Forming Tool Routes at Developing the Control Programs for the Thermal Machine Cutting, Vestn. UGATU, Ser. Upravl., Vychisl. Tekhn., Informat., 2009, vol. 13, no. 2 (35), pp. 280–286.

    Google Scholar 

  2. Frolovskii, V.D., Computer-aided Design of the Control Programs for Thermal Metal Cutting on NPC Machines, Inform. Tekhnol. Proektir., Proizvod., 2005, no. 4, pp. 63–66.

    Google Scholar 

  3. Petunin, A.A., Chentsov, A.G., and Chentsov, P.A., On Routing Tool Motion on the Sheet Cutting NPC Machines, in Nauch.-tekhn. Vedomosti SPbGPU, Ser. Inform., Telekommunik., Control, 2013, no. 2 (169), pp. 103–111.

    Google Scholar 

  4. Petunin, A.A., Chentsov, A.G., and Chentsov, P.A., On One Problems of Routing Tool Transfer at Sheet Cutting of Parts, in Modelir. Analiz Inform. Sistem, 2015, vol. 22, no. 2, pp. 278–294.

    Article  MathSciNet  Google Scholar 

  5. Gutin, G., and Punnen, A., The Traveling Salesman Problem and Its Variations, Berlin: Springer, 2002.

    MATH  Google Scholar 

  6. Chentsov, A.G. and Chentsov, A.A., Dynamic Programming of the Problems of Routing with Constraints and Costs Depending on the List of Jobs, Dokl. Ross. Akad. Nauk, 2013, vol. 453, no. 1, pp. 20–23.

    MATH  Google Scholar 

  7. Kosheleva, M.S., Chentsov, A.A., and Chentsov, A.G., On Problem of Routing with Constraints Including Dependence on the List of Jobs, Tr. Inst. Mat. Mekh., 2015, vol. 21, no. 4, pp. 178–195.

    MathSciNet  Google Scholar 

  8. Chentsov, A.G., Ekstremal’nye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii (Extremal Problems of Routing and Assignment of Jobs: Questions of Theory), Moscow–Izhevsk: NITS “Regulyarnaya i Khaoticheskaya Dinamika,” Izhev. Inst. Komp’yut. Issled, 2008.

    Google Scholar 

  9. Chentsov, A.G., Problem of Successive Megalopolis Traversal with the Precedence Conditions, Autom. Remote Control, 2014, vol. 75, no. 4, pp. 728–744.

    Article  MathSciNet  MATH  Google Scholar 

  10. Wang, G.G. and Xie, S.Q., Optimal Process Planning for a Combined Punch-and-Laser Cutting Machine Using Ant Colony Optimization, Int. J. Product. Res., 2005, vol. 43 (11), pp. 2195–2216.

    Article  Google Scholar 

  11. Lee, M.-K. and Kwon, K.-B., Cutting Path Optimization in NC Cutting Processes Using a Two-step Genetic Algorithm, Int. J. Product. Res., 2006, vol. 44 (24), pp. 5307–5326.

  12. Jing, Y. and Zhige, C., An Optimized Algorithm of Numerical Cutting-Path Control in Garment Manufacturing, Adv. Mater. Res., 2013, vol. 796, pp. 454–457.

    Article  Google Scholar 

  13. Ganelina, N.D. and Frolovskii, V.D., Study of the Methods for Constructing the Shortest Path to Round the Segments on Plane, Sib. Zh. Vychisl. Mat., 2006, vol. 9, no. 3, pp. 201–212.

    Google Scholar 

  14. Verkhoturov, M.A. and Tarasenko, P.Yu., Software for the Problems of Optmization of the Cutting Tool Path for Planar Figure Cutting on the Basis of Chain Cutting, Vestn. UGATU, Upravlen., VTiIT, 2008, vol. 10, no. 2 (27), pp. 123–130.

  15. Bellman, R., Application of the Dynamic Programming Method to the Travelling Salesman Problem, in Kiberneticheskii Sbornik (Cybernetical Series), Moscow: Mir, 1964, vol. 9, pp. 219–228.

    Google Scholar 

  16. Held, M. and Karp, R.M., A Dynamic Programming Approach to Sequencing Problems, J. Soc. Ind. Appl. Math., 1962, no. 10 (1), pp. 196–210.

    Article  MathSciNet  MATH  Google Scholar 

  17. Cook, W.J., in Pursuit of the Traveling Salesman. Mathematics at the Limits of Computation, Princeton: Princeton Univ. Press, 2012.

    MATH  Google Scholar 

  18. Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman Problem. Issues in Theory, Autom. Remote Control, 1989, vol. 50, no. 9, pp. 1147–1173.

    MathSciNet  MATH  Google Scholar 

  19. Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman’s Problem. Exact Methods, Autom. Remote Control, 1989, vol. 50, no. 10, pp. 1303–1324.

    MathSciNet  MATH  Google Scholar 

  20. Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman’s Problem. Approximate Algorithms, Autom. Remote Control, 1989, vol. 50, no. 11, pp. 1459–1479.

    MathSciNet  MATH  Google Scholar 

  21. Korobkin, V.V., Sesekin, A.N., Tashlykov, O.L., and Chentsov, A.G., Methods of Routing with Application to the Problems of Safety Enhancement and Operational Effectiveness of Nuclear Power Plants, Kalyaev, I.A., Ed., Moscow: Novye Tekhnologii, 2012.

  22. Kuratovwski, K. and Mostowski, A., Set Theory, Amsterdam: North-Holland, 1967. Translated under the title Teoriya mnozhestv, Moscow: Mir, 1970.

    Google Scholar 

  23. Dieudonné, J., Foundations of Modern Analysis, New York: Academic, 1960. Translated under the title Osnovy sovremennogo analiza, Moscow: Mir, 1964.

    MATH  Google Scholar 

  24. Cormen, T.H., Leizerson, C.E., and Rivest, R.L., Introduction to Algorithms, Cambridge: MIT Press, 1990. Translated under the title Algoritmy. Postroenie i analiz, Moscow: MTsNTO, 2002.

    Google Scholar 

  25. Chentsov, A.G., On Routing of Complexes, Vestn. UdGU, Mat. Mekh. Komp’yut. Nauki, 2013, vol. 1, pp. 59–82.

    Article  MATH  Google Scholar 

  26. Chentsov, A.A., Chentsov, A.G., and Chentsov, P.A., Elements of Dynamic Programming in the Extremal Problems of Routing, Probl. Upravlen., 2013, no. 5, pp. 12–21.

    MATH  Google Scholar 

  27. Chentsov, A.G., On a Parallel Procedure for Constructing the Bellman Function in the Generalized Problem of Courier with Internal Jobs, Autom. Remote Control, 2012, vol. 73, no. 3, pp. 532–546.

    Article  MathSciNet  MATH  Google Scholar 

  28. Chentsov, A.G. and Chentsov, A.A., On Finding the Value of the Routing Problem with Constraints, Probl. Upravlen. Informat., 2016, no. 1, pp. 41–54.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of Russian Academy of Sciences, Yekaterinburg, Russia

    A. G. Chentsov & P. A. Chentsov

  2. Ural Federal University, Yekaterinburg, Russia

    A. G. Chentsov & P. A. Chentsov

Authors
  1. A. G. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. 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.G. Chentsov, P.A. Chentsov, 2016, published in Avtomatika i Telemekhanika, 2016, No. 11, pp. 96–117.

This paper was recommended for publication by A.A. Lazarev, a member of the Editorial Board

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chentsov, A.G., Chentsov, P.A. Routing under constraints: Problem of visit to megalopolises. Autom Remote Control 77, 1957–1974 (2016). https://doi.org/10.1134/S0005117916110060

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Search

Navigation