نتایج جستجو برای: covering tour problem

تعداد نتایج: 930965  

Journal: :European Journal of Operational Research 2020

Journal: :American Journal of Operations Research 2017

Journal: :Transportation Science 2019

Journal: :Graphs and Combinatorics 2013

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 aCross Entropy (CE) algorithm consider...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید