Evolutionary algorithm for an inventory location problem

6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper deals with minimizing the cost in a joint location-inventory model with a single supplier supplying to multiple capitated distribution centers. The distribution center faces stochatic demands from multiple retailers. The problem is to determine how to assign retailers to distribution center within the service level constraints. The costs considered include the transportation cost, inventory holding cost and ordering cost. We develop an adaptive realcoded genetic algorithm to solve the problem. We conduct few experiment runs to compare the performance of the proposed method with some existing methods which include the simple genetic algorithm, the column generation method and the greedy method. For the non-capacitated case, the method shows very promising results with respect to both time and quality of the solutions. Similarly for the capacitated case, where the column generation method cannot be applied, the model is also significantly better than all the other methods, especially when the problem size is big. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Chew, E. P., Lee, L. H., & Rajaratnam, K. (2007). Evolutionary algorithm for an inventory location problem. Studies in Computational Intelligence, 49, 613–628. https://doi.org/10.1007/978-3-540-48584-1_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free