**
Soumen Atta ^{1}, Priya Ranjan Sinha Mahapatra^{2}, Anirban Mukhopadhyay^{2}
**

**
^{1} Laboratoire des Sciences du Numérique de Nantes (LS2N), UMR 6004, UFR Sciences et Techniques, Université de Nantes, IMT Atlantique, 4 Rue Alfred
Kastler, Nantes 44307, France
^{2}Department of Computer Science and Engineering, University of Kalyani, Kalyani-741235, West Bengal, India
**

**
Email addresses: soumen.atta@univ-nantes.fr;soumen.atta@ls2n.fr;priya@klyuniv.ac.in;anirban@klyuniv.ac.in
**

The instances for the *multi-objective maximal covering location problem with customers' preferences* (MOMCLPCP) mentioned in this page are generated using the *maximal covering location problem* (MCLP) [1, 2] instances which are available at http://www.lac.inpe.br/~lorena/instancias.html. We have created 82 MOMCLPCP instances. The size of an instance is determined by the number of customers (*n*). Each instance of MOMCLPCP consists of *distance matrix* having size *n* × *n*, *demand vector* of size *n* × 1, and *preference matrix* having size *n* × *n*. These files are named as follows: *distanceMOMCLPCP#.txt*, *demandMOMCLPCP#.txt*, and *preferenceMOMCLPCP#.txt*, respectively, where *#* denotes the number of customers.

The obtained solutions for each of these 82 instances, along with their visualization, can be seen by clicking on the individual "Show Result" button in the following table.

Cite as: Soumen Atta, Priya Ranjan Sinha Mahapatra and Anirban Mukhopadhyay (2021). A multi-objective formulation of maximal covering location problem with customers’ preferences: Exploring Pareto optimality-based solutions. Expert Systems With Applications, Elsevier, Article 115830.

**
Click here to download all the instances as single zip file.
**

**References:**

[1] Lorena, L.A., Pereira, M.A.: A Lagrangean/Surrogate Heuristic for the Maximal Covering Location Problem Using Hillman's Edition. International Journal of Industrial Engineering 9, 57–67 (2002)

[2] Atta, S., Mahapatra, P.R.S., Mukhopadhyay, A.: Solving maximal covering location problem using genetic algorithm with local refinement. Soft Computing 22(12), 3891–3906 (2018)

*This page is maintained by Dr. Soumen Atta, PhD. *

This page was created on December 25, 2019.