Utilization of Genetic Algorithm in Allocating Goods to Shop Shelves

Kazuhiro Takeyasu and Yuki Higuchi

Business and Management Research, 2016, vol. 5, issue 4, 1-13

Abstract: 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 a 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 allows goods to be allocated in multiple shelves and introduce the concept of sales profits and sales probabilities. Expansion of shelf position is executed. Optimization in allocating goods to shop shelves is investigated. Utilizing genetic algorithm, optimum solution is pursued and verified by a numerical example. Various patterns of problems must be examined hereafter.

Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciedupress.com/journal/index.php/bmr/article/download/10335/6285 (application/pdf)
http://www.sciedupress.com/journal/index.php/bmr/article/view/10335 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:jfr:bmr111:v:5:y:2016:i:4:p:1-13

Access Statistics for this article

Business and Management Research is currently edited by Simon Lee

More articles in Business and Management Research from Business and Management Research, Sciedu Press
Bibliographic data for series maintained by Simon Lee ().