Please use this identifier to cite or link to this item:
Title: Modeling the vehicle routine problem for a soft drink distribution company
Authors: Cheong, Y.M.
Ong, H.L. 
Huang, H.C. 
Keywords: Column generation
Set-covering model
Tree search
Vehicle routing problem
Issue Date: May-2002
Citation: Cheong, Y.M.,Ong, H.L.,Huang, H.C. (2002-05). Modeling the vehicle routine problem for a soft drink distribution company. Asia-Pacific Journal of Operational Research 19 (1) : 17-34. ScholarBank@NUS Repository.
Abstract: In this paper, we present a modeling study of vehicle routing problem (VRP) for a soft drink distribution company and propose a method to solve it. The distribution problem is concerned with assigning a fixed fleet of heterogeneous vehicles to serve the customers at various districts. The proposed methodology consists of two phases. Phase I is used to assign a fixed fleet of vehicles to districts on a long-term basis. In Phase II, three methods are proposed to reroute the assigned vehicles to solve the daily VRP. Customer demand data over a 23-day period are used to evaluate the performance of the proposed methods. The results show that the proposed methods give a better solution to the current distribution problem.
Source Title: Asia-Pacific Journal of Operational Research
ISSN: 02175959
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.