期刊名称：International Journal of Business Administration
印刷版ISSN：1923-4007
电子版ISSN：1923-4015
出版年度：2019
卷号：10
期号：3
页码：104-146
DOI：10.5430/ijba.v10n3p104
出版社：Sciedu Press
摘要：How to allocate goods in shop shelves makes great influence to sales amount. Searching best fit allocation of goods to shelves is a kind of combinatorial problem. This becomes a problem of integer programming and utilizing genetic algorithm may be an effective method. Reviewing past researches, there are few researches made on this. Formerly, we have presented papers concerning optimization in allocating goods to shop shelves utilizing genetic algorithm. In those papers, the problem that goods were not allowed to allocate in multiple shelves and the problem that goods were allowed to allocate in multiple shelves were pursued. In this paper, we examine the problem that does not allow goods to be allocated in multiple shelves and introduce the concept of sales profits and sales probabilities. Expansion of shelf is executed. Optimization in allocating goods to shop shelves is investigated. An application to the convenience store with POS sales data of cup noodles is executed. Utilizing genetic algorithm, optimum solution is pursued and verified by a numerical example. Comparison with other past papers was executed. Various patterns of problems must be examined hereafter.
