• 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.

• Structural Engineering and Mechanics
• /
• v.70 no.3
• /
• pp.367-380
• /
• 2019

The paper concerns topology and geometry optimization of statically determinate beams with arbitrary number of supports. The optimization problem is treated as a bi-criteria one, with the objectives of minimizing the absolute maximum bending moment and the maximum deflection for a uniform gravity load. The problem is formulated and solved using the Pareto optimality concept and the lexicographic ordering of the objectives. The non-dominated sorting genetic algorithm NSGA-II and the local search method are used for the optimization in the Pareto sense, whereas the genetic algorithm and the exhaustive search method for the lexicographic optimization. Trade-offs between objectives are examined and sets of Pareto-optimal solutions are provided for different topologies. Lexicographically optimal beams are found assuming that the maximum moment is a more important criterion. Exact formulas for locations and values of the maximum deflection are given for all lexicographically optimal beams of any topology and any number of supports. Topologies with lexicographically optimal geometries are classified into equivalence classes, and specific features of these classes are discussed. A qualitative principle of the division of topologies equivalent in terms of the maximum moment into topologies better and worse in terms of the maximum deflection is found.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.869-874
• /
• 2005

This paper proposes the Pareto artificial life algorithm for a multi-objective function optimization problem. The artificial life algorithm for a single objective function optimization problem is improved through incorporating the new method to estimate the fitness value fur a solution and the Pareto list to memorize and to improve the Pareto optimal set. The proposed algorithm is 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 are reported to present the possible solutions to a decision maker or a designer.

• IE interfaces
• /
• v.21 no.1
• /
• pp.75-84
• /
• 2008

It is a difficult task for decision makers(DMs) to choose an appropriate release plan which balances the conflicts between water storage and hydro-electric energy generation in a multi-reservoir operation problem. In this study, we proposed a DEA-based ranking procedure by which the DM can rank the potential alternatives and select the best solution among the Pareto-optimal solutions. The proposed procedure can resolve the problem of mix inefficiency that may cause errors in measuring the efficiency of alternatives. We applied the proposed procedure to the multi-reservoir operation problem for the Geum-River basin and could choose the best efficient solution from the Pareto-set which were generated by the Coordinated Multi-Reservoir Operating Model.

• 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.

• 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.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.12 no.2
• /
• pp.9-22
• /
• 2008

This paper presents an integrated optimal design technique of a hybrid structure-damper system for improving the seismic performance of the structure. The proposed technique corresponds to the optimal distribution of the stiffness and dampers. The multi-objective optimization technique is introduced to deal with the optimal design problem of the hybrid system, which is reformulated into the multi-objective optimization problem with a constraint of target reliability in an efficient manner. An illustrative example shows that the proposed technique can provide a set of Pareto optimal solutions embracing the solutions obtained by the conventional sequential design method and single-objective optimization method based on weighted summation scheme. Based on the stiffness and damping capacities, three representative designs are selected among the Pareto optimal solutions and their seismic performances are investigated through the parametric studies on the dynamic characteristics of the seismic events. The comparative results demonstrate that the proposed approach can be efficiently applied to the optimal design problem for improving the seismic performance of the structure.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.1
• /
• pp.77-91
• /
• 2007

In this paper, we present a symbiotic evolutionary algorithm for multi-objective optimization. The goal in multi-objective evolutionary algorithms (MOEAs) is to find a set of well-distributed solutions close to the true Pareto optimal solutions. Most of the existing MOEAs operate one population that consists of individuals representing the entire solution to the problem. The proposed algorithm has a two-leveled structure. The structure is intended to improve the capability of searching diverse and food solutions. At the lower level there exist several populations, each of which represents a partial solution to the entire problem, and at the upper level there is one population whose individuals represent the entire solutions to the problem. The parallel search with partial solutions at the lower level and the Integrated search with entire solutions at the upper level are carried out simultaneously. The performance of the proposed algorithm is compared with those of the existing algorithms in terms of convergence and diversity. The optimization problems with continuous variables and discrete variables are used as test-bed problems. The experimental results confirm the effectiveness of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1157-1165
• /
• 2011

The Karush-Kuhn-Tucker (KKT) necessary optimality conditions for nonlinear differentiable programming problems are also sufficient under suitable convexity assumptions. The KKT conditions in multiobjective programming problems with interval-valued objective and constraint functions are derived in this paper. The main contribution of this paper is to obtain the Pareto optimal solutions by resorting to the sufficient optimality condition.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.4
• /
• pp.119-125
• /
• 2011

The part family (PF) formation in a cellular manufacturing has been a key issue for the successful implementation of Group Technology (GT). Basically, a part has two different attributes; i.e., design and manufacturing. The respective similarity in both attributes is often conflicting each other. However, the two attributes should be taken into account appropriately in order for the PF to maximize the benefits of the GT implementation. This paper proposes a clustering algorithm which considers the two attributes simultaneously based on pareto optimal theory. The similarity in each attribute can be represented as two individual objective functions. Then, the resulting two objective functions are properly combined into a pareto fitness function which assigns a single fitness value to each solution based on the two objective functions. A GA is used to find the pareto optimal set of solutions based on the fitness function. A set of hypothetical parts are grouped using the proposed system. The results show that the proposed system is very promising in clustering with multiple objectives.