Skip to main content
SpringerLink
Log in
Book cover

International Conference on Discrete Optimization and Operations Research

DOOR 2016: Discrete Optimization and Operations Research pp 121–135Cite as

A Scheme of Independent Calculations in a Precedence Constrained Routing Problem

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9869))

Abstract

We consider a routing problem with constraints. To solve this problem, we employ a variant of the dynamic programming method, where the significant part (that is, the part that matters in view of precedence constraints) of the Bellman function is calculated by means of an independent calculations scheme. We propose a parallel implementation of the algorithm for a supercomputer, where the construction of position space layers for the hypothetical processors is conducted with use of discrete dynamic systems’ apparatus.

This research was supported by Russian Science Foundation (project no. 14-11-00109).

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Chentsov, A.G.: One parallel procedure for the construction of the Bellman function in the generalized problem of the courier with the inner workings. Vestnik YuUrGU. Gos. Univ. Ser. Mat. Model Program. 12, 53–76 (2012)

    MathSciNet  MATH  Google Scholar 

  2. Chentsov, A.G.: One parallel procedure for the construction of the Bellman function in the generalized problem of the courier with the inner workings. Autom. Remote Control 3, 34–149 (2012)

    MathSciNet  Google Scholar 

  3. Chentsov, A.G.: To question of routing of works complexes: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp’yuternye Nauki, (1), 59–82 (2013)

    Google Scholar 

  4. Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Springer, New York (2002)

    MATH  Google Scholar 

  5. Cook, W.J.: In Pursuit of the Traveling Salesman. Mathematics at the limits of computation, p. 248. Princeton University Press, New Jersey (2012)

    Google Scholar 

  6. Melamed, I.I., Sergeev, S.I., Sigal, I.: The traveling salesman problem. I. Issues in Theory; II Exact Methods; III Approximate Algorithms: Automation and Remote Control 50(9), 1147–1173; 50(10), 1303–1324; 50(11), 1459–1479 (1989)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Chentsov, A.G., Chentsov, A.A.: Route problem with constraints depending on a list of tasks. Doklady Math. 92(3), 685–688 (2015)

    Article  MATH  Google Scholar 

  10. Chentsov, A.A., Chentsov, A.G., Chentsov, P.A.: Elements of dynamic programming in extremal route problems. Autom. Remote Control 75(3), 537–550 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  11. Chentsov, A.G., Chentsov, A.A.: On the problem of obtaining the value of routing problem with constraints. J. Autom. Inf. Sci. 6, 41–54 (2016)

    MATH  Google Scholar 

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

    Google Scholar 

  13. Chentsov, A.G., Kosheleva, M.S.: Dynamic programming in the precedence constrained TSP with the costs depending on a list of tasks. Mechatron. Autom. Control 16(4), 232–244 (2015). (in Russian)

    MathSciNet  Google Scholar 

  14. Lawler, E.L.: Efficient implementation of dynamic programming algorithms for sequencing problems. CWI Technical report. Stichting Mathematisch Centrum. Mathematische Besliskunde-BW 106/79, pp. 1–16 (1979). http://oai.cwi.nl/oai/asset/9663/9663A.pdf

  15. Bianco, L., Mingozzi, A., Ricciardelli, S., Spadoni, M.: The traveling salesman problem with precedence constraints. In: Bühler, W., Feichtinger, G., Hartl, R.F., Radermacher, F.J., Stähly, P. (eds.) Papers of the 19th Annual Meeting / Vorträge der 19. Jahrestagung. Operations Research Proceedings, vol. 1990, pp. 299–306. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  16. Steiner, G.: On the complexity of dynamic programming for sequencing problems with precedence constraints. Ann. Oper. Res. 26(1), 103–123 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  17. Salii, Y.V.: On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp’yuternye Nauki, (1), 76–86 (2014). (in Russian)

    Google Scholar 

  18. Korobkin, V.V., Sesekin, A.N., Tashlykov, O.L., Chentsov, A.G.: Routing Methods and Their Applications to the Enhancement of Safety and Efficiency of Nuclear Plant Operation. Novye Tekhnologii, Moscow (2012)

    Google Scholar 

  19. Tashlykov, O.L.: Personnel Dose Costs in the Nuclear Industry. Analysis. Ways to Decrease. Optimization. LAP LAMBERT Academic Publishing GmbH & Co. RG., Saarbruke (2011)

    Google Scholar 

  20. Alkaya, A.F., Duman, E.: A new generalization of the traveling salesman problem. Appl. Comput. Math. 9(2), 162–175 (2010)

    MathSciNet  MATH  Google Scholar 

  21. Salii, Y.V.: Restricted dynamic programming heuristic for precedence constrained bottleneck generalized TSP. In: Proceedings of the 1st Ural Workshop on Parallel, Distributed, and Cloud Computing for Young Scientists, pp. 85–108 (2015). http://ceur-ws.org/Vol-1513/#paper-10

  22. Wang, G.G., Xie, S.Q.: Optimal process planning for a combined punch-and-laser cutting machine using ant colony optimization. Int. J. Prod. Res. 43(11), 2195–2216 (2005)

    Article  Google Scholar 

  23. Lee, M.-K., Kwon, K.-B.: Cutting path optimization in CNC cutting processes using a two-step genetic algorithm. Int. J. Prod. Res. 44(24), 5307–5326 (2006)

    Article  MATH  Google Scholar 

  24. Jing, Y., Zhige, C.: An optimized algorithm of numerical cutting-path control in garment manufacturing. Adv. Mater. Res. 796, 454–457 (2013)

    Article  Google Scholar 

  25. Dewil, R., Vansteenwegen, P., Cattrysse, D: Construction heuristics for generating tool paths for laser cutters. Int. J. Prod. Res. pp. 1–20 (2014)

    Google Scholar 

  26. Petunin, A.A.: Modelling of tool path for the CNC sheet cutting machines. In: AIP Conference Proceedings, 41st International Conference Applications of Mathematics in Engineering and Economics (AMEE 2015), vol. 1690, pp. 060002(1)–060002(7) (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Alexander G. Chentsov & Alexey M. Grigoryev

  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

Corresponding author

Correspondence to Alexey M. Grigoryev .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics , Novosibirsk, Russia

    Yury Kochetov

  2. Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia

    Michael Khachay

  3. Sobolev Institute of Mathematics , Novosibirsk, Russia

    Vladimir Beresnev

  4. Far Eastern Federal University , Vladivostik, Russia

    Evgeni Nurminski

  5. University of Florida , Gainesville, Florida, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Chentsov, A.G., Grigoryev, A.M. (2016). A Scheme of Independent Calculations in a Precedence Constrained Routing Problem. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds) Discrete Optimization and Operations Research. DOOR 2016. Lecture Notes in Computer Science(), vol 9869. Springer, Cham. https://doi.org/10.1007/978-3-319-44914-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44914-2_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44913-5

  • Online ISBN: 978-3-319-44914-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation