• Korean Management Science Review
• /
• v.25 no.3
• /
• pp.87-99
• /
• 2008

Besieged by needs for upgrading the current Internet, social pressures, and regulatory concerns, a network operator may be left with few options to Improve his services. Yet he can still consider a transition prioritizing network services. In this paper, we describe a transition from a non-priority system to a prioritized one, using non-preemptive M/G/1 model. After reviewing the constraints and theoretical results from past research, we describe steps making the transition Pareto-improving, which boils down to a multi-goal search for a Pareto-improving state. We use a genetic algorithm that captures actual transition costs along with incentive-compatible and Pareto-Improving constraints. Simulation results demonstrate that the initial post-transition solutions are typically Pareto-improving. for non Pareto-improving solutions, the heuristic quickly generates Pareto-improving and incentive-compatible solutions.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.2
• /
• pp.36-42
• /
• 2021

This paper deals with a vehicle routing problem with resource repositioning (VRPRR) which is a variation of well-known vehicle routing problem with pickup and delivery (VRPPD). VRPRR in which static repositioning of public bikes is a representative case, can be defined as a multi-objective optimization problem aiming at minimizing both transportation cost and the amount of unmet demand. To obtain Pareto sets for the problem, famous multi-objective optimization algorithms such as Strength Pareto Evolutionary Algorithm 2 (SPEA2) can be applied. In addition, a linear combination of two objective functions with weights can be exploited to generate Pareto sets. By varying weight values in the combined single objective function, a set of solutions is created. Experiments accomplished with a standard benchmark problem sets show that Variable Neighborhood Search (VNS) applied to solve a number of single objective function outperforms SPEA2. All generated solutions from SPEA2 are completely dominated by a set of VNS solutions. It seems that local optimization technique inherent in VNS makes it possible to generate near optimal solutions for the single objective function. Also, it shows that trade-off between the number of solutions in Pareto set and the computation time should be considered to obtain good solutions effectively in case of linearly combined single objective function.

• Nuclear Engineering and Technology
• /
• v.42 no.4
• /
• pp.414-425
• /
• 2010

In this paper, a procedure is developed for identifying a number of representative solutions manageable for decision-making in a multiobjective optimization problem concerning the test intervals of the components of a safety system of a nuclear power plant. Pareto Front solutions are identified by a genetic algorithm and then clustered by subtractive clustering into "families". On the basis of the decision maker's preferences, each family is then synthetically represented by a "head of the family" solution. This is done by introducing a scoring system that ranks the solutions with respect to the different objectives: a fuzzy preference assignment is employed to this purpose. Level Diagrams are then used to represent, analyze and interpret the Pareto Fronts reduced to the head-of-the-family solutions.

• Structural Engineering and Mechanics
• /
• v.43 no.6
• /
• pp.771-794
• /
• 2012

This paper presents a multi-objective evolutionary algorithm for combinatorial optimisation and applied for design optimisation of fiber reinforced composite structures. The proposed algorithm closely follows the implementation of Pareto Archive Evolutionary strategy (PAES) proposed in the literature. The modifications suggested include a customized neighbourhood search algorithm in place of mutation operator to improve intensification mechanism and a cross over operator to improve diversification mechanism. Further, an external archive is maintained to collect the historical Pareto optimal solutions. The design constraints are handled in this paper by treating them as additional objectives. Numerical studies have been carried out by solving a hybrid fiber reinforced laminate composite cylindrical shell, stiffened composite cylindrical shell and pressure vessel with varied number of design objectives. The studies presented in this paper clearly indicate that well spread Pareto optimal solutions can be obtained employing the proposed algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.4
• /
• pp.109-117
• /
• 2022

Most of real-world decision-making processes are used to optimize problems with many objectives of conflicting. Since the betterment of some objectives requires the sacrifice of other objectives, different objectives may not be optimized simultaneously. Consequently, Pareto solution can be considered as candidates of a solution with respect to a multi-objective optimization (MOP). Such problem involves two main procedures: finding Pareto solutions and choosing one solution among them. So-called multi-objective genetic algorithms have been proved to be effective for finding many Pareto solutions. In this study, we suggest a fitness evaluation method based on the achievement level up to the target value to improve the solution search performance by the multi-objective genetic algorithm. Using numerical examples and benchmark problems, we compare the proposed method, which considers the achievement level, with conventional Pareto ranking methods. Based on the comparison, it is verified that the proposed method can generate a highly convergent and diverse solution set. Most of the existing multi-objective genetic algorithms mainly focus on finding solutions, however the ultimate aim of MOP is not to find the entire set of Pareto solutions, but to choose one solution among many obtained solutions. We further propose an interactive decision-making process based on a visualized trade-off analysis that incorporates the satisfaction of the decision maker. The findings of the study will serve as a reference to build a multi-objective decision-making support system.

• Industrial Engineering and Management Systems
• /
• v.12 no.2
• /
• pp.151-160
• /
• 2013

In the past decades, several algorithms based on evolutionary approaches have been proposed for solving job shop scheduling problems (JSP), which is well-known as one of the most difficult combinatorial optimization problems. Most of them have concentrated on finding optimal solutions of a single objective, i.e., makespan, or total weighted tardiness. However, real-world scheduling problems generally involve multiple objectives which must be considered simultaneously. This paper proposes an efficient particle swarm optimization based approach to find a Pareto front for multi-objective JSP. The objective is to simultaneously minimize makespan and total tardiness of jobs. The proposed algorithm employs an Elite group to store the updated non-dominated solutions found by the whole swarm and utilizes those solutions as the guidance for particle movement. A single swarm with a mixture of four groups of particles with different movement strategies is adopted to search for Pareto solutions. The performance of the proposed method is evaluated on a set of benchmark problems and compared with the results from the existing algorithms. The experimental results demonstrate that the proposed algorithm is capable of providing a set of diverse and high-quality non-dominated solutions.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.304-310
• /
• 2021

The paper presents problems of optimization of the synthesis of embedded systems, in particular Pareto optimization. The model of such a system for its design for high-level of abstract is based on the classic approach known from the theory of task scheduling, but it is significantly extended, among others, by the characteristics of tasks and resources as well as additional criteria of optimal system in scope structure and operation. The metaheuristic algorithm operating according to this model introduces a new approach to system synthesis, in which parallelism of task scheduling and resources partition is applied. An algorithm based on a genetic approach with simulated annealing and Boltzmann tournaments, avoids local minima and generates optimized solutions. Such a synthesis is based on the implementation of task scheduling, resources identification and partition, allocation of tasks and resources and ultimately on the optimization of the designed system in accordance with the optimization criteria regarding cost of implementation, execution speed of processes and energy consumption by the system during operation. This paper presents examples and results for multi-criteria optimization, based on calculations for specifying non-dominated solutions and indicating a subset of Pareto solutions in the space of all solutions.

• Journal of Mechanical Science and Technology
• /
• v.20 no.12
• /
• pp.2115-2123
• /
• 2006

The paper deals with the identification of Pareto optimal solutions using GA based coevolution in the context of multiobjective optimization. Coevolution is a genetic process by which several species work with different types of individuals in parallel. The concept of cooperative coevolution is adopted to compensate for each of single objective optimal solutions during genetic evolution. The present study explores the GA based coevolution, and develops prescribed and adaptive scheduling schemes to reflect design characteristics among single objective optimization. In the paper, non-dominated Pareto optimal solutions are obtained by controlling scheduling schemes and comparing each of single objective optimal solutions. The proposed strategies are subsequently applied to a three-bar planar truss design and an energy preserving flywheel design to support proposed strategies.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.841-848
• /
• 2004

Evolutionary a1gorithms are well-suited for multi-objective optimization problems involving several, often conflicting objectives. Pareto-based evolutionary algorithms, in particular, have shown better performance than other multi-objective evolutionary algorithms in comparison. However, generalized evolutionary multi-objective optimization algorithms have a weak point, in which the distribution of solutions are not uni-formly distributed onto Pareto optimal front. In this paper, we propose an evolutionary a1gorithm for multi-objective optimization which uses seed individuals in order to overcome weakness of algorithms Published. Seed individual means a solution which is not located in the crowded region on Pareto front. And the idea of our algorithm uses seed individuals for reproducing individuals for next generation. Thus, proposed a1go-rithm takes advantage of local searching effect because new individuals are produced near the seed individual with high probability, and is able to produce comparatively uniform distributed pareto optimal solutions. Simulation results on five testbed problems show that the proposed algo-rithm could produce uniform distributed solutions onto pareto optimal front, and is able to show better convergence compared to NSGA-II on all testbed problems except multi-modal problem.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.11 s.254
• /
• pp.1358-1368
• /
• 2006

This paper proposes a Pareto artificial life algorithm for solving multi-objective optimization problems. The artificial life algorithm for optimization problem with a single objective function is improved to handle Pareto optimization problem through incorporating the new method to estimate the fitness value for a solution and the Pareto list to memorize and to improve the Pareto optimal set. The proposed algorithm was applied to the optimum design of a journal bearing which has two objective functions. The Pareto front and the optimal solution set for the application were presented to give the possible solutions to a decision maker or a designer. Furthermore, the relation between linearly combined single-objective optimization problem and Pareto optimization problem has been studied.