نتایج جستجو برای: multi objective programming problem
تعداد نتایج: 1972522 فیلتر نتایج به سال:
hub covering problem (hlp) is a very popular areas of research for its wide ranges of applications in different service or manufacturing industries. this paper considers a bi-objective hub covering location problem with congestion. the objectives minimize the total transportation cost and the total waiting time for all hobs, respectively. the resulted multi-objective decision-making problem is ...
the present paper aims to investigate the effects of modularity and the layout of subsystems and parts of a complex system on its maintainability. for this purpose, four objective functions have been considered simultaneously: i) maximizing the level of accordance between system design and optimum modularity design,ii) maximizing the level of accessibility and the maintenance space required,iii...
Computing the exact ideal and nadir criterion values is a very important subject in multi-objective linear programming (MOLP) problems. In fact, these values define the ideal and nadir points as lower and upper bounds on the nondominated points. Whereas determining the ideal point is an easy work, because it is equivalent to optimize a convex function (linear function) over a con...
Abstract This paper addresses the problem of approximating set all solutions for Multi-objective Markov Decision Processes. We show that in vast majority interesting cases, number is exponential or even infinite. In order to overcome this difficulty we propose approximate by means a limited precision approach based on White’s multi-objective value-iteration dynamic programming algorithm. prove ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید