Abstract
In this paper, we deal with a special version of the set covering problem, which consists in finding the minimum number of service centres providing specialized services for all customers (or larger units, such as urban areas) within a reasonable distance given by a threshold. If a suitable threshold is found that makes it possible to determine a feasible solution of the task, the task is transformed into a general set covering problem. However, this has a combinatorial nature and, because it belongs to the class of NP-hard problems, for a large instance of the problem, it cannot be used to find the optimal solution in a reasonable amount of time. In the paper, we present a solution by means of two stochastic heuristic methods - genetic algorithms and simulated annealing – and, using a test instance from OR-Library, we present the parameter settings of both methods and the results achieved.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 11, 1069–1072 (1990)
Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94, 392–404 (1996)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
Goldberg, D.E.: The Design of Innovation (Genetic Algorithms and Evolutionary Computation). Kluwer Academic Publishers, Dordrecht (2002)
Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht (2002)
Lessing, L., Dumitrescu, I., Stützle, T.: A comparison between ACO algorithms for the set covering problem. In: Dorigo, M. (ed.) ANTS 2004. Lecture Notes in Computer Science, vol. 3172, pp. 1–12. Springer-Verlag, Berlin (2004)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Berlin (1996)
Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Berlin (2002)
Reeves, C.R.: Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford (1993)
Šeda, M., Roupec, J., Šedová, J.: Transportation problem and related tasks with application in agriculture. Int. J. Appl. Math. Inf. 8, 26–33 (2014)
Wolpert, D.H., McReady, W.G.: No Free Lunch Theorems for Optimization. IEEE Trans. Evol. Comput. 1, 67–82 (1997)
Zelinka, I., Snášel, V., Abraham, A. (eds.): Handbook of Optimization: From Classical to Modern Approach. Berlin. Springer, Berlin (2013)
Matousek, R.: HC12: the principle of CUDA implementation. In: Proceedings of 16th International Conference on Soft Computing – MENDEL 2010. Mendel series vol. 2010, pp. 303–308, Brno (2010), ISSN: 1803-3814
Matousek, R., Zampachova, E.: Promissing GAHC and HC12 algorithms in global optimization tasks. J. Optim. Methods Softw. 26(3), 405–419 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Šeda, M., Šeda, P. (2015). A Minimisation of Network Covering Services in a Threshold Distance. In: Matoušek, R. (eds) Mendel 2015. ICSC-MENDEL 2016. Advances in Intelligent Systems and Computing, vol 378. Springer, Cham. https://doi.org/10.1007/978-3-319-19824-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-19824-8_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19823-1
Online ISBN: 978-3-319-19824-8
eBook Packages: EngineeringEngineering (R0)