Simulated Annealing–Golden section algorithm for the multiproduct replenishment problem with stochastic demand.
Guardado en:
| Autores: | , , |
|---|---|
| Formato: | artículo original |
| Estado: | Versión publicada |
| Fecha de Publicación: | 2010 |
| Descripción: | The joint replenishment problem (JRP) has been studied for over 30 years and there are both heuristic and exact algorithms to determine the frequency of orders and fundamental cycle; in recent years it has been considered the model with stochastic demand. If we assume a behavior of normal distribution for the demand, we may obtain a non linear mixed-integer programming for costs, for which only is reported one heuristic solving method. In this paper we propose a simulated annealing algorithm with golden section for one-dimensional search in order to solve the JRP considering a normal distribution demand. Its performance is compared with the reported heuristic method. The results showed that the new algorithm obtains lower costs. |
| País: | Portal de Revistas UCR |
| Institución: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Lenguaje: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/2124 |
| Acceso en línea: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/2124 |
| Palabra clave: | Multi-item inventory problem joint replenishment problem simulated annealing golden section Problemas de inventario multiproducto problema de reaprovisionamiento conjunto recocido simulado sección dorada |