haku: @author Desprochers, M. / yhteensä: 1
viite: 1 / 1
« edellinen | seuraava »
| Tekijä: | Li, C.-L. Simchi-Levi, D. Desprochers, M. |
| Otsikko: | On the distance constrained vehicle routing problem |
| Lehti: | Operations Research
1992 : JUL-AUG, VOL. 40:4, p. 790-799 |
| Asiasana: | VEHICLE SCHEDULING ROUTING PROBLEM HEURISTIC METHODS TRAVELLING SALESMAN PROBLEM OPTIMIZATION |
| Kieli: | eng |
| Tiivistelmä: | The vehicle routing problem with constraints on the total distance traveled by each vehicle is analyzed. The worst case relationship between optimal solutions for the two possible objective functions, i.e., minimize the total distance traveled (MD) and minimize the number of vehicles used (MV) is demonstrated. A tour partitioning heuristic for the problem is also developed and it is showed that the heuristic has a satisfactory worst case performance when the number of vehicles used is relatively small. In general, however, it is proved that the heuristic can perform arbitrarily badly even if we optimally partition an optimal initial traveling salesman tour. |
« edellinen | seuraava »
SCIMA