>
Fa   |   Ar   |   En
   A cross entropy algorithm for continuous covering location problem  
   
نویسنده hosseininezhad javad ,jabalameli mohammad saeed ,pesaran haji abbas marjan
منبع journal of industrial and systems engineering - 2018 - دوره : 11 - شماره : 3 - صفحه:247 -260
چکیده    Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance. this paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (minlp) for covering location model. the model is solved to determine the best covering value. also, this paper proposes a cross entropy (ce) algorithm considering multivariate normal density function for solving large scale problems. for showing capabilities of the proposed algorithm, it is compared with gams. finally, a numerical example and a case study are expressed to illustrate the proposed model. for case study, tehran's special drugstores consider and determine how to locate 7 more drugstores to cover all 22 districts in tehran.
کلیدواژه Continuous covering location problem (CCLP) ,uncertainty ,cross entropy (CE)
آدرس k. n. toosi university of technology, department of industrial engineering, Iran, iran university of science and technology, school of industrial engineering, Iran, k. n. toosi university of technology, department of industrial engineering, Iran
پست الکترونیکی marjan.pesaran@gmail.com
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved