Solving maximal covering location problem using genetic algorithm with local refinement

标题
Solving maximal covering location problem using genetic algorithm with local refinement
作者
关键词
Facility location problem, Covering location problem, Maximal covering location problem (MCLP), Genetic algorithm (GA), Local refinement
出版物
SOFT COMPUTING
Volume 22, Issue 12, Pages 3891-3906
出版商
Springer Nature
发表日期
2017-04-20
DOI
10.1007/s00500-017-2598-3

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now