Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
569956 | Advances in Engineering Software | 2008 | 6 Pages |
Abstract
In this paper, we propose two methods for solving a real-life soft drink distribution problem. The objective of this problem is to minimize the total number of vehicles used. The proposed methods are composite procedures involving the solution of bin packing problems, and the application of an assignment-based procedure or a generalized crossing procedure, respectively for improvement. We apply the proposed composite procedures to a number of real-life problem instances. The computational results show that our methods are able to obtain better solutions than the methods proposed in the literature.
Related Topics
Physical Sciences and Engineering
Computer Science
Software
Authors
L. Zeng, H.L. Ong, K.M. Ng, S.B. Liu,