• Title/Summary/Keyword: Departure Management

Search Result 130, Processing Time 0.023 seconds

Decision Supprot System fr Arrival/Departure of Ships in Port by using Enhanced Genetic Programming (개선된 유전적 프로그래밍 기법을 이용한 선박 입출항 의사결정 지원 시스템)

  • Lee, Kyung-Ho;Yeun, Yun-Seog;Rhee, Wook
    • Journal of Intelligence and Information Systems
    • /
    • v.7 no.2
    • /
    • pp.117-127
    • /
    • 2001
  • The Main object of this research is directed to LG Oil company harbor in kwangyang-hang, where various ships ranging from 300 ton to 48000ton DWT use seven berths in the harbor. This harbor suffered from inefficient and unsafe management procedures since it is difficult to set guidelines for arrival and departure of ships according to the weather conditions and the current guidelines dose not offer clear basis of its implications. Therefore, it has long been suggested that these guidelines should be improved. This paper proposes a decision-support system, which can quantitatively decide the possibility of entry or departure on a harbor by analyzing the weather conditions (wind, current, and wave) and taking account of factors such as harbor characteristics, ship characteristics, weight condition, and operator characteristics. This system has been verified using 5$_{th}$ and 7$_{th}$ berth in Kwangyang-hang harbor. Machine learning technique using genetic programming(GP) is introduced to the system to quantitatively decide and produce results about the possibility of entry or arrival, and weighted linear associative memory (WLAM) method is also used to reduce the amount of calculation the GP has to perform. Group of additive genetic programming trees (GAGPT) is also used to improve learning performance by making it easy to find global optimum.mum.

  • PDF

A Note on the Relationships among the Queue Lengths at Various Epochs of a Queue with BMAP Arrivals

  • Kim, Nam K;Chae, Kyung C;Lee, Ho W
    • Management Science and Financial Engineering
    • /
    • v.9 no.2
    • /
    • pp.1-12
    • /
    • 2003
  • For a stationary queue with BMAP arrivals, Takine and Takahashi [8] present a relationship between the queue length distributions at a random epoch and at a departure epoch by using the rate conservation law of Miyazawa [6]. In this note, we derive the same relationship by using the elementary balance equation, ‘rate-in = rate-out’. Along the same lines, we additionally derive relationships between the queue length distributions at a random epoch and at an arrival epoch. All these relationships hold for a broad class of finite-as well as infinite-capacity queues with BMAP arrivals.

A Railway Construction Efficiency Plan by Using Project Management Information System (프로젝트정보관리시스템을 활용한 철도공사 효율화 방안)

  • Lee, Tai-Sik;Park, Jang-Hee;Kim, Young-Hyun
    • Proceedings of the KSR Conference
    • /
    • 2004.10a
    • /
    • pp.1532-1537
    • /
    • 2004
  • Downtown traffic culture of the car focus of our country have developed. But, it was been interested in railroad to saturation of situation, environmental problem. Also, it is getting interest which is international by departure point of network connecting from Europe to Northeast Asia. Private capital project of railroad is activated but Construction companies payability is real that is worsen day by day. Therefore, Construction companies is destroying element enterprise's inefficiency and the waste, be interested in Project Management Information System as part of information. I wish to approach in efficiency of railway construction by presenting professional construction company's Project Management Information System.

  • PDF

Development of penalty dependent pricing strategy for bicycle sharing and relocation of bicycles using trucks

  • Kim, Woong;Kim, Ki-Hong;Lee, Chul-Ung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.6
    • /
    • pp.107-115
    • /
    • 2016
  • In this paper, we propose a Bicycle sharing has grown popular around the cities in the world due to its convenience. However, the bicycle sharing system is not problem-free, and there remains many managerial problems to be solved. In this study, we analyzed pricing strategy of a bicycle sharing system by minimizing the number of bicycles relocated by trucks, the act of which incurs penalty. The objective function is constructed by applying mixed integer programming and is presented as a stochastic model by using Markov chain so that arrival and departure rates of bicycle stations can be utilized in the analysis. The efficiency of the presented model is verified upon the analysis of bicycle sharing data gathered in Daejeon in 2014.

FEASIBILITY OF A RFID-BASED MONITORING SYSTEM FOR THE CONCRETE POUR PROCESS

  • S. W. Moon;S. M. Hong
    • International conference on construction engineering and project management
    • /
    • 2007.03a
    • /
    • pp.433-439
    • /
    • 2007
  • A ubiquitous environment in construction requires integrating hardware and software systems. Currently the Construction System Integration Lab (CSIL) at Pusan National University is currently studying the application of ubiquitous technology for better communication in the construction process. In this paper, a pilot of Ubiquitous Concrete Pour System (u-CPS) has been presented to demonstrate the effectiveness of data exchange in the concrete pour process. The u-CPS environment takes advantage of the RFID technology for collecting construction data. The pilot can automatically generate the data for concrete pour work such as departure time, arrival time, concrete pour time. Construction managers can keep track of the progress of concrete pour work using the information. A case study was done for a building construction using the pilot system, the result of which demonstrated that the RFID-base system can help improve the effectiveness of data communication during the concrete pour process.

  • PDF

Airport Security Process Improving for Advanced Operation and Smart Airport Framework Design (공항 운영 효율성 향상을 위한 보안검색 프로세스 개선 및 스마트 공항 프레임워크 설계)

  • Lee, Jaewhan;Im, Hyeonu;Sohn, Seichang;Ko, Seungyoon;Hong, Ki-Sung;Choi, Sanggyun;Seo, Sangwon;Lee, Chulung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.39 no.2
    • /
    • pp.129-134
    • /
    • 2013
  • The airport processes are restricted by some limits of performance objects as size of airport, ability of human resources, capacity of facilities and operational rules. These limitations make passenger handling difficult when passenger numbers increase. In order to solve this problem, we modeled the airport process and analyzed departure passenger arrival, scheduled security manpower under specific customer service level maintenance with mixed integer programming and validate the efficiency with simulation with adapting smart airport framework. We concluded that the airport management with information techniques can reduce waiting time within security and immigration process.

SEVERE ACCIDENT MANAGEMENT CONCEPT OF THE VVER-1000 AND THE JUSTIFICATION OF CORIUM RETENTION IN A CRUCIBLE-TYPE CORE CATCHER

  • Khabensky, Vladimir Benzianovich;Granovsky, Vladimir Semenovich;Bechta, Sevostian Victorovich;Gusarov, Victor Vlasmirovich
    • Nuclear Engineering and Technology
    • /
    • v.41 no.5
    • /
    • pp.561-574
    • /
    • 2009
  • First ex-vessel core catcher has been applied to the practical design of NPPs with VVER-1000 reactors built in China (Tyanvan) and India (Kudankulam) for severe accident management (SAM) and mitigation of SA consequences. The paper presents the concept and basic design of this crucible-type core catcher as well as an evaluation of its efficiency. The important role of oxidic sacrificial material is discussed. Insight into the behaviour of the molten pool, which forms in the catcher after core relocation from the reactor vessel, is provided. It is shown that heat loads on the water-cooled vessel walls are kept within acceptable limits and that the necessary margins for departure from nucleate boiling (DNB) and of vessel failure caused by thermo-mechanical stress are satisfactorily provided for.

Design of UCC Broadcasting System in P2P Based IPTV Environments (P2P 기반의 IPTV 환경에서 UCC 방송을 위한 시스템 설계)

  • Kim, Ji Hoon
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.3
    • /
    • pp.37-47
    • /
    • 2010
  • In this paper, we propose an UCC broadcasting system in P2P based IPTV environments. Proposed system applies P2P based multiple chain architecture. UCC broadcasting system transfers data from not ISP server but UCC server peer that is included in DSLAM to joined peers. Therefore an algorithm to manage join and departure of peers have to modified. In this paper we propose an algorithm that does not increase an uplink bandwidth of DSLAM that include UCC server when peer joins to the UCC channel. We will show the improved performance of proposed scheme rather than general method with respect to the uplink bandwidth of DSLAM that include UCC server.

Application of (Max, +)-algebra to the Waiting Times in Deterministic 3-node Tandem Queues with Blocking ((Max, +)-대수를 이용한 3-노드 유한 버퍼 일렬대기행렬에서의 대기시간 분석)

  • Seo Dong-Won
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.2
    • /
    • pp.73-80
    • /
    • 2005
  • In this paper, we consider characteristics of waiting times in s1n91e-server 3-node tandem queues with finite buffers, a Poisson arrival process and deterministic service times at all nodes. There are three buffers : one at the first node is infinite and the others are finite. We obtain the fact that sojourn time or departure process is independent of the capacities of the finite buffers and does not depend on the order of service times, which are the same results in the literature. Moreover, the explicit expressions of stationary waiting times in all areas of the systems can be derived as functions of the finite buffer capacities. We also disclose a relationship of waiting times in subareas of the systems between two blocking policies communication and manufacturing. Some numerical examples are also provided.

An Impact Analysis of Window Mechanism and End to End Delay of Tandem Queueing Network with Constant Service Times (상수 서비스 시간을 갖는 개방형 대기행렬의 종대종 지연과 윈도우 구조의 영향 분석)

  • Rhee Young
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.29 no.3
    • /
    • pp.99-109
    • /
    • 2004
  • In this paper, we investigate the impact of window mechanisms on end to end delay in a series of nodes with constant service times. It is shown that arbitrary combinations of window mechanisms, each applying to an arbitrary subset of data, can be embedded on the nodes without affecting the departure instants from the system if the windows are at least as large as the number of nodes spanned. The window mechanisms are shown to have no impact on the average end to end delay of data. As the condition on the windows is a minimal necessary requirement for full parallelism, the results show that the transparent operation from viewpoint of data transmission can be achieved with minimal resources.