Dynamic capacitated maximal covering location problem by considering dynamic capacity

被引：8

作者：

Bagherinejad, Jafar ^{[1
]}

Shoeib, Mahnaz ^{[2
]}

机构：

[1] Alzahra Univ, Dept Ind Engn, Tehran, Iran

[2] Alzahra Univ, Ind Engn, Tehran, Iran

来源：

INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS | 2018年 / 9卷 / 02期

关键词：

Capacitated MCLP; Multi-period MCLP; Dynamic capacity; Genetic algorithm; Bee algorithm; FACILITY LOCATION; GENETIC ALGORITHM; OPTIMIZATION; UNCERTAIN; SEARCH; MODEL;

D O I：

10.5267/j.ijiec.2017.5.004

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

Capacitated maximal covering location problems (MCLP) have considered capacity constraint of facilities but these models have been studied in only one direction. In this paper, capacitated MCLP and dynamic MCLP are integrated with each other and dynamic capacity constraint is considered for facilities. Since MCLP is NP-hard and commercial software packages are unable to solve such problems in a rational time, Genetic algorithm (GA) and bee algorithm are proposed to solve this problem. In order to achieve better performance, these algorithms are tuned by Taguchi method. Sample problems are generated randomly. Results show that GA provides better solutions than bee algorithm in a shorter amount of time. (C) 2018 Growing Science Ltd. All rights reserved

引用

页码：249 / 264

页数：16

共 45 条

[1]

Afrabandpei F., 2012, J OPTIMIZATION IND E, V10, P35

[2]

[Anonymous], INT J COMPUT APPL, DOI DOI 10.5120/12636-9343

[3]

[Anonymous], 2011, INTELLIGENT PRODUCTI

[4] Facility location dynamics: An overview of classifications and applications [J].