{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T09:03:41Z","timestamp":1769763821995,"version":"3.49.0"},"reference-count":26,"publisher":"Vilnius University Press","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:p>We introduce a compact formulation for the fixed-destination multi-depot asymmetric travelling salesman problem (FD-mATSP). It consists of m salesmen distributed among D depots who depart from and return to their respective origins after visiting a set of customers. The proposed model exploits the multi-depot aspect of the problem by labelling the arcs to identify the nodes that belong to the same tour. Our experimental investigation shows that the proposed-two index formulation is versatile and effective in modelling new variations of the FD-mATSP compared with existing formulations. We demonstrate this by applying it for the solution of two important extensions of the FD-mATSP that arise in logistics and manufacturing environments.<\/jats:p>","DOI":"10.15388\/22-infor485","type":"journal-article","created":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T11:28:19Z","timestamp":1654082899000},"page":"671-692","source":"Crossref","is-referenced-by-count":6,"title":["A Two-Index Formulation for the Fixed-Destination Multi-Depot Asymmetric Travelling Salesman Problem and Some Extensions"],"prefix":"10.15388","author":[{"given":"Maichel M.","family":"Aguayo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco N.","family":"Avil\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhash C.","family":"Sarin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"6097","published-online":{"date-parts":[[2022,6,1]]},"reference":[{"key":"2022121916244222558_j_infor485_ref_001"},{"issue":"4","key":"2022121916244222558_j_infor485_ref_002","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1002\/net.3230220408","article-title":"The swapping problem","volume":"22","year":"1992","journal-title":"Networks"},{"issue":"1","key":"2022121916244222558_j_infor485_ref_003","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ejor.2011.07.020","article-title":"Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing","volume":"216","year":"2012","journal-title":"European Journal of Operational Research"},{"key":"2022121916244222558_j_infor485_ref_004","doi-asserted-by":"crossref","first-page":"105084","DOI":"10.1016\/j.cor.2020.105084","article-title":"Compact formulations for multi-depot routing problems: theoretical and computational comparisons","volume":"124","year":"2020","journal-title":"Computers & Operations Research"},{"key":"2022121916244222558_j_infor485_ref_005","volume-title":"Operations Research Proceedings 2013","year":"2014"},{"issue":"2","key":"2022121916244222558_j_infor485_ref_006","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.ejor.2017.07.056","article-title":"A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem","volume":"265","year":"2018","journal-title":"European Journal of Operational Research"},{"key":"2022121916244222558_j_infor485_ref_007","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.neucom.2013.07.051","article-title":"Urban bicycles renting systems: Modelling and optimization using nature-inspired search methods","volume":"135","year":"2014","journal-title":"Neurocomputing"},{"key":"2022121916244222558_j_infor485_ref_008"},{"key":"2022121916244222558_j_infor485_ref_009","volume-title":"Traveling Salesman Problem: Theory and Applications","year":"2010"},{"key":"2022121916244222558_j_infor485_ref_010"},{"key":"2022121916244222558_j_infor485_ref_011","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","year":"2008"},{"issue":"3","key":"2022121916244222558_j_infor485_ref_012","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1287\/trsc.2015.0631","article-title":"Intermediate facilities in freight transportation planning: a survey","volume":"50","year":"2016","journal-title":"Transportation Science"},{"issue":"3","key":"2022121916244222558_j_infor485_ref_013","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1016\/j.ejor.2005.03.008","article-title":"Integer linear programming formulations of multiple salesman problems and its variations","volume":"174","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"03","key":"2022121916244222558_j_infor485_ref_014","doi-asserted-by":"crossref","first-page":"66","DOI":"10.4236\/iim.2012.43010","article-title":"A survey on the vehicle routing problem and its variants","volume":"4","year":"2012","journal-title":"Intelligent Information Management"},{"issue":"2","key":"2022121916244222558_j_infor485_ref_015","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","article-title":"The traveling salesman problem: an overview of exact and approximate algorithms","volume":"59","year":"1992","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2022121916244222558_j_infor485_ref_016","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","article-title":"The vehicle routing problem: an overview of exact and approximate algorithms","volume":"59","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"2022121916244222558_j_infor485_ref_017"},{"key":"2022121916244222558_j_infor485_ref_018","volume-title":"MATEC Web of Conferences","volume":"81","year":"2016"},{"issue":"6","key":"2022121916244222558_j_infor485_ref_019","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1016\/j.orl.2007.02.001","article-title":"An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem","volume":"35","year":"2007","journal-title":"Operations Research Letters"},{"key":"2022121916244222558_j_infor485_ref_020","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cie.2014.10.029","article-title":"A literature review on the vehicle routing problem with multiple depots","volume":"79","year":"2015","journal-title":"Computers & Industrial Engineering"},{"key":"2022121916244222558_j_infor485_ref_021","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.compag.2017.01.015","article-title":"The milk collection problem with blending and collection points","volume":"134","year":"2017","journal-title":"Computers and Electronics in Agriculture"},{"issue":"2","key":"2022121916244222558_j_infor485_ref_022","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1080\/13675567.2019.1630374","article-title":"Multi-depot vehicle routing problem: a comparative study of alternative formulations","volume":"23","year":"2020","journal-title":"International Journal of Logistics Research and Applications"},{"key":"2022121916244222558_j_infor485_ref_023","volume-title":"The Traveling Salesman: Computational Solutions for TSP Applications","year":"1994"},{"key":"2022121916244222558_j_infor485_ref_024","volume-title":"The Vehicle Routing Problem","year":"2002"},{"key":"2022121916244222558_j_infor485_ref_025"},{"issue":"6","key":"2022121916244222558_j_infor485_ref_026","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1016\/j.tre.2009.04.012","article-title":"A reactive tabu search algorithm for the multi-depot container truck transportation problem","volume":"45","year":"2009","journal-title":"Transportation Research Part E: Logistics and Transportation Review"}],"container-title":["Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1260\/text","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1260\/text","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T06:38:27Z","timestamp":1671518307000},"score":1,"resource":{"primary":{"URL":"https:\/\/informatica.vu.lt\/doi\/10.15388\/22-INFOR485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":26,"alternative-id":["10.15388\/22-INFOR485"],"URL":"https:\/\/doi.org\/10.15388\/22-infor485","relation":{},"ISSN":["0868-4952","1822-8844"],"issn-type":[{"value":"0868-4952","type":"print"},{"value":"1822-8844","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}