{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T11:25:37Z","timestamp":1771413937378,"version":"3.50.1"},"reference-count":25,"publisher":"American Institute of Aeronautics and Astronautics (AIAA)","issue":"3","funder":[{"DOI":"10.13039\/501100003626","name":"Defense Acquisition Program Administration","doi-asserted-by":"publisher","award":["KRIT-CT-22-064-00"],"award-info":[{"award-number":["KRIT-CT-22-064-00"]}],"id":[{"id":"10.13039\/501100003626","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["arc.aiaa.org"],"crossmark-restriction":true},"short-container-title":["Journal of Aerospace Information Systems"],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:p> This paper introduces a grouping and routing problem of multiple agents for cooperative missions. The introduced problem, referred to as the Vehicle Grouping and Routing Problem with Profits, aims to maximize the total reward obtained by conducting a multi-agent mission (e.g., cooperative reconnaissance) while reducing its makespan by appropriately grouping the agents and determining their routes under operational constraints (e.g., fuel, endurance). A mixed-integer linear programming formulation and a conservative column generation-based solution procedure for the problem are proposed. A case study with homogeneous and heterogeneous agents and numerical experiments involving a cooperative reconnaissance mission with multiple unmanned aerial vehicles demonstrate the validity of the proposed formulation and solution procedure. <\/jats:p>","DOI":"10.2514\/1.i011478","type":"journal-article","created":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T17:09:26Z","timestamp":1739207366000},"page":"163-176","update-policy":"https:\/\/doi.org\/10.2514\/aiaa_crossmarkpolicy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-Agent Grouping and Routing with Cooperative Tasks"],"prefix":"10.2514","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3048-2971","authenticated-orcid":false,"given":"Euihyeon","family":"Choi","sequence":"first","affiliation":[{"name":"Korea Advanced Institute of Science and Technology (KAIST)"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4971-5130","authenticated-orcid":false,"given":"Jaemyung","family":"Ahn","sequence":"additional","affiliation":[{"name":"Korea Advanced Institute of Science and Technology (KAIST)"}]}],"member":"1387","reference":[{"key":"r1","doi-asserted-by":"publisher","DOI":"10.2514\/1.C035473"},{"key":"r2","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2023.3234455"},{"key":"r3","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2008.4560207"},{"key":"r4","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2020.3029624"},{"key":"r5","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9707-1_16"},{"key":"r6","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2376-7"},{"key":"r7","doi-asserted-by":"publisher","DOI":"10.2514\/1.C036921"},{"key":"r8","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90192-C"},{"key":"r9","doi-asserted-by":"publisher","DOI":"10.1145\/2666003"},{"key":"r10","unstructured":"Gurobi Optimizer Reference Manual, Gurobi Optimization, 2023."},{"key":"r11","unstructured":"IBM ILOG CPLEX Optimization Studio CPLEX User\u2019s Manual, IBM Corporation, Dec.\u00a02022."},{"key":"r12","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2009.2022423"},{"key":"r13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.06.001"},{"key":"r14","doi-asserted-by":"publisher","DOI":"10.2514\/1.C032984"},{"key":"r15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594.ch10"},{"key":"r16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.04.059"},{"key":"r17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.03.045"},{"key":"r18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.10.023"},{"key":"r19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.12.064"},{"key":"r20","doi-asserted-by":"publisher","DOI":"10.2514\/1.A35632"},{"key":"r21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.07.020"},{"key":"r22","unstructured":"AhnJ. \u201cthe Generalized Location Routing Problem with Profits for Planetary Surface Exploration and Terrestrial Applications,\u201d Ph.D. Thesis,\u201d Massachusetts Inst. of Technology, Cambridge, MA, 2008."},{"key":"r23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.06.018"},{"key":"r24","doi-asserted-by":"publisher","DOI":"10.2514\/1.I011052"},{"key":"r26","series-title":"Army Unmanned Aircraft Systems Center of Excellence, Fort Rucker, AL","year":"2010"}],"container-title":["Journal of Aerospace Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arc.aiaa.org\/doi\/pdf\/10.2514\/1.I011478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T12:43:28Z","timestamp":1747053808000},"score":1,"resource":{"primary":{"URL":"https:\/\/arc.aiaa.org\/doi\/10.2514\/1.I011478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10.2514\/1.I011478"],"URL":"https:\/\/doi.org\/10.2514\/1.i011478","relation":{},"ISSN":["1940-3151","2327-3097"],"issn-type":[{"value":"1940-3151","type":"print"},{"value":"2327-3097","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"2024-05-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}