In real world most of the optimization problems are multi-objective in nature. These problems take large amount of time to congregate to the true Pareto front. So the basic algorithm like non parallel NSGA II may not able to solve such problem in ?-tolerable amount of time. This paper proposes a new hybrid parallel multi-objective genetic algorithm and solve one of the real life problem i. e. ,...

This paper describes a new technique for solving the duration minimization in a resourceconstrained network. It is based on a transformation of the resource-constrained project scheduling problem (RCPSP) to a sequence of (multi)knapsack problem (MKP) solutions. In the first part, three deterministic approaches are summarized and their time complexity is discussed. Due to the combinatorial natur...

This paper presents a layered encoding cascade evolutionary approach to solve a 0/1 knapsack optimization problem. A layered encoding structure is proposed and developed based on the schema theorem and the concepts of cascade correlation and multi-population evolutionary algorithms. Genetic algorithm (GA) and particle swarm optimization (PSO) are combined with the proposed layered encoding stru...

a three stage production system is considered in this paper. there are two stages to fabricate and ready the parts and an assembly stage to assembly the parts and complete the products in this system. suppose that a number of products of different kinds are ordered. each product is assembled with a set of several parts. at first the parts are produced in the first stage with parallel machines a...

multi objective quadratic fractional programming (moqfp) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the object...

Abstract We consider a bilevel continuous knapsack problem where the leader controls capacity of and follower chooses an optimal packing according to his own profits, which may differ from those leader. To this problem, we add uncertainty in natural way, assuming that does not have full knowledge about follower’s problem. More precisely, adopting robust optimization approach profits belong give...