Two composite methods for soft drink distribution problem

Authors:
L. Zeng;H. L. Ong;K. M. Ng;S. B. Liu
Affiliations:
Department of Industrial and Systems Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260;Department of Industrial and Systems Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260;Department of Industrial and Systems Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260;Department of Industrial and Systems Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260
Venue:
Advances in Engineering Software
Year:
2008

Citing 8
Cited 0

Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the vehicle routing problem

Management Science
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
The vehicle routing problem

The vehicle routing problem
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
SavingsAnts for the Vehicle Routing Problem

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms

Proceedings of the 5th International Conference on Genetic Algorithms
Applying a hybrid ant colony system to the vehicle routing problem

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

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.