This thesis presents a study on computer-aided vehicle routing for delivering goods.
During the peak demand season for the goods, we consider the vehicle routing problem where the number of vehicles and the distance required to serve demand points are minimized.
During the off-peak season, however, the vehicle assignment problem is considered instead, in which the objective is to assign demand points to days of the week in order to solve the resulting routing problem over the entire week.
The original Clarke and Wright algorithm for a vehicle routing problem was modified to fit the current needs, and the real world data for the problem have been obtained through field studies.
Computational results, as well as a discussion on expected benifits, are presented.