• Title/Summary/Keyword: Time window models

Search Result 66, Processing Time 0.027 seconds

A Model for Determining Time Windows for Vehicles of Suppliers in a Supply Chain (공급사슬환경하에서 차량의 도착시각 시간창 결정을 위한 모델)

  • Kim, Ki-Young;Kim, Kap-Hwan
    • IE interfaces
    • /
    • v.14 no.4
    • /
    • pp.365-373
    • /
    • 2001
  • It is discussed how to determine time windows for pickups and deliveries, which have been assumed to be given in all most of previous studies on traveling salesman problems with time window, vehicle routing problems with time window, vehicle scheduling and dispatching problems, and so on. First, time windows are classified into four models (DR, DA, AR, and AA) by customers‘ polices. For each model, it is shown how a time window is related to various cost terms of suppliers and customers. Under the assumption of collaborative supplier-customer relationship, an integrated cost model for both supplier and customer is constructed for determining boundaries of time windows. The cost models in this paper consists of cost terms that depend on waiting time, early arrival time, late arrival time, and rejection of receipt. A numerical example is provided and results of the sensitivity analysis for some parameters are also provided to help intuitive understanding about the characteristics of the suggested models.

  • PDF

THE BIAS OF LAG WINDOW ESTIMATORS OF THE FRACTIONAL DIFFERENCE PARAMETER

  • Hunt, Richard;Peiris, Shelton;Weber, Neville
    • Journal of applied mathematics & informatics
    • /
    • v.12 no.1_2
    • /
    • pp.67-79
    • /
    • 2003
  • An approximation for the bias in lag window estimators of the degree of differencing in fractionally integrated time series models is derived. The expression obtained is compared with the observed bias from simulations for various windows.

Discrete-time BLUFIR filter (이산시간 무편향 선형 최적 유한구간 필터)

  • 박상환;권욱현;권오규
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.980-983
    • /
    • 1996
  • A new version of the discrete-time optimal FIR (finite impulse response) filter utilizing only the measurements of finite sliding estimation window is suggested for linear time-invariant state-space models. This filter is called the BLUFIR (best linear unbiased finite impulse response) filter since it provides the BLUE (best linear unbiased estimate) of the state obtained from the measurements of the estimation window. It is shown that the BLUFIR filter has the deadbeat property when there are no noises in the estimation window.

  • PDF

Analysis of Efficiency and Productivity Changes for Mail Centers Using DEA-Window Analysis and Malmquist Productivity Index (DEA-Window 분석 및 Malmquist 생산성지수를 사용한 우편집중국 효율성 및 생산성 변화 분석)

  • Lee, Jae-Seol;Goh, Hyun-Woo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.32 no.4
    • /
    • pp.79-86
    • /
    • 2009
  • The purpose of this paper is to analyze the 24 mail center's efficiency and productivity changes from first quarter to fourth quarter of 2008 using window analysis and Malmquist productivity index. Row views of window analysis results make it possible to determine trends and/or observed behavior with the same data set, and column views to examine the stability of results across different data sets. Malmquist productivity indexes greater than unity translate into improvements in productivity, and less than unity mean deterioration in performance over time. The results of this study suggest that DEA models under dynamic situations such as window analysis and Malmquist productivity index enable us to comprehend the efficiency and productivity changes over time and to show the direction of improvements.

Determination of Optimal Scan Time for the Measurement of Downstream Metabolites in Hyperpolarized 13C MRSI

  • Lee, Hansol;Lee, Joonsung;Joe, Eunhae;Yang, Seungwook;Choi, Young-suk;Wang, Eunkyung;Song, Ho-Taek;Kim, Dong-Hyun
    • Investigative Magnetic Resonance Imaging
    • /
    • v.19 no.4
    • /
    • pp.212-217
    • /
    • 2015
  • Purpose: For a single time-point hyperpolarized $^{13}C$ magnetic resonance spectroscopy imaging (MRSI) of animal models, scan-time window after injecting substrates is critical in terms of signal-to-noise ratio (SNR) of downstream metabolites. Pre-scans of time-resolved magnetic resonance spectroscopy (MRS) can be performed to determine the scan-time window. In this study, based on two-site exchange model, protocol-specific simulation approaches were developed for $^{13}C$ MRSI and the optimal scan-time window was determined to maximize the SNR of downstream metabolites. Materials and Methods: The arterial input function and conversion rate constant from injected substrates (pyruvate) to downstream metabolite (lactate) were precalibrated, based on pre-scans of time-resolved MRS. MRSI was simulated using two-site exchange model with considerations of scan parameters of MRSI. Optimal scan-time window for mapping lactate was chosen from simulated lactate intensity maps. The performance was validated by multiple in vivo experiments of BALB/C nude mice with MDA-MB-231 breast tumor cells. As a comparison, MRSI were performed with other scan-time windows simply chosen from the lactate signal intensities of pre-scan time-resolved MRS. Results: The optimal scan timing for our animal models was determined by simulation, and was found to be 15 s after injection of the pyruvate. Compared to the simple approach, we observed that the lactate peak signal to noise ratio (PSNR) was increased by 230%. Conclusion: Optimal scan timing to measure downstream metabolites using hyperpolarized $^{13}C$ MRSI can be determined by the proposed protocol-specific simulation approaches.

The Effect on a Delivery Time Window Dispatching Policy for 3PL Distribution Center (제3자 물류센터 납품시간창 디스패칭 정책에 관한 효과)

  • Lee, Woon-Seek;Kim, Byung Soo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.37 no.1
    • /
    • pp.60-67
    • /
    • 2014
  • This paper considers an inbound ordering and outbound dispatching problem for multi-products and multi-vehicles in a third-party distribution center. The demands are dynamic over a discrete and finite time horizon, and replenishing orders are shipped in various transportation modes and the freight cost is proportional to the number of vehicles used. Any mixture of products is loaded onto any type of vehicles. The objective of the study is to simultaneously determine the inbound lot-sizes, the outbound dispatching sizes, and the types and numbers of vehicles used to minimize total costs, which consist of inventory holding cost and freight cost. Delivery time window is one of the general dispatching policies between a third-party distribution center and customers in practice. In the policy, each demand of product for a customer must be delivered within the time window without penalty cost. We derive mixed integer programming models for the dispatching policy with delivery time windows and on-time delivery dispatching policy, respectively and analyze the effect on a dispatching policy with delivery time windows by comparing with on-time delivery dispatching policy using various computational experiments.

Comparison of forecasting performance of time series models for the wholesale price of dried red peppers: focused on ARX and EGARCH

  • Lee, Hyungyoug;Hong, Seungjee;Yeo, Minsu
    • Korean Journal of Agricultural Science
    • /
    • v.45 no.4
    • /
    • pp.859-870
    • /
    • 2018
  • Dried red peppers are a staple agricultural product used in Korean cuisine and as such, are an important aspect of agricultural producers' income. Correctly forecasting both their supply and demand situations and price is very important in terms of the producers' income and consumer price stability. The primary objective of this study was to compare the performance of time series forecasting models for dried red peppers in Korea. In this study, three models (an autoregressive model with exogenous variables [ARX], AR-exponential generalized autoregressive conditional heteroscedasticity [EGARCH], and ARX-EGARCH) are presented for forecasting the wholesale price of dried red peppers. As a result of the analysis, it was shown that the ARX model and ARX-EGARCH model, each of which adopt both the rolling window and the adding approach and use the agricultural cooperatives price as the exogenous variable, showed a better forecasting performance compared to the autoregressive model (AR)-EGARCH model. Based on the estimation methods and results, there was no significant difference in the accuracy of the estimation between the rolling window and adding approach. In the case of dried red peppers, there is limitation in building the price forecasting models with a market-structured approach. In this regard, estimating a forecasting model using only price data and identifying the forecast performance can be expected to complement the current pricing forecast model which relies on market shipments.

A study on Data Preprocessing for Developing Remaining Useful Life Predictions based on Stochastic Degradation Models Using Air Craft Engine Data (항공엔진 열화데이터 기반 잔여수명 예측력 향상을 위한 데이터 전처리 방법 연구)

  • Yoon, Yeon Ah;Jung, Jin Hyeong;Lim, Jun Hyoung;Chang, Tai-Woo;Kim, Yong Soo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.2
    • /
    • pp.48-55
    • /
    • 2020
  • Recently, a study of prognosis and health management (PHM) was conducted to diagnose failure and predict the life of air craft engine parts using sensor data. PHM is a framework that provides individualized solutions for managing system health. This study predicted the remaining useful life (RUL) of aeroengine using degradation data collected by sensors provided by the IEEE 2008 PHM Conference Challenge. There are 218 engine sensor data that has initial wear and production deviations. It was difficult to determine the characteristics of the engine parts since the system and domain-specific information was not provided. Each engine has a different cycle, making it difficult to use time series models. Therefore, this analysis was performed using machine learning algorithms rather than statistical time series models. The machine learning algorithms used were a random forest, gradient boost tree analysis and XG boost. A sliding window was applied to develop RUL predictions. We compared model performance before and after applying the sliding window, and proposed a data preprocessing method to develop RUL predictions. The model was evaluated by R-square scores and root mean squares error (RMSE). It was shown that the XG boost model of the random split method using the sliding window preprocessing approach has the best predictive performance.

Novel Push-Front Fibonacci Windows Model for Finding Emerging Patterns with Better Completeness and Accuracy

  • Akhriza, Tubagus Mohammad;Ma, Yinghua;Li, Jianhua
    • ETRI Journal
    • /
    • v.40 no.1
    • /
    • pp.111-121
    • /
    • 2018
  • To find the emerging patterns (EPs) in streaming transaction data, the streaming is first divided into some time windows containing a number of transactions. Itemsets are generated from transactions in each window, and then the emergence of itemsets is evaluated between two windows. In the tilted-time windows model (TTWM), it is assumed that people need support data with finer accuracy from the most recent windows, while accepting coarser accuracy from older windows. Therefore, a limited array's elements are used to maintain all support data in a way that condenses old windows by merging them inside one element. The capacity of elements that accommodates the windows inside is modeled using a particular number sequence. However, in a stream, as new data arrives, the current array updating mechanisms lead to many null elements in the array and cause data incompleteness and inaccuracy problems. Two models derived from TTWM, logarithmic TTWM and Fibonacci windows model, also inherit the same problems. This article proposes a novel push-front Fibonacci windows model as a solution, and experiments are conducted to demonstrate its superiority in finding more EPs compared to other models.

Moving Window Technique for Obstacle Detection Using Neural Networks (신경망을 사용한 장애물 검출을 위한 Moving Window 기법)

  • 주재율;회승욱;이장명
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.164-164
    • /
    • 2000
  • This paper proposes a moving window technique that extracts lanes and vehicles using the images captured by a CCD camera equipped inside an automobile in real time. For the purpose, first of all the optimal size of moving window is determined based upon speed of the vehicle, road curvature, and camera parameters. Within the moving windows that are dynamically changing, lanes and vehicles are extracted, and the vehicles within the driving lanes are classified as obstacles. Assuming highway driving, there are two sorts of image-objects within the driving lanes: one is ground mark to show the limit speed or some information for driving, and the other is the vehicle as an obstacle. Using characteristics of three-dimension objects, a neural network can be trained to distinguish the vehicle from ground mark. When it is recognized as an obstacle, the distance from the camera to the front vehicle can be calculated with the aids of database that keeps the models of automobiles on the highway. The correctness of this measurement is verified through the experiments comparing with the radar and laser sensor data.

  • PDF