This paper considers two-level assembly systems whose lead times of components are stochastic with known discrete random distributions. In such a system, supply planning requires determination of release dates of components at level 2 in order to minimize expected holding cost and to maximize customer service. Hnaien et al. [Hnaien F, Delorme X, Dolgui A. Multi-objective optimization for invent...

As one of the most challenging combinatorial optimization problems in scheduling, the resource-constrained project scheduling problem (RCPSP) has attracted numerous scholars’ interest resulting in considerable research in the past few decades. However, most of these papers focused on the single objective RCPSP; only a few papers concentrated on the multi-objective resource-constrained project s...

Classical evolutionary multi-objective optimization algorithms aim at finding an approximation of the entire set of Pareto optimal solutions. By considering the preferences of a decision maker within evolutionary multi-objective optimization algorithms, it is possible to focus the search only on those parts of the Pareto front that satisfy his/her preferences. In this paper, an extended prefere...

Postcoarctation aneurysm is one of the most dangerous complications in long-term period after surgery for coarctation aorta (CoA). formation associated with high risk rupture, and, therefore, patient death. Considering this pathology, it necessary to study thoroughly results surgical treatment and quality life correction develop measures prevent aneurysms formation.
 The aim. To present an...

Job Shop Scheduling is an important combinatorial optimisation problem in practice. It usually contains many (four or more) potentially conflicting objectives such as makespan and mean weighted tardiness. On the other hand, evolving dispatching rules using genetic programming has demonstrated to be a promising approach to solving job shop scheduling due to its flexibility and scalability. In th...

Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( ) computational complexity (where is the number of objectives and is the population size); 2) nonelitism approach; and 3) the need for specifying a sharing parameter. In this paper, we suggest a nondominated sorting-based multiobjective EA (MOEA), called nondominate...

Optimizing the operation of reservoir involving ecological and environmental (eco-environmental) objectives is challenging due to the often competing social-economic objectives. Non-dominated Sorting Genetic Algorithm-II is a popular method for solving multi-objective optimization problems. However, within a complex search space, the NSGA-II population (i.e., a group of candidate solutions) may...

Here, we report the synthesis of a Schiff-base mixed-ligand complex of cadmium(ІІ) in bulk and nano-scales via the precipitation and sonochemical methods, respectively. The complex formula is [Cd(3-bpdh)(3-bpdb)Cl2]n (1), where the ligands are 3-bpdh = 2,5-bis(3-pyridyl)-3,4-diaza-2,4-hexadiene and 3-bpdb = 1,4-bis(3-pyridyl)-2,3-diaza-1,3-butadiene. The structure of mixed-ligand complex (1) wa...

distribution centers (dcs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.this paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. an evolutionary algorithm named non-dominated sorting ant colony optimization (nsaco) is used as the optimi...

Optimum controller placement in the presence of several conflicting objectives has received significant attention Software-Defined Wide Area Network (SD-WAN) deployment. Multi-objective evolutionary algorithms, like Non-dominated Sorting Genetic Algorithm II (NSGA-II) and Particle Swamp Optimization (MOPSO), have proved helpful solving Controller Placement Problem (CPP) SD-WAN. However, these a...