نتایج جستجو برای: non dominated sorting genetic algorithm nsga ii

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

Journal: :journal of optimization in industrial engineering 2014
keyvan sarrafha abolfazl kazemi alireza alinezhad

integrated production-distribution planning (pdp) is one of the most important approaches in supply chain networks. we consider a supply chain network (scn) to consist of multi suppliers, plants, distribution centers (dcs), and retailers. a bi-objective mixed integer linear programming model for integrating production-distribution designed here aim to simultaneously minimize total net costs in ...

A multi-objective optimization (MOO) of two-element wing models with morphing flap by using computational fluid dynamics (CFD) techniques, artificial neural networks (ANN), and non-dominated sorting genetic algorithms (NSGA II), is performed in this paper. At first, the domain is solved numerically in various two-element wing models with morphing flap using CFD techniques and lift (L) and drag ...

Journal: :JSEA 2010
Parames Chutima Panuwat Olanviwatchai

Mixed-model U-shaped assembly line balancing problems (MMUALBP) is known to be NP-hard resulting in it being nearly impossible to obtain an optimal solution for practical problems with deterministic algorithms. This paper presents a new evolutionary method called combinatorial optimisation with coincidence algorithm (COIN) being applied to Type I problems of MMUALBP in a just-in-time production...

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2022

The non-dominated sorting genetic algorithm II (NSGA-II) is the most intensively used multi-objective evolutionary (MOEA) in real-world applications. However, contrast to several simple MOEAs analyzed also via mathematical means, no such study exists for NSGA-II so far. In this work, we show that runtime analyses are feasible NSGA-II. As particular results, prove with a population size larger t...

Journal: :JIPI (Jurnal Ilmiah Penelitian dan Pembelajaran Informatika) 2023

Penjadwalan operasi pasien merupakan aktifitas penting pada kegiatan operasional rumah sakit, karena menentukan waktu pasien-pasien tertangani dengan baik. Permasalahan ini dimodelkan sebagai masalah optimasi multi-obyektif yaitu meminimalkan yang digunakan saat tindakan operasi. Masalah penjadwalan dirumuskan mixed integer programming (MIP), sehingga variabel merepresentasikan jadwal kasus lay...

The hub location problem is employed for many real applications, including delivery, airline and telecommunication systems and so on. This work investigates on hierarchical hub network in which a three-level network is developed. The central hubs are considered at the first level, at the second level, hubs are assumed which are allocated to central hubs and the remaining nodes are at the third ...

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...

2014
Shishir Dixit Laxmi Srivastava Ganga Agnihotri

Modern this paper proposes non dominated sorting genetic algorithm (NSGA-II) which has feature of adaptive crowding distance for finding optimal location and sizing of Static Var Compensators (SVC) in order to minimize real power losses and voltage deviation and also to improve voltage profile of a power system at the same time. While finding the optimal location and size of SVC, single line ou...

In design and fabricate drive shafts with high value of fundamental natural frequency that represented high value of critical speed; using composite materials instead of typical metallic materials could provide longer length shafts with lighter weight. In this paper, multi-objective optimization (MOP) of a composite drive shaft is performed considering three conflicting objectives: fundamental ...

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

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

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