A heuristic algorithm for the period vehicle routing problem |
| |
Authors: | C.C.R. Tan J.E. Beasley |
| |
Affiliation: | Imperial College of Science and Technology, London, UK |
| |
Abstract: | In this paper we consider the period vehicle routing problem, which is the problem of designing routes for delivery vehicles to meet customer service level requirements (not all customers require delivery on every day in the period). A heuristic algorithm, based upon the daily vehicle routing algorithm of Fisher and Jaikumar, is presented and computational results are given for test problems drawn from the literature. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|