• Journal of the Society of Naval Architects of Korea
• /
• v.45 no.2
• /
• pp.221-228
• /
• 2008

This paper describes to determine optimum main particulars of warships which satisfy user's requirements in a concept design stage with minimum construction cost and maximum transportation efficiency. Present worth was used as an assessment criteria of the economical efficiency. And Pareto optimal set was used to have the optimum design.

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

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

• Management Science and Financial Engineering
• /
• v.13 no.2
• /
• pp.1-27
• /
• 2007

This paper presents a fuzzy-goal programming(FGP) approach for Bi-Level Linear Multiple Objective Decision Making(BLL-MODM) problem in a large hierarchical decision making and planning organization. The proposed approach combines the attractive features of both fuzzy set theory and goal programming(GP) for MODM problem. The GP problem has been developed by fixing the weights and aspiration levels for generating pareto-optimal(satisfactory) solution at each level for BLL-MODM problem. The higher level decision maker(HLDM) provides the preferred values of decision vector under his control and bounds of his objective function to direct the lower level decision maker(LLDM) to search for his solution in the right direction. Illustrative numerical example is provided to demonstrate the proposed approach.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.2
• /
• pp.247-255
• /
• 2004

The majority of real-world problems encountered by engineers involve simultaneous optimization of competing objectives. In this case instead of single optima, there is a set of alternative trade-offs, generally known as Pareto-optimal solutions. The use of evolutionary algorithms Pareto GA, which was first introduced by Goldberg in 1989, has now become a sort of standard in solving Multiobjective Optimization Problems (MOPs). Though this approach was further developed leading to numerous applications, these applications are based on Pareto ranking and employ the use of the fitness sharing function to maintain diversity. Another scheme for solving MOPs has been presented by J. Nash to solve MOPs originated from Game Theory and Economics. Sefrioui introduced the Nash Genetic Algorithm in 1998. This approach combines genetic algorithms with Nash's idea. Another central achievement of Game Theory is the introduction of an Evolutionary Stable Strategy, introduced by Maynard Smith in 1982. In this paper, we will try to find ESS as a solution of MOPs using our game model based co-evolutionary algorithm. First, we will investigate the validity of our co-evolutionary approach to solve MOPs. That is, we will demonstrate how the evolutionary game can be embodied using co-evolutionary algorithms and also confirm whether it can reach the optimal equilibrium point of a MOP. Second, we will evaluate the effectiveness of our approach, comparing it with other methods through rigorous experiments on several MOPs.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.11 no.3
• /
• pp.49-56
• /
• 2011

This paper deals with a methodology for searching optimal route of hazard material (hazmat) vehicles. When we make a decision of hazmat optimal paths, there is a conflict between the public aspect which wants to minimize risk and the private aspect which has a goal of minimizing travel time. This paper presents Efficient Vector Labeling algorithm as a methodology for searching optimal path of hazmat transportation, which is intrinsically one of the multi-criteria decision making problems. The output of the presented algorithm is a set of Pareto optimal paths considering both risk and travel time at a time. Also, the proposed algorithm is able to identify non-dominated paths which are significantly different from each other in terms of links used. The proposed Efficient Vector Labeling algorithm are applied to test bed network and compared with the existing k-shortest path algorithm. Analysis of result shows that the proposed algorithm is more efficient and advantageous in searching reasonable alternative routes than the existing one.

• International Journal of Fluid Machinery and Systems
• /
• v.3 no.2
• /
• pp.150-159
• /
• 2010

Laidback fan shaped film-cooling hole is formulated numerically and optimized with the help of three-dimensional numerical analysis, surrogate methods, and the multi-objective evolutionary algorithm. As Pareto optimal front produces a set of optimal solutions, the trends of objective functions with design variables are predicted by hybrid multi-objective evolutionary algorithm. The problem is defined by four geometric design variables, the injection angle of the hole, the lateral expansion angle of the diffuser, the forward expansion angle of the hole, and the ratio of the length to the diameter of the hole, to maximize the film-cooling effectiveness compromising with the aerodynamic loss. The objective function values are numerically evaluated through Reynolds- averaged Navier-Stokes analysis at the designs that are selected through the Latin hypercube sampling method. Using these numerical simulation results, the Response Surface Approximation model are constructed for each objective function and a hybrid multi-objective evolutionary algorithm is applied to obtain the Pareto optimal front. The clustered points from Pareto optimal front were evaluated by flow analysis. These designs give enhanced objective function values in comparison with the experimental designs.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.248-256
• /
• 2021

Now that we're in the big data era, data has taken on a new significance as the storage capacity has exploded from trillion bytes to petabytes at breakneck pace. As the use of cloud computing expands and becomes more commonly accepted, several businesses and institutions are opting to store their requests and data there. Cloud storage's concept of a nearly infinite storage resource pool makes data storage and access scalable and readily available. The majority of them, on the other hand, favour a single cloud because of the simplicity and inexpensive storage costs it offers in the near run. Cloud-based data storage, on the other hand, has concerns such as vendor lock-in, privacy leakage and unavailability. With geographically dispersed cloud storage providers, multicloud storage can alleviate these dangers. One of the key challenges in this storage system is to arrange user data in a cost-effective and high-availability manner. A multicloud storage architecture is given in this study. Next, a multi-objective optimization problem is defined to minimise total costs and maximise data availability at the same time, which can be solved using a technique based on the non-dominated sorting genetic algorithm II (NSGA-II) and obtain a set of non-dominated solutions known as the Pareto-optimal set.. When consumers can't pick from the Pareto-optimal set directly, a method based on Principal Component Analysis (PCA) is presented to find the best answer. To sum it all up, thorough tests based on a variety of real-world cloud storage scenarios have proven that the proposed method performs as expected.

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

• Advances in Computational Design
• /
• v.6 no.1
• /
• pp.31-42
• /
• 2021

This research aims to demonstrate the optimal geometrical design of splayed multiple cross-sectional pin fin heat sinks (SMCSPFHS), which are a type of side-inlet-side-outlet heat sink (SISOHS). The optimiser strength Pareto evolutionary algorithm2 (SPEA2)is employed to explore a set of Pareto optimalsolutions. Objective functions are the fan pumping power and junction temperature. Function evaluations can be accomplished using computational fluid dynamics(CFD) analysis. Design variablesinclude pin cross-sectional areas, the number of fins, fin pitch, thickness of heatsink base, inlet air speed, fin heights, and fin orientations with respect to the base. Design constraints are defined in such a way as to make a heat sink usable and easy to manufacture. The optimum results obtained from SPEA2 are compared with the straight pin fin design results obtained from hybrid population-based incremental learning and differential evolution (PBIL-DE), SPEA2, and an unrestricted population size evolutionary multiobjective optimisation algorithm (UPSEMOA). The results indicate that the splayed pin-fin design using SPEA2 issuperiorto those reported in the literature.