Abstract It has been shown that evolutionary algorithms are able to construct suitable search strategies for classes of Constraint Satisfaction Problems (CSPs) in Programming. This paper is an explanation the use multi-objective optimisation contrast simple additive weighting techniques with a view develop CSPs. A hierarchical scheme employed select candidate strategy from Pareto frontier final...

<p style='text-indent:20px;'>We consider a complex multi-objective programming problem (CMP). In order to establish the optimality conditions of (CMP), we introduce several properties optimal efficient solutions and scalarization techniques. Furthermore, certain parametric dual model is discussed, their duality theorems are proved.</p>

in this paper, the cost and income efficiency models have been considered with regard to the multiple objective programming structures. for finding the efficient points in purposed molp problem, some various methods like lexicography & the weighted sum can be used. so by introducing the molp problem the cost & income efficiencies will be achieved. in the present study, the molp problem ...

Abstract This paper presents an optimization method to solve a multi-objective model of bi-level linear programming problem with intuitionistic fuzzy coefficients. The idea is based on TOPSIS (technique for order preference by similarity ideal solution) method. multiple criteria that identifies satisfactory solution from given set alternatives the minimization distance point and maximization na...

The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...