Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Similars in SciELO
Share
Journal of applied research and technology
On-line version ISSN 2448-6736Print version ISSN 1665-6423
Abstract
HERNANDEZ, S.; FLORES, I. and VAZQUEZ, J.A.. Improved Golden-Section Algorithm for the Multi-Item Replenishment Problem. J. appl. res. technol [online]. 2012, vol.10, n.3, pp.388-397. ISSN 2448-6736.
This paper presents a procedure for solving instances of the joint replenishment problem using the golden-section method. The algorithm includes an iterative method for obtaining a narrowing search range for the continuous variable in order to carry out less iterations. We studied the behavior of the algorithm experimentally and made comparisons with the heuristic technique known as RAND, solving randomly-generated problems. The results showed that the golden-section algorithm with the proposed improvements obtains the optimum solution for up to 100% of the problems solved, it is very stable when faced with the increase in the number of products in the problem and the runtime is notably competitive. The procedure is easy to implement and useful for professionals working in planning.
Keywords : line search methods; golden section; inventory management; joint replenishment.