Loading...
  1. Simple search
  2. Search result
Search for: large-scale-dynamics
0.005 seconds
Total 1 records

      The large-scale dynamic maximal covering location problem

      , Article Mathematical and Computer Modelling ; Volume 57, Issue 3-4 , February , 2013 , Pages 710-719 ; 08957177 (ISSN) Zarandi, M. H. F ; Davari, S ; Sisakht, S. A. H ; Sharif University of Technology
      2013
      Abstract
      Most of the publications regarding the maxim covering location problem (MCLP) address the case where the decision is to be made for one period. In this paper, we deal with a rather untouched version of MCLP which is called dynamic MCLP (DMCLP). In order to solve this problem, a simulated annealing (SA) has been presented. The proposed solution algorithm is capable of solving problems with up to 2500 demand nodes and 200 potential facilities with a fair amount of exactness. Our experiments showed that the proposed approach finds solutions with errors less than one percent  
    Total 1 records