A novel multi-objective evolutionary algorithm (MOEA) is developed based on Imperialist Competitive Algorithm (ICA), a newly introduced evolutionary algorithm (EA). Fast non-dominated sorting and the Sigma method are employed for ranking the solutions. The algorithm is tested on six well-known test functions each of them incorporate a particular feature that may cause difficulty to MOEAs. The n...

according to this fact that wind is now a part of global energy portfolio and due to unreliable and discontinuous production of wind energy; prediction of wind power value is proposed as a main necessity. in recent years, various methods have been proposed for wind power prediction. in this paper the prediction structure involves feature selection and use of artificial neural network (ann). in ...

In this paper, a comprehensive mathematical model for designing an electric power supply chain network via considering preventive maintenance under risk of network failures is proposed. The risk of capacity disruption of the distribution network is handled via using a two-stage stochastic programming as a framework for modeling the optimization problem. An applied method of planning for the net...

In this paper, a novel algorithm for the load flow analysis problem in an islanded microgrid is proposed. The problem is modeled without any slack bus by considering the steady state frequency as one of the load flow variables. To model different control modes of DGs, such as droop, PV and PQ, in an islanded microgrid, a new formula for load flow equations is proposed. A hybrid optimization alg...

The paper presents a problem resolved from social Modeling associated with the adequate selection of clothes and their distribution in a Dresser using a range of 87 clothes with different features associated with a fashion collection to represent the symbolic capital of it. A case of study is presented regarding to the selection of 47 different possible combinations using data obtained from the...

the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In  this paper, stochastic dyn...