haku: @indexterm ALGORITHMS / yhteensä: 403
viite: 200 / 403
| Tekijä: | Husban, A. |
| Otsikko: | An exact solution method for the MTSP |
| Lehti: | Journal of the Operational Research Society
1989 : MAY, VOL. 40:5, p. 461-469 |
| Asiasana: | TRAVELLING SALESMAN PROBLEM BRANCH AND BOUND METHODS ALGORITHMS PROBLEM SOLVING |
| Kieli: | eng |
| Tiivistelmä: | A new mathematical formulation for the multi-travelling salesman problem is presented which can be easily extended to the version of the problem with a variable number of salesmen. The multi-travelling salesman problem formulation is modified, and a branch-and bound algorithm for solving this problem exactly is developed. The significance of this procedure is that it does not need to transform the problem into a single travelling salesman problem, which has been the case in the dominant algorithms for solving the above problem. Computational experience shows that as the number of salesmen increases for a fixed number of cities to be visited, the time required to solve the problem decreases markedly. |
SCIMA