• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.335-352
• /
• 2023

When solving multi-objective optimization problems, the blindness of the evolution direction of the population gradually emerges with the increase in the number of objectives, and there are also problems of convergence and diversity that are difficult to balance. The many- objective optimization problem makes some classic multi-objective optimization algorithms face challenges due to the huge objective space. The sine cosine algorithm is a new type of natural simulation optimization algorithm, which uses the sine and cosine mathematical model to solve the optimization problem. In this paper, a knee-driven many-objective sine-cosine algorithm (MaSCA-KD) is proposed. First, the Latin hypercube population initialization strategy is used to generate the initial population, in order to ensure that the population is evenly distributed in the decision space. Secondly, special points in the population, such as nadir point and knee points, are adopted to increase selection pressure and guide population evolution. In the process of environmental selection, the diversity of the population is promoted through diversity criteria. Through the above strategies, the balance of population convergence and diversity is achieved. Experimental research on the WFG series of benchmark problems shows that the MaSCA-KD algorithm has a certain degree of competitiveness compared with the existing algorithms. The algorithm has good performance and can be used as an alternative tool for many-objective optimization problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.514-537
• /
• 2020

Wireless sensor network (WSN) is a distributed network composed of many sensory nodes. It is precisely due to the clustering unevenness and cluster head election randomness that the energy consumption of WSN is excessive. Therefore, a many-objective optimization WSN energy balance model is proposed for the first time in the clustering stage of LEACH protocol. The four objective is considered that the cluster distance, the sink node distance, the overall energy consumption of the network and the network energy consumption balance to select the cluster head, which to better balance the energy consumption of the WSN network and extend the network lifetime. A many-objective optimization algorithm to optimize the model (LEACH-ABF) is designed, which combines adaptive balanced function strategy with penalty-based boundary selection intersection strategy to optimize the clustering method of LEACH. The experimental results show that LEACH-ABF can balance network energy consumption effectively and extend the network lifetime when compared with other algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.442-460
• /
• 2021

Nowadays, recommendation systems (RSs) are applied to all aspects of online life. In order to overcome the problem that individuals who do not meet the constraints need to be regenerated when the many-objective evolutionary algorithm (MaOEA) solves the hybrid recommendation model, this paper proposes a many-objective particle swarm optimization algorithm based on multiple criteria (MaPSO-MC). A generation-based fitness evaluation strategy with diversity enhancement (GBFE-DE) and ISDE⁺ are coupled to comprehensively evaluate individual performance. At the same time, according to the characteristics of the model, the regional optimization has an impact on the individual update, and a many-objective evolutionary strategy based on bacterial foraging (MaBF) is used to improve the algorithm search speed. Experimental results prove that this algorithm has excellent convergence and diversity, and can produce accurate, diverse, novel and high coverage recommendations when solving recommendation models.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.805-815
• /
• 2022

The model-based evolutionary algorithms are divided into three groups: estimation of distribution algorithms, inverse modeling, and surrogate modeling. Existing inverse modeling is mainly applied to solve multi-objective optimization problems and is not suitable for many-objective optimization problems. Some inversed-model techniques, such as the inversed-model of multi-objective evolutionary algorithm, constructed from the Pareto front (PF) to the Pareto solution on nondominated solutions using a random grouping method and Gaussian process, were introduced. However, some of the most efficient inverse models might be eliminated during this procedure. Also, there are challenges, such as the presence of many local PFs and developing poor solutions when the population has no evident regularity. This paper proposes inverse modeling using random forest regression and uniform reference points that map all nondominated solutions from the objective space to the decision space to solve many-objective optimization problems. The proposed algorithm is evaluated using the benchmark test suite for evolutionary algorithms. The results show an improvement in diversity and convergence performance (quality indicators).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1238-1259
• /
• 2024

Previous studies on joint optimization of computation offloading and service caching policies in Mobile Edge Computing (MEC) have often neglected the impact of dependency-aware subtasks, edge server resource constraints, and multiple users on policy formulation. To remedy this deficiency, this paper proposes a many-objective joint optimization dependency-aware task offloading and service caching model (MaJDTOSC). MaJDTOSC considers the impact of dependencies between subtasks on the joint optimization problem of task offloading and service caching in multi-user, resource-constrained MEC scenarios, and takes the task completion time, energy consumption, subtask hit rate, load variability, and storage resource utilization as optimization objectives. Meanwhile, in order to better solve MaJDTOSC, a many-objective evolutionary algorithm TSMSNSGAIII based on a three-stage mating selection strategy is proposed. Simulation results show that TSMSNSGAIII exhibits an excellent and stable performance in solving MaJDTOSC with different number of users setting and can converge faster. Therefore, it is believed that TSMSNSGAIII can provide appropriate sub-task offloading and service caching strategies in multi-user and resource-constrained MEC scenarios, which can greatly improve the system offloading efficiency and enhance the user experience.

• The Journal of the Korea Contents Association
• /
• v.15 no.7
• /
• pp.21-29
• /
• 2015

This paper proposes a novel two-tier optimization approach for decision making in many-objective problems. Because the Pareto-optimal solution ratio increases exponentially with an increasing number of objectives, simply finding the Pareto-optimal solutions is not sufficient for decision making in many-objective problems. In other words, it is necessary to discriminate the more preferable solutions from the other solutions. In the proposed approach, user preference-oriented as well as diverse Pareto-optimal solutions can be obtained as candidate solutions by introducing an additional tier of optimization. The second tier of optimization employs the corresponding secondary objectives, global evaluation and crowding distance, which were proposed in previous works, to represent the users preference to a solution and the crowdedness around a solution, respectively. To demonstrate the effectiveness of the proposed approach, decision making for some benchmark functions is conducted, and the outcomes with and without the proposed approach are compared. The experimental results demonstrate that the decisions are successfully made with consideration of the users preference through the proposed approach.

• Computers and Concrete
• /
• v.14 no.4
• /
• pp.445-462
• /
• 2014

To solve structural optimization problems, it is necessary to integrate a structural analysis package and an optimization package. There have been many packages that can be employed to analyze reinforced concrete plane frames. However, because most structural analysis packages suffer from closeness of systems, it is very difficult to integrate them with optimization packages. To overcome the difficulty, we proposed a possible alternative, DAMDO, which integrates Design, Analysis, Modeling, Definition, and Optimization phases into an integration environment as follows. (1) Design: first generate many possible structural design alternatives. Each design alternative consists of many design variables X. (2) Analysis: employ the structural analysis software to analyze all structural design alternatives to obtain their internal forces and displacements. They are the response variables Y. (3) Modeling: employ artificial neural networks to build the models Y=f(X) to obtain the relationship functions between the design variables X and the response variables Y. (4) Definition: employ the design variables X and the response variables Y to define the objective function and constraint functions. (5) Optimization: employ the optimization software to solve the optimization problem consisting of the objective function and the constraint functions to produce the optimum design variables. The RC frame optimization problem was examined to evaluate the DAMDO approach, and the empirical results showed that it can be solved by the approach.

• International Journal of Computer Science & Network Security
• /
• v.22 no.6
• /
• pp.203-211
• /
• 2022

Multi-objective optimization problems (MOPs) arise in many real-world applications. MOPs involve two or more objectives with the aim to be optimized. With these problems improvement of one objective may led to deterioration of another. The primary goal of most multi-objective evolutionary algorithms (MOEA) is to generate a set of solutions for approximating the whole or part of the Pareto optimal front, which could provide decision makers a good insight to the problem. Over the last decades or so, several different and remarkable multi-objective evolutionary algorithms, have been developed with successful applications. However, MOEAs are still in their infancy. The objective of this research is to study how to use and apply machine learning (ML) to improve evolutionary multi-objective optimization (EMO). The EMO method is the multi-objective evolutionary algorithm based on decomposition (MOEA/D). The MOEA/D has become one of the most widely used algorithmic frameworks in the area of multi-objective evolutionary computation and won has won an international algorithm contest.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.10
• /
• pp.2150-2158
• /
• 2002

A recent research and development has the requirement for the optimization to shorten design time of modified or new product model and to obtain more precise engineering solution. General optimization problem must consider many conflicted objective functions simultaneously. Multi-objective optimization treats the multiple objective functions and constraints with design change. But, real engineering problem doesn't describe accurate constraint and objective function owing to the limit of representation. Therefore this study applies variance analysis on the basis of structure analysis and DOE to the vertical roller mill fur portland cement and proposed statistical design model to evaluate the effect of structural modification with design change by performing practical multi-objective optimization considering mass, stress and deflection.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.3
• /
• pp.433-438
• /
• 2014

A semi-infinite optimization problem involving a quasi-convex objective function and infinitely many convex constraint functions with data uncertainty is considered. A surrogate duality theorem for the semi-infinite optimization problem is given under a closed and convex cone constraint qualification.