• The Journal of Information Systems
• /
• v.21 no.3
• /
• pp.99-116
• /
• 2012

As a way to allocate lots of orders to many participants for vehicle allocation problem, this study has used an agent negotiation based reverse auction model. This agent negotiation provides coordination functions allowing all participants to make a profit, and accomplishing Pareto optimum solution from the viewpoint of a whole trucking cargo transportation network. In order to build a strategic cooperation relationship based on information sharing, this agent negotiation provides a coordination mechanism in which all the participants including consignors, brokerage firms, and car owners are able to attain their own profits, and also that ensure a competitive market. This study has tried to prove that the result of an agent-based negotiation is the Pareto optimal solution under the present market environment. We established a mathematical formulation for a comparison with the Integer Programming model, and analysing e-Marketplace, structure of shipping expenses and brokerage system in the trucking cargo transportation industry.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1296-1299
• /
• 1996

This paper proposes a design automation method for the flight control system of an aircraft based on optimization. The control system design problem which has many specifications is formulated as multi-objective optimization problem. The solution of this optimization problem should be considered in terms of Pareto-optimality. In this paper, we use an evolutionary algorithm providing numerous Pareto-optimal solutions. These solutions are given to a control system designer and the most suitable solution is selected. This method decreases tasks required to determine the control parameters satisfying all specifications. The design automation of a flight control system is illustrated through an example.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.1071-1076
• /
• 2003

Evolutionary algorithm is recognized as a promising approach to solving multi-objective combinatorial optimization problems. When no preference information of decision makers is given, multi-objective optimization problems have been commonly used to search for diverse and good Pareto optimal solution. In this paper we propose a new multi-objective evolutionary algorithm based on competitive coevolutionary algorithm, and demonstrate the applicability of the algorithm. The proposed algorithm is designed to promote both population diversity and rapidity of convergence. To achieve this, the strategies of fitness evaluation and the operation of the Pareto set are developed. The algorithm is applied to job shop scheduling problems (JSPs). The JSPs have two objectives: minimizing makespan and minimizing earliness or tardiness. The proposed algorithm is compared with existing evolutionary algorithms in terms of solution quality and diversity. The experimental results reveal the effectiveness of our approach.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.3
• /
• pp.25-43
• /
• 2010

We consider a multi-objective balancing and sequencing problem in mixed model assembly lines, which is important for an efficient use of the assembly lines. In this paper, we present a neighborhood symbiotic evolutionary algorithm to simultaneously solve the two problems of balancing and model sequencing under multiple objectives. We aim to find a set of well-distributed solutions close to the true Pareto optimal solutions for decision makers. The proposed algorithm has a two-leveled structure. At Level 1, two populations are operated : One consists of individuals each of which represents a partial solution to the balancing problem and the other consists of individuals for the sequencing problem. Level 2, which is an upper level, works one population whose individuals represent the combined entire solutions to the two problems. The process of Level 1 imitates a neighborhood symbiotic evolution and that of Level 2 simulates an endosymbiotic evolution together with an elitist strategy to promote the capability of solution search. The performance of the proposed algorithm is compared with those of the existing algorithms in convergence, diversity and computation time of nondominated solutions. The experimental results show that the proposed algorithm is superior to the compared algorithms in all the three performance measures.

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

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.11 no.1
• /
• pp.26-35
• /
• 1987

As an attempt to make the multi-objection for the line design of the rope way, the resulted formulas from the catenary curve as exact ones were summarized, and it was found out that the Kuhn-Tucker's optimality conditions and regions of the objective functions can analytically be expressed with dimensionless parameters. The Pareto's optimum solution set was analytically obtained through the objective function-the minimum relation of $W^{*}$, and $W^{*}$ is a trade-off relation. From this, The dimension of a rope and the value of an initial tension that are the standard in design of the rope way were determined. It was concluded that $V^{*}$ should become minimum, and that the ratio of the dimension of rope to the value of and initial tension become larger than superposition factor corresponding to curve AB.to curve AB.

• The Journal of Fisheries Business Administration
• /
• v.42 no.3
• /
• pp.31-39
• /
• 2011

This paper attempts to extend such analysis to the rather more difficult problem of optimal management of transnational fish stocks jointly owned by two countries. Transboundary fish such as Mackerel creates an incentive to harvest fish before a competitor does and leads to over-exploitation. This tendency is especially poignant for transnational stocks since, in the absence of an enforceable, international agreement, there is little or no reason for either government or the fishing industry to promote resource conservation and economic efficiency. In the current paper I examine a game theoretic setting in which cooperative management can provide more benefits than noncooperative management. A dynamic model of Mackerel fishery is combined with Nash's theory of two countries cooperative games. A characteristic function game approach is applied to describe the sharing of the surplus benefits from cooperation and noncooperation. A bioeconomic model was used to compare the economic yield of the optimal strategies for two countries, under joint maximization of net benefits in joint ocean. The results suggest as follows. First, the threat points represent the net benefits for two countries in absence of cooperation. The net benefits to Korea and China in threat points are 2,000 billion won(${\pi}^0_{KO}$) and 1,130 billion won(${\pi}^0_{CH}$). Total benefits are 3,130 billion won. Second, if two countries cooperate one with another, they reach the solution payoffs such as Pareto efficient. The net benefits to Korea and China in Pareto efficient are 2,785 billion won(${\pi}^0_{KO}$) and 1,605 billion won(${\pi}^0_{CH}$) or total benefits of 4,390 billion won : a gain of 1,260 billion won. Third, the different price effects under the two scenarios show that total benefit rise as price increases.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.65 no.6
• /
• pp.23-35
• /
• 2023

In this study, we developed a method to determine the flood-limited water levels of agricultural reservoirs, considering both their irrigation and flood control functions. Irrigation safety and flood safety indices were defined to be applied to various reservoirs, allowing for a comprehensive assessment of the irrigation and flood control properties. Seasonal flood-limited water level scenarios were established to represent the temporal characteristics of rainfall and agricultural water supply and the safety indices were analyzed according to these scenarios. The optimal scenarios were derived using a schematic solution based on Pareto front analysis. The method was applied to Obong, Yedang, and Myogok reservoirs, and the results showed that the characteristics of each reservoir were well represented in the safety indices. The irrigation safety of Obong reservoir was found to be significantly influenced by the late-stage flood-limited water level, while those of Yedang and Myogok reservoir were primarily affected by the early and mid-stage flood-limited water levels. The values of irrigation safety and flood safety indices for each scenario were plotted as points on the coordinate plane, and the optimal flood-limited water levels were selected from the Pareto front. The storage ratio of the optimal flood-limited water levels for the early, mid, and late stages were 65-70%, 70%, and 75% for Obong reservoir, 75%, 70-75%, and 65-70% for Yedang reservoir, and 75-80%, 70%, and 50% for Myogok reservoir. We expect that the method developed in this study will facilitate efficient reservoir operations.

• Management Science and Financial Engineering
• /
• v.13 no.2
• /
• pp.29-46
• /
• 2007

This paper makes an attempt to compare the two important methods for finding solutions of multi-item inventory problem with more than one conflicting objectives. Panda et al.[9] discusses a distance-based method to find the best possible compromise solution with variation of priority under the given weight structure. In this paper, the problem in [9] is revisited through the Pareto-optimal front of genetic algorithm with the help of a situation of retail stocking of FMCG business. The advantages of using the solutions from the perspective of the decision maker obtained through multi-objective optimization are highlighted in terms of population search, weighted goals and priority structure, cost, set of compromise solutions along with prevention of stock-out situation.

• Journal of the Society of Naval Architects of Korea
• /
• v.33 no.2
• /
• pp.56-64
• /
• 1996

In this study, a review is made of the previous work(Ref. 1 and 5) for the development of the limit design method of the flat rectangular grillages under the lateral pressure. And the effect of the in-plane loads on the collapse theory is considered. The main part of the work is devoted in developing the standard design method of grillages under the criteria of minimum weight and minimum cost. In the final part, it was shown that Pareto solution methods can be easily applied to structural optimization with the multiple objectives, and the designer can have an appropriate choice from those Pareto optimal solutions.