This paper presents a new algorithm for identifying all the supported nondominated vectors (or outcomes) in the objective space, as well as the corresponding efficient solutions in the decision space, for the multi-objective integer network flow problem. Identifying the set of supported non-dominated vectors is of the utmost importance for obtaining a first approximation of the whole set of non...

The objective of the present paper is to select the best compromise irrigation planning strategy for the case study of Jayakwadi irrigation project, Maharashtra, India. Four-phase methodology is employed. In phase 1, separate linear programming (LP) models are formulated for the three objectives, namely, net economic benefits, agricultural production and labour employment. In phase 2, nondomina...

We propose a method for constrained and unconstrained nonlinear multiobjective optimization problems that is based on an SQP-type approach. The proposed algorithm maintains a list of nondominated points that is improved both for spread along the Pareto front and optimality by solving single-objective constrained optimization problems. These single-objective problems are derived as SQP problems ...

A robust optimization approach is proposed for generating nondominated robust solutions for multiobjective linear programming problems with imprecise coefficients in the objective functions and constraints. Robust optimization is used in dealing with impreciseness while an interactive procedure is used in eliciting preference information from the decision maker and in making tradeoffs among the...

Abstract For a continuous multi-objective optimization problem, it is usually not practical approach to compute all its nondominated points because there are infinitely many of them. this reason, typical an approximation the set. A common technique for generate polyhedron which contains However, often these approximations used further evaluations. those applications structure that easy handle. ...

For the multiple automated guided vehicle (multi-AGV) routing problems in warehousing link of logistics, where optimization objective is to minimize both number AGVs used and maximum pickup time simultaneously, a nondominant sorting differential evolution (NSDE) algorithm proposed. In encoding decoding stages, point area divided. are allocated each region according proposed rule based on avoidi...

Minimum Spanning Tree (MST) problem is of high importance in network optimization. The multi-criteria MST (mc-MST) is a more realistic representation of the practical problem in the real-world, but it is diicult for the traditional network optimization technique to deal with. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. Without neglecting its network ...

Optimization problems under uncertainty has achieved much attention because of inaccurate or incomplete data that often appear in real-world applications. In order to address this challenging issue, several types methodologies have been developed optimization theory and one them is fuzzy optimization. paper, an attempt taken use the minimax exact penalty function method for solving convex nondi...

This paper proposes dual multiobjective quantum-inspired evolutionary algorithm (DMQEA) with the dualstage of dominance check by introducing secondary objectives in addition to primary objectives. The secondary objectives are to maximize global evaluation values and crowding distances of the solutions in the external global population obtained for the primary objectives and the previous archive...