Combined genetic algorithm for capacitated p-median problem

This paper presents specific way to construct a genetic algorithm for solving capacitated p-median problem and compares it to another approaches used in another publications. Capacitated p-median problem is a well-known NP-hard problem and therefore it is unpractical to solve it whit exact methods. Genetic algorithms proved themselves as a valid method for this kind of problems and they offer many strategies to their construction so it is useful to make an effort to improve genetic algorithms in order to get even better results. Modifications are often achieved through combining whit different kind of heuristics. One such specific algorithm is proposed based on previous experience and tested on several benchmark instances.