This study aimed to evaluate the effectiveness of closed season policy using an integer linear programming, targeting the large purse seine fishery in Korea. In the analysis, based on Cheng and Townsend(1993), fishing effort (fishing days by month) was assumed to be distributed for profit maximization of vessels and catch of immature fish was estimated. The analytical results showed that the effects of closed season policy would vary in accordance with the monthly closures in terms of fishing profits and catch of immature fish. A closed season policy by month had different effects on fishing profits and catch of immature fish by species. It implies the importance of considering seasonal changes of fish species when limiting fishing efforts with the closed season policy.

In this paper, we present a multi-period 0-1 knapsack problem which has the cardinality constraints. Theoretically, the presented problem can be regarded as an extension of the multi-period 0-1 knapsack problem. In the multi-period 0-1 knapsack problem, there are n jobs to be performed during m periods. Each job has the execution time and its completion gives profit. All the n jobs are partitioned into m periods, and the jobs belong to i-th period may be performed not later than in the i-th period, i = 1, ⋯, m. The total production time for periods from 1 to i is given by bi for each i = 1, ⋯, m, and the objective is to maximize the total profit. In the extended problem, we can select a specified number of jobs from each of periods associated with the corresponding cardinality constraints. As the extended problem is NP-hard, the branch and bound method is preferable to solve it, and therefore it is important to have efficient procedures for solving its linear programming relaxed problem. So we intensively explore the LP relaxed problem and suggest a polynomial time algorithm. We first decompose the LP relaxed problem into m subproblems associated with each cardinality constraints. Then we identify some new properties based on the parametric analysis. Finally by exploiting the special structure of the LP relaxed problem, we develop an efficient algorithm for the LP relaxed problem. The developed algorithm has a worst case computational complexity of order max[O(n2log n), O(mn2)], where m is the number of periods and n is the total number of jobs. We illustrate a numerical example.

This study aimed to empirically investigate the applicability of ecosystem-based TAC (Total Allowable Catch) fisheries management targeting the large purse seine fishery where multi-species are regulated by TAC. Using a linear programming, the optimal fishing effort and the catch amount by species which maximize fishing profits were analyzed under the constraint condition of catch limits by species. Analytical results showed that an application of TAC on only chub mackerel would have negative impacts on fish stocks such as hairtail and jack mackerel by increasing the level of fishing effort to achieve its allocated catch limit. However, under the constraint condition of catch limits of all species, it was shown that optimal catches of all species were achieved within their catch limits. It implies the importance of ecosystem-based management considering biological and technical interactions of species those were excluded in the traditional single species fisheries management.

This paper is for applying interactive fuzzy linear programming for the problem of product mix planning, which is one of the aggregate planning problem. We developed a modified algorithm, which has two-phase approach for interactive fuzzy linear programming to get a better solution. Adding two-phase method, we expect to obtain not only the highest membership degree, but also a better utilization of each constrained resource.

본 논문은 수식화의 특이성 때문애 구조 최적화 문제에 거의 사용되지 않고 있는 선형 goal programrrung을 대규모 비선형 구조 최적화에 용용하는 방법올 제시한다. 이 방법은 다기준 최적화의 도구로 사용 되는데 그 까닭은 goal programming 이 목적합수와 제한조건둥을 정의하는데 있어서 발생하는 난점 들올 제거해 주기 때문이다. 이 방병은 비선형 goal 최적화 문제톨의 해톨 얻기 위해서 유한요소해석， 선형 goal programming 기볍 ‘ 그리고 계속적인 선형화 기법을 이용한다. 즉， 대규모 비선형 구조 최적화 문제를 비선형 goal programming 형태로 전환시키는 일반적인 수식화 방법을 제시하고， 얻어진 비선형 goal 최적화 문제 를 풀기 위한 계속적인 선형화 방법에 대해서도 논의한다. 얼계도구로서 이 방법의 유효성올 논증하기 위하여 10‘ 25 및 200트러스의 사례를 가지고 용력채한조건들의 최소무게 구조 최적화 문제에 대한 해를 모색하며 이 쓸 다른 연구결과와 비교검토한다.

Although some indicators for evaluating rural settlement conditions have been offered, these indicators could not reflect unique characteristics that rural has its own peculiarities. The rural area is identified with central districts functioned as service provision and hinterlands used its service. The aim of this study is to find a central district of rural villages and define range of its hinterlands using various physical characteristics of rural areas. Targeting areas are Yongsan and Hwanggan in Yeongdong-gun . The physical characteristics are represented by building density, number of shops among secondary and tertiary industries, official land price, and density of bus line. The rural central district is estimated by linear programming using defined the physical characteristics. Also its hinterlands used Huff model and social accessibility. The results of this study are as follows; (1) The physical characteristics in Hwanggan myeon is higher than Yongsan myeon because Hwanggan area has a large floating population for using Hwanggan station and ticket office; (2) The central district in Hwanggan has wider regional range than Yongsan. When central district estimate in rural areas, we suggest a grid diameter of Hexagon for controlling errors; (3) Considering accessibility, the life zone of 4 districts defined legally in Hwanggan use Yongsan and 2 legal districts in Hwanggan are possible to take advantage of Yongsan’s life zone; (4) The results of survey targeting boundary villages between Yongsan and Hwanggan, individual drivers use central districts both Yongsan and Hwanggan, however users by public transportation (especially bus) go more to Hwanggan because bus lines to Hwanggan have many routes than to Yongsan. Evaluating the rural settlement conditions by national unit through grasping central districts and its hinterlands, these results can use as base line data and the evidence for regional development projects.

강수량을 이용해 수문분석 할 경우 강수 자료의 양과 연속성은 분석의 신뢰성에 큰 영향을 미칠 수 있다. 따라서 강수 자료가 짧거나 기계 고장 등으로 인하여 결측된 경우에 강수 자료기간을 늘리거나 결측 자료를 보완하는 것은 매우 기본적인 과정이다. 이에 본 연구에서는 결측 강수량을 보완하기 위해서 적용되는 자료구동(Data-driven) 방법인 선형계획법을 많이 사용되는 7개 기법을 비교 분석하고 우수성을 검정한다. 이를 위해서 적용한 자료는 한강 유역

Significant increase of container flows in the marine terminals requires more efficient port equipments such as logistic and transfer systems. This paper presents collision avoidance and routing approach based on dynamic programming (DP) algorithm for a linear motor based shuttle car which is considered as a new transfer system in the port terminals. Most of routing problems are focused on automatic guided vehicle (AGV) systems, but its solutions are hardly utilized for LM based shuttle cars since both are mechanically different. Our proposed DP is implemented for real-time searching of an optimal path for each shuttle car in the Agile port terminal located at California in USA.