Browse > Article
http://dx.doi.org/10.7232/JKIIE.2011.37.1.001

Endosymbiotic Evolutionary Algorithm for the Combined Location Routing and Inventory Problem with Budget Constrained  

Song, Seok-Hyun (Department of Operations Research, Korea National Defense University)
Lee, Sang-Heon (Department of Operations Research, Korea National Defense University)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.37, no.1, 2011 , pp. 1-9 More about this Journal
Abstract
This paper presents a new method that can solve the integrated problem of combined location routing and inventory problem (CLRIP) efficiently. The CLRIP is used to establish facilities from several candidate depots, to find the optimal set of vehicle routes, and to determine the inventory policy in order to minimize the total system cost. We propose a mathematical model for the CLRIP with budget constrained. Because this model is a nonpolynomial (NP) problem, we propose a endosymbiotic evolutionary algorithm (EEA) which is a kind of symbiotic evolutionary algorithm (SEA). The heuristic method is used to obtaining the initial solutions for the EEA. The experimental results show that EEA perform very well compared to the existing heuristic methods with considering inventory control decisions.
Keywords
Combined Location Routing and Inventory Problem(CLRIP); Endosymbiotic Evolutionary Algorithm(EEA); Symbiotic Evolutionary Algorithm(SEA);
Citations & Related Records
연도 인용수 순위
  • Reference
1 Perl, J. and Daskin, M. S. (1985), A warehouse location-routing problem, Transportation Research, 19, 381-396.
2 Potter, M. A. (1997), The Design and Analysis of a Computational Model of Cooperative Coevolution, Ph.D. dissertation, George Mason University.
3 Tuzun, D. and Burke, L. I. (1999), A Two-Phase Tabu Search Approach to the Location Routing Problem, European Journal of Operational Research, 116, 87-99.   DOI   ScienceOn
4 Koza, J. R. (1992), Genetic Programming, The MIT Press, Cambridge, Massachusetts.
5 Laporte, G., Louveaux, F., and Mercure, H. (1989), Models and Exact Solutions for a Class of Stochastic Location-Routing Prblems, European Journal of Operational Research, 39, 71-78.   DOI   ScienceOn
6 Davidor, Y. (1991), A naturally occurring niche and species phenomenon : the model and first results, Proceedings 4th International Conference on Genetic Algorithms, San, 257-263.
7 Laporte, G. and Nobert, Y. (1981), An Exact Algorithm for Minimizing Routing and Operating Costs in Depot Location, European Journal of Operational Research, 6, 224-226.   DOI   ScienceOn
8 Liu, S. C. and Lee, S. B. (2003), A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration, International Journal of Advanced Manufacturing Technology, 22, 941-950.   DOI   ScienceOn
9 Moriarty, D. E. and Miikkulainen, R. (1997), Forming neural networks through efficient and adaptive coevolution, Evolutionary Computation, 5, 373-399.   DOI   ScienceOn
10 Drezner, Z. and Wesolowsky, G. O. (1982), A trajectory approach for the round-trip location problem, Transportation Science, 16, 56-66.   DOI   ScienceOn
11 Hadely, G. and Whitin, T. (1963), Analysis of inventory systems, Prentice Hall, Englewood Cliffs.
12 Kim, J. Y., Kim, Y., and Kim, Y. K. (2001), An endosymbiotic evolutionary algorithm for optimization, Applied Intelligence, 15, 117-130.   DOI   ScienceOn
13 Kim, J. Y., Kim, Y. K., and Sin, T. H. (2000), Analysis of Partnering Strategies in Symbiotic Evolutionary Algorithms, The Korean Operations Research and Management Science Society, 25(4), 67-80.
14 Burness, R. C. and White, J. A. (1976), The traveling salesman location problem, Transportation Science, 10, 348-360.   DOI   ScienceOn
15 Bednar, L. and Strohmeier, E. (1979), Lager standortoptimierung und Fuhrparkeinsatzplanung in der Konzumguter-Industrie, Zeitschrift fur Operations Research, 23, 89-104.
16 Bull, L. and Fogarty, T. C. (1995), Artificial symbiogenesis, Artificial Life, 2, 269-292.   DOI   ScienceOn