haku: @indexterm operational research / yhteensä: 1454
viite: 37 / 1454
| Tekijä: | Lau, H. C. Sim, M. Teo, K. M. |
| Otsikko: | Vehicle routing problem with time windows and a limited number of vehicles |
| Lehti: | European Journal of Operational Research
2003 : AUG, VOL. 148:3, p. 559-569 |
| Asiasana: | Operational research Routing problem Heuristic methods |
| Kieli: | eng |
| Tiivistelmä: | The paper introduces a variant of the vehicle routing problem with time windows where a limited number of vehicles is given (m-VRPTW). Under this scenario, a feasible solution is one that may contain either unserved customers and/or relaxed time windows. The authors provide a computable upper bound to the problem. To solve the problem, the authors propose a tabu search approach characterized by a holding list and a mechanism to force dense packing within a route. They also allow time windows to be relaxed by introducing the notion of penalty for lateness. Customer jobs are inserted based on a hierarchical objective function that captures multiple objectives. |
SCIMA