This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial solution by optimizing only one single objective, and then (ii) to start from this solution a search for non-dominated solutions exploiting a sequence of different formulations of the problem based on aggregations of the ...

This paper makes a review of interactive methods devoted to multiobjective integer and mixed-integer programming (MOIP/MOMIP) problems. The basic concepts concerning the characterization of the non-dominated solution set are first introduced, followed by a remark about non-interactive methods vs. interactive methods. Then, we focus on interactive MOIP/MOMIP methods, including their characteriza...

Many engineering design problems must optimize multiple objectives. While many objectives are explicit and can be mathematically modeled, some goals are subjective and cannot be included in a mathematical model of the optimization problem. A set of alternative non-dominated fronts that represent multiple optima for problem solution can be identified to provide insight about the decision space a...

Generator Maintenance Scheduling (GMS) problem in a vertically integrated electric utility system is considered in this paper. The cost and reliability objectives are included in the problem formulation. The GMS is formulated as a non linear, heavily constrained multi-objective optimization problem and the non dominated solutions are obtained using multi objective hybrid integer coded different...

Non-domination level update problem is to sort the non-dominated fronts after insertion or deletion of a solution. Generally the solution to this problem requires to perform the complete non-dominated sorting which is too expensive in terms of number of comparisons. Recently an Efficient Nondomination Level Update (ENLU) approach is proposed which does not perform the complete sorting. For this...

this paper considers the job scheduling problem in virtual manufacturing cells (vmcs) with the goal of minimizing two objectives namely, makespan and total travelling distance. to solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (nsga-ii) and knowledge-based non-dominated sorting genetic algorithm (kbnsga-ii). the difference between these algor...

in this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. two objective functions, real power loss and energy not supplied index (ens), were utilized. multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...

this paper explores the capabilities of multi-objective particle swarm optimization algorithmin a simulation-optimization model for solving waste load allocation problems. the main goals are totaltreatment costs, violation of the water quality standards and equity. in this research, the water qualitysimulation model is coupled with a multi-objective optimization model, mopso. in order to derive...

A new optimization technique is proposed for solving problems having single and multiple objectives, with objective functions such as generation cost, loss, severity value. This algorithm was developed to satisfy the constraints, OPF practical ram rate limits. Single multi-objective were implemented hybrid fruit fly-based artificial bee colony (HFABC) non-dominated sorting (NSHFABC) algorithm. ...