.png){kind=icon}
Return
Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(01)00260-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper compares the performance of genetic algorithms (GAs) on large-scale maximum expected coverage problems to other heuristic approaches. We focus our attention on a particular formulation with a nonlinear objective function to be optimized over a convex set. The solutions obtained by the best genetic algorithm are compared to Daskin's heuristic and the optimal or best solutions obtained by solving the corresponding integer linear programming (ILP) problems. We show that at least one of the GAs yields optimal or near-optimal solutions in a reasonable amount of time. (C) 2002 Elsevier Science B.V. All rights reserved.
Keywords:
genetic algorithms
location
integer programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveA Randomized Trial Comparing a Brief Meditation Retreat to a Vacation: Effects on Daily Well-Being
PREAI
ShareSaveShareSave
The queueing Maximal Availability Location Problem: A model for the siting of emergency vehicles
OAAI
OAAIShareSave
View more