نتایج جستجو برای: well dispersed subset non dominated solutions

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

2011
J. Li Q. Pan S. Xie S. Wang Jun-qing Li Sheng-xian Xie

In this paper, we propose a hybrid Pareto-based artificial bee colony (HABC) algorithm for solving the multi-objective flexible job shop scheduling problem. In the hybrid algorithm, each food sources is represented by two vectors, i.e., the machine assignment vector and the operation scheduling vector. The artificial bee is divided into three groups, namely, employed bees, onlookers, and scouts...

Journal: :Computers & OR 2013
Bernabé Dorronsoro Grégoire Danoy Antonio J. Nebro Pascal Bouvry

This article introduces three new multi-objective cooperative coevolutionary variants of three state-ofthe-art multi-objective evolutionary algorithms, namely, Non-dominated Sorting Genetic Algorithm II (NSGA-II), Strength Pareto Evolutionary Algorithm 2 (SPEA2) and Multi-objective Cellular Genetic Algorithm (MOCell). In such a coevolutionary architecture, the population is split into several s...

2015
Mohammad Mohammadi

This paper presents an optimization of photovoltaic water pumping system (PWPS) considering the reliability criteria and economic aspects. In this way loss of load probability (LLP) as reliability criteria and life cycle cost (LCC) as economic criteria are used to simulate the performance of the PWPS. The sizing of a photovoltaic pumping system means the sizing of the photovoltaic module number...

2014
Yabo Luo Min Liu Zhongxiao Hao Dongbo Liu

Multi-objective traveling salesman problem (MOTSP) is an extended instance of traveling salesman problem (TSP), which is a well-known NP hard problem. In this paper, an improved NSGA-II algorithm (denoted by INSGA-II-MOTSP) is proposed to solve the MOTSP. Specifically, a layer strategy according to need is proposed to avoid generating unnecessary non-dominated fronts. The arena’s principle is a...

2011
Yasuhiro Hirakawa Aya Ishigaki

The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop schedu...

2010
Anna Battauz Marzia De Donno Alessandro Sbuelz

If the average risk-adjusted growth rate of the project’s present value V overcomes the discount rate but is dominated by the average risk-adjusted growth rate of the cost I of entering the project, a non-standard double continuation region can arise: The …rm waits to invest in the project if V is insu¢ ciently above I as well as if V is comfortably above I. Under a framework with di¤usive unce...

Journal: :Discussiones Mathematicae Graph Theory 2020

Journal: :IJADS 2013
Asghar Moeini Mehdi Foumani Kouroush Jenab

Multi-objective optimisation problems normally have not one but a set of solutions, which are called Pareto-optimal solutions or non-dominated solutions. Once a Pareto-optimal set has been obtained, the decision-maker faces the challenge of analysing a potentially large set of solutions. Selecting one solution over others can be quite a challenging task because the Pareto set can contain an unm...

2011
A. Mohammadian Martin Charron

Some new nonlinear analytical solutions are found for axisymmetric horizontal flows dominated by strong heat sources. These flows are common in multiscale atmospheric and oceanic flows such as hurricane embryos and ocean gyres. The analytical solutions are illustrated with several examples. The proposed exact solutions provide analytical support for previous numerical observations and can be al...

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

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