Utilization of Genetic Algorithm in Allocating Goods to Shop Shelves

Kazuhiro Takeyasu, Yuki Higuchi


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.

Full Text:


DOI: https://doi.org/10.5430/bmr.v5n4p1


  • There are currently no refbacks.

Business and Management Research
ISSN 1927-6001 (Print)   ISSN 1927-601X (Online)

Copyright © Sciedu Press 
To make sure that you can receive messages from us, please add the 'Sciedupress.com' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.