• 한국환경과학회지
• /
• 제14권6호
• /
• pp.533-542
• /
• 2005

In this study, an optimization technique was developed from the application of Allocation Rule. Average Allocation coefficients of the Andong and Imha dam compare constant water supply condition with vary water supply condition that are above the contribute ratio $67\%\~50\%$ the Andong dam in Rule(A)-Rule(C). In the Refill Season, Andong dam water supply contribution is higher than Imha dam at the Control point water supply. In the Allocation analysis results, Rule(A) is calculated storage ratio because Andong dam contribute to Control point larger than Imha dam which Andong dam storage is larger than Imha dam storage. Rule(B) calculated sum of the storage and inflow ratio for Andong dam and Imha dam, as Andong dam contribution is higher than Imha dam. Rule(C) calculated that sum of storage, inflow and water supply is divided average storage ratio, as the best results of the Allocation coefficients and water supply capacity. The results of storage analysis is larger vary water supply condition than constant water supply condition and the results of water supply analysis is larger vary water supply condition than constant water supply condition. Water supply deficit is decrease $30\%$ for vary water supply condition.

• 한국경영과학회지
• /
• 제31권3호
• /
• pp.11-25
• /
• 2006

Space may be a scarce resource in manufacturing shops, warehouses, freight terminals, and container terminals. This Paper discusses how to locate temporary storage Inventories In limited storage areas. A typical inventory is delivered from the location of the preceding process to the storage area and stored In the storage area during the certain period of time. And it may be relocated from the storage position to another. Finally. it is delivered from the final storage area to the location of the next process. Because this logistic process for an inventory requires handling activities, transportation activities, and storage spaces, the limitation in capacities of handling equipment, transportation equipment, and storage space must be considered when allocating spaces to the inventory. This problem Is modeled as a multicommodity minimal cost flow problem. And a heuristic algorithm for the Problem is proposed. Numerical experiments are presented to validate the mathematical model and the heuristic algorithm.

• 정보처리학회논문지A
• /
• 제13A권7호
• /
• pp.561-572
• /
• 2006

모바일 다비이스는 시스템 자원이 매우 제한적이기 때문에 응용프로그램을 실행시키기 위해서는 자원들을 효율적으로 관리하여야 한다. 특히 제한적인 메모리에 대한 동적 관리기법은 모바일 디바이스의 운영체제 및 플랫폼에서 매우 중요한 요소이다. 그러나 기존 동적 메모리 관리기법들은 응용프로그램의 실행 스타일과 사용되는 객체의 라이프 타임(life time), 객체 종류 및 종류 분포를 고려하치 않음으로써 효율적으로 메모리를 관리할 수 없으며, 응용프로그램의 실행 속도를 저하시킨다. 따라서 본 논문에서는 모바일 응용프로그램의 실행 특성을 분석하고, 분석한 결과를 토대로 모바일 디바이스용 응용프로그램의 실행 시 메모리를 절약하고, 실행 속도를 향상시키는 새로운 동적 메모리관리기법을 제안 및 개발하였다. 기존 동적 메모리 관리 모듈과의 응용프로그램 실행 속도를 비교한 결과. 제안한 동적 메모리 관리기법은 테스트용 응용프로그램을 실행할 때 링크드 리스트[11]에 비하여 6.5배, Doug. Lea 메모리 관리기법[13]에 비하여 2.5배, Brent 메모리 관리기법[15]에 비하여 10.5배 빠른 실행 속도를 보였다.

• 한국건축시공학회지
• /
• 제17권4호
• /
• pp.369-375
• /
• 2017

본 연구는 제설작업의 효율성을 높일 수 있도록 제설차량의 작업구간 할당 및 제설기지 위치를 최적화할 수 있는 PSO 알고리듬을 제시하였다. 기존의 PSO 알고리듬을 개선하여 해공간의 탐색 성능을 높일 수 있는 개선된 알고리듬을 제시하였으며, 제설차량의 작업구간 할당 문제에 적용할 수 있도록 개체의 표현 및 적합도 합수값을 제시하였다. 또한 제시한 알고리듬의 타당성을 검증하기 위하여 지자체의 실제 사례에 적용하였으며, 기존 알고리듬과 개선된 알고리듬을 비교하였다. 그 결과 개선된 PSO의 경우 기존 알고리듬보다 폭넓게 해공간을 탐색하여 지역해에 빠지지 않고 더 우수한 해를 도출하는 것을 알 수 있다. 또한 개별 제설차량의 작업부하가 평준화될 수 있도록 작업구간을 할당할 수 있으며, 할당된 작업구간에 가장 가까운 지점을 도출하여 제설전진기지의 위치를 결정하는데 활용될 수 있음을 알 수 있었다.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2005년도 공동추계학술대회
• /
• pp.442-450
• /
• 2005

One of the important tactical problems for the efficient operation of container terminals is to determine the usage of storage space There are two different strategies for stacking containers; mixing strategy. in which outbound containers and inbound containers are mixed in the same block. and segregating strategy, in which outbound containers and inbound containers are stacked in blocks different from each other. The performance of space allocation strategies also depends on the types of handling equipment in the yard and the number of handling equipment allocated to each block. A simulation model is developed considering various handling characteristics of yard cranes. Performances of various space and equipment allocation strategies are evaluated by using the simulation model.

• 전자공학회논문지B
• /
• 제28B권9호
• /
• pp.703-711
• /
• 1991

In this paper, an efficient storage reclamation algorithm for RISC parallel processing in the object orented programming environments is presented. The memory management for the dynamic memory allocation and the frequent memory access in object oriented programming is the main factor that decreases RISC parallel processing performance. The proposed algorithm can be efficiently allocated the memory space of RISCy computer which is required the frequent memory access, so it can be increased RISC parallel processing performance. The proposed algorithm is verified the efficiency by implementing C language on SUN SPARC(4.3 BSD UNIX).

• 한국항만학회지
• /
• 제11권2호
• /
• pp.191-202
• /
• 1997

As the suitability of berth allocation will ultimately have a significant influence on the performance of a berth, a great deal of attention should be given to berth allocation. Generally, a berth allocation problem has conflicting factors between servers and users. In addition, there is uncertainty in great extent caused by various factors such as departure delay, inclement weather on route, poor handling equipment, a lack of storage space, and other factors contribute to the uncertainty of arrival and berthing time. Thus, it is necessary to establish berth allocation planning which reflects the positions of interested parties and the ambiguity of parameters. For this, a berth allocation problem is formulated by fuzzy 0-1 integer programming introducing the concept of maximum Position Shift(MPS). But, the above approach has limitations in terms of computational time and computer memory when the size of problem is increased. It also has limitations with respect to the integration of other sub-systems such as ship planning system and yard planning system. For solving such problem, this paper focuses particularly on developing an efficient heuristic algorithm as a new technique of getting an effective solution. And also the suggested algorithm is verified through the illustrative examples and empirical appalicaton to BCTOC.

• 산업공학
• /
• 제19권3호
• /
• pp.214-224
• /
• 2006

The container handling times of automated transfer cranes(ATCs) significantly affect the productivity of container terminals. In this paper, evaluation models for the container handling times of ATCs are suggested for import container blocks with different transfer point configurations. Firstly, evaluation models for various motion times of stacking and retrieving operations of ATC are suggested for two basic alternatives of import container blocks. In addition, in considering the space allocation, evaluation methods for the container handling times of ATC are suggested. Finally, the container handling times for each case are compared with each other in order to analyze how the block shape and the transfer point locations affect the container handling times of ATC.

• 정보처리학회논문지A
• /
• 제10A권5호
• /
• pp.519-528
• /
• 2003

컨테이너 터미널에서느 매일 24시간, 365일 운영하는 데에 있어서 다양한 의사결정을 필요로 하며, 이 모든 의사결정들은 상호 관계를 가지게 된다. 이러한 의사결정의 궁극적인 목표는 선박 작업시간, 작업 처리를 위해 사용되는 자원들, 터미널 내부 도로의 혼잡도 등을 최소화하는 것이다. 또한 필요한 저장 공간을 효율적으로 이용하는 것이다. 따라서 컨테이너 터미널의 운용 효율을 더 한층 강화하기 위해서는 이러한 의사결정의 범위와 복잡성이 더해지게 되어 의사결정 도구의 필요성이 강조될 수 밖에 없다. 이 논문은 이러한 목적을 위해 의사결정시스템을 위한 평가요소들을 도출하고, 의사결정시스템 설계에 가장 큰 영향을 주는 평가요소, 즉 야드장치장 배경, RTGC 배정, QC당 YT 배정의 최적화 전략을 제안한다. 그리고 G2 언어를 상요한 시뮬레이션에 의해 의사결정시스템 설계의 효율성을 선박작업시간 비교를 통하여 평가한다.

• Industrial Engineering and Management Systems
• /
• 제9권2호
• /
• pp.165-177
• /
• 2010

This paper discusses a method for pricing the storage of inbound containers in a container yard. The pricing structure is characterized by a free-time-limit and a storage price for the storage time that extends beyond the free-time-limit. A cost model is developed from the viewpoint of a public terminal operator as well as a private terminal operator. Unlike a previous study on this issue, this study assumes that the retrieval times follow a discrete probability distribution, which is more realistic than the previous study. A solution procedure is suggested and illustrated by using numerical examples.