Abstract
The multiple weapons to multiple targets assignment problem can be seen as a multiple traveling salesmen problem with moving targets (MTSPMT), where the weapons play the role of the salesmen, and the cities to be visited are the targets. Approaches in the literature for the MTSPMT include complexity results and approximation algorithms, where additional restrictions on the targets’ trajectories and velocities are imposed. Our approach is based on a discretization of time, which leads to large-scale integer linear programming problems, that need to be solved in very short time. Our computational studies on a set of test problems demonstrate, that exact algorithms are able to solve instances of moderate size and that they improve solutions from a fast and simple first come, first served heuristic.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
