• Korean Circulation Journal
• /
• 제53권5호
• /
• pp.294-312
• /
• 2023

Heart failure (HF) is a global health problem closely related to morbidity and mortality. As the burden of HF increases, it is necessary to manage and treat this condition well. However, there are differences between real-world practice and guidelines for the optimal treatment for HF. Patient-related, healthcare provider-related, and health system-related factors contribute to poor adherence to optimal care. This review article aims to examine HF treatment patterns and treatment adherence in real-world practice, identify clinical gaps to suggest ways to improve the quality of care for HF and clinical outcomes for patients with HF. Although it is important to optimize treatment based on evidence-based guidelines to the greatest extent, it is known that there is still poor treatment adherence, and many patients do not receive guideline-directed medical therapy, especially at the early stages. To improve medication adherence, qualitative evaluation through performance measurement, as well as education of patients, caregivers and medical staff through a multidisciplinary approach are important.

• Korean Management Science Review
• /
• 제25권1호
• /
• pp.43-53
• /
• 2008

This paper considers a profit-based unit commitment problem with fuel consumption constraint and maintenance cost, which is one of the key decision problems in electricity industry. The nature of non-linearity inherent in the constraints and objective functions makes the problem intractable which have led many researches to focus on Lagrangian based heuristics. To solve the problem more effectively, we propose mixed integer programming based solution algorithm linearizing the complex non-linear constraints and objectives functions. The computational experiments using the real-world operation data taken from a domestic electricity power generator show that the proposed algorithm solves the given problem effectively.

• Journal of Korean Institute of Industrial Engineers
• /
• 제36권2호
• /
• pp.78-86
• /
• 2010

The traveling purchaser problem(TPP) is a generalization of the well-known traveling salesman problem(TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. TPP also could be extended to the vehicle routing problem(VRP) by incorporating additional constraints such as multi-purchaser, capacity, distance and time restrictions. In the last decade, TPP has received some attention of the researchers in the operational research area. However it has not received the equivalent interest as much as TSP and VRP. Therefore, there does not exist a review of the TPP. The purpose of this paper is to review the TPP and to describe solution procedures proposed for this problem. We also introduce the ILP formulation for the multiple TPP(mTPP) which is generalized type of TPP. We compare the system performance according to change from TPP to mTPP.

• IE interfaces
• /
• 제12권1호
• /
• pp.94-101
• /
• 1999

The set covering(SC) problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The SC problem has been proven to be NP-complete and many algorithms have been presented to solve the SC problem. In this paper we present hybrid simulated annealing(HSA) algorithm based on the Simulated Annealing(SA) for the SC problem. The HSA is an algorithm which combines SA with a crossover operation in a genetic algorithm and a local search method. Our experimental results show that the HSA obtains better results than SA does.

• Journal of the Korea Society of Computer and Information
• /
• 제24권4호
• /
• pp.27-34
• /
• 2019

The course timetabling problem is a kind of very complex combinatorial optimization problems, which is known as an NP-complete problem. Sometimes a given course timetabling problem can be accompanied by many constraints. At this time, even if only one constraint is violated, it can be an infeasible timetable. Therefore, it is very difficult to make an automated course timetabling system for a complex real-world course timetabling problem. This paper introduces an automated course timetabling system using constraint programming. The target problem has 26 constraints in total, and they are expressed as 24 constraints and an objective function in constraint programming. Currently, we are making a timetable through this system and applying the result to the actual class. Members' satisfaction is also much higher than manual results. We expect this paper can be a guide for making an automated course timetabling system.

• Journal of Korean Society for Geospatial Information Science
• /
• 제16권3호
• /
• pp.29-34
• /
• 2008

Demand for car navigation systems has been an explosive increase because of prevalence of owner-drivers, spare time spread, and so on. In addition, car navigation systems are achieving a rapid growth to be the important part of telematics industry with services such as real-time traffic information and DMB(Digital Multimedia Broadcasting). The network data, one of the composition components in car navigation systems, is most important component because that is abstract of real world road network and base data in pathfinding. However most of the car navigation systems have been stand-alone system. Thus user's network data becomes outdated according to the time passing and does not reflect the change of road information in real world. To overcome this problem, users have to update network data in car navigation systems periodically. This method is quite cumbersome process. For this reason, this study proposed a new update method to serve the difference network data on user's device and the real world in real time, and simulated to verify.

• Progress in Superconductivity and Cryogenics
• /
• 제8권3호
• /
• pp.54-58
• /
• 2006

In this paper, authors developed a real-time simulation algorithm for the power device application of HTS(High Temperature Superconducting) wire by using Real Time Digital Simulator(RTDS). At present, in order to extend the power capacity of some area where has a serious problem of power quality. especially metropolitan complex city, there are so many problems such as right of way for power line routes. space for downtown substations. and the environmental protection, etc. HTS technology can be useful to overcome this problem. Recently, according to the advanced HTS technology, the power application is being researched well. Simulation is required for safety before installation of HTS power cable, a fabrication model used at the power system simulation. This paper describes a real time digital simulation method for the application of HTS wire to power device. For the simulation analysis, test sample of HTS wire was actually manufactured. And the transient phenomenon of the HTS wire was analysed in the simulated utility power grid. This simulation method is the world first trial in order to obtain much better information for installation of HTS power device into a utility network.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.65-68
• /
• 2000

The problem of selecting a portfolio is to find Un investment plan that achieves a desired return while minimizing the risk involved. One stream of algorithms are based upon mixed integer linear programming models and guarantee an integer optimal solution. But these algorithms require too much time to apply to real problems. Another stream of algorithms are fur a near optimal solution and are fast enough. But, these also have a weakness in that the solution generated can't be guaranteed to be integer values. Since it is not a trivial job to tansform the scullion into integer valued one simutaneously maintaining the quality of the solution, they are not easy to apply to real world portfolio selection. To tackle the problem more efficiently, we propose an algorithm which generates a very good integer solution in reasonable amount of time. The algorithm is tested using Korean stock market data to verify its accuracy and efficiency.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.262-269
• /
• 2003

Recently, a multi facility, multi product and multi period industrial problem has been widely investigated in Supply Chain Management (SCM). One of the key issues in the current SCM research area involved reducing both production and distribution costs. The purpose of this study is to determine the optimum quantity of production and transportation with minimum cost in the supply chain network. We have presented a mathematical model that deals with real world factors and constructs. Considering the complexity of solving such model, we have applied the genetic algorithm approach for solving this model computational experiments using a commercial genetic algorithm based optimizer. The results show that the real size problems we encountered can be solved In reasonable time

• Korean Management Science Review
• /
• 제17권1호
• /
• pp.41-54
• /
• 2000

in the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.