{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:41:17Z","timestamp":1773816077524,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030628666","type":"print"},{"value":"9783030628673","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62867-3_15","type":"book-chapter","created":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T08:05:11Z","timestamp":1604563511000},"page":"196-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["PCGLNS: A Heuristic Solver for the Precedence Constrained Generalized Traveling Salesman Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3555-0080","authenticated-orcid":false,"given":"Michael","family":"Khachay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5683-4862","authenticated-orcid":false,"given":"Andrei","family":"Kudriavtsev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2540-1305","authenticated-orcid":false,"given":"Alexander","family":"Petunin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,4]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1023\/A:1018939709890","volume":"86","author":"E Balas","year":"1999","unstructured":"Balas, E.: New classes of efficiently solvable Generalized Traveling Salesman Problems. Ann. Oper. Res. 86, 529\u2013558 (1999). https:\/\/doi.org\/10.1023\/A:1018939709890","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0278-6125(03)90018-5","volume":"22","author":"K Castelino","year":"2003","unstructured":"Castelino, K., D\u2019Souza, R., Wright, P.K.: Toolpath optimization for minimizing airtime during machining. J. Manuf. Syst. 22(3), 173\u2013180 (2003). https:\/\/doi.org\/10.1016\/S0278-6125(03)90018-5","journal-title":"J. Manuf. Syst."},{"issue":"1","key":"15_CR3","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."},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1134\/S0005117914040122","volume":"75","author":"A Chentsov","year":"2014","unstructured":"Chentsov, A.: Problem of successive megalopolis traversal with the precedence conditions. Autom. Remote Control 75(4), 728\u2013744 (2014). https:\/\/doi.org\/10.1134\/S0005117914040122","journal-title":"Autom. Remote Control"},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Chentsov, A., Khachay, M., Khachay, D.: Linear time algorithm for precedence constrained asymmetric Generalized Traveling Salesman Problem. IFAC-PapersOnLine 49(12), 651\u2013655 (2016). https:\/\/doi.org\/10.1016\/j.ifacol.2016.07.767. 8th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2016","DOI":"10.1016\/j.ifacol.2016.07.767"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"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\u20134830 (2018). https:\/\/doi.org\/10.1080\/00207543.2017.1421784","DOI":"10.1080\/00207543.2017.1421784"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Dewil, R., K\u00fc\u00e7\u00fcko\u01e7lu, I., Luteyn, C., Cattrysse, D.: A critical review of multi-hole drilling path optimization. Arch. Comput. Meth. Eng. 26(2), 449\u2013459 (2019). https:\/\/doi.org\/10.1007\/s11831-018-9251-x","DOI":"10.1007\/s11831-018-9251-x"},{"issue":"20","key":"15_CR9","doi-asserted-by":"publisher","first-page":"5965","DOI":"10.1080\/00207543.2014.895064","volume":"52","author":"R Dewil","year":"2014","unstructured":"Dewil, R., Vansteenwegen, P., Cattrysse, D.: Construction heuristics for generating tool paths for laser cutters. Int. J. Prod. Res. 52(20), 5965\u20135984 (2014). https:\/\/doi.org\/10.1080\/00207543.2014.895064","journal-title":"Int. J. Prod. Res."},{"key":"15_CR10","doi-asserted-by":"crossref","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","DOI":"10.1007\/s00170-016-8609-1"},{"issue":"6","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1080\/00207543.2014.959268","volume":"53","author":"R Dewil","year":"2015","unstructured":"Dewil, R., Vansteenwegen, P., Cattrysse, D., Laguna, M., Vossen, T.: An improvement heuristic framework for the laser cutting tool path problem. Int. J. Prod. Res. 53(6), 1761\u20131776 (2015). https:\/\/doi.org\/10.1080\/00207543.2014.959268","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti, M., Gonz\u00e1lez, J.J.S., Toth, P.: A branch-and-cut algorithm for the symmetric Generalized Traveling Salesman Problem. Oper. Res. 45(3), 378\u2013394 (1997). https:\/\/doi.org\/10.1287\/opre.45.3.378","journal-title":"Oper. Res."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Potvin, J.Y.: Handbook of Metaheuristics. International Series in Operations Research & Management Science, 3rd edn., vol. 272. Springer International Publishing, Heidelberg (2019)","DOI":"10.1007\/978-3-319-91086-4"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Ghilas, V., Demir, E., Van Woensel, T.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines. Comput. Oper. Res. 72(C), 12\u201330 (2016). https:\/\/doi.org\/10.1016\/j.cor.2016.01.018","DOI":"10.1016\/j.cor.2016.01.018"},{"key":"15_CR15","unstructured":"Gurobi Optimization, LLC: Gurobi optimizer reference manual (2020). http:\/\/www.gurobi.com"},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cor.2009.05.004","volume":"9","author":"G Gutin","year":"2010","unstructured":"Gutin, G., Karapetyan, D.: A memetic algorithm for the Generalized Traveling Salesman Problem. Nat. Comput. 9(1), 47\u201360 (2010). https:\/\/doi.org\/10.1016\/j.cor.2009.05.004","journal-title":"Nat. Comput."},{"key":"15_CR17","doi-asserted-by":"publisher","unstructured":"Helsgaun, K.: Solving the equality Generalized Traveling Salesman Problem using the Lin-Kernighan-Helsgaun algorithm. Math. Program. Comput. 7, 1\u201319 (2015). https:\/\/doi.org\/10.1007\/s12532-015-0080-8","DOI":"10.1007\/s12532-015-0080-8"},{"issue":"12","key":"15_CR18","doi-asserted-by":"publisher","first-page":"168781401773744","DOI":"10.1177\/1687814017737448","volume":"9","author":"NS Karuppusamy","year":"2017","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","journal-title":"Adv. Mech. Eng."},{"key":"15_CR19","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-93800-4_6","volume-title":"Optimization Problems and Their Applications","author":"M Khachay","year":"2018","unstructured":"Khachay, M., Neznakhina, K.: Towards tractability of the Euclidean Generalized Traveling Salesman Problem in grid clusters defined by a grid of bounded height. In: Eremeev, A., Khachay, M., Kochetov, Y., Pardalos, P. (eds.) OPTA 2018. CCIS, vol. 871, pp. 68\u201377. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93800-4_6"},{"issue":"1","key":"15_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":"15_CR21","unstructured":"Kudriavtsev, A., Khachay, M.: PCGLNS: adaptive heuristic solver for the precedence constrained GTSP (2020). https:\/\/github.com\/AndreiKud\/PCGLNS\/"},{"issue":"3","key":"15_CR22","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1080\/00207543.2017.1401746","volume":"56","author":"T Makarovskikh","year":"2018","unstructured":"Makarovskikh, T., Panyukov, A., Savitskiy, E.: Mathematical models and routing algorithms for economical cutting tool paths. Int. J. Prod. Res. 56(3), 1171\u20131188 (2018). https:\/\/doi.org\/10.1080\/00207543.2017.1401746","journal-title":"Int. J. Prod. Res."},{"key":"15_CR23","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. Theoret. Comput. Sci. 4, 237\u2013244 (1977). https:\/\/doi.org\/10.1016\/0304-3975(77)90012-3","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR24","unstructured":"Punnen, A.P., Gutin, G., Punnen, A.P., (eds.): The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, 1 edn., vol. 12. Springer, New York (2002)"},{"issue":"2","key":"15_CR25","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1299\/jamdsm.1.272","volume":"1","author":"JA Qudeiri","year":"2007","unstructured":"Qudeiri, J.A., Yamamoto, H., Ramli, R.: Optimization of operation sequence in CNC machine tools using genetic algorithm. J. Adv. Mech. Des. Syst. Manuf. 1(2), 272\u2013282 (2007). https:\/\/doi.org\/10.1299\/jamdsm.1.272","journal-title":"J. Adv. Mech. Des. Syst. Manuf."},{"issue":"1","key":"15_CR26","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s13676-012-0010-0","volume":"1","author":"R Roberti","year":"2012","unstructured":"Roberti, R., Toth, P.: Models and algorithms for the asymmetric traveling salesman problem: an experimental comparison. EURO J. Transp. Logistics 1(1), 113\u2013133 (2012). https:\/\/doi.org\/10.1007\/s13676-012-0010-0","journal-title":"EURO J. Transp. Logistics"},{"key":"15_CR27","doi-asserted-by":"publisher","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. 6th CIRP Conference on Assembly Technologies and Systems (CATS)","DOI":"10.1016\/j.procir.2016.02.136"},{"issue":"2","key":"15_CR28","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."},{"issue":"1","key":"15_CR29","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.orl.2004.03.007","volume":"33","author":"SC Sarin","year":"2005","unstructured":"Sarin, S.C., Sherali, H.D., Bhootra, A.: New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints. Oper. Res. Lett. 33(1), 62\u201370 (2005). https:\/\/doi.org\/10.1016\/j.orl.2004.03.007","journal-title":"Oper. Res. Lett."},{"key":"15_CR30","unstructured":"Shaw, P.: A new local search algorithm providing high quality solutions to vehicle routing problems (1997)"},{"key":"15_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-030-62867-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T00:34:18Z","timestamp":1619224458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62867-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030628666","9783030628673"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62867-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 November 2020","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":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=optima-2020","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":"60","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":"2","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":"35% - 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.25","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.23","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}