• IE interfaces
• /
• v.15 no.3
• /
• pp.279-285
• /
• 2002

A break-even analysis is a method used widely for profit planning or decisions in most companies. It is useful tool in financial studies because it is simple and offers useful insights from a modest amount of data. Although it is widely used, it has some weaknesses. It is limited in particular to the analysis for a short term time horizon or one period. We suggest a new break-even procedure to analyze projects with a long term time horizon as keeping the simplicity of a conventional break-even analysis. We will make efforts doing to include actual data for a cost or an income as much as possible rather than developing a mathematical model to improve unreality of a traditional break-even analysis. Also, we will use the spreadsheet software to solve problems.

• The Bulletin of The Korean Astronomical Society
• /
• v.40 no.2
• /
• pp.29.2-29.2
• /
• 2015

Interactions such as mergers and flybys play a fundamental role in shaping galaxy morphology. We used the Horizon Run 4 cosmological N-body simulations to study the aligments of spins and shapes of interacting haloes as a function of the halo mass and large-scale density. Interactions preferentially occur in the plane of rotation, and in the direction of the major axis of prolate haloes, and the trajectories are preferentially radial and prograde. We found a very strong alignment of the shapes already at redshift as high as 4. The spins are initially unaligned or even anti-aligned, and become more and more aligned as the redshift decreases. The alignment signals are stronger and evolve more at lower densities, and mass plays a secondary role.

• The Bulletin of The Korean Astronomical Society
• /
• v.40 no.2
• /
• pp.50.2-50.2
• /
• 2015

The Horizon Run 4 is a huge cosmological simulation intended for the study of evolution of dark matter halos in a side of volume of 3150 h-1 Mpc. Using the halo merger trees of most bound particles, we test various models on the survivals of satellites in clusters and will compare them with observed satellite galaxies in a one-to-one correspondence model. We estimate the abundances of central and satellite subhalos, and compare them with the SDSS main-galaxy group catalogue provided by Tempel et al. (2014). Based on these comparisons we will study the mass-to-light relations, environmental effects on morphology and luminosity function, halo occupations in clusters, and nonlinear dynamics of clusters of galaxies.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.1
• /
• pp.10-23
• /
• 1988

This paper examines a deterministic, discrete-time, finite-horizon, production/distribution problem for a one-plant multi-retailer system. Production may occur at the plant in each time period. Customer demands at each retailer over a finite number of periods are known and must be met without backlogging. The plant as well as the retailers can serve as stocking points. The problem is to find a minimum-cost production/distribution schedule satisfying the known demands. We show that under a certain cost structure a nested policy is optimal, and present an efficient algorithm to find such an optimal policy. Planning horizon results and some computational saving schemes are also presented.

• Journal of Korean Institute of Industrial Engineers
• /
• v.2 no.1
• /
• pp.85-92
• /
• 1976

In this paper, the employment planning model is developed which is a decision-making model for determining the optimum employment level with respect to varying net manpower requirement for each planing period such that total cost in a planning horizon is minimized. It is constructed as a nonlinear programming model and a dynamic programming model on the basis of studies in the areas of production smoothing and manpower scheduling. Costs for a planning period are categorized into regular wage cost, hiring cost, and overtime cost. The first is a linear function. The other two cost functions are of quadratic nature. The planning horizon of this planning model is intermediate range (five years) for which a fair planning accuracy can be guaranteed. The model considers learning period for each job class. It is simple and an optimum solution can be easily obtained by direct search techniques.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.5
• /
• pp.2536-2543
• /
• 2013

In this paper, we proposed the modeling in one zone buildings and the energy efficient temperature control algorithm using particle swarm optimization (PSO). A control horizon switching method with PSO is used for optimal control, and the TOU tariff is included to calculate the energy costs. Simulation results show that the reductions of energy cost and peak power can be obtained using proposed algorithms.

• Journal of information and communication convergence engineering
• /
• v.14 no.2
• /
• pp.129-135
• /
• 2016

In this paper, we present a novel algorithm for image-based maritime obstacle detection using global sparsity potentials (GSPs), in which "global" refers to the entire sea area. The horizon line is detected first to segment the sea area as the region of interest (ROI). Considering the geometric relationship between the camera and the sea surface, variable-size image windows are adopted to sample patches in the ROI. Then, each patch is represented by its texture feature, and its average distance to all the other patches is taken as the value of its GSP. Thereafter, patches with a smaller GSP are clustered as the sea surface, and patches with a higher GSP are taken as the obstacle candidates. Finally, the candidates far from the mean feature of the sea surface are selected and aggregated as the obstacles. Experimental results verify that the proposed approach is highly accurate as compared to other methods, such as the traditional feature space reclustering method and a state-of-the-art saliency detection method.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2236-2244
• /
• 2018

We make optimal consecutive offer curves for an energy storage system (ESS) integrated wind power producer (WPP) in the co-optimized day-ahead energy and regulation markets. We build the offer curves by solving multi-stage stochastic optimization (MSSO) problems based on the scenarios of pairs consisting of real-time price and wind power forecasts through the progressive hedging method (PHM). We also use the rolling horizon method (RHM) to build the consecutive offer curves for several hours in chronological order. We test the profitability of the offer curves by using the data sampled from the Iberian Peninsula. We show that the offer curves obtained by solving MSSO problems with the PHM and RHM have a higher profitability than offer curves obtained by solving deterministic problems.

• International Journal of Aeronautical and Space Sciences
• /
• v.12 no.1
• /
• pp.16-23
• /
• 2011

In this paper, nonlinear model predictive control (NMPC) is addressed to develop formation guidance for multiple unmanned aerial vehicles. An NMPC algorithm predicts the behavior of a system over a receding time horizon, and the NMPC generates the optimal control commands for the horizon. The first input command is, then, applied to the system and this procedure repeats at each time step. The input constraint and state constraint for formation flight and inter-collision avoidance are considered in the proposed NMPC framework. The performance of NMPC for formation guidance critically degrades when there exists a communication failure. In order to address this problem, the modified optimal guidance law using only line-of-sight, relative distance, and own motion information is presented. If this information can be measured or estimated, the proposed formation guidance is sustainable with the communication failure. The performance of this approach is validated by numerical simulations.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.36 no.1
• /
• pp.27-38
• /
• 2011

In this paper, we deal with the periodic heterogeneous fleet vehicle routing problem (PHVRP). PHVRP is a problem of designing vehicle routes in each day of given period to minimize the sum of fixed cost and variable cost over the planning horizon. Each customer can be visited once or more times over the planning horizon according to the service combinations of that customer. Due to the complexity of the problem, we suggest a heuristic algorithm in which an initial solution is obtained by assigning the customer-day and the customer-car simultaneously and then it is improved. A performance of the proposed algorithm was compared to both well-known results and new test problems.