haku: @author Srikanth, K. / yhteensä: 3
viite: 2 / 3
| Tekijä: | Gavish, B. Srikanth, K. |
| Otsikko: | An optimal solution method for large-scale multiple travelling salesmen problems. |
| Lehti: | Operations Research
1986 : SEP-OCT, VOL. 34:5, p. 698-717 |
| Asiasana: | TRAVELLING SALESMAN PROBLEM |
| Kieli: | eng |
| Tiivistelmä: | In the solution of delivery problems widely used the traveling salesman problem models. An efficient branch-and-bound based method is developed for solving the multiple traveling salesman problem. The algorithm was tested on 416 problems with up to 500 cities and 10 salesmen. Computational results are presented on different data sets and parameters in order to identify the major factors that influence the performance of the developed code. |
SCIMA