tailieunhanh - Dynamic capacitated maximal covering location problem by considering dynamic capacity

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. | Dynamic capacitated maximal covering location problem by considering dynamic capacity

TÀI LIỆU MỚI ĐĂNG