Tests with two heuristic search strategies in the simulated annealing algorithm for an inventory problem
DOI:
https://doi.org/10.17533/udea.redin.11779Keywords:
metaheuristics, simulated annealing, inventory, experimental designAbstract
The problem in the results when implemented metaheuristics techniques to solve instances of the problem of multi-product replenishment is the deterioration of the quality of the solution. It was noted that the implementations have focused on the parameters of the algorithm paying little attention to the strategy to access the neighboring solution. In this paper, we study experimentally an implementation of Simulated Annealing algorithm exploring several combinations of parameters and also, two schemes for obtaining the neighbor solution by comparison with the RAND algorithm. A 2-factorial experimental design was constructed and the study was conducted over 2.000 randomly generated instances, the results show that under the same combinations of parameters, perturbing a variable at a time provides poor results, however, to access the neighbor solution taking into account families of products provides better results and Simulated Annealing algorithm behaves robust against the increase in the size of the problem.
Downloads
References
S. Goyal. “Determination of optimum packaging frequency for items jointly replenished”. Management Science. Vol. 21. 1974. pp. 436-443. DOI: https://doi.org/10.1287/mnsc.21.4.436
E. Silver. “A simple method of determining order quantities in joint replenishments under deterministic demand”. Management Science. Vol. 22. 1976. pp. 1351-1361. DOI: https://doi.org/10.1287/mnsc.22.12.1351
M. Khouja, S. Goyal. “A review of the joint replenishment problem literature: 1989–2005”. European Journal of Operational Research. Vol. 186. 2008. pp. 1- 16. DOI: https://doi.org/10.1016/j.ejor.2007.03.007
M. Kaspi, M. Rosenblatt. “An improvement of Silver’s algorithm for the joint replenishment problem”. IIE Transactions. Vol. 15. 1983. pp. 264-267. DOI: https://doi.org/10.1080/05695558308974644
A. Nilsson, A. Segersted, E. van der Sluis. “A new iterative heuristic to solve the joint replenishment problem using a spreadsheet technique”. International Journal of Production Economics. Vol. 108. 2007. pp. 399 - 405. DOI: https://doi.org/10.1016/j.ijpe.2006.12.022
A. Nisson, E. Silver. “A simple improvement on Silver’s heuristic for the joint replenishment problem”. Journal of the Operational Research Society. Vol. 59. 2008. pp. 1415-1421. DOI: https://doi.org/10.1057/palgrave.jors.2602446
M. Khouja, Z. Michalewicz, S. Satoskar. “A comparison between genetic algorithms and the RAND method for solving the joint replenishment problem”. Production, planning and control. Vol. 11. 2000. pp. 556-564. DOI: https://doi.org/10.1080/095372800414115
A. Olsen. “An evolutionary algorithm to solve the joint replenishment problem using direct grouping”. Computers and Industrial Engineering. Vol. 48. 2005. pp. 223-235. DOI: https://doi.org/10.1016/j.cie.2005.01.010
M. Yoo, L. Lin. “A new solution method for the joint replenishment problem”. International Journal of Manufacturing Technology and Management. Vol. 16. 2009. pp. 166 - 175. DOI: https://doi.org/10.1504/IJMTM.2009.021508
H. Hoos, T. Stützle. Stochastic local search: foundations and applications. 1a ed. Ed. SpringerVerlag. San Francisco, CA. 2005. pp. 61 - 74. DOI: https://doi.org/10.1016/B978-155860872-6/50019-6
S. Kirkpatrick, C. Gellat, M. Vecci. “Optimization by simulated annealing”. Science. Vol. 220. 1983. pp. 671-680. DOI: https://doi.org/10.1126/science.220.4598.671
R. Myers, D. Montgomery. Response surface methodology: process and product optimization using designed experiments. Ed. John Wiley & Sons. New Jersey. 2002. pp. 73 - 113.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2018 Revista Facultad de Ingeniería
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Revista Facultad de Ingeniería, Universidad de Antioquia is licensed under the Creative Commons Attribution BY-NC-SA 4.0 license. https://creativecommons.org/licenses/by-nc-sa/4.0/deed.en
You are free to:
Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material
Under the following terms:
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
NonCommercial — You may not use the material for commercial purposes.
ShareAlike — If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
The material published in the journal can be distributed, copied and exhibited by third parties if the respective credits are given to the journal. No commercial benefit can be obtained and derivative works must be under the same license terms as the original work.
Twitter