Solving integer multi-objective optimization problems using TOPSIS, Differential Evolution and Tabu Search
This paper presents a method to solve non-linear integer multiobjective optimization problems. First the problem is formulated using the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS). Next, the Differential Evolution (DE) algorithm in its three versions (standard DE, DE best and DEGL) are used as optimizer. Since the solutions found by the DE algorithms are continuous, the Tabu Search (TS) algorithm is employed to find integer solutions during the optimization process. Experimental results show the effectiveness of the proposed method.
Code (0)
등록된 구현이 없습니다.
Tasks
Multiobjective OptimizationSimilar Papers 제목 키워드 기반
Diffusion Model-Based Multiobjective Optimization for Gasoline Blending Scheduling
Gasoline blending scheduling uses resource allocation and operation sequencing to meet a refinery's production requirements. The presence of nonlinearity, integer constraints, and a large number of decision variables add…
Evolutionary AlgorithmsMultiobjective OptimizationSchedulingOptimal $(0,1)$-Matrix Completion with Majorization Ordered Objectives (To the memory of Pravin Varaiya)
We propose and examine two optimal $(0,1)$-matrix completion problems with majorization ordered objectives. They elevate the seminal study by Gale and Ryser from feasibility to optimality in partial order programming (PO…
Matrix CompletionPortfolio OptimizationUtilizing Dependence among Variables in Evolutionary Algorithms for Mixed-Integer Programming: A Case Study on Multi-Objective Constrained Portfolio Optimization
Several real-world applications could be modeled as Mixed-Integer Non-Linear Programming (MINLP) problems, and some prominent examples include portfolio optimization, remote sensing technology, and so on. Most of the mod…
Evolutionary AlgorithmsImage ClassificationPortfolio OptimizationInverse Mixed-Integer Programming: Learning Constraints then Objective Functions
Data-driven inverse optimization for mixed-integer linear programs (MILPs), which seeks to learn an objective function and constraints consistent with observed decisions, is important for building accurate mathematical m…
Marginal Probability-Based Integer Handling for CMA-ES Tackling Single-and Multi-Objective Mixed-Integer Black-Box Optimization
This study targets the mixed-integer black-box optimization (MI-BBO) problem where continuous and integer variables should be optimized simultaneously. The CMA-ES, our focus in this study, is a population-based stochasti…