haku: @indexterm Vehicle scheduling / yhteensä: 130
viite: 42 / 130
Tekijä: | Labbe, M. Laporte, G. Mercure, H. |
Otsikko: | Capacitated vehicle routing on trees. |
Lehti: | Operations Research
1991 : JUL-AUG, VOL. 39:4, p. 616-622 |
Asiasana: | VEHICLE SCHEDULING |
Kieli: | eng |
Tiivistelmä: | The Capacitated Vehicle Routing Problem on Trees /CVRPT/ consists of determining vehicle collection routes starting and ending at the depot so that: the weight associated with any given vertex is collected by exactly one vehicle; the sum of all weights collected by a vehicle does not exceed its capacity; a linear combination of the number of vehicles and of the total distances travelled by these vehicles are minimized. A good lower bound for the problem was derived by generalizing the Martello and Toth bin packing bound. A linear upper bounding procedure that generally produces solution values within 5 p.c. of the optimum was also developed. |
SCIMA