Improved Golden-Section Algorithm for the Multi-Item Replenishment Problem
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.
| Main Authors: | , , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
Universidad Nacional Autónoma de México, Instituto de Ciencias Aplicadas y Tecnología
2012
|
| Online Access: | http://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S1665-64232012000300008 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|