نتایج جستجو برای: modified nsga ii algorithm

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

2016
Jafar Bagherinejad Mina Dehghani

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 optimization tool for solving this problem. The proposed methodology is based on a new variant of ant colony optimization (ACO) specialized in multi-objective o...

Journal: :iranian journal of management studies 2015
mostafa zareei hossein ali hassan-pour

this paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. the net present value (npv) maximization and making span minimization are this study objectives. and since this problem is considered as complex optimization in np-hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...

Journal: :journal of optimization in industrial engineering 2014
behrouz afshar-nadjafi arian razmi-farooji

time-dependent vehicle routing problem is one of the most applicable but least-studied variants of routing and scheduling problems. in this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. to deal with the traffic congestions, we also considered that the vehicles are not forced to come...

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 presents a bi-objective MIP model for the flexible flow shop scheduling  problem (FFSP) in which the total weighted tardiness and the energy consumption are minimized simultaneously. In addition to considering unrelated machines at each stage, the set-up times are supposed to be sequence- and machine-dependent, and it is assumed that jobs have different release tim...

The gaining returns in line with risks is always a major concern for market play-ers. This study compared the selection of stock portfolios based on the strategy of buying and retaining winning stocks and the purchase strategy based on the level of investment risks. In this study, the two-step optimization algorithms NSGA-II and SPEA-II were used to optimize the stock portfolios. In order to de...

2012
Yuelin Gao Jun Wu Yingzhen Chen

An improved harmony search algorithm for constrained multi-objective optimization problems is proposed in this paper. Inspired by Particle Swarm Optimization, an inductor particle is introduced to speed up the convergence rate of the CMOHS. Two populations are adopted to increase the opportunity of finding the optimal solutions. Numerical experiments are divided into two parts: the first one co...

Journal: :JSW 2013
Yuelin Gao Xia Chang Yingzhen Chen

An improved harmony search algorithm for constrained multi-objective optimization problems is proposed in this paper. Inspired by Particle Swarm Optimization, an inductor particle is introduced to speed up the convergence rate of the CMOHS. Two populations are adopted to increase the opportunity of finding the optimal solutions. Numerical experiments are divided into two parts: the first one co...

Journal: :IEEE Transactions on Transportation Electrification 2023

Railway electrification has attracted substantial interest in recent years as a key part of the global effort to achieve transport decarbonization. To improve energy efficiency train operations, particular is optimization speed trajectories. However, most studies formulate problem single-objective model and do not take into account mass uncertainty associated with passenger load variations. Thi...

2010
G. Subashini M. C. Bhuvaneswari

To meet the increasing computational demands, geographically distributed resources need to be logically coupled to make them work as a unified resource. In analyzing the performance of such distributed heterogeneous computing systems scheduling a set of tasks to the available set of resources for execution is highly important. Task scheduling being an NP-complete problem, use of metaheuristics ...

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

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