|
|
|
Sílvia de Castro Pereira, Eduardo J. Solteiro Pires and Paulo B. de Moura Oliveira
A new algorithm based on the ant colony optimization (ACO) method for the multiple traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP. This paper addresses the problem of solving the mTSP while considering several salesmen and keepin...
ver más
|
|
|