• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.6
• /
• pp.22-27
• /
• 2011

This paper presents an efficient technique to reduce PN code acquisition time considerably by adjusting threshold values in direct sequence spread spectrum (DS-SS) systems. The proposed algorithm employs a pre-dump mode prior to a search mode, and the pre-dump mode determines threshold values of both search and verification modes depending on its correlation energy, which can improve not only the rejection performance of false code phases in the search mode but also that in the verification mode. The proposed method can reduce the mean code acquisition time by about 40% without increase of hardware costs compared with the conventional technique.

• IE interfaces
• /
• v.20 no.2
• /
• pp.103-111
• /
• 2007

A heterogeneous VRP which considers various capacities, fixed and variable costs was suggested in this study. The transportation cost for vehicle is composed of its fixed and variable costs incurred proportionately to the travel distance. The main objective is to minimize the total sum of transportation costs. A mathematical programming model was suggested for this purpose and it gives an optimal solution by using OPL-STUDIO (ILOG CPLEX). A genetic algorithm which considers improvement of an initial solution, new fitness function with weighted cost and distance rates, and flexible mutation rate for escaping local solution was also suggested. The suggested algorithm was compared with the results of a tabu search and sweeping method by Taillard and Lee, respectively. The suggested algorithm gives better solutions rather than existing algorithms.

• Journal of the Korea Society for Simulation
• /
• v.29 no.4
• /
• pp.95-109
• /
• 2020

In this paper, an optimal manufacturing system design problem in an automotive body assembly lines is introduced when various costs such as equipment investment costs are considered. Meta-model methodology based on simulation results has been used for estimating the performances of the system such as production rate and work-in-process levels. The objective function is minimizing total cost which satisfies the target production rate. The investment costs such as robots, buffers, transportation equipment, and the inventory holding cost of work-in-process have been included in the objective function. Harmony search method has been used for optimization.

• Journal of Korean Academy of Nursing
• /
• v.38 no.3
• /
• pp.363-371
• /
• 2008

Purpose: This analysis was conducted to evaluate the cost-effectiveness of gemcitabine-cisplatin chemotherapy for non small-cell lung cancer patients in an outpatient setting compared with the traditional inpatient setting. Methods: A cost-effective analysis was conducted from a societal perspective. The effects of treatment, which was measured as an adverse event rate, were abstracted from a published literature search and empirical data from one university hospital. The costs included both direct and indirect costs. Direct costs included hospitalizations, outpatient visits, and lab tests. Pharmaceutical costs were excluded in analysis because they were same for both options. Indirect costs included productivity loss of patients as well as care-givers. In order to determine the robustness of the results, sensitivity analysis on treatment protocol was conducted. Results: Literature search showed no difference in adverse effect rates between inpatient treatment protocol and outpatient treatment protocol. Therefore, this analysis is a cost-minimization analysis. Cost-savings in the outpatient setting was 555,936 won for one treatment cycle. Our sensitivity analysis indicated that the outpatient chemotherapy still showed cost-savings, regardless of changes in treatment protocol. Conclusion: The outpatient gemcitabine-cisplatin chemotherapy for non small-cell lung cancer resulted in cost savings compared to inpatient chemotherapy. More importantly, outpatient chemotherapy could improve the utilization of health service resources in terms of available beds.

• Journal of Internet Computing and Services
• /
• v.9 no.3
• /
• pp.1-8
• /
• 2008

With growing interest in location-based service (LBS), there is increasing necessity for nearest neighbor (NN) search through query while the user is moving. NN search in such a dynamic environment has been performed through the repeated applicaton of the NN method to the search segment, but this increases search cost because of unnecessary redundant calculation. We propose slabbed continuous nearest neighbor (Slabbed_CNN) search, which is a new method that searches CNN in the search segment while moving, Slabbed_CNN reduces calculation costs and provides faster services than existing CNN by reducing the search area and calculation cost of the existing CNN method through reducing the search segment using slabs.

• IE interfaces
• /
• v.24 no.4
• /
• pp.295-303
• /
• 2011

This paper presents a discrete time optimal asset buying problem with a predetermined final deadline where an available budget is limited. A cost is paid to search for assets called the search cost. A seller who shows up offers a price for the asset and then the buyer decides whether or not to buy the asset by comparing the offered price to his optimal selection threshold. When the budget becomes less than the search cost or the price of the asset the buyer can get a necessary loan with some interests. We clarify the properties of the buyer's optimal selection threshold in order to maximize the expected value of budget which is left after paying all the search costs and the price of the asset at that point in time.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.11
• /
• pp.528-536
• /
• 2001

This paper proposes a method of solving a unit commitment problem using parallel tabu search(PTS) approach. Tabu search is a heuristic optimization method that has the tabu list to control the search process. To improve the searching ability of a global solution, we used a method of exchanging solutions among connected processors as a diversification strategy, and to reduce the computation time, a new evaluating method was proposed which evaluates only a changed par. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with other conventional methods.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.10a
• /
• pp.341-345
• /
• 2003

This study develops modeling processes for alignment optimization considering characteristics of intersections using genetic algorithms and GIS for road alignment optimization. Since existing highway alignment optimization models have neglected the characteristics of intersections, they have shown serious weaknesses for real applications. In this paper, intersection costs include earthwork, right-of-way, pavement, accident, delay and fuel consumption costs that are sensitive and dominating to alignments. Also, local optimization of intersections for saving good alignment alternatives is developed and embedded. A highway alignment is described by parametric representation in space and vector manipulation is used to find the coordinates of intersections and other interesting points. The developed intersection cost estimation model is sufficiently precise for estimating intersection costs and eventually enhancing the performance of highway alignment optimization models. Also, local optimization of intersections can be used for improving search flexibility, thus allowing more effective intersections. It also provides a basis for extending the alignment optimization from single highways to networks. The presented two artificial examples show that the total intersection costs are substantial and sensitive to highway alignments.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.472-476
• /
• 2010

Nowadays, as the indices of the major search engines grow to a tremendous proportion, vertical search services can help customers to find what they need. Real time search is valuable because it lets you know what's happening right now on any given topic. In this paper, we designed a new architecture to implement a high performance real time search system. Based on the real time search's characters, we divided the whole system to two parts which are collection system and search system. The evaluation results showed that our design has the potential to provide the real time search transparent scalability while maintaining the replication overhead costs in check.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.59-65
• /
• 1988

This paper discusses the problem of coordinating aggregate planning and production schedules, minimizing the combined set-up inventory and capacity costs. In this study, by using the relation of fixed production quantity and the number of set-up we develop a heuristirc procedure of solving the discrete demand, fixed production quantity, variable capacity problem. First, we obtain the trade-off between set-up cost and capacity cost, then search the point minimizing the combined inventory and capacity costs.