{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T13:44:30Z","timestamp":1767015870383,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031478581"},{"type":"electronic","value":"9783031478598"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-47859-8_13","type":"book-chapter","created":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T17:02:34Z","timestamp":1699549354000},"page":"174-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reliable Production Process Design Problem: Compact MILP Model and\u00a0ALNS-Based Primal Heuristic"],"prefix":"10.1007","author":[{"given":"Roman","family":"Rudakov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9276-4128","authenticated-orcid":false,"given":"Daniil","family":"Khachai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1750-1368","authenticated-orcid":false,"given":"Yuri","family":"Ogorodnikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3555-0080","authenticated-orcid":false,"given":"Michael","family":"Khachay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,10]]},"reference":[{"key":"13_CR1","unstructured":"de Andrade, R.C.: Elementary shortest-paths visiting a given set of nodes (2013). http:\/\/www.din.uem.br\/sbpo\/sbpo2013\/pdf\/arq0242.pdf"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.ejor.2016.05.008","volume":"254","author":"RC de Andrade","year":"2016","unstructured":"de Andrade, R.C.: New formulations for the elementary shortest-path problem visiting a given set of nodes. Eur. J. Oper. Res. 254(3), 755\u2013768 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2016.05.008","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01585767","volume":"68","author":"E Balas","year":"1995","unstructured":"Balas, E., Fischetti, M., Pulleyblank, W.: The precedence-constraint asymmetric traveling salesman polytope. Math. Program. 68, 241\u2013265 (1995). https:\/\/doi.org\/10.1007\/BF01585767","journal-title":"Math. Program."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1287\/ijoc.13.1.56.9748","volume":"13","author":"E Balas","year":"2001","unstructured":"Balas, E., Simonetti, N.: Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study. INFORMS J. Comput. 13(1), 56\u201375 (2001). https:\/\/doi.org\/10.1287\/ijoc.13.1.56.9748","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1134\/S0081543816090054","volume":"295","author":"AG Chentsov","year":"2016","unstructured":"Chentsov, A.G., Khachai, M.Y., Khachai, D.M.: An exact algorithm with linear complexity for a problem of visiting megalopolises. Proc. Steklov Inst. Math. 295(1), 38\u201346 (2016). https:\/\/doi.org\/10.1134\/S0081543816090054","journal-title":"Proc. Steklov Inst. Math."},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Deng, C., Xiong, Y., Yang, L., Yang, Y.: A smoothing SAA method for solving a nonconvex multisource supply chain stochastic optimization model. Math. Probl. Eng. 2022 (2022). https:\/\/doi.org\/10.1155\/2022\/5617213","DOI":"10.1155\/2022\/5617213"},{"issue":"5","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1007\/s00170-016-8609-1","volume":"87","author":"R Dewil","year":"2016","unstructured":"Dewil, R., Vansteenwegen, P., Cattrysse, D.: A review of cutting path algorithms for laser cutters. Int. J. Adv. Manuf. Technol. 87(5), 1865\u20131884 (2016). https:\/\/doi.org\/10.1007\/s00170-016-8609-1","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Fan, Y., Schwartz, F., Vob, S., Woodruff, D.L.: Catastrophe insurance and flexible planning for supply chain disruption management: a stochastic simulation case study. Int. J. Prod. Res. (2023). https:\/\/doi.org\/10.1080\/00207543.2023.2176179","DOI":"10.1080\/00207543.2023.2176179"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556788.2018.1548015","volume":"35","author":"D Ferone","year":"2020","unstructured":"Ferone, D., Festa, P., Guerriero, F.: An efficient exact approach for the constrained shortest path tour problem. Optim. Methods Softw. 35(1), 1\u201320 (2020). https:\/\/doi.org\/10.1080\/10556788.2018.1548015","journal-title":"Optim. Methods Softw."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.cor.2016.04.002","volume":"74","author":"D Ferone","year":"2016","unstructured":"Ferone, D., Festa, P., Guerriero, F., Lagan\u00e0, D.: The constrained shortest path tour problem. Comput. Oper. Res. 74, 64\u201377 (2016). https:\/\/doi.org\/10.1016\/j.cor.2016.04.002","journal-title":"Comput. Oper. Res."},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Gomes, T., Marques, S., Martins, L., Pascoal, M., Tipper, D.: Protected shortest path visiting specified nodes (2015). https:\/\/doi.org\/10.1109\/RNDM.2015.7325218","DOI":"10.1109\/RNDM.2015.7325218"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Gomes, T., Martins, L., Ferreira, S., Pascoal, M., Tipper, D.: Algorithms for determining a node-disjoint path pair visiting specified nodes. Opt. Switching Netw. 23 (2017). https:\/\/doi.org\/10.1016\/j.osn.2016.05.002","DOI":"10.1016\/j.osn.2016.05.002"},{"key":"13_CR13","unstructured":"L. Gurobi Optimization: Gurobi optimizer reference manual (2021). https:\/\/www.gurobi.com\/documentation\/9.5\/refman\/index.html"},{"key":"13_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/b101971","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G Gutin","year":"2007","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Springer, Boston (2007)"},{"key":"13_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106365","volume":"142","author":"I Kalateh Ahani","year":"2020","unstructured":"Kalateh Ahani, I., Salari, M., Hosseini, S.M., Iori, M.: Solution of minimum spanning forest problems with reliability constraints. Comput. Ind. Eng. 142, 106365 (2020). https:\/\/doi.org\/10.1016\/j.cie.2020.106365","journal-title":"Comput. Ind. Eng."},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Karuppusamy, N.S., Kang, B.Y.: Minimizing airtime by optimizing tool path in computer numerical control machine tools with application of $$A^*$$ and genetic algorithms. Adv. Mech. Eng. 9(12), 1687814017737448 (2017). https:\/\/doi.org\/10.1177\/1687814017737448","DOI":"10.1177\/1687814017737448"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Khachai, D., Sadykov, R., Battaia, O., Khachay, M.: Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm. Eur. J. Oper. Res. (2023). https:\/\/doi.org\/10.1016\/j.ejor.2023.01.039","DOI":"10.1016\/j.ejor.2023.01.039"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1134\/S0081543817090127","volume":"299","author":"MY Khachai","year":"2017","unstructured":"Khachai, M.Y., Neznakhina, E.D.: Approximation schemes for the generalized traveling salesman problem. Proc. Steklov Inst. Math. 299(1), 97\u2013105 (2017). https:\/\/doi.org\/10.1134\/S0081543817090127","journal-title":"Proc. Steklov Inst. Math."},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-030-62867-3_15","volume-title":"Optimization and Applications","author":"M Khachay","year":"2020","unstructured":"Khachay, M., Kudriavtsev, A., Petunin, A.: PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem. In: Olenev, N., Evtushenko, Y., Khachay, M., Malkova, V. (eds.) OPTIMA 2020. LNCS, vol. 12422, pp. 196\u2013208. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62867-3_15"},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10472-019-09626-w","volume":"88","author":"M Khachay","year":"2020","unstructured":"Khachay, M., Neznakhina, K.: Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters. Ann. Math. Artif. Intell. 88(1), 53\u201369 (2020). https:\/\/doi.org\/10.1007\/s10472-019-09626-w","journal-title":"Ann. Math. Artif. Intell."},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-030-92121-7_17","volume-title":"Learning and Intelligent Optimization","author":"A Kudriavtsev","year":"2021","unstructured":"Kudriavtsev, A., et al.: The shortest simple path problem with\u00a0a\u00a0fixed number of\u00a0must-pass nodes: a\u00a0problem-specific branch-and-bound algorithm. In: Simos, D.E., Pardalos, P.M., Kotsireas, I.S. (eds.) LION 2021. LNCS, vol. 12931, pp. 198\u2013210. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92121-7_17"},{"key":"13_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105819","volume":"144","author":"S Martin","year":"2022","unstructured":"Martin, S., Magnouche, Y., Juvigny, C., Leguay, J.: Constrained shortest path tour problem: branch-and-price algorithm. Comput. Oper. Res. 144, 105819 (2022). https:\/\/doi.org\/10.1016\/j.cor.2022.105819","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"13_CR23","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.24.4.611","volume":"24","author":"TL Morin","year":"1976","unstructured":"Morin, T.L., Marsten, R.E.: Branch-and-bound strategies for dynamic programming. Oper. Res. 24(4), 611\u2013627 (1976)","journal-title":"Oper. Res."},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Ogorodnikov, Y., Rudakov, R., Khachay, D., Khachay, M.: A problem-specific branch-and-bound algorithm for the protected shortest simple path problem with must-pass nodes. IFAC-PapersOnLine 55, 572\u2013577 (2022). https:\/\/doi.org\/10.1016\/j.ifacol.2022.09.455","DOI":"10.1016\/j.ifacol.2022.09.455"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"C Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.: Euclidean TSP is NP-complete. Theor. Comput. Sci. 4, 237\u2013244 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455\u2013472 (2006). https:\/\/doi.org\/10.1287\/trsc.1050.0135","journal-title":"Transp. Sci."},{"issue":"5","key":"13_CR27","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1287\/opre.14.5.909","volume":"14","author":"JP Saksena","year":"1966","unstructured":"Saksena, J.P., Kumar, S.: The routing problem with \u2018k\u2019 specified nodes. Oper. Res. 14(5), 909\u2013913 (1966)","journal-title":"Oper. Res."},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.procir.2016.02.136","volume":"44","author":"R Salman","year":"2016","unstructured":"Salman, R., Carlson, J.S., Ekstedt, F., Spensieri, D., Torstensson, J., S\u00f6derberg, R.: An industrially validated CMM inspection process with sequence constraints. Procedia CIRP 44, 138\u2013143 (2016). https:\/\/doi.org\/10.1016\/j.procir.2016.02.136","journal-title":"Procedia CIRP"},{"issue":"2","key":"13_CR29","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.orl.2020.01.009","volume":"48","author":"R Salman","year":"2020","unstructured":"Salman, R., Ekstedt, F., Damaschke, P.: Branch-and-bound for the precedence constrained generalized traveling salesman problem. Oper. Res. Lett. 48(2), 163\u2013166 (2020). https:\/\/doi.org\/10.1016\/j.orl.2020.01.009","journal-title":"Oper. Res. Lett."},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Schilling, L., Seuring, S.: Linking the digital and sustainable transformation with supply chain practices. Int. J. Prod. Res. 1\u201325 (2023). https:\/\/doi.org\/10.1080\/00207543.2023.2173502","DOI":"10.1080\/00207543.2023.2173502"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.05.010","volume":"87","author":"SL Smith","year":"2017","unstructured":"Smith, S.L., Imeson, F.: GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem. Comput. Oper. Res. 87, 1\u201319 (2017). https:\/\/doi.org\/10.1016\/j.cor.2017.05.010","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47859-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T17:04:16Z","timestamp":1699549456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47859-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031478581","9783031478598"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47859-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/OPTIMA-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}