A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage


KARASAKAL E. , Silav A.

TOP, cilt.24, ss.206-232, 2016 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 24 Konu: 1
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1007/s11750-015-0386-8
  • Dergi Adı: TOP
  • Sayfa Sayıları: ss.206-232

Özet

In this study, we present a bi-objective facility location model that considers both partial coverage and service to uncovered demands. Due to limited number of facilities to be opened, some of the demand nodes may not be within full or partial coverage distance of a facility. However, a demand node that is not within the coverage distance of a facility should get service from the nearest facility within the shortest possible time. In this model, it is assumed that demand nodes within the predefined distance of opened facilities are fully covered, and after that distance the coverage level decreases linearly. The objectives are defined as the maximization of full and partial coverage, and the minimization of the maximum distance between uncovered demand nodes and their nearest facilities. We develop a new multi-objective genetic algorithm (MOGA) called modified SPEA-II (mSPEA-II). In this method, the fitness function of SPEA-II is modified and the crowding distance of NSGA-II is used. The performance of mSPEA-II is tested on randomly generated problems of different sizes. The results are compared with the solutions of the most well-known MOGAs, NSGA-II and SPEA-II. Computational experiments show that mSPEA-II outperforms both NSGA-II and SPEA-II.