Abstract: The Multiple Depot Traveling Salesman Problem (MDTSP) is a variant of the NP-hard Traveling Salesman Problem (TSP) with more than one salesman to jointly visit all destinations, commonly ...
Abstract: Over the past few decades, significant progress has been made in the development of evolutionary techniques for solving optimization problems. As time has passed, these techniques have ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback