Please use this identifier to cite or link to this item:
|Title:||Two composite methods for soft drink distribution problem||Authors:||Zeng, L.
Bin packing problem
Generalized crossing method
Vehicle routing problem
|Issue Date:||May-2008||Citation:||Zeng, L., Ong, H.L., Ng, K.M., Liu, S.B. (2008-05). Two composite methods for soft drink distribution problem. Advances in Engineering Software 39 (5) : 438-443. ScholarBank@NUS Repository.||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. © 2007 Elsevier Ltd. All rights reserved.||Source Title:||Advances in Engineering Software||URI:||http://scholarbank.nus.edu.sg/handle/10635/50749||ISSN:||09659978|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 28, 2018
WEB OF SCIENCETM
checked on Dec 31, 2018
checked on Oct 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.