A Concept for Real-Valued Multi-objective Landscape Analysis Characterizing Two Biochemical Optimization Problems

2015 ◽  
pp. 897-909 ◽  
Author(s):  
Susanne Rosenthal ◽  
Markus Borschbach
Keyword(s):  
Optimization Problems ◽  
Landscape Analysis ◽  
Multi Objective

scholarly journals A Multi-Objective Approach toward Optimal Design of Sustainable Integrated Biodiesel/Diesel Supply Chain Based on First- and Second-Generation Feedstock with Solid Waste Use

Energies ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 2261
Author(s):  
Evgeniy Ganev ◽  
Boyan Ivanov ◽  
Natasha Vaklieva-Bancheva ◽  
Elisaveta Kirilova ◽  
Yunzile Dzhelil
Keyword(s):  
Supply Chain ◽  
Optimal Design ◽  
Solid Waste ◽  
Second Generation ◽  
Agricultural Land ◽  
Optimization Problems ◽  
Biodiesel Production ◽  
Mixed Integer ◽  
Economic Criterion ◽  
Multi Objective

This study proposes a multi-objective approach for the optimal design of a sustainable Integrated Biodiesel/Diesel Supply Chain (IBDSC) based on first- (sunflower and rapeseed) and second-generation (waste cooking oil and animal fat) feedstocks with solid waste use. It includes mixed-integer linear programming (MILP) models of the economic, environmental and social impact of IBDSC, and respective criteria defined in terms of costs. The purpose is to obtain the optimal number, sizes and locations of bio-refineries and solid waste plants; the areas and amounts of feedstocks needed for biodiesel production; and the transportation mode. The approach is applied on a real case study in which the territory of Bulgaria with its 27 districts is considered. Optimization problems are formulated for a 5-year period using either environmental or economic criteria and the remainder are defined as constraints. The obtained results show that in the case of the economic criterion, 14% of the agricultural land should be used for sunflower and 2% for rapeseed cultivation, while for the environmental case, 12% should be used for rapeseed and 3% for sunflower. In this case, the price of biodiesel is 14% higher, and the generated pollutants are 6.6% lower. The optimal transport for both cases is rail.

Pareto-Optimal Equilibrium Points in non-Cooperative Multi-Objective Optimization Problems

2021 ◽  
pp. 114995
Author(s):  
Mohammadali Saniee Monfared ◽  
Sayyed Ehsan Monabbati ◽  
Atefeh Rajabi Kafshgar
Keyword(s):  
Optimization Problems ◽  
Equilibrium Points ◽  
Pareto Optimal ◽  
Multi Objective Optimization ◽  
Multi Objective

Injecting domain knowledge in multi-objective optimization problems: A semantic approach

2021 ◽  
pp. 103546
Author(s):  
Cristóbal Barba-González ◽  
Antonio J. Nebro ◽  
José García-Nieto ◽  
María del Mar Roldán-García ◽  
Ismael Navas-Delgado ◽  
...  
Keyword(s):  
Domain Knowledge ◽  
Optimization Problems ◽  
Multi Objective Optimization ◽  
Semantic Approach ◽  
Multi Objective

scholarly journals A Method for Integration of Preferences to a Multi-Objective Evolutionary Algorithm Using Ordinal Multi-Criteria Classification

2021 ◽  
Vol 26 (2) ◽  
pp. 27
Author(s):  
Alejandro Castellanos-Alvarez ◽  
Laura Cruz-Reyes ◽  
Eduardo Fernandez ◽  
Nelson Rangel-Valdez ◽  
Claudia Gómez-Santillán ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Selective Pressure ◽  
Optimization Problems ◽  
Region Of Interest ◽  
Decision Makers ◽  
Multiple Objective ◽  
Objective Functions ◽  
Multi Objective ◽  
Imperfect Knowledge ◽  
Real World Problems

Most real-world problems require the optimization of multiple objective functions simultaneously, which can conflict with each other. The environment of these problems usually involves imprecise information derived from inaccurate measurements or the variability in decision-makers’ (DMs’) judgments and beliefs, which can lead to unsatisfactory solutions. The imperfect knowledge can be present either in objective functions, restrictions, or decision-maker’s preferences. These optimization problems have been solved using various techniques such as multi-objective evolutionary algorithms (MOEAs). This paper proposes a new MOEA called NSGA-III-P (non-nominated sorting genetic algorithm III with preferences). The main characteristic of NSGA-III-P is an ordinal multi-criteria classification method for preference integration to guide the algorithm to the region of interest given by the decision-maker’s preferences. Besides, the use of interval analysis allows the expression of preferences with imprecision. The experiments contrasted several versions of the proposed method with the original NSGA-III to analyze different selective pressure induced by the DM’s preferences. In these experiments, the algorithms solved three-objectives instances of the DTLZ problem. The obtained results showed a better approximation to the region of interest for a DM when its preferences are considered.

scholarly journals Elite Exploitation: A Combination of Mathematical Concept and EMO Approach for Multi-Objective Decision Making

Symmetry ◽  
2021 ◽  
Vol 13 (1) ◽  
pp. 136
Author(s):  
Wenxiao Li ◽  
Yushui Geng ◽  
Jing Zhao ◽  
Kang Zhang ◽  
Jianxin Liu
Keyword(s):  
Decision Making ◽  
Optimization Problems ◽  
Hybrid Genetic Algorithm ◽  
Decision Makers ◽  
Superior Performance ◽  
Test Problems ◽  
Mathematical Function ◽  
Hyperbolic Tangent ◽  
Nsga Ii ◽  
Multi Objective

This paper explores the combination of a classic mathematical function named “hyperbolic tangent” with a metaheuristic algorithm, and proposes a novel hybrid genetic algorithm called NSGA-II-BnF for multi-objective decision making. Recently, many metaheuristic evolutionary algorithms have been proposed for tackling multi-objective optimization problems (MOPs). These algorithms demonstrate excellent capabilities and offer available solutions to decision makers. However, their convergence performance may be challenged by some MOPs with elaborate Pareto fronts such as CFs, WFGs, and UFs, primarily due to the neglect of diversity. We solve this problem by proposing an algorithm with elite exploitation strategy, which contains two parts: first, we design a biased elite allocation strategy, which allocates computation resources appropriately to elites of the population by crowding distance-based roulette. Second, we propose a self-guided fast individual exploitation approach, which guides elites to generate neighbors by a symmetry exploitation operator, which is based on mathematical hyperbolic tangent function. Furthermore, we designed a mechanism to emphasize the algorithm’s applicability, which allows decision makers to adjust the exploitation intensity with their preferences. We compare our proposed NSGA-II-BnF with four other improved versions of NSGA-II (NSGA-IIconflict, rNSGA-II, RPDNSGA-II, and NSGA-II-SDR) and four competitive and widely-used algorithms (MOEA/D-DE, dMOPSO, SPEA-II, and SMPSO) on 36 test problems (DTLZ1–DTLZ7, WGF1–WFG9, UF1–UF10, and CF1–CF10), and measured using two widely used indicators—inverted generational distance (IGD) and hypervolume (HV). Experiment results demonstrate that NSGA-II-BnF exhibits superior performance to most of the algorithms on all test problems.

Sign in / Sign up

Export Citation Format

Share Document