Soumen Atta
Faculty of Information Technology, University of Jyväskylä, P.O. Box 35 (Agora), FI-40014, Finland
Email address: soumen.s.atta@jyu.fi
The instances for the Capacitated Facility Location Problem with Service Distance and Outsourcing (CFLPSDO) mentioned in this page are generated using the maximal covering location problem (MCLP) [1,2,3] instances which are available at http://www.lac.inpe.br/~lorena/instancias.html. We have created 45 CFLPSDO instances. The size of an instance is determined by the number of customers or potential facility locations (n). Each instance of CFLPSDO consists of distance matrix having size n × n, demand vector of size n × 1, capacity matrix having size n × n, and external cost matrix having size n × 1.
Cite as: Soumen Atta, “Solving the Capacitated Facility Location Problem with Service Distance and Outsourcing Using a Customized Artificial Bee Colony Algorithm”, Evolutionary Intelligence, Vol. 18, 60, Springer, 2025. https://doi.org/10.1007/s12065-025-01042-w
Click here to download all the instances as a single zip file.
| Instance | Open facility set | Optimal Cost |
||
|---|---|---|---|---|
| n | p | s | ||
| 324 | 1 | 800 | {247} | 385975.63 |
| 324 | 2 | 800 | {155, 270} | 262645.35 |
| 324 | 3 | 800 | {62, 92, 287} | 179476.58 |
| 324 | 4 | 800 | { 56, 157, 206, 274} | 143959.67 |
| 324 | 1 | 1200 | {247} | 339219.56 |
| 324 | 2 | 1200 | {156, 260 } | 219898.57 |
| 324 | 3 | 1200 | {62, 156, 287} | 162285.95 |
| 324 | 1 | 1600 | {247} | 333280.43 |
| 324 | 2 | 1600 | {156, 260} | 217102.92 |
| 402 | 1 | 800 | {300} | 583780.20 |
| 402 | 2 | 800 | {159, 309} | 431580.17 |
| 402 | 3 | 800 | {67, 100, 339} | 281516.89 |
| 402 | 4 | 800 | {44, 96, 186, 340} | 221569.33 |
| 402 | 1 | 1200 | {285} | 501187.68 |
| 402 | 2 | 1200 | {159, 231} | 344198.02 |
| 402 | 3 | 1200 | {160, 318, 397} | 237514.11 |
| 402 | 1 | 1600 | {285} | 490274.15 |
| 402 | 2 | 1600 | {100, 228} | 336805.32 |
| 500 | 1 | 800 | {256} | 1089467.95 |
| 500 | 2 | 800 | {256, 353} | 851730.41 |
| 500 | 3 | 800 | {63, 285, 353} | 624074.15 |
| 500 | 4 | 800 | {37, 63, 290, 353} | 432569.39 |
| 500 | 1 | 1200 | {255} | 942353.41 |
| 500 | 2 | 1200 | {255, 459} | 608337.67 |
| 500 | 3 | 1200 | {63, 257, 353} | 429231.15 |
| 500 | 1 | 1600 | {159} | 898794.81 |
| 500 | 2 | 1600 | {254, 459} | 558576.03 |
| 708 | 1 | 800 | {325} | 1859239.74 |
| 708 | 2 | 800 | {325, 437} | 1531861.48 |
| 708 | 3 | 800 | {66, 342, 437} | 1220779.06 |
| 708 | 4 | 800 | {66, 99, 364, 437} | 939896.27 |
| 708 | 1 | 1200 | {310} | 1686408.71 |
| 708 | 2 | 1200 | {310, 642} | 1209424.56 |
| 708 | 3 | 1200 | {316, 393, 677} | 881533.04 |
| 708 | 1 | 1600 | {196} | 1631991.53 |
| 708 | 2 | 1600 | {309, 438} | 1076216.27 |
| 818 | 1 | 800 | {321} | 2529121.75 |
| 818 | 2 | 800 | {321, 493} | 2149136.47 |
| 818 | 3 | 800 | {66, 338, 493} | 1781763.79 |
| 818 | 4 | 800 | {66, 159, 360, 493} | 1443339.34 |
| 818 | 1 | 1200 | {310} | 2309668.38 |
| 818 | 2 | 1200 | {310, 673} | 1763862.52 |
| 818 | 3 | 1200 | {313, 454, 703} | 1377681.86 |
| 818 | 1 | 1600 | {196} | 2225709.61 |
| 818 | 2 | 1600 | {339, 493} | 1581948.21 |
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)
[3] S. Atta: An improved harmony search algorithm using opposition-based learning and local search for solving the maximal covering location problem. Engineering Optimization, 1–20 (2023).
This page is maintained by Dr. Soumen Atta, PhD.
This page was created on June 17, 2024.