Two-Stage Dynamic Programming in the Routing Problem with Decomposition
This paper considers an optimal movement routing problem with constraints. One such constraint is due to decomposing the original problem into a preliminary subproblem and a final subproblem; the tasks related to the preliminary problem must be executed before the tasks of the final subproblem begin...
Uloženo v:
| Vydáno v: | Automation and remote control Ročník 84; číslo 5; s. 543 - 563 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Moscow
Pleiades Publishing
01.05.2023
Springer Nature B.V |
| Témata: | |
| ISSN: | 0005-1179, 1608-3032 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This paper considers an optimal movement routing problem with constraints. One such constraint is due to decomposing the original problem into a preliminary subproblem and a final subproblem; the tasks related to the preliminary problem must be executed before the tasks of the final subproblem begin. In particular, this condition may arise in the tool control problem for thermal cutting machines with computer numerical control (CNC): if there are long parts among workpieces, the cutting process near a narrow material boundary should start with these workpieces since such parts are subject to thermal deformations, which may potentially cause rejects. The problem statement under consideration involves two zones for part processing. The aggregate routing process in the original problem includes a starting point, a route (a permutation of indices), and a particular track consistent with the route and the starting point. Each of the subproblems has specific precedence conditions, and the travel cost functions forming the additive criterion may depend on the list of pending tasks. A special two-stage procedure is introduced to apply dynamic programming as a solution method. The structure of the optimal solution is established and an algorithm based on this structure is developed. The algorithm is implemented on a personal computer and a computational experiment is carried out. |
|---|---|
| AbstractList | This paper considers an optimal movement routing problem with constraints. One such constraint is due to decomposing the original problem into a preliminary subproblem and a final subproblem; the tasks related to the preliminary problem must be executed before the tasks of the final subproblem begin. In particular, this condition may arise in the tool control problem for thermal cutting machines with computer numerical control (CNC): if there are long parts among workpieces, the cutting process near a narrow material boundary should start with these workpieces since such parts are subject to thermal deformations, which may potentially cause rejects. The problem statement under consideration involves two zones for part processing. The aggregate routing process in the original problem includes a starting point, a route (a permutation of indices), and a particular track consistent with the route and the starting point. Each of the subproblems has specific precedence conditions, and the travel cost functions forming the additive criterion may depend on the list of pending tasks. A special two-stage procedure is introduced to apply dynamic programming as a solution method. The structure of the optimal solution is established and an algorithm based on this structure is developed. The algorithm is implemented on a personal computer and a computational experiment is carried out. |
| Author | Chentsov, A. G. Chentsov, P. A. |
| Author_xml | – sequence: 1 givenname: A. G. surname: Chentsov fullname: Chentsov, A. G. email: chentsov@imm.uran.ru organization: Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Ural Federal University – sequence: 2 givenname: P. A. surname: Chentsov fullname: Chentsov, P. A. email: chentsov.p@mail.ru organization: Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Ural Federal University |
| BookMark | eNp1kF9LwzAUxYNMcJt-AN8CPldv_jRtH2XTKQwUt_eSpmmXsSYzyRj79muZ4IP4dO_ld865cCZoZJ3VCN0TeCSE8acVAKSEZAVlkPYru0JjIiBPGDA6QuMBJwO_QZMQtgCEAGVjtFgfXbKKstV4frKyMwp_etd62XXGtthYHDcaf7lDHM4eVTvd4aOJGzzXynV7F0w0zt6i60bugr77mVO0fn1Zz96S5cfiffa8TBQjJCaSM55RLkTBtchqWoHiHHLKGwFplVaK5VTwQtWqrguaZ0xpWTFapw2vZU7ZFD1cYvfefR90iOXWHbztP5aMpkJknFDoVeSiUt6F4HVT7r3ppD-VBMqhrvJPXb2HXjyh19pW-9_k_01ncdpsZg |
| Cites_doi | 10.1134/S0005117916110060 10.1287/opre.11.6.972 10.1080/00207540500070376 10.1134/S0005117914040122 10.1080/00207540600579615 10.1145/321105.321111 |
| ContentType | Journal Article |
| Copyright | Pleiades Publishing, Ltd. 2023. ISSN 0005-1179, Automation and Remote Control, 2023, Vol. 84, No. 5, pp. 543–563. © Pleiades Publishing, Ltd., 2023. Russian Text © The Author(s), 2023, published in Avtomatika i Telemekhanika, 2023, No. 5, pp. 133–164. Pleiades Publishing, Ltd. 2023. |
| Copyright_xml | – notice: Pleiades Publishing, Ltd. 2023. ISSN 0005-1179, Automation and Remote Control, 2023, Vol. 84, No. 5, pp. 543–563. © Pleiades Publishing, Ltd., 2023. Russian Text © The Author(s), 2023, published in Avtomatika i Telemekhanika, 2023, No. 5, pp. 133–164. – notice: Pleiades Publishing, Ltd. 2023. |
| DBID | AAYXX CITATION 8FE 8FG ABJCF AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L6V M7S P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.1134/S0005117923050053 |
| DatabaseName | CrossRef ProQuest SciTech Collection ProQuest Technology Collection ProQuest Materials Science & Engineering ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Engineering Collection Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | Computer Science Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1608-3032 |
| EndPage | 563 |
| ExternalDocumentID | 10_1134_S0005117923050053 |
| GroupedDBID | -5D -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 23N 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 408 409 40D 40E 5GY 5VS 67Z 6NX 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABEFU ABFTD ABFTV ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACUHS ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AETLH AEVLU AEXYK AFBBN AFFNX AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARCSS ARMRJ ASPBG AVWKF AXYYD AZFZN B-. B0M BA0 BAPOH BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP EAD EAP EBLON EBS EDO EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GROUPED_DOAJ GXS H13 HF~ HG6 HLICF HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C JBSCW JCJTX JZLTJ KDC KOV LAK LLZTM M4Y MA- MK~ N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM OVD P2P P9O PF0 PT4 QOS R89 R9I RNI RNS ROL RPX RSV RZC RZE S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TEORI TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WH7 WK8 XU3 YLTOR Z7R Z7Z Z83 Z88 ZMTXR ZY4 ~8M ~A9 AAPKM AAYXX ABDBE ABFSG ABJCF ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AGQPQ AHPBZ AHWEU AIXLP ARAPS ATHPR BENPR BGLVJ CCPQU CITATION HCIFZ K7- M7S PHGZM PHGZT PQGLB PTHSS 8FE 8FG AZQEC DWQXO GNUQQ JQ2 L6V P62 PKEHL PQEST PQQKQ PQUKI PRINS |
| ID | FETCH-LOGICAL-c311t-a4347246694e67d2b0c440824f605b5bc382649cdcdd92873ceab32d5f4da823 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001067925500007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0005-1179 |
| IngestDate | Sun Nov 30 04:22:23 EST 2025 Sat Nov 29 06:42:10 EST 2025 Fri Feb 21 02:41:38 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | dynamic programming route precedence conditions megalopolis |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c311t-a4347246694e67d2b0c440824f605b5bc382649cdcdd92873ceab32d5f4da823 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85171617413&doi=10.1134%2fS0005117923050053&partnerID=40&md5=782161cff326834bab195e46f7ed9a56 |
| PQID | 3256674120 |
| PQPubID | 2043520 |
| PageCount | 21 |
| ParticipantIDs | proquest_journals_3256674120 crossref_primary_10_1134_S0005117923050053 springer_journals_10_1134_S0005117923050053 |
| PublicationCentury | 2000 |
| PublicationDate | 20230500 2023-05-00 20230501 |
| PublicationDateYYYYMMDD | 2023-05-01 |
| PublicationDate_xml | – month: 5 year: 2023 text: 20230500 |
| PublicationDecade | 2020 |
| PublicationPlace | Moscow |
| PublicationPlace_xml | – name: Moscow – name: New York |
| PublicationTitle | Automation and remote control |
| PublicationTitleAbbrev | Autom Remote Control |
| PublicationYear | 2023 |
| Publisher | Pleiades Publishing Springer Nature B.V |
| Publisher_xml | – name: Pleiades Publishing – name: Springer Nature B.V |
| References | Chentsov, A.G., On Routing Complexes of Jobs, Vestn. UdGU,Mat. Mekh. Komp’yut. Nauki, 2013, no. 1, pp. 58–82. Chentsov, A.G., Ekstremal’nye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii (Extremal Problems of Routing and Task Distribution: Theoretical Fundamentals), Moscow–Izhevsk: Regulyarnaya i Khaoticheskaya Dinamika, 2008. Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman Problem, Autom. Remote Control, 1989, vol. 50, no. 9, pp. 1147–1173; no. 10, pp. 1303–1324; no. 11, pp. 1459–1479. BellmanR.Dynamic Programming Treatment of the Travelling Salesman ProblemJ. ACM19629616313570210.1145/321105.3211110106.14102 ChentsovA.G.ChentsovP.A.Routing under Constraints: Problem of Visit to MegalopolisesAutom. Remote Control20167719571974366447010.1134/S00051179161100601356.90153 KuratowskiK.MostowskiA.Set Theory1967AmsterdamNorth-Holland0165.01701 ChentsovA.G.Problem of Successive Megalopolis Traversal with the Precedence ConditionsAutom. Remote Control201475728744327589610.1134/S00051179140401221297.90169 Little, J.D., Murty, K.G., Sweeney, D.W., and Karel, C., An Algorithm for the Traveling Salesman Problem, Oper. Res., 1963, no. 11(6), pp. 972–989. 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. DieudonnéJ.Foundations of Modern Analysis1960New YorkAcademic0100.04201 PetuninA.A.ChentsovA.G.ChentsovP.A.Optimal Routing in Problems of Sequential Traversal of Megapolises in the Presence of ConstraintsChelyabinsk Physical and Mathematical Journal202272092331503.90071 Petunin, A.A., On Some Strategies for Constructing the Tool’s Route in the Development of Controlling Programs for Thermal Cutting Machines, Vestn. UGATU, Ser. Upravlen., Vychisl. Tekh. Informatika, 2009, vol. 13, no. 2(35), pp. 280–286. Chentsov, A.G., Chentsov, A.A., and Sesekin, A.N., Zadachi marshrutizatsii peremeshchenii s neadditivnym agregirovaniem zatrat (Movement Routing Problems with Non-additive Cost Aggregation), Moscow: Lenand, 2021. WargaJ.Optimal Control of Differential and Functional Equations1972New YorkAcademic0253.49001 CookW.J.In Pursuit of the Traveling Salesman. Mathematics at the Limits of Computation2012PrincetonPrinceton University Press1236.00007 ChentsovA.G.ChentsovP.A.Dynamic Programming in the Routing Problem: Decomposition Variant, Russian Universities Reports.Mathematics2022279512407579481 Petunin, A.A., Chentsov, A.G., and Chentsov, P.A., Optimal’naya marshrutizatsiya instrumenta mashin figurnoi listovoi rezki s chislovym programmnym upravleniem. Matematicheskie modeli i algoritmy (Optimal Tool Routing of Shaped Sheet Cutting Machines with Computer Numerical Control. Mathematical Models and Algorithms), Yekaterinburg: Ural Federal University, 2020. Frolovskii, V.D., Automating the Design of Controlling Programs for Heat Metal Cutting on Equipment with Digital Program Control, Inform. Tekhnol. Proektirovan. Proizvod., 2005, no. 4, pp. 63–66. ChentsovA.G.ChentsovP.A.An Extremal Two-Stage Routing Problem and Procedures Based on Dynamic Programming, Trudy Inst. Mat. i Mekh.Ural. Otd. Ross. Akad. Nauk202228215248 Gimadi, E.Kh. and Khachai, M.Yu., Ekstremal’nye zadachi na mnozhestvakh perestanovok (Extremal Problems on Permutation Sets), Yekaterinburg: UPI Training Center, 2016. HeldM.KarpR.A Dynamic Programming Approach to Sequencing ProblemsJ. SIAM1962101962101394930106.14103 CormenT.H.LeisersonC.E.RivestR.L.Introduction to Algorithms1990CambridgeMIT Press1158.68538 GutinG.PunnenA.The Traveling Salesman Problem and Its Variations2002BerlinSpringer0996.00026 Lee, M.-K. and Kwon, K.-B., Cutting Path Optimization in CNC Cutting Processes Using a Two-Step Genetic Algorithm, Int. J. Product. Res., 2006, no. 44, pp. 5307–5326. WangG.G.XieS.Q.Optimal Process Planning for a Combined Punch-and-Laser Cutting Machine Using Ant Colony OptimizationInt. J. Product. Res.2005432195221610.1080/00207540500070376 Lawler, E.L., Efficient Implementation of Dynamic Programming Algorithms for Sequencing Problems, Report BW106, Amsterdam: Mathematisch Centrum, 1979, pp. 1–16. G.G. Wang (2407_CR17) 2005; 43 2407_CR25 A.G. Chentsov (2407_CR11) 2022; 27 W.J. Cook (2407_CR2) 2012 A.A. Petunin (2407_CR26) 2022; 7 R. Bellman (2407_CR6) 1962; 9 2407_CR23 K. Kuratowski (2407_CR19) 1967 2407_CR24 A.G. Chentsov (2407_CR13) 2014; 75 M. Held (2407_CR7) 1962; 10 A.G. Chentsov (2407_CR14) 2016; 77 2407_CR8 2407_CR5 2407_CR9 A.G. Chentsov (2407_CR12) 2022; 28 2407_CR16 2407_CR15 J. Dieudonné (2407_CR20) 1960 2407_CR3 2407_CR4 G. Gutin (2407_CR1) 2002 2407_CR18 T.H. Cormen (2407_CR21) 1990 J. Warga (2407_CR22) 1972 2407_CR10 |
| References_xml | – reference: ChentsovA.G.ChentsovP.A.Dynamic Programming in the Routing Problem: Decomposition Variant, Russian Universities Reports.Mathematics2022279512407579481 – reference: KuratowskiK.MostowskiA.Set Theory1967AmsterdamNorth-Holland0165.01701 – reference: BellmanR.Dynamic Programming Treatment of the Travelling Salesman ProblemJ. ACM19629616313570210.1145/321105.3211110106.14102 – reference: Chentsov, A.G., Ekstremal’nye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii (Extremal Problems of Routing and Task Distribution: Theoretical Fundamentals), Moscow–Izhevsk: Regulyarnaya i Khaoticheskaya Dinamika, 2008. – reference: CookW.J.In Pursuit of the Traveling Salesman. Mathematics at the Limits of Computation2012PrincetonPrinceton University Press1236.00007 – reference: ChentsovA.G.Problem of Successive Megalopolis Traversal with the Precedence ConditionsAutom. Remote Control201475728744327589610.1134/S00051179140401221297.90169 – reference: GutinG.PunnenA.The Traveling Salesman Problem and Its Variations2002BerlinSpringer0996.00026 – reference: WargaJ.Optimal Control of Differential and Functional Equations1972New YorkAcademic0253.49001 – reference: Chentsov, A.G., Chentsov, A.A., and Sesekin, A.N., Zadachi marshrutizatsii peremeshchenii s neadditivnym agregirovaniem zatrat (Movement Routing Problems with Non-additive Cost Aggregation), Moscow: Lenand, 2021. – reference: Gimadi, E.Kh. and Khachai, M.Yu., Ekstremal’nye zadachi na mnozhestvakh perestanovok (Extremal Problems on Permutation Sets), Yekaterinburg: UPI Training Center, 2016. – reference: HeldM.KarpR.A Dynamic Programming Approach to Sequencing ProblemsJ. SIAM1962101962101394930106.14103 – reference: Little, J.D., Murty, K.G., Sweeney, D.W., and Karel, C., An Algorithm for the Traveling Salesman Problem, Oper. Res., 1963, no. 11(6), pp. 972–989. – reference: Petunin, A.A., On Some Strategies for Constructing the Tool’s Route in the Development of Controlling Programs for Thermal Cutting Machines, Vestn. UGATU, Ser. Upravlen., Vychisl. Tekh. Informatika, 2009, vol. 13, no. 2(35), pp. 280–286. – reference: WangG.G.XieS.Q.Optimal Process Planning for a Combined Punch-and-Laser Cutting Machine Using Ant Colony OptimizationInt. J. Product. Res.2005432195221610.1080/00207540500070376 – reference: PetuninA.A.ChentsovA.G.ChentsovP.A.Optimal Routing in Problems of Sequential Traversal of Megapolises in the Presence of ConstraintsChelyabinsk Physical and Mathematical Journal202272092331503.90071 – reference: CormenT.H.LeisersonC.E.RivestR.L.Introduction to Algorithms1990CambridgeMIT Press1158.68538 – reference: DieudonnéJ.Foundations of Modern Analysis1960New YorkAcademic0100.04201 – reference: Lee, M.-K. and Kwon, K.-B., Cutting Path Optimization in CNC Cutting Processes Using a Two-Step Genetic Algorithm, Int. J. Product. Res., 2006, no. 44, pp. 5307–5326. – reference: ChentsovA.G.ChentsovP.A.Routing under Constraints: Problem of Visit to MegalopolisesAutom. Remote Control20167719571974366447010.1134/S00051179161100601356.90153 – reference: Frolovskii, V.D., Automating the Design of Controlling Programs for Heat Metal Cutting on Equipment with Digital Program Control, Inform. Tekhnol. Proektirovan. Proizvod., 2005, no. 4, pp. 63–66. – reference: ChentsovA.G.ChentsovP.A.An Extremal Two-Stage Routing Problem and Procedures Based on Dynamic Programming, Trudy Inst. Mat. i Mekh.Ural. Otd. Ross. Akad. Nauk202228215248 – reference: Petunin, A.A., Chentsov, A.G., and Chentsov, P.A., Optimal’naya marshrutizatsiya instrumenta mashin figurnoi listovoi rezki s chislovym programmnym upravleniem. Matematicheskie modeli i algoritmy (Optimal Tool Routing of Shaped Sheet Cutting Machines with Computer Numerical Control. Mathematical Models and Algorithms), Yekaterinburg: Ural Federal University, 2020. – reference: Chentsov, A.G., On Routing Complexes of Jobs, Vestn. UdGU,Mat. Mekh. Komp’yut. Nauki, 2013, no. 1, pp. 58–82. – reference: 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. – reference: Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman Problem, Autom. Remote Control, 1989, vol. 50, no. 9, pp. 1147–1173; no. 10, pp. 1303–1324; no. 11, pp. 1459–1479. – reference: Lawler, E.L., Efficient Implementation of Dynamic Programming Algorithms for Sequencing Problems, Report BW106, Amsterdam: Mathematisch Centrum, 1979, pp. 1–16. – ident: 2407_CR9 – volume: 77 start-page: 1957 year: 2016 ident: 2407_CR14 publication-title: Autom. Remote Control doi: 10.1134/S0005117916110060 – volume-title: Foundations of Modern Analysis year: 1960 ident: 2407_CR20 – ident: 2407_CR5 doi: 10.1287/opre.11.6.972 – ident: 2407_CR16 – volume-title: The Traveling Salesman Problem and Its Variations year: 2002 ident: 2407_CR1 – ident: 2407_CR3 – volume: 43 start-page: 2195 year: 2005 ident: 2407_CR17 publication-title: Int. J. Product. Res. doi: 10.1080/00207540500070376 – ident: 2407_CR24 – volume: 75 start-page: 728 year: 2014 ident: 2407_CR13 publication-title: Autom. Remote Control doi: 10.1134/S0005117914040122 – ident: 2407_CR10 – volume-title: Optimal Control of Differential and Functional Equations year: 1972 ident: 2407_CR22 – ident: 2407_CR8 – ident: 2407_CR15 – ident: 2407_CR18 doi: 10.1080/00207540600579615 – ident: 2407_CR4 – volume: 10 start-page: 196 year: 1962 ident: 2407_CR7 publication-title: J. SIAM – volume: 28 start-page: 215 year: 2022 ident: 2407_CR12 publication-title: Ural. Otd. Ross. Akad. Nauk – volume-title: In Pursuit of the Traveling Salesman. Mathematics at the Limits of Computation year: 2012 ident: 2407_CR2 – ident: 2407_CR25 – volume-title: Introduction to Algorithms year: 1990 ident: 2407_CR21 – ident: 2407_CR23 – volume-title: Set Theory year: 1967 ident: 2407_CR19 – volume: 7 start-page: 209 year: 2022 ident: 2407_CR26 publication-title: Chelyabinsk Physical and Mathematical Journal – volume: 27 start-page: 95 year: 2022 ident: 2407_CR11 publication-title: Mathematics – volume: 9 start-page: 61 year: 1962 ident: 2407_CR6 publication-title: J. ACM doi: 10.1145/321105.321111 |
| SSID | ssj0011023 |
| Score | 2.299058 |
| Snippet | This paper considers an optimal movement routing problem with constraints. One such constraint is due to decomposing the original problem into a preliminary... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 543 |
| SubjectTerms | Algorithms CAE) and Design Calculus of Variations and Optimal Control; Optimization Computer-Aided Engineering (CAD Constraints Control Cost function Cutting equipment Decomposition Dynamic programming Mathematical functions Mathematics Mathematics and Statistics Mechanical Engineering Mechatronics Numerical controls Operations Research Optimization Permutations Personal computers Robotics Set theory System Analysis Systems Theory Traveling salesman problem Workpieces |
| SummonAdditionalLinks | – databaseName: Engineering Database dbid: M7S link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED5BYYCBN6JQkAcmkEUc20k8IUQpDKiqRIdukV9BHUhLW-DvYycu5SFYGCNLVnQ---58n78P4NSqKI1NxLAmimMmC4OViBS2UpBMJ5xIUT0Uvk-73WwwEL1w4TYNsMr5mVgd1Gak_R35BXWxOXHhL44ux8_Yq0b57mqQ0FiGFc-SQCro3sNHF8HTEtTpL8ee-ix0NQll_oWwc0fi2fMi7j3xa1xaJJvf-qNV2Ols_veHt2AjJJzoqvaQbViy5Q6sf6Ih3IXb_tsIu6zz0aJ2LVCPejVs68mNo2GJXJaIPHbIf_ZqCRrkb3BR23pMegB-7UG_c9O_vsNBYAFrSsgMS0ZZGrMkEcwmqYlVpCsBala4IkdxpakrPpjQRhsjXGlFtZWKxoYXzMgspvvQKEelPQCUUJX64rLg1DCViCwqRCZJJqTmVnDahLO5dfNxTaORV-UHZfmPpWhCa27RPOyoab4wZxPO52uyGP51ssO_JzuCNS8gX0MYW9CYTV7sMazq19lwOjmp3OkdHdrNzQ priority: 102 providerName: ProQuest |
| Title | Two-Stage Dynamic Programming in the Routing Problem with Decomposition |
| URI | https://link.springer.com/article/10.1134/S0005117923050053 https://www.proquest.com/docview/3256674120 |
| Volume | 84 |
| WOSCitedRecordID | wos001067925500007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1608-3032 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0011023 issn: 0005-1179 databaseCode: P5Z dateStart: 20230101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1608-3032 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0011023 issn: 0005-1179 databaseCode: K7- dateStart: 20230101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1608-3032 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0011023 issn: 0005-1179 databaseCode: M7S dateStart: 20230101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1608-3032 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0011023 issn: 0005-1179 databaseCode: BENPR dateStart: 20230101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: Springer Nature Consortium list (Orbis Cascade Alliance) customDbUrl: eissn: 1608-3032 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011023 issn: 0005-1179 databaseCode: RSV dateStart: 20010101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLbYxgEOvBGDMeXACRSpbZK2OQLbQAKmapvQxKVqHkU7sKFtwN8n6WPjeYBLpahWVDlubdef_QGcaOEEnnIolq5gmCapwoI7AuuEu6H0mZvwrFH4Nuh2w-GQR0Uf96xEu5clyexLnfOOUNvTawzItfPuHGZtpwI14-1Cy9fQ698vSgd2FkEe8zJsxYtS5o9bfHZGywjzS1E08zWdzX895RZsFKElOs9tYRtW9HgH1j8MHDSru8WU1tkuXA3eJthEm48atXJiehTlcK0nI41GY2SEkcUM2WWUU88g--cWtbTFoheArz0YdNqDy2tcECtgSVx3jhNKaOBR3-dU-4HyhCMz4mmamuRGMCGJSTool0oqxU1KRaROBPEUS6lKQo_sQ3U8GesDQD4RgU0qU0YUFb45jZSHiRvyRDLNGanDaang-DkfnxFnaQeh8TdV1aFRHkFcvEmzmJiYzDdhj-fU4axU-fL2r5sd_kn6CNYsj3yOZGxAdT590cewKl_no9m0CbWLdjfqNaFyE-CmhYf2zTViD83M9N4BiyXLUQ |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JTsMwEB0hQAIO7Iiy-gAXkEUS20l8QAhRNlGqHnrgFnkL6qEp0ELVj-IfsbNQFsGNA8doJEvOPM288WwAe0Z6UaA9ipUvGaYi1VhyT2IjuB-rkPmC543CjajZjO_ueGsCXqteGFdWWdnE3FDrnnJv5EfE-ubQur_AO3l4xG5rlMuuVis0CljcmNHQhmz94-u61e9-EFyct8-ucLlVACvi-wMsKKFRQMOQUxNGOpCeyrcu09Qye8mkIpZxU6600prbeIIoIyQJNEupFrGbc2At_hQlVuJywBF-T1q4KQgF22bYTVork6g-oa4h2aLfd8P6POaA_9kNjrntl3Rs7uUuFv7Z_1mE-ZJOo9MC_0swYbJlmPswZHEFLtvDHrac-t6g-igT3Y5CraIorWvlqJMhy4GRq4xyn61iwQ5y79OoblzFfVnWtgrtv7jIGkxmvcysAwqJjFzonDKiqQx57KU8Fn7MhWKGM1KDg0qZyUMxJCTJgytCk2-ar8FWpcCktBf9ZKy9GhxWEBiLfzxs4_fDdmHmqn3bSBrXzZtNmA0sQItizS2YHDw9m22YVi-DTv9pJ0cyguSPkfEGPJgoZg |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwEB1BQQgO7Iiy-sAJZJHEdhIfEaWAKFUkKtRbFC9BPZBWbYDfx87Ssh4QRysjK5qM5ZnMm_cATrRwAk85FEtXMEyTVGHBHYF1wt1Q-sxNeDEo3Am63bDf51Glczqp0e51S7KcabAsTVl-PlJppUFC7XyvCSbXct85zMbRPCxQi6O35frD47SNYHkJyvyXYWtetTV_3OLzxTTLNr80SIt7p7327zdeh9Uq5UQXZYxswJzONmHlAxGhWd1P2VsnW3Ddextik4U-adQqBetRVMK4no01GmTIGCOLJbLLqJSkQfaPLmppi1GvgGDb0Gtf9S5vcCW4gCVx3RwnlNDAo77PqfYD5QlHFoLUNDVFj2BCElOMUC6VVIqbUotInQjiKZZSlYQe2YFGNsz0LiCfiMAWmykjigqfh07Kw8QNeSKZ5ow04bR2djwqaTXiohwhNP7mqiYc1J8jrk7YJCYmV_NNOuQ5TTir3T97_Otme3-yPoalqNWOO7fdu31YtlLzJdjxABr5-EUfwqJ8zQeT8VERd-_o4NK3 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Two-Stage+Dynamic+Programming+in+the+Routing+Problem+with+Decomposition&rft.jtitle=Automation+and+remote+control&rft.au=Chentsov%2C+A.+G.&rft.au=Chentsov%2C+P.+A.&rft.date=2023-05-01&rft.pub=Pleiades+Publishing&rft.issn=0005-1179&rft.eissn=1608-3032&rft.volume=84&rft.issue=5&rft.spage=543&rft.epage=563&rft_id=info:doi/10.1134%2FS0005117923050053&rft.externalDocID=10_1134_S0005117923050053 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0005-1179&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0005-1179&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0005-1179&client=summon |