Seyed Javad Hosseininezhad
Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran
[ 1 ] - A cross entropy algorithm for continuous covering location problem
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...
[ 2 ] - A multiobjective continuous covering location model
This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...
[ 3 ] - A robust approach to multi period covering location-allocation problem in pharmaceutical supply chain
This paper proposes a discrete capacitated covering location-allocation model for pharmaceutical centers. In the presented model, two objectives are considered; the first one is minimization of costs and the second one try to maximize customer satisfaction by definition of social justice. Social justice in the model means that we consider customers satisfaction by using distance. the introduced...
نویسندگان همکار