Computational Geometry and Heuristic Approaches for Location Problems

Stať ve sborníku v databázi WoS či Scopus

en

In this paper we deal with two problems, whose common basis is to find the location of a service center for potential customers, but with different criterion function, determining what we consider in these tasks as optimal. While maximizing the coverage of an area by supermarkets, we choose for a new supermarket the location that minimises interaction (and thus competition) with existing supermarkets. On the contrary, if we want to provide the availability of certain services for all customers within a reasonable distance, and yet we know in advance where it would be possible to set up servicing points, the goal is to minimize their number. We show that the first type of problem can be solved in polynomial time using the Voronoi diagram, the task of the second type leads to the set covering problem, which is an NP-hard problem, and it is therefore necessary to solve larger instances of a task by heuristics. It is proposed using a genetic algorithm approach and special attention is paid to implementation of a repair operator for infeasible solutions generated by the operations of crossover and mutation.

location problem, Voronoi diagram, set covering, stochastic heuristics, genetic algorithm

2015-05-01

Atlantis Press

Phuket, Thailand

9789462520714

K. Chan, J. Yeh (eds.): Proceedings of the International Conference of Electrical, Automation and Mechanical Engineering EAME 2015

545–549

5