• Title/Summary/Keyword: Multiobjective Programming

Search Result 68, Processing Time 0.032 seconds

Application of a Multiobjective Technique for Optimum Operation of Pumps and Reservoirs in Service Water Transmission Systems (다목적 분석 기법을 이용한 상수도 송수계의 펌프와 배수지의 연계 최적 운영)

  • Ko, Seok-Ku;Oh, Min-Hwan
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.738-743
    • /
    • 1991
  • A multiobjective analysis technique was applied for the optimum operation of pumps and reservoirs in service water transmission systems. Three major objectives were identified and assessed on the normally operating service water transmission systems. They are, 1) stability of pump operation; 2) economic point of view in minimizing the energy cost for pumping; 3) reliability in meeting the stochasticaly varying demands. The measures of these objectives were required times of pump on-offs in stability, required total energy cost in economics, and minimum required storage during the operating horizon in reliability. In order to find the best meeting solution to the decision maker, a set of non-dominated solutions which show the tradeoff relationships between the considering objectives were generated. The DM selects the best solution from this explicit tradeoff relationships using his heuristic decision rules or experience. The theory was verified by applying to the Kumi Service Water System. A combined technique of the ${\varepsilon}-constraint$ and the weighting methods was used to generate the nondominated solutions, and the dynamic programming algorithm was applied to find the optimal solution for the discretized multi-objective analysis problems.

  • PDF

Optimal Reservoir Operation Using Goal Programming for Flood Season (Goal Programming을 이용한 홍수기 저수지 최적 운영)

  • Kim, Hye-Jin;Ahn, Jae-Hwang;Choi, Chang-Won;Yi, Jae-Eung
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.11 no.2
    • /
    • pp.147-156
    • /
    • 2011
  • The purpose of multipurpose reservoir operation in flood season is to reduce the peak flood at a control point by utilizing flood control storage or to minimize flood damage by controlling release and release time. Therefore, the most important thing in reservoir operation for flood season is to determine the optimal release and release time. In this study, goal programming is used for the optimal reservoir operation in flood season. The goal programming minimizes a sum of deviation from the target value using linear programming or nonlinear programming to obtain the optimal alternative for the problem with more than two objectives. To analyze the applicability of goal programming, the historical storm data are utilized. The goal programming is applied to the reservoir system operation as well as single reservoir operation. Chungju reservoir is selected for single reservoir operation and Andong and Imha reservoirs are selected for reservoir system operation. The result of goal programming is compared with that of HEC-5. As a result, it was found that goal programming could maintain the reservoir level within flood control level at the end of a flood season and also maintain flood discharge within a design flood at a control point for each time step. The goal programming operation is different from the real operation in the sense that all inflows are assumed to be given in advance. However, flood at a control point can be reduced by calculating the optimal release and optimal release time using suitable constraints and flood forecasting system.

Development of Clustering Algorithm for the Design of Telecommunication Network Considering Cost-Traffic Tradeoff (Cost-Traffic Tradeoff를 고려한 통신망 설계의 Clustering 알고리듬 개발)

  • 박영준;이홍철;김승권
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.3
    • /
    • pp.23-36
    • /
    • 1997
  • In the design of telecommunication network, the network configuration using hubbing topology is useful for designing and managing the network efficiently : i. e. all of central offices (COs) are grouped into clusters. Each cluster has one hub consisting of large-scale transmission facilities like digital cross-connect systems and ATMs. In clustering process, the community of interest and geographical factor should be considered. However, there exists a tradeoff between two factors. One is to minimize total link costs for geographical factor and the other is to maximize the total intra-cluster traffics for community of interest. Hence, this can be solved by multiobjective linear programming techniques. In this paper, the problem under considerations is formulated as two p-median subproblems taking into considerations total costs and total intra-traffics, respectively. Then we propose the algorithm to solve the problem based on the concept of cost-traffic tradeoff. The algorithm enables to identify efficient cost-traffic tradeoff pairs. An illustration is also presented.

  • PDF

ON OPTIMALITY AND DUALITY FOR GENERALIZED NONDIFFERENTIABLE FRACTIONAL OPTIMIZATION PROBLEMS

  • Kim, Moon-Hee;Kim, Gwi-Soo
    • Communications of the Korean Mathematical Society
    • /
    • v.25 no.1
    • /
    • pp.139-147
    • /
    • 2010
  • A generalized nondifferentiable fractional optimization problem (GFP), which consists of a maximum objective function defined by finite fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions, is considered. Recently, Kim et al. [Journal of Optimization Theory and Applications 129 (2006), no. 1, 131-146] proved optimality theorems and duality theorems for a nondifferentiable multiobjective fractional programming problem (MFP), which consists of a vector-valued function whose components are fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions. In fact if $\overline{x}$ is a solution of (GFP), then $\overline{x}$ is a weakly efficient solution of (MFP), but the converse may not be true. So, it seems to be not trivial that we apply the approach of Kim et al. to (GFP). However, modifying their approach, we obtain optimality conditions and duality results for (GFP).

An Overview of Models for Energy Technology Assessment (에너지기술평가모형에 관한 고찰)

  • 김호탁;최기련;강희정;차재호
    • Journal of Energy Engineering
    • /
    • v.1 no.1
    • /
    • pp.111-134
    • /
    • 1992
  • Energy system models have been broadly used for the solution of the assessment of technical and economical characteristics in the national energy systems. The purpose of this study is to overview the structures, potentials and usefulness of system models for energy technology assessment. The conventional models developed so far are not aquate to analyze the energy and environmental problems simultaneously. Energy system models integrated by multiobjective programming are also reviewed and discussed in this paper to judge their usefulness and applicability in simultaneously analyzing the energy and environmental problems.

  • PDF

Development of a Multiobjective Optimization Algorithm Using Data Distribution Characteristics (데이터 분포특성을 이용한 다목적함수 최적화 알고리즘 개발)

  • Hwang, In-Jin;Park, Gyung-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.34 no.12
    • /
    • pp.1793-1803
    • /
    • 2010
  • The weighting method and goal programming require weighting factors or target values to obtain a Pareto optimal solution. However, it is difficult to define these parameters, and a Pareto solution is not guaranteed when the choice of the parameters is incorrect. Recently, the Mahalanobis Taguchi System (MTS) has been introduced to minimize the Mahalanobis distance (MD). However, the MTS method cannot obtain a Pareto optimal solution. We propose a function called the skewed Mahalanobis distance (SMD) to obtain a Pareto optimal solution while retaining the advantages of the MD. The SMD is a new distance scale that multiplies the skewed value of a design point by the MD. The weighting factors are automatically reflected when the SMD is calculated. The SMD always gives a unique Pareto optimal solution. To verify the efficiency of the SMD, we present two numerical examples and show that the SMD can obtain a unique Pareto optimal solution without any additional information.

Optimum Design of Endosseous Implant in Dentistry by Multilevel Optimization Method (다단계 최적화 기법을 이용한 치과용 골내 임플란트의 형상 최적 설계)

  • Han, Jung-Suk;Seo, Ki-Youl;Choi, Joo-Ho
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.1
    • /
    • pp.144-151
    • /
    • 2003
  • In this paper, an optimum design problem for endosseous implant in dentistry is studied to find best implant design. An optimum design problem is formulated to reduce stresses arising at the cortical as well as cancellous bones, in which sufficient design parameters are chosen fur design definition that encompasses major implants in popular use. Optimization at once (OAO) with the large number of design variables, however, causes too costly solution or even failure to converge. A concept of multilevel optimization (MLO) is employed to this end, which is to group the design variables of similar nature, solve the sub-problem of smaller size fur each group in sequence, and this is iterated until convergence. Each sub-problem is solved based on the response surface method (RSM) due to its efficiency for small sized problem. Favorable solution is obtained by the MLO, which is compared to both solutions made by RSM and sequential quadratic programming (SQP) in the OAO problem.

A MULTIOBJECTIVE MODEL OF WHOLESALER-RETAILERS' PROBLEM VIA GENETIC ALGORITHM

  • MAHAPATRA NIRMAL KUMAR;BHUNIA ASOKE KUMAR;MAITI MANORANJAN
    • Journal of applied mathematics & informatics
    • /
    • v.19 no.1_2
    • /
    • pp.397-414
    • /
    • 2005
  • In the existing literature, most of the purchasing models were developed only for retailers problem ignoring the constraint of storage capacity of retailers shop/showroom. In this paper, we have developed a deterministic model of wholesaler-retailers' problem of single product. The storage capacity of wholesaler's warehouse/showroom and retailers' showroom/shop are assumed to be finite. The items are transported from wholesaler's warehouse to retailers' Own Warehouse (OW) in a lot. The customer's demand is assumed to be displayed inventory level dependent. Demands are met from OW and that spaces of OW will immediately be filled by shifting the same amount from the Rented Warehouse (RW) till the RW is empty. The time duration between selling from OW and filling up its space by new ones from RW is negligible. According to relative size of the retailers' existing (own) warehouse capacity and the demand factors, different scenarios are identified. Our objectives are to optimize the cost functions of wholesaler and two retailers separately. To solve this problem, a real coded Genetic Algorithm (GA) with roulette wheel selection/reproduction, whole arithmetic crossover and non-uniform mutation is developed. Finally a numerical example is presented to illustrate the results for different scenarios. To compare the results of GA, Generalised Reduced Gradient Method has been used for the problem. Also, a sensitivity analysis has been performed to study the variations of the optimal average cost with respect to the different parameters.