Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic Algorithms and Grouping Problems
Genetic Algorithms and Grouping Problems
An evolutionary algorithm for the joint replenishment problem
An evolutionary algorithm for the joint replenishment problem
How to Solve It: Modern Heuristics
How to Solve It: Modern Heuristics
International Journal of Computer Applications in Technology
Expert Systems: The Journal of Knowledge Engineering
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
There has been much work in establishing a joint replenishment policy to minimize the total cost of inventory replenishment. Most of this work uses the indirect grouping method. Little research has been done with direct grouping methods. In this paper we develop an evolutionary algorithm (EA) that uses direct grouping to solve the joint replenishment problem (JRP). We test the EA and compare these results with results with the best available algorithm. The EA is shown to find a replenishment policy that incurs a lower total cost than the best available algorithm for some problem parameters.