• Title/Summary/Keyword: Waiting Cost

Search Result 145, Processing Time 0.052 seconds

A Simulation Study Based on the Continuous Berth Utilization in Inchon Port (선석의 연속접안을 고려한 인천항의 시뮬레이션 연구)

  • 최현규;이창호
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2000.11a
    • /
    • pp.95-99
    • /
    • 2000
  • The domestic ports become less competitive for the out of dated equipments and inefficient information system. Specially, Inchon Port, which is the second largest port of Korea, has the point at issue such as the excessive logistics cost because of the limit of handling capacity and the chronic demurrage. In this paper to develope the simulation programs the basic input parameters such as arrival intervals, cargo tons, service rates are analyzed and the probability density functions for there variable are estimated. Also to perform the conception of continuous berth utilization, the berth and cargo classification is reconstructed. And the more actual simulation is realized by using more detailed depth representation of water The simulation model is executed based on the knowledge base and database, and is constructed using Visual Basic and Access database. Simulation results reveal that this study suitably reflect the real berth operation and waiting time of ships is shortened.

  • PDF

A Study on Simulation Design for the Optimum Number of Ticket Booth (역 매표창구 최적화를 위한 시뮬레이션 설계 연구)

  • Kim, Ick-Hee;Lee, Kyung-Tae;Park, Su-Myung
    • Proceedings of the KSR Conference
    • /
    • 2009.05a
    • /
    • pp.1851-1858
    • /
    • 2009
  • As the ticket issuing methods have been diversified for the convenience of the passengers such as ticketless service(SMS ticket, e-ticket, home ticket), automatic ticket issuing machine and consignment ticket sale, maintaining the current number of ticket booth has been becoming a issue. This study is designed to simulation for the optimum number of ticket booth and which can affect an efficient operation of train station and improvement of customer convenience. This study is proceeding and will contribute to minimize customer waiting time at the ticket booth. In addition, presenting the optimum number of booth is expected to have an effect on the increase of productivity and cost savings.

  • PDF

Automatic Remote Firmware Upgrade Algorithm through Internet for DOCSIS Cable Modems

  • Kim, Hong-Ik;Park, Sung-Kwon
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1367-1370
    • /
    • 2002
  • This paper introduces a new web based method to remotely upgrade firmwares of Cable Modems (CM) which are integral part in providing high-speed Internet access through Hybrid Fiber Coaxial (HFC) networks. Also, it discusses various practical problems arising in the upgrading process. Traditional upgrade has been performed by modifying the CM configuration fie. This paper shows a new web based CM firmware upgrade method using SNMP and MIB which greatly reduces upgrading time, cost and man-hour than traditional firmware upgrade methods. This method has been shown to be very efficient and practical. This method will make significant impact especially because tens of million cable modems are currently waiting to be upgraded soon to the next version from the current version.

  • PDF

A Genetic Algorithm for Route Guidance System in Intermodal Transportation Networks with Time - Schedule Constraints (서비스시간 제한이 있는 복합교통망에서의 경로안내 시스템을 위한 유전자 알고리듬)

  • Chang, In-Seong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.2
    • /
    • pp.140-149
    • /
    • 2001
  • The paper discusses the problem of finding the Origin-Destination(O-D) shortest paths in internodal transportation networks with time-schedule constraints. The shortest path problem on the internodal transportation network is concerned with finding a path with minimum distance, time, or cost from an origin to a destination using all possible transportation modalities. The time-schedule constraint requires that the departure time to travel from a transfer station to another node takes place only at one of pre-specified departure times. The scheduled departure times at the transfer station are the times when the passengers are allowed to leave the station to another node using the relative transportation modality. Therefore, the total time of a path in an internodal transportation network subject to time-schedule constraints includes traveling time and transfer waiting time. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. The effectiveness of the GA approach is evaluated using several test problems.

  • PDF

Developing a Transit Assignment Model Considering Waiting Time Variation and Line Capacity (대기시간변동 및 용량을 고려한 대중교통 통행배정모형)

  • Kim, Jin Howan;Kim, Dong Sun;Kim, Ji Hyun
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.34 no.5
    • /
    • pp.1525-1534
    • /
    • 2014
  • In recent years, the passengers are likely to decide their route on impulse due to the development of the integrated public transport system, and real-time information system. Especially, public transport fare integration in Seoul Metropolitan area, 2004 makes them not to have resistance about changing the modes or routes and their route choice is most effected by the degree of congestion. Assignment model have limitations to describe route changes by congestion. In this study, the concept of a link cost function used in road assignment and Effective frequency is introduced to describe the passengers' behavior when the capacity of public transport is over and the waiting time variation. Two situations, new transit line operation and accident, are set up to validate the model, as a result of the transit assignment by this model, the traffic on networks is not over the capacity. It is expected that this study will be of help to reflect the various behaviors in transit assignments.

Design of path-finding algorithm using dynamic turn heuristic (가변적인 턴 휴리스틱을 이용한 경로탐색 알고리즘의 설계)

  • Lee, Ji-Wan;Moon, Dae-Jin;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.179-182
    • /
    • 2008
  • It needs to consider of turns during a path-finding on real road network. Because a car is delayed by waiting a traffic signal and decreasing speed when drived in a turn road such as cross road and slip road. If a straightness of a path is increased, a real cost of traveling should be able to decrease. An older method, the algorithm with Turn Heuristic, considered of this case. The algorithm, that differently gave weights to left, right and U-turns, improved a straightness of a path, but increased a cost of exploring. In this paper, we propose a improved Turn Heuristic Algorithm. Proposed algorithm uses Dynamic Turn Heuristic. It is able to more decrease a cost of exploring than older method by using the Turn Heuristic in a part of path-finding.

  • PDF

Performance Analysis of BIM Labor using Case Analysis (사례분석을 활용한 시공단계 BIM 인력 투입 성과 분석)

  • Kim, Hyoung-Jin;Yoo, Moo-Young;Kim, Jae-Jun;Choi, Chang-Shik
    • Journal of KIBIM
    • /
    • v.7 no.3
    • /
    • pp.31-39
    • /
    • 2017
  • BIM is effective to improve the labor productivity of construction participants. From this point of view, it is important to analyze the outcome related with BIM Labor which covers most of the BIM investment costs. This research focuses on BIM RFI which is one of the major task of the BIM labor and analyze the outcomes. In addition, this research was quantitatively analyzed by the standby time and related cost caused by BIM labor, which affect the results of the project participants. To this end, analytical standby queue model was utilized to analyze the labor focusing on micros TASK. 11 projects were selected to analyze the results of BIM labor and RFI that the project participants requested to the BIM labor was collected. Through this, it collected variables for analyzing results, and Finally, we pulled out 4 projects for analysis. In this study, the basic results analysis of RFI processing of the BIM labor, the probabilistic analysis of BIM labor service status, and the economic analysis of BIM labor optimal inputs were performed by using the research model presented. The results of this study can be utilized to formulate the optimal strategy for BIM labor inputs(e.g. number of employees, level, time point, etc.) of the construction phase. Moreover, it can contribute to ensuring the credibility of the BIM ROI results by presenting the cost of BIM services in BIM ROI analysis and the standby cost of project participants.

The Development of A Dynamic Traffic Assignment Technique using the Cell Transmission Theory (Cell Transmission 이론을 이용한 동적통행배정기법 개발에 관한 연구)

  • 김주영;이승재;손의영
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.4
    • /
    • pp.71-84
    • /
    • 1999
  • The purpose of this study is to construct a dynamic traffic analysis model using the existing traffic flow theory in order to develope a dynamic traffic assignment technique. In this study the dynamic traffic analysis model was constructed using Daganzo's CELL TRANSMISSION THEORY which was considered more suitable to dynamic traffic assignment than the other traffic flow theories. We developed newly the diverging split module, the cost update module and the link cost function and defined the maximum waiting time decision function that Daganzo haven't defined certainly at his Papers. The output that resulted from the simulation of the dynamic traffic analysis model with test network I and II was shown at some tables and figures, and the analysis of the bottleneck and the HOV lane theory showed realistic outputs. Especially, the result of traffic assignment using the model doesn't show equilibrium status every time slice but showed that the average travel cost of every path maintains similarly in every time slice. It is considered that this model can be used at the highway operation and the analysis of traffic characteristics at a diverging section and the analysis of the HOV lane effect.

  • PDF

Effectiveness Analysis of Transforming Many-Legs Type Intersection into Roundabout in Jeju (제주지역 다지교차로의 회전교차로 교통시스템 변환에 따른 효과분석)

  • Lee, Dong Weon;Ko, Sang Ick;Lee, Dong Wook
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.32 no.6D
    • /
    • pp.623-636
    • /
    • 2012
  • Roundabout is an intersection that allows vehicles to pass through the intersection by circulating the circular traffic island at the center of the intersection. In this study, a comparative analysis was conducted on roundabout at five locations in order to deduce the operational result and financial effect of roundabout and signal intersection. As for the operational result, it was found that roundabout showed improvement effect in the average delay per vehicle compared to that of signal intersection by minimum of 65.6% and maximum of 91.77%. it was found that roundabout showed financial cost-saving effect in the traffic congestion cost compared to that of signal operation by minimum of 58.59% and maximum of 81.69% per year. It can be known from these analysis results that roundabout has significant operational effects under certain amount of traffic volume by allowing vehicles to pass through the intersection in a continuous way without much waiting time and stoppage from signal control.

An Online Forklift Dispatching Algorithm Based on Minimal Cost Assignment Approach (최소 비용할당 기반 온라인 지게차 운영 알고리즘)

  • kwon, BoBae;Son, Jung-Ryoul;Ha, Byung-Hyun
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.2
    • /
    • pp.71-81
    • /
    • 2018
  • Forklifts in a shipyard lift and transport heavy objects. Tasks occur dynamically and the rate of the task occurrence changes over time. Especially, the rate of the task occurrence is high immediately after morning and afternoon business hours. The weight of objects varies according to task characteristic, and a forklift also has the workable or allowable weight limit. In this study, we propose an online forklift dispatching algorithm based on nearest-neighbor dispatching rule using minimal cost assignment approach in order to attain the efficient operations. The proposed algorithm considers various types of forklift and multiple jobs at the same time to determine the dispatch plan. We generate dummy forklifts and dummy tasks to handle unbalance in the numbers of forklifts and tasks by taking their capacity limits and weights. In addition, a method of systematic forklift selection is also devised considering the condition of the forklift. The performance indicator is the total travel distance and the average task waiting time. We validate our approach against the priority rule-based method of the previous study by discrete-event simulation.