• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.213-219
• /
• 2016

This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

• Progress in Medical Physics
• /
• v.23 no.4
• /
• pp.252-260
• /
• 2012

The reduction of radiation dose from x-ray is a main concern in computed tomography (CT) imaging due to the side-effect of the dose on human body. Recently, the various methods for dose reduction have been studied in CT and one of the method is a iterative reconstruction based on total variation (TV) minimization at few-views data. In this paper, we evaluated the image quality between total variation (TV) minimization algorithm and Feldkam-Davis-kress (FDK) algorithm in micro computed tomography (CT). To evaluate the effect of TV minimization algorithm, we produced a cylindrical phantom including contrast media, water, air inserts. We can acquire maximum 400 projection views per rotation of the x-ray tube and detector. 20, 50, 90, 180 projection data were chosen for evaluating the level of image restoration by TV minimization. The phantom and mouse image reconstructed with FDK algorithm at 400 projection data used as a reference image for comparing with TV minimization and FDK algorithm at few-views. Contrast-to-noise ratio (CNR), Universal quality index (UQI) were used as a image evaluation metric. When projection data are not insufficient, our results show that the image quality of reconstructed with TV minimization is similar to reconstructed image with FDK at 400 view. In the cylindrical phantom study, the CNR of TV image was 5.86, FDK image was 5.65 and FDK-reference was 5.98 at 90-views. The CNR of TV image 0.21 higher than FDK image CNR at 90-views. UQI of TV image was 0.99 and FDK image was 0.81 at 90-views. where, the number of projection is 90, the UQI of TV image 0.18 higher than FDK image at 90-views. In the mouse study UQI of TV image was 0.91, FDK was 0.83 at 90-views. the UQI of TV image 0.08 higher than FDK image at 90-views. In cylindrical phantom image and mouse image study, TV minimization algorithm shows the best performance in artifact reduction and preserving edges at few view data. Therefore, TV minimization can potentially be expected to reduce patient dose in clinics.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.5
• /
• pp.1709-1718
• /
• 2017

This paper presents a hybrid stochastic deterministic multi-timescale scheduling (SDMS) approach for generation scheduling of a power grid. SDMS considers flexible resource options including conventional generation flexibility in a chance-constrained day-ahead scheduling optimization (DASO). The prime objective of the DASO is the minimization of the daily production cost in power systems with high penetration scenarios of variable generation. Furthermore, energy storage is scheduled in an hourly-ahead deterministic real-time scheduling optimization (RTSO). DASO simulation results are used as the base starting-point values in the hour-ahead online rolling RTSO with a 15-minute time interval. RTSO considers energy storage as another source of grid flexibility, to balance out the deviation between predicted and actual net load demand values. Numerical simulations, on the IEEE RTS test system with high wind penetration levels, indicate the effectiveness of the proposed SDMS framework for managing the grid flexibility to meet the net load demand, in both day-ahead and real-time timescales. Results also highlight the adequacy of the framework to adjust the scheduling, in real-time, to cope with large prediction errors of wind forecasting.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.6
• /
• pp.305-311
• /
• 2000

This paper presents a hybrid algorithm for solving optimal power flow(OPF) in order to enhance a systems capability to cope with outages, which is based on combined application of evolutionary computation and local search method. The efficient algorithm combining main advantages of two methods is as follows : Firstly, evolutionary computation is used to perform global exploitation among a population. This gives a good initial point of conventional method. Then, local methods are used to perform local exploitation. The hybrid approach often outperforms either method operating alone and reduces the total computation time. The objective function of the security constrained OPF is the minimization of generation fuel costs and real power losses. The resulting optimal operating point has to be feasible after outages such as any single line outage(respect of voltage magnitude, reactive power generation and power flow limits). In OPF considering security, the outages are selected by contingency ranking method(contingency screening model). The OPF considering security, the outages are selected by contingency ranking method(contingency screening model). The method proposed is applied to IEEE 30 buses system to show its effectiveness.

• Industrial Engineering and Management Systems
• /
• v.9 no.2
• /
• pp.70-79
• /
• 2010

Makespan and cost minimization are two important factors in project investment. This paper considers a multi-mode resource-constrained project scheduling problem with the objective of minimizing costs, subject to a deadline constraint. A number of studies have focused on minimizing makespan or resource availability cost with a specified deadline. This problem assumes a fixed cost for the availability of each renewable resource per period, and the project cost to be minimized is the sum of the variable cost associated with the execution mode of each activity. The presented memetic algorithm (MA) consists of three features: (1) a truncated branch and bound heuristic that serves as effective preprocessing in forming the initial population; (2) a strategy that maintains two populations, which respectively store deadline-feasible and infeasible solutions, enabling the MA to explore quality solutions in a broader resource-feasible space; (3) a repair-and-improvement local search scheme that refines each offspring and updates the two populations. The MA is tested via ProGen generated instances with problem sizes of 18, 20, and 30. The experimental results indicate that the MA performs exceptionally well in both effectiveness and efficiency using the optimal solutions or the current best solutions for the comparison standard.

• Advances in Energy Research
• /
• v.4 no.4
• /
• pp.255-274
• /
• 2016

This paper presents a novel symbiotic organisms search (SOS) algorithm to optimize both real power loss (RPL) and voltage stability limit (VSL) of a transmission network by controlling the variables such as unified power flow controller (UPFC) location, UPFC series injected voltage magnitude and phase angle and transformer taps simultaneously. Mathematically, this issue can be formulated as nonlinear equality and inequality constrained multi objective, multi variable optimization problem with a fitness function integrating both RPL and VSL. The symbiotic organisms search (SOS) algorithm is a nature inspired optimization method based on the biological interactions between the organisms in ecosystem. The advantage of SOS algorithm is that it requires a few control parameters compared to other meta-heuristic algorithms. The proposed SOS algorithm is applied for solving optimum control variables for both single objective and multi-objective optimization problems and tested on New England 39 bus test system. In the single objective optimization problem only RPL minimization is considered. The simulation results of the proposed algorithm have been compared with the results of the algorithms like interior point successive linear programming (IPSLP) and bacteria foraging algorithm (BFA) reported in the literature. The comparison results confirm the efficacy and superiority of the proposed method in optimizing both single and multi objective problems.

• ETRI Journal
• /
• v.42 no.1
• /
• pp.26-35
• /
• 2020

Herein, we consider uplink multiuser massive multiple-input multiple-output systems when multiple users transmit information symbols to a base station (BS) by applying simple space-time block coding (STBC). At the BS receiver, two detection filters for each user are used to detect the STBC information symbols. One of these filters is for odd-indexed symbols and the other for even-indexed symbols. Using constrained output variance metric minimization, we first derive a special relation between the closed-form optimal solutions for the two detection filters. Then, using the derived special relation, we propose a new blind adaptive algorithm for implementing the minimum output variance-based optimal filters. In the proposed adaptive algorithm, filter weight vectors are updated only in the region satisfying the special relation. Through a theoretical analysis of the convergence speed and a computer simulation, we demonstrate that the proposed scheme exhibits faster convergence speed and lower steady-state bit error rate than the conventional scheme.

• Journal of the Society of Naval Architects of Korea
• /
• v.40 no.5
• /
• pp.26-35
• /
• 2003

Propellers operating in a given nonuniform ship wake generate unsteady loads leading to undesirable stern vibration problems. The skew is known to be the most proper and effective geometric parameter to control or reduce the fluctuating forces on the shaft. This paper assumes the skew profile as either a quadratic or a cubic function of the radius and determines the coefficients of the polynomial function by applying the simplex method. The method uses the converted unconstrained algorithm to solve the constrained minimization problem of 6-component shaft excitation forces. The propeller excitation was computed either by applying the two-dimensional gust theory for quick estimation or by the fully three-dimensional unsteady lifting surface theory in time domain for an accurate solution. A sample result demonstrates that the shaft forces can be further reduced through optimization from the original design.

• Journal of applied mathematics & informatics
• /
• v.35 no.5_6
• /
• pp.423-438
• /
• 2017

The aim of this paper is to present two new viscosity rules for nonexpansive mappings in Hilbert spaces. Under some assumptions, the strong convergence theorems of the purposed new viscosity rules are proved. Some applications are also included.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.103-110
• /
• 2004

This paper presents a two-phase method for the vehicle routing problems with time windows(VRPTW). In a supply chain management(SCM) environment, timely distribution is very important problem faced by most industries. The VRPTW is associated with SCM for each customer to be constrained the time of service. In the VRPTW, the objective is to design the least total travel time routes for a fleet of identical capacitated vehicles to service geographically scattered customers with pre-specified service time windows. The proposed approach is based on ant colony optimization(ACO) and improvement heuristic. In the first phase, an insertion based ACO is introduced for the route construction and its solutions is improved by an iterative random local search in the second phase. Experimental results show that the proposed two-phase method obtains very good solutions with respect to total travel time minimization.