this paper uses the weighted l$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. when all variables are integer it finds the whole set of efficient solutions. in each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

In this paper, we propose new depth-first heuristic search algorithms to approximate the set of Pareto optimal solutions in multi-objective constraint optimization. Our approach builds upon recent advances in multi-objective heuristic search over weighted AND/OR search spaces and uses an -dominance relation between cost vectors to significantly reduce the set of non-dominated solutions. Our emp...

Cystic fibrosis (CF) is an autosomal recessive disorder caused by mutations in CFTR genes that affect chloride ion channel. The CF is a good nominee for gene therapy as the asymptomatic carriers are phenotypically normal, and the desired cells are accessible for vector delivery. Gene therapy shows promising effects involving the correction of gene or replacement of the mutant gene with the func...

The focus is the experimental assessment of insitu flow vectors in a hillslope soil. We selected a 100 m2 trenched hillslope study site. During prescribed sprinkling an obliquely installed TDR wave-guide provides for the velocity of the wetting front in its direction. A triplet of wave-guides mounted along the sides of an hypothetical tetrahedron, with its peak pointing down, produces a three-d...

In this paper, we propose a hybrid Pareto-based artificial bee colony (HABC) algorithm for solving the multi-objective flexible job shop scheduling problem. In the hybrid algorithm, each food sources is represented by two vectors, i.e., the machine assignment vector and the operation scheduling vector. The artificial bee is divided into three groups, namely, employed bees, onlookers, and scouts...

A variant of the classical knapsack problem is considered in which each item associated with an integer weight and a qualitative level. We define dominance relation over feasible subsets given set show that this defines preorder. propose dynamic programming algorithm to compute entire non-dominated rank cardinality vectors we state two greedy algorithms, efficiently single efficient solution.

in this paper, a non-dominated sorting genetic algorithm-ii (nsga-ii) based approach is presented for distribution system reconfiguration. in contrast to the conventional ga based methods, the proposed approach does not require weighting factors for conversion of multi-objective function into an equivalent single objective function. in order to illustrate the performance of the proposed method,...

Evolutionary algorithms have been recognized to be suitable for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier‎. ‎This paper applies an evolutionary optimization scheme‎, ‎inspired by Multi-objective Invasive Weed Optimization (MOIWO) and Non-dominated Sorting (NS) strategi...