نتایج جستجو برای: non dominated sort genetic algorithm
تعداد نتایج: 2544225 فیلتر نتایج به سال:
Abstract This paper presents a hybrid approach based Binary Artificial Bee Colony (BABC) and Pareto Dominance strategy for scheduling workflow applications considering different Quality of Services (QoS) requirements in cloud computing. The main purpose is to schedule given application onto the available machines environment with minimum makespan (i.e. length) processing cost while maximizing r...
despite the growing use of evolutionary multi-objective optimization algorithms in different categories of science, these algorithms as a powerful tool in portfolio optimization and specially solving multi-objective portfolio optimization problem is still in its early stages. in this paper, moeas have been used for solving multi-objective portfolio optimization problem in tehran stock market. f...
in this study the performance and emissions characteristics of a heavy-duty, direct injection, compression ignition (ci) engine which is specialized in agriculture, have been investigated experimentally. for this aim, the influence of injection timing, load, engine speed on power, brake specific fuel consumption (bsfc), peak pressure (pp), nitrogen oxides (nox), carbon dioxide (co2), carbon mon...
To address the issues of low efficiency and lengthy running time associated with trajectory planning for 6-degree-of-freedom manipulators, this paper introduces a novel solution that generates time-optimal path manipulator while adhering to its kinematic limitations. The proposed method comprises several stages. Firstly, kinematics are analyzed. Secondly, manipulator’s joint-space points interp...
this paper proposes a bi-objective model for the facility location problem under a congestion system. the idea of the model is motivated by applications of locating servers in bank automated teller machines (atms), communication networks, and so on. this model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...
one main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. this paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. indeed, the nature of products is considered different and hub capacity constraint is also applied. due to ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید