.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
genetic algorithms
location
integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏A Randomized Trial Comparing a Brief Meditation Retreat to a Vacation: Effects on Daily Well-Being
PREAI
分享收藏
The queueing Maximal Availability Location Problem: A model for the siting of emergency vehicles
OAAI
OAAI分享收藏
查看更多内容