The Traveling Salesman Problem (TSP) is a prototypical NP-hard combinatorial optimisation challenge: given a set of locations and pairwise distances satisfying the triangle inequality, find the ...

Dr. James McCaffrey of Microsoft Research uses full code samples to detail an evolutionary algorithm technique that apparently hasn't been published before. The goal of a combinatorial optimization ...

The Multiple Traveling Salesman Problem (MTSP) is a canonical combinatorial optimisation challenge in which a fleet of salespeople must collectively visit a set of locations and return to a common ...