Skip to main content
Springer Nature Link
Log in

Optimization “In Windows” for Routing Problems with Constraints

  • Conference paper
  • First Online:
Mathematical Optimization Theory and Operations Research (MOTOR 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1090))

Abstract

We investigate the problem of sequentially visiting a number of megalopoleis while satisfying precedence constraints where the travel cost functions depend on the set of pending tasks. It is supposed that the dimension of the investigated problem is sufficiently large, therefore, an exact solution is practically impossible; in these circumstances, heuristics are used very widely. We investigate some possibilities for local improvement of results achievable in a class of heuristics. For such improvement of a result, optimizing insertions and finite systems of optimizing insertions are used. We view these systems as multi-insertions. The given approach is combined with the employment of a parallel algorithm implemented for a multiprocessor computing system. The optimizing insertions are designed by means of a broadly understood dynamic programming.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    see http://www.cs.nott.ac.uk/~pszdk/gtsp.html.

References

  1. Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and its Variations. Springer, Berlin (2002)

    MATH  Google Scholar 

  2. William, J.C.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation, p. 248. Princeton University Press, Princeton (2012)

    Google Scholar 

  3. Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. Assoc. Comput. Mach. 9, 61–63 (1962)

    Article  MathSciNet  Google Scholar 

  4. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196–210 (1962)

    Article  MathSciNet  Google Scholar 

  5. Chentsov, A.G.: Problem of successive megalopolis traversal with the precedence conditions. Autom. Remote Control 75(4), 728–744 (2014). https://doi.org/10.1134/S0005117914040122

    Article  MathSciNet  MATH  Google Scholar 

  6. Chentsov, A.G., Chentsov, A.A.: Route problem with constraints depending on a list of tasks. Doklady Math. 92(3), 685–688 (2015). https://doi.org/10.1134/S1064562415060083

    Article  MathSciNet  MATH  Google Scholar 

  7. Chentsov, A.G.: The Bellman insertions in the route problem with constraints and complicated cost functions. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp’yuternye Nauki 2014(4), 122–141 (2014). https://doi.org/10.20537/vm140410. (in Russian)

    Article  MATH  Google Scholar 

  8. Chentsov, A.G., Chentsov, P.A., Petunin, A.A., Sesekin, A.N.: Model of megalopolises in the tool path optimisation for CNC plate cutting machines. Int. J. Prod. Res. 56(14), 4819–4830 (2018). https://doi.org/10.1080/00207543.2017.1421784

    Article  Google Scholar 

  9. Petunin, A.A., Chentsov, A.G., Chentsov, P.A.: Optimizing inserts in a routing task with constraints and complicated cost functions. Izvestija RAN. Teorija i sistemy upravlenija 1, 117–130 (2019). (in Russian)

    Google Scholar 

  10. Chentsov, A.G., Grigoryev, A.M.: Dynamic programming method in a routing problem: a scheme of independent computations. Mekhatronika, Avtomatizatsiya, Upravlenie 17(12), 834–846 (2016). (in Russian)

    Article  Google Scholar 

  11. Chentsov, A.G., Grigoryev, A.M., Chentsov, A.A.: Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions. Ural Math. J. 4(2), 43–55 (2018). https://doi.org/10.15826/umj.2018.2.006

    Article  MathSciNet  Google Scholar 

  12. Chentsov, A.G.: The Bellmann insertions in route problems with constraints and complicated cost functions. II. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp’yuternye Nauki 26(4), 565–578 (2016). https://doi.org/10.20537/vm160410. (in Russian)

    Article  MATH  Google Scholar 

  13. Petunin, A.A., Chentsov, A.A., Chentsov, A.G., Chentsov, P.A.: Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints. Autom. Remote Control 78(4), 666–681 (2017). https://doi.org/10.1134/S0005117917040087

    Article  MathSciNet  MATH  Google Scholar 

  14. Chentsov, A.G., Grigoryev, A.M.: Optimizing multi-inserts in routing problems with constraints. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp’yuternye Nauki 28(4), 513–530 (2018). https://doi.org/10.20537/vm180406. (in Russian)

    Article  Google Scholar 

  15. Gimadi, E.Kh., Khachai, M.Yu.: Extremal Problems on Sets of Permutations, p. 220. UMC UPI, Yekaterinburg (2016). (in Russian)

    Google Scholar 

  16. Melamed, I.I., Sergeev, S.I., Sigal, I.Kh.: The traveling salesman problem. I Issues in theory; II Exact methods; III Approximate algorithms. Autom. Remote Control 50(9), 1147–1173; 50(10), 1303–1324; 50(11), 1459–1479 (1989)

    Google Scholar 

  17. Litl, Dzh., Murti, K., Suini, D., Kerel, K.: Algorithm for the traveling salesman problem. Ekon. Mat. Metod. 1(1), 94–107 (1965)

    Google Scholar 

  18. Chentsov, A.G.: Extreme Problems of Routing and Tasks Distribution: Regular and Chaotic Dynamics, 240 p. Izhevsk Institute of Computer Research (2008). (in Russian)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. 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 50, 83–109 (2017). https://doi.org/10.20537/2226-3594-2017-50-08. (in Russian)

    Article  MATH  Google Scholar 

  21. Chentsov, A.A., Chentsov, A.G., Chentsov, P.A.: Extremal routing problem with internal losses. Proc. Steklov Inst. Math. 264(Suppl. 1), 87–106 (2009)

    Article  MathSciNet  Google Scholar 

  22. Chentsov, A.G., Chentsov, P.A.: Optimization of the start point in the GTSP with the precedence conditions. Bull. South Ural State Univ.: Series Math. Model., Prog. Comput. Soft. 11(2), 83–95 (2018). https://doi.org/10.14529/mmp180207

    Article  MATH  Google Scholar 

  23. Alkaya, A.F., Duman, E.: Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly. Discrete Appl. Math. 192, 2–16 (2015)

    Article  MathSciNet  Google Scholar 

  24. Salii, Y.V.: Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization. Eur. J. Oper. Res. 272(1), 32–42 (2019)

    Article  MathSciNet  Google Scholar 

  25. Gouveia, L., Ruthmair, M.: Load-dependent and precedence-based models for pickup and delivery problems. Comput. Oper. Res. 63, 56–71 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Krasovskii Institute of Mathematics and Mechanics, Ekaterinburg, Russia

    Alexander G. Chentsov, Alexey M. Grigoryev & Alexey A. Chentsov

  2. Ural Federal University, Ekaterinburg, Russia

    Alexander G. Chentsov

Authors
  1. Alexander G. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexey M. Grigoryev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexey A. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander G. Chentsov .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Igor Bykadorov

  2. University of Greenwich, London, UK

    Vitaly Strusevich

  3. University of Aveiro, Aveiro, Portugal

    Tatiana Tchemisova

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chentsov, A.G., Grigoryev, A.M., Chentsov, A.A. (2019). Optimization “In Windows” for Routing Problems with Constraints. In: Bykadorov, I., Strusevich, V., Tchemisova, T. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2019. Communications in Computer and Information Science, vol 1090. Springer, Cham. https://doi.org/10.1007/978-3-030-33394-2_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-33394-2_36

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-33393-5

  • Online ISBN: 978-3-030-33394-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics