To read this content please select one of the options below:

A genetic algorithm for supermarket location problem

Mohammed Alnahhal (Transport Systems and Logistics, Duisburg-Essen University, Duisburg, Germany)
Bernd Noche (Transport Systems and Logistics, Duisburg-Essen University, Duisburg, Germany)

Assembly Automation

ISSN: 0144-5154

Article publication date: 2 February 2015




This purpose of this paper is to investigate the location problem of supermarkets, feeding by material the mixed model assembly lines using tow trains. It determines the number and the locations of these supermarkets to minimize transportation and inventory fixed costs of the system.


This is done using integer programming model and real genetic algorithm (RGA) in which custom chromosomes representation, two custom mating and two custom mutation operators were proposed.


The performance of RGA is very good since it gives results that are very close or identical to the optimal ones in reasonable CPU time.

Research limitations/implications

The study is applicable only if a group of supermarkets feed the same assembly line.


For the first time in supermarket location problem, limitation on availability of some areas for possible supermarkets ' locations and capacity of the supermarkets were taken into consideration.



Alnahhal, M. and Noche, B. (2015), "A genetic algorithm for supermarket location problem", Assembly Automation, Vol. 35 No. 1, pp. 122-127.



Emerald Group Publishing Limited

Copyright © 2015, Emerald Group Publishing Limited

Related articles