A genetic algorithm approach to solving the anti-covering location problem

A genetic algorithm approach to solving the anti-covering location problem

0.00 Avg rating0 Votes
Article ID: iaor20071622
Country: United Kingdom
Volume: 23
Issue: 5
Start Page Number: 251
End Page Number: 257
Publication Date: Nov 2006
Journal: Expert Systems
Authors:
Keywords: heuristics: genetic algorithms
Abstract:

In this paper we address the problem of locating a maximum weighted number of facilities such that no two are within a specified distance from each other. A natural process of evolution approach, more specifically a genetic algorithm, is proposed to solve this problem. It is shown that through the use of a commercially available spreadsheet-based genetic algorithm software package, the decision-maker with a fundamental knowledge of spreadsheets can easily set up and solve this optimization problem. Also, we report on our extensive computational experience using three different data sets.

Reviews

Required fields are marked *. Your email address will not be published.