http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
고정비용과 비선형 단위운송비용을 가지는 수송문제를 위한 이단유전알고리즘에 관한 연구
성기석(Kiseok Sung) 한국경영과학회 2016 韓國經營科學會誌 Vol.41 No.4
This paper proposes a Bi-level Genetic Algorithm for the Fixed Charge Transportation Problem with Non-linear Unit Cost. The problem has the property of mixed integer program with non-linear objective function and linear constraints. The bi-level procedure consists of the upper-GA and the lower-GA. While the upper-GA optimize the connectivity between each supply and demand pair, the lower-GA optimize the amount of transportation between the pairs set to be connected by the upper-GA. In the upper-GA, the feasibility of the connectivity are verified, and if a connectivity is not feasible, it is modified so as to be feasible. In the lower-GA, a simple method is used to obtain a pivot feasible solution under the restriction of the connectivity determined by the upper-GA. The obtained pivot feasible solution is utilized to generate the initial generation of chromosomes. The computational experiment is performed on the selected problems with several non-linear objective functions. The performance of the proposed procedure is analyzed with the result of experiment
분지한계기법을 이용한 무환네트워크에서 최대물동량경로의 해법에 관한 연구
성기석,임준묵 한국경영과학회 1995 韓國經營科學會誌 Vol.20 No.3
The Maximum Origin-Destination Flow Path Problem (MODFP) in an Acyclic Network has known as NP-hard. K. S. Sung has suggested an Optimal Algorithm for MODFP based on the 'Pseudo flow of arc' and the K-th shortest path algorithm. When we try to solve MODFP problem by general Branch and Bound Method (BBM), the upper and lower bounds of subproblems are so weak that the BBM become very inefficient. Here we utilized the 'Pseudo flow of arc' for the tight bounds of subproblems so that it can produce an efficient BBM for MODFP problem.
성기석 한국경영과학회 1999 한국경영과학회지 Vol.24 No.2
A genetic algorithm to determine the optimal signal sequence and double cycle pattern is described The signal sequence and double cycle pattern are used as the input for TRANSYT to find optimal signal timing at each junction in the area traffic networks in the genetic process, the partially matched crossover and simple crossover operators are used for evolution of signal sequence and double cycle pattern respectively A special conversion algorithm is devised to convert the signal sequence into the link-stage assignment for TRANSYT Results from tests using data from an area traffic network in Leicester region R are given
프로세서의 수가 한정되어있는 병렬계산모델에서 유전알고리즘을 이용한 스케쥴링해법
성기석,박지혁 한국경영과학회 1998 韓國經營科學會誌 Vol.23 No.2
In the parallel processing systems, a compiler partitions a loaded program into tasks, allocates the tasks on multiple processors and schedules the tasks on each allocated processor. In this paper we suggest a Genetic Algorithm(GA) based scheduling method to find an optimal allocation and sequence of tasks on each processor. The suggested method uses a chromosome which consists of task sequence and binary string that represent the number and order of tasks on each processor respectively. Two correction algorithms are used to maintain precedency constraints of the tasks in the chromosome. This scheduling method determines the optimal number of processors within limited numbers, and then finds the optimal schedule for each processor. A result from computational experiment of the suggested method is given.
성기석,박지혁 한국경영과학회 1997 한국경영과학회 학술대회논문집 Vol.- No.2
For parallel processing, the compiler partitions a loaded program into a set of tasks and makes a schedule for the tasks that will minimize parallel processing time for the loaded program. Building an optimal schedule for a given set of partitioned tasks of a program has known to be NP-complete. In this paper we introduce a GA(Genetic Algorithm)-based scheduling method in which a choromosome consists of two parts of a string which decide the number and order of tasks on each processor. An additional computation is used for feasibility constraint in the chromosome. By granularity theory, a partitioned program is categorized into coarse-grain or fine-grain types. There exist good heuristic algorithms for coarse-grain type partitioning. We suggested another GA adaptive to the coarse-grain type partitioning. The infeasibility of chromosome is overcome by the encoding and operators. The number of processors are decided while the GA find the minimum parallel processing time.
영동지역의 기업유치에 있어 물류의 역활에 대한 인지도 설문조사
최용기,성기석 강릉대학교동해안지역연구소 1995 東海岸硏究 Vol.6 No.1
영동지역에 기업을 유치하는데 있어 물류의 역할에 대한 인지도를 설문 조사하였다. 조사 결과 전반적인 물류 역할에 대한 인지도는 54%였다. 물류의 역할 중에서는 수송기능에 대한 관심이 높았고, 영동지역의 물류에 있어 가장 시급한 것은 영동고속도로의 확장과 동해고속도로의 신설을 통해 교통문제를 해결하는 것이다. 영동지역의 기업유치에 가장 유리한 지역은 동해가 33%였다. 이는 동해가 물류의 수송 기능을 가장 원활히 수행할 수 있는 지역으로 인식되기 때문이다. A survey on the recognition of the role of Logistics in attracting enterprises in Young-Dong province results in the 54% of recognition. The most interested part among the roles of Logistics is the transportation function, and the most urgent thing in attracting enterprises in Young-Dong province is resolving the superannuated transportation condition through extending Young-Dong Highway and constructing Dong-Hae Highway. The superior area in attracting enterprises is Dong-Hae, which has come out for 33%, because Dong-Hae is recognized as the best area for performing the transportation function in Young-Dong province.