• International Journal of Contents
• /
• 제1권1호
• /
• pp.21-28
• /
• 2005

This paper is about the hardness of Leader Election problem in asynchronous distributed systems in which processes can crash but links are reliable. Recently, the hardness of a problem encountered in the systems is defined with respect to the difficulty to solve it despite failures: a problem is easy if it can be solved in presence of failures, otherwise it is hard [9]. It is shown in [9] that problems are classified as three classes: F (fault-tolerant), NF (Not fault-tolerant) and NFC (NF-completeness). Among those, the class NFC is the hardest problem to solve. It is also shown in [9] that the construction of Perfect Failure Detector (problem P) belongs to NFC. In this paper, we show that Leader Election is also one of NFC problems by using a general reduction protocol that reduces the Leader Election Problem to P. We use a formulation of the Leader Election problem as a prototype to show that it belongs to NFC.

• 한국경영과학회지
• /
• 제27권4호
• /
• pp.67-86
• /
• 2002

This paper considers subway crew scheduling problem. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper. we propose two basic techniques that solve the subway crew scheduling problem in a reasonable time, though the optimality of the solution is not guaranteed. We develop an algorithm that solves the column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational result for a real instance is reported.

• 경영과학
• /
• 제26권1호
• /
• pp.197-208
• /
• 2009

In this paper, we study stochastic maximal covering location problem considering floating population. Traditional maximal covering location problem assumed that number of populations at demand point is already known and fixed. In this manner, someone who try to solve real world maximal covering location problem must consider administrative population as a population at demand point. But, after observing floating population, appliance of population in steady-state is more reasonable. In this paper, we suggest revised numerical model of maximal covering location problem. We suggest heuristic methodology to solve large scale problem by using genetic algorithm.

• 한국초등과학교육학회지:초등과학교육
• /
• 제38권1호
• /
• pp.73-86
• /
• 2019

The purpose of this study is to investigate the characteristics of problem solving strategies that gifted students use in science inquiry problem. The subjects of the study are the notes and presentation materials that the 15 team of elementary and junior high school students have solved the problem. They are a team consisting of 27 elementary gifted and 29 middle gifted children who voluntarily selected topics related to dimple among the various inquiry themes. The analysis data are the observations of the subjects' inquiry process, the notes recorded in the inquiry process, and the results of the presentations. In this process, the knowledge related to dimple is classified into the declarative knowledge level and the process knowledge level, and the strategies used by the gifted students are divided into general strategy and supplementary strategy. The results of this study are as follows. First, as a result of categorizing gifted students into knowledge level, six types of AA, AB, BA, BB, BC, and CB were found among the 9 types of knowledge level. Therefore, gifted students did not have a high declarative knowledge level (AC type) or very low level of procedural knowledge level (CA type). Second, the general strategy that gifted students used to solve the dimple problem was using deductive reasoning, inductive reasoning, finding the rule, solving the problem in reverse, building similar problems, and guessing & reviewing strategies. The supplementary strategies used to solve the dimple problem was finding clues, recording important information, using tables and graphs, making tools, using pictures, and thinking experiment strategies. Third, the higher the knowledge level of gifted students, the more common type of strategies they use. In the case of supplementary strategy, it was not related to each type according to knowledge level. Knowledge-based learning related to problem situations can be helpful in understanding, interpreting, and representing problems. In a new problem situation, more problem solving strategies can be used to solve problems in various ways.

• Journal of Electrical Engineering and Technology
• /
• 제13권5호
• /
• pp.1778-1790
• /
• 2018

Based on the requirements and characteristics of multi-zone autonomous decision-making in modern power system, fully distributed computing methods are needed to optimize the economic dispatch (ED) problem coordination of multi-regional power system on the basis of constructing decomposition and interaction mechanism. In this paper, four fully distributed methods based on alternating direction method of multipliers (ADMM) are used for solving the ED problem in distributed manner. By duplicating variables, the 2-block classical ADMM can be directly used to solve ED problem fully distributed. The second method is employing ADMM to solve the dual problem of ED in fully distributed manner. N-block methods based on ADMM including Alternating Direction Method with Gaussian back substitution (ADM_G) and Exchange ADMM (E_ADMM) are employed also. These two methods all can solve ED problem in distributed manner. However, the former one cannot be carried out in parallel. In this paper, four fully distributed methods solve the ED problem in distributed collaborative manner. And we also discussed the difference of four algorithms from the aspects of algorithm convergence, calculation speed and parameter change. Some simulation results are reported to test the performance of these distributed algorithms in serial and parallel.

• 한국콘텐츠학회논문지
• /
• 제20권11호
• /
• pp.636-643
• /
• 2020

차분 진화 알고리즘은 연속적인 문제 공간인 실수 최적화 문제를 해결하기 위해 개발된 메타휴리스틱 기법 중에 하나이다. 본 연구에서는 차분 진화 알고리즘을 불연속적인 문제 공간인 외판원 문제 해결에 사용하기 위하여 차분 진화 알고리즘에 난수 키 표현법을 적용하였다. 차분 진화 알고리즘은 실수 공간을 탐색하고 오름 차순으로 정렬된 해의 인덱스의 순서를 도시 방문 순서로 하여 적합도를 구한다. TSPLIB에서 제공하는 표준 외판원 문제에 적용하여 실험한 결과 제안한 난수 키 표현법 기반 차분 진화 알고리즘이 외판원 문제 해결에 가능성을 가지고 있음을 확인하였다.

• 한국산업정보학회논문지
• /
• 제7권3호
• /
• pp.54-61
• /
• 2002

원격 영상전송 장치는 안전상의 문제가 있거나 사람이 갈 수 없는 곳을 관찰하기 위해 로봇 기술과 영상전송 기술을 결합한 것이다. 최근 원격 제어를 위해 웹서버와 로봇간 유선 및 RF를 이용한 제어 장치들이 개발되고 있지만, 작동 거리 및 인터넷 라인을 설치해야 하는 제한점이 있으며, 무선 방식의 통신장비를 이용할 경우 무선 라우터의 가격이 고가라는 문제가 있다. 본 연구에서는 이러한 문제점을 해결하기 위해 CDMA 셀룰러 폰 통신망을 이용하여 영상전송 및 영상전송 장치를 원격으로 제어할 수 있는 시스템을 개발하였으며, 개발된 시스템은 기존의 무선동신(RF)을 이용한 영상 전송시의 단점인 거리 제한 문제와 인터넷을 이용한 영상전송시의 문제를 해결할 수 있었고, 현재의 통신망을 비롯한 제한된 조건하에서 최적의 영상 및 음성을 전송할 수 있었다.

• 디지털산업정보학회논문지
• /
• 제13권3호
• /
• pp.65-73
• /
• 2017

The fifth generation(5G) of wireless networks will connect not only smart phone but also unimaginable things. Therefore, 5G cellular network is facing the soaring traffic demand of numerous user devices. To solve this problem, a huge amount of 5G base stations will need to be installed. The base station positioning problem is an NP-hard problem that does not know how long it will take to solve the problem. Because, it can not find an answer other than to check the number of all cases. In this paper, to solve the NP hard problem, we compare the tabu search and the genetic algorithm using real maps for optimal cell planning. We also perform Monte Carlo simulations to study the performance of the Tabu search and Genetic algorithm for 5G cell planning. As a results, Tabu search required 2.95 times less computation time than Genetic algorithm and showed accuracy difference of 2dBm.

• 인터넷정보학회논문지
• /
• 제3권1호
• /
• pp.1-10
• /
• 2002

원격 영상전송 장치는 안전상의 문제가 있거나 사람이 갈 수 없는 곳을 관찰하기 위해 로봇 기술과 영상전송 기술을 결합한 것이다. 최근 원격 제어를 위해 웹서버와 로봇간 유선 및 RF를 이용한 제어 장치들이 개발되고 있지만, 작동 거리 및 인터넷 라인을 설치해야 하는 제한점이 있으며, 무선 방식의 통신장비를 이용할 경우 무선 라우터의 가격이 고가라는 문제가 있다. 본 연구에서는 이러한 문제점을 해결하기 위해 셀룰러 폰 통신망을 이용하여 영상전송 및 영상전송 장치를 원격으로 제어할 수 있는 시스템을 개발하였으며, 개발된 시스템은 기존의 무선통신(RF)을 이용한 영상 전송시의 단점인 거리 제한 문제와 인터넷을 이용한 영상전송시의 문제를 해결할 수 있었고, 현재의 통신망을 비롯한 제한된 조건 하에서 최적의 영상 및 음성을 전송할 수 있었다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.179-184
• /
• 2002

We consider the heterogeneous fleet vehicle routing problem (HVRP), a variant of the classical vehicle routing problem (VRP). The HVRP differs from the classical VRP in that it deals with a heterogeneous fleet of vehicles having various capacities, fixed costs, and variables costs. Therefore the HVRP is to find the fleet composition and a set of routes with minimum total cost. We give an integer programming formulation of the problem and propose an algorithm to solve it. Although the formulation has exponentially many variables, we can efficiently solve the linear programming relaxation of it by using the column generation technique. To generate profitable columns we solve a shortest path problem with capacity constraints using dynamic programming. After solving the linear programming relaxation, we apply a branch-and-bound procedure. We test the proposed algorithm on a set of benchmark instances. Test results show that the algorithm gives best-known solutions to almost all instances.