Abstract: The Traveling Salesman Problem (TSP) is a challenging combinatorial optimization problem classified as NP-hard. This paper investigates the performance of various meta-heuristic algorithms, ...

NASA’s Artemis program has hit a significant obstacle, forcing delays and raising urgent questions about its next steps. Engineers are trying to resolve technical challenges that could impact both ...

Abstract: The Moving-Target Traveling Salesman Problem (MT-TSP) seeks a shortest path for an agent that starts at a stationary depot, visits a set of moving targets exactly once, each within one of ...

GALESBURG, Ill. — Earlier this year, Galesburg city officials contracted a team of trained falcons to deal with the city’s decades-long crow infestation. This weekend, that contract is ending. For ...

Earlier this year, San Jose politicians announced they were targeting the thousands of abandoned shopping carts clogging creeks and blighting streets. Now the first data on a pilot program aimed at ...