• 제목/요약/키워드: Arrival Management

검색결과 342건 처리시간 0.027초

오전 첨두시의 동적 교통관리를 위한 동적 통행배정모형에 관한 연구 (A Dynamic assignment model for Dynamic Traffic Management in AM Peak)

  • 박준식;박창호;전경수
    • 대한교통학회지
    • /
    • 제19권4호
    • /
    • pp.97-108
    • /
    • 2001
  • 기존의 동적 통행배정모형은 출발시간 선택에 있어서 도착시간제약을 고려하지 못하고 있으며, 이를 고려하더라도 수단분담을 고려하지 못하거나 별도의 문제로 다루고 있다. 따라서 대중교통의 수단분담비가 높고, 도착시간에 대한 제약이 따르는 출근·통학통행이 주류를 이루는 오전첨두시의 교통관리·분석을 위해서는 이들을 동시에 고려하는 동적 통행배정모형이 요구된다. 본 연구에서는 Ran과 Boyce가 구축한 모형에 기반하여 통행수단과 도착시간 제약에 따른 출발시간 선택을 경로선택과 동시에 고려할 수 있는 통합모형을 제시하였다. 모형의 풀이를 위해 Ran과 Boyce가 사용한 시·공간 확장 가로망을 새롭게 설계하여 사용하였으며, 가상 가로망에 적용하여 모형의 적합성을 검증하였다. 사례연구 결과 본 연구에서 제시한 모형이 동적 사용자최적 통행배점상태를 나타내는 것을 확인할 수 있었고, 이를 통해 오전 첨두시의 교통관리·분석을 위해 적용 가능함을 입증하였다.

  • PDF

이동 통신에서 호 수신 확률에 근거한 위치 관리 기법 (A Location Management Strategy Based on the Call Arrival Probability(CAP) in Mobile Communication)

  • 박선영;한기준
    • 대한전자공학회논문지TC
    • /
    • 제41권3호
    • /
    • pp.159-159
    • /
    • 2004
  • 이동 통신망의 수요가 증가함에 따라 보다 많은 가입자를 수용하기 위해 셀의 크기가 소형화되고 이는 잦은 위치 갱신을 유발시켜 위치 관리 비용의 증가를 가져왔다. 이와 같은 위치 관리 비용을 줄이기 위해 본 논문에서는 호 수신 확률에 근거한 위치 관리 기법을 제안한다. 제안된 기법은 단말이 새로운 LA로 진입 할 때 그 LA에서 호 수신 확률과 현재까지의 위치 갱신 생략 횟수를 고려하여 위치 갱신 여부를 결정한다. 이 때 호 수신 확률은 단말의 이동 성향에 관한 예측 정보에 의해서 계산된다. 성능을 검증하기 위해 시뮬레이션을 수행하였고 그 결과, 예측 정보가 맞을 경우 위치 갱신 비용을 상당히 줄일 수 있으며 예측 정보가 어긋나더라도 최소한 기존 표준안(IS-41)의 위치 관리 비용을 초과하지 않음을 시뮬레이션을 통해 알 수 있었다. 또한 예측 정보 유지와 같은 유사한 형태의 오버헤드를 요구하는 AS(Alternative Strategy)와도 시뮬레이션을 통해 성능을 비교하고 제안한 기법의 성능이 우수함을 보였다.

이동 통신에서 호 수신 확률에 근거한 위치 관리 기법 (A Location Management Strategy Based on the Call Arrival Probability(CAP) in Mobile Communication)

  • 장성식;박선영;이원열;한기준
    • 대한전자공학회논문지TC
    • /
    • 제41권3호
    • /
    • pp.1-8
    • /
    • 2004
  • 이동 통신망의 수요가 증가함에 따라 보다 많은 가입자를 수용하기 위해 셀의 크기가 소형화되고 이는 잦은 위치 갱신을 유발시켜 위치 관리 비용의 증가를 가져왔다. 이와 같은 위치 관리 비용을 줄이기 위해 본 논문에서는 호 수신 확률에 근거한 위치 관리 기법을 제안한다. 제안된 기법은 단말이 새로운 LA로 진입 할 때 그 LA에서 호 수신 확률과 현재까지의 위치 갱신 생략 횟수를 고려하여 위치 갱신 여부를 결정한다. 이 때 호 수신 확률은 단말의 이동 성향에 관한 예측 정보에 의해서 계산된다. 성능을 검증하기 위해 시뮬레이션을 수행하였고 그 결과, 예측 정보가 맞을 경우 위치 갱신 비용을 상당히 줄일 수 있으며 예측 정보가 어긋나더라도 최소한 기존 표준안(IS-41)의 위치 관리 비용을 초과하지 않음을 시뮬레이션을 통해 알 수 있었다. 또한 예측 정보 유지와 같은 유사한 형태의 오버헤드를 요구하는 AS(Alternative Strategy)와도 시뮬레이션을 통해 성능을 비교하고 제안한 기법의 성능이 우수함을 보였다.

시간에 따른 인구유동/호 발생의 변화를 고려한 이동통신 네트워크의 위치영역 설계 (Location Area Design of a Cellular Network with Time-dependent Mobile flow and Call Arrival Rate)

  • 홍정식;장재성;김지표;이창훈;이진승
    • 한국경영과학회지
    • /
    • 제30권3호
    • /
    • pp.119-135
    • /
    • 2005
  • Design of location erea(LA) in a cellular network is to partition the network into clusters of cells so as to minimize the cost of location updating and paging. Most research works dealing with the LA design problem assume that the call. arrival rate and mobile flow rate are fixed parameters which can be estimated independently. In this aspect, most Problems addressed so far are deterministic LA design problems(DLADP), known to be NP hard. The mobile flow and call arrival rate are, however, varying with time and should be treated simultaneously because the call arrival rate in a cell during a day is influenced by the change of a population size of the cell. This Paper Presents a new model on IA design problems considering the time-dependent call arrival and mobile flow rate. The new model becomes a stochastic LA design problem(SLADP) because It takes into account the possibility of paging waiting and blocking caused by the changing call arrival rate and finite paging capacity. Un order to obtain the optimal solution of the LA design problem, the SIADP is transformed Into the DLADP by introducing the utilization factor of paging channels and the problem is solved iteratively until the required paging quality is satisfied. Finally, an illustrative example reflecting the metropolitan area, Seoul, is provided and the optimal partitions of a cell structure are presented.

Point-Merge 절차를 이용한 도착 스케줄링 및 조언 정보 생성 알고리즘 개발 (A Development of Arrival Scheduling and Advisory Generation Algorithms based on Point-Merge Procedure)

  • 홍성권;김소윤;전대근;은연주;오은미
    • 한국항공운항학회지
    • /
    • 제25권3호
    • /
    • pp.44-50
    • /
    • 2017
  • This paper proposes arrival scheduling and advisory generation algorithms which can be used in the terminal airspace with Point-Merge procedures. The proposed scheduling algorithm consists of two steps. In the first step, the algorithm computes aircraft schedules at the entrance of the Point-Merge sequencing legs based on First-Come First-Served(FCFS) strategy. Then, in the second step, optimal sequence and schedules of all aircraft at the runway are computed using Multi-Objective Dynamic Programming(MODP) method. Finally, the advisories that have to be provided to the air traffic controllers are generated. To demonstrate the proposed algorithms, the simulation was conducted based on Jeju International Airport environments.

예약기반 서비스 시스템에서의 고객 도착 프로세스 분석 (Analysis of Customer Arrival Process in an Appointment-Based Service System)

  • 민대기
    • 한국경영과학회지
    • /
    • 제37권2호
    • /
    • pp.31-43
    • /
    • 2012
  • Delivery of a good quality of service in an efficient manner requires matching the supply of capacity with customer demand. Much research has employed queueing models that analyzed the service system on the basis of independent and stationary customer arrivals. However, the appointment system, which is widely used to facilitate customer access to service in many industries including healthcare, has significant influence on the customer arrival process so that the independent and stationary assumption does not hold in an appointment-based service system. In this regard, this paper aims to propose a model for accurate illustration of the appointment-based customer arrival process. The use of the proposed model allows us to evaluate the overall system performance such as mean waiting time and service level under various appointment policies instead of conducting simulation studies.

임의의 횟수의 휴가를 갖는 $M^{X}/G/1$$GEO^{X}/G/1$ 대기행렬의 분석 (Analysis of $M^{X}/G/1$ and $GEO^{X}/G/1$ Queues with Random Number of Vacations)

  • 채경철;김남기;이호우
    • 한국경영과학회지
    • /
    • 제27권2호
    • /
    • pp.51-61
    • /
    • 2002
  • By using the arrival time approach of Chae et at. [6], we derive various performance measures including the queue length distributions (in PGFs) and the waiting time distributions (in LST and PGF) for both M$^{x}$ /G/1 and Geo$^{x}$ /G/1 queueing systems, both under the assumption that the server, when it becomes idle, takes multiple vacations up to a random maximum number. This is an extension of both Choudhury[7] and Zhang and Tian [11]. A few mistakes in Zhang and Tian are corrected and meaningful interpretations are supplemented.

선전과 이탈이 있는 복수 서비스 대기행렬모형에 대한 시뮬레이션 분석 (Simulation Analysis for Multiple-Server Queueing Model with Advertising and Balking)

  • 권치명;김성연;정문상;황성원
    • 한국시뮬레이션학회논문지
    • /
    • 제13권1호
    • /
    • pp.41-50
    • /
    • 2004
  • The purpose of this paper is to analyse the manager's policy to maximize the profit in a multiple-server queueing facility with a limited queue capacity. We assume that the level of advertizing effects on the arrival rate of customers to the facility. The model without ‘word of mouth effect’ is assumed that the arrival rate is independent on the qualify of service level. We estimate the service quality by the balking rate of customers from system. We extend this to the model with ‘word of mouth effect’. To achieve the maximum profit, the most important factor is the considerably high utilization of facility for both models. Given service rate, we should maintain an effective arrival rate to some extent. To this end, among the available options, an increase of advertizing effort is more desirable than reducing the fee if the service value of customers remains unchanged. We also investigate whether the variability of service time has a significant impact on determining the optimal policy. The cost of service variability is not so expensive as that in a single server model due to the reduced variability of service times in a multiple-server model.

  • PDF

급성 뇌경색 환자의 증상 발현 후 응급실 도착까지의 시간이 치료 결과에 미치는 영향 (Impact of an Early Hospital Arrival on Treatment Outcomes in Acute Ischemic Stroke Patients)

  • 권영대;윤성상;장혜정
    • Journal of Preventive Medicine and Public Health
    • /
    • 제40권2호
    • /
    • pp.130-136
    • /
    • 2007
  • Objectives : Recent educational efforts have concentrated on patient's early hospital arrival after symptom onset. The purpose of this study was to evaluate the time interval between symptom onset and hospital arrival and to investigate its relation with clinical outcomes for patients with acute ischemic stroke. Methods : A prospective registry of patients with signs or symptoms of acute ischemic stroke, admitted to the OO Medical Center through emergency room, was established from September 2003 to December 2004. The interval between symptom onset and hospital arrival was recorded for each eligible patient and analyzed together with clinical characteristics, medication type, severity of neurologic deficits, and functional outcomes. Results : Based on the data of 256 patients, the median interval between symptom onset and hospital arrival was 13 hours, and 22% of patients were admitted to the hospital within 3 hours after symptom onset. Patients of not-mild initial severity and functional status showed significant differences between arrival hours of 0-3 and later than 3 in terms of their functional outcomes on discharge. Logistic regression models also showed that arrival within 3 hours was a significant factor influencing functional outcome (OR=5.6; 95% CI=2.1, 15.0), in addition to patient's initial severity, old age, cardioembolism subtype, and referral to another hospital. Conclusions : The time interval between symptom onset and hospital arrival significantly influenced treatment outcome for patients with acute ischemic stroke, even after controlling for other significant clinical characteristics. The findings provided initiatives for early hospital arrival of patients and improvement of emergency medical system.

예약도착 대기행렬을 활용한 함정정비 최적 예약시간 산정에 관한 연구 (A Study on the Optimal Appointment Scheduling for the Ship Maintenance with Queueing System with Scheduled Arrivals)

  • 고재우;김각규;윤봉규
    • 한국경영과학회지
    • /
    • 제38권3호
    • /
    • pp.13-22
    • /
    • 2013
  • Queueing system with scheduled arrivals is useful in many fields where both customers' waiting time and servers' operation time (utilization) are important, and arrival time of customers is possible to be controlled. In this paper, we analyzed the operation of ship maintenance with the queueing system with scheduled arrival. Based on the model presented by Pegden and Rosenshine [8], who dealt with exponential service time, we extended the service time distributions to phase-type distribution which is able to include a wide range of real stochastic phenomena. Since most activities in the military are carried out under tight control and schedule, scheduled arrival queue has quite good applicability in this area. In this context, we applied queue with scheduled arrival to the optimal booking time decision for the ship maintenance in the navy.