• Title/Summary/Keyword: Assignment Method

Search Result 834, Processing Time 0.026 seconds

A Logit Type of Public Transit Trip Assignment Model Considering Stepwise Transfer Coefficients (Stepwise 환승계수를 고려한 Logit 유형 대중교통통행배정모형)

  • SHIN, Seongil;BAIK, Namcheol
    • Journal of Korean Society of Transportation
    • /
    • v.34 no.6
    • /
    • pp.570-579
    • /
    • 2016
  • This study proposes a concept of Stepwise Transfer Coefficient(STC) which implies greater transfer cost with increasing the number of transfers. Thus, the public transport information system provides the choice sets of travel routes by the consideration of not only transportation time but also the optimum number of transfers. However, path choice problems that involve STC are found to include non additive cost, which requires additional route enumeration works. Discussions on route enumeration in actual transportation networks is very complicated, thereby warranting a theoretical examination of route search considering STC. From these points of view, this study results in a probability based transit trip assignment model including STC. This research also uses incoming link based entire route deletion method. The entire route deletion method proposed herein simplifies construction of an aggregation of possible routes by theoretically supporting the process of enumeration of the different routes from origin to destination. Conclusively, the STC reflected route based logit model is proposed as a public transportation transit trip assignment model.

An Empirical Analysis of Sino-Russia Foreign Trade Turnover Time Series: Based on EMD-LSTM Model

  • GUO, Jian;WU, Kai Kun;YE, Lyu;CHENG, Shi Chao;LIU, Wen Jing;YANG, Jing Ying
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.9 no.10
    • /
    • pp.159-168
    • /
    • 2022
  • The time series of foreign trade turnover is complex and variable and contains linear and nonlinear information. This paper proposes preprocessing the dataset by the EMD algorithm and combining the linear prediction advantage of the SARIMA model with the nonlinear prediction advantage of the EMD-LSTM model to construct the SARIMA-EMD-LSTM hybrid model by the weight assignment method. The forecast performance of the single models is compared with that of the hybrid models by using MAPE and RMSE metrics. Furthermore, it is confirmed that the weight assignment approach can benefit from the hybrid models. The results show that the SARIMA model can capture the fluctuation pattern of the time series, but it cannot effectively predict the sudden drop in foreign trade turnover caused by special reasons and has the lowest accuracy in long-term forecasting. The EMD-LSTM model successfully resolves the hysteresis phenomenon and has the highest forecast accuracy of all models, with a MAPE of 7.4304%. Therefore, it can be effectively used to forecast the Sino-Russia foreign trade turnover time series post-epidemic. Hybrid models cannot take advantage of SARIMA linear and LSTM nonlinear forecasting, so weight assignment is not the best method to construct hybrid models.

A Study on Improving Reliability of Benefit Estimation Based on User Equilibrium Traffic Assignment Results (이용자 균형 통행배정 결과를 이용한 편익추정의 안정성 제고방안 연구)

  • Kim, Jae-Yeong;Son, Ui-Yeong
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.6
    • /
    • pp.19-31
    • /
    • 2007
  • When estimating the benefits from an investment project in the transportation sector, errors caused by many factors may exist. This study focuses on user equilibrium traffic assignment methods and stopping criteria. According to previous studies, when using a user equilibrium assignment model, the benefits of travel time savings can be effected by the relative gap value. As the stopping criteria decreases, the time needed for traffic assignment increases, so that lowering the criteria cannot be the best solution. Therefore, an effort is necessary to reduce this change rate and thus improve reliability. This paper considers three methods: reducing the links subject to benefit calculation, extracting sub-area O/D tables and networks, and applying the mean value of successive traffic assignment results. The results of the analysis show that the method using the mean value of five results is more proper than the other methods. Using the sub-area analysis method, if the study area is small the benefits of a project might be over- or under-estimated. This paper used a nationwide O/D table and network at peak time as a case study. The resulting patterns can differ according to basic data to be used in analysis. So further analysis using the data from metropolitan areas are needed.

A study on the Adaptive Subcarrier Assignment techniques for interference suppression in OFDM System (OFDM 시스템에서 Adaptive Subcarrier Assignment 기법을 통한 간섭 경감에 관한 연구)

  • 조성구;박용완;최정희;이동학;정원석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.8A
    • /
    • pp.889-897
    • /
    • 2004
  • In this Paper, we propose the algorithm to provide stable communication in OFDM system under the highly interfered environment by the same/different systems which use same bandwidth or other jamming signal, i.e., radar signal. The proposed Adaptive Subcarrier Assignment(ASA) method first estimates the received power of each subcarrier in the block or fin or OFDM receiver. Then we estimate the threshold level which is the average power of the transmitted OFDM signal with AWGN. The highly interfered subcarriers, which are greater powers than the specified threshold level, are rejected in the next transmission and the only non-interfered subcarriers are selected as the next transmission. This algorithm provides stable communication in any OFDM systems without changing the physical layer under the highly interfered communication environment. We estimated the status of the subcarriers based on the bandwidth and power of the jamming signal and showed the performance of the proposed algorithm by the simulation.

Assignment Semantic Category of a Word using Word Embedding and Synonyms (워드 임베딩과 유의어를 활용한 단어 의미 범주 할당)

  • Park, Da-Sol;Cha, Jeong-Won
    • Journal of KIISE
    • /
    • v.44 no.9
    • /
    • pp.946-953
    • /
    • 2017
  • Semantic Role Decision defines the semantic relationship between the predicate and the arguments in natural language processing (NLP) tasks. The semantic role information and semantic category information should be used to make Semantic Role Decisions. The Sejong Electronic Dictionary contains frame information that is used to determine the semantic roles. In this paper, we propose a method to extend the Sejong electronic dictionary using word embedding and synonyms. The same experiment is performed using existing word-embedding and retrofitting vectors. The system performance of the semantic category assignment is 32.19%, and the system performance of the extended semantic category assignment is 51.14% for words that do not appear in the Sejong electronic dictionary of the word using the word embedding. The system performance of the semantic category assignment is 33.33%, and the system performance of the extended semantic category assignment is 53.88% for words that do not appear in the Sejong electronic dictionary of the vector using retrofitting. We also prove it is helpful to extend the semantic category word of the Sejong electronic dictionary by assigning the semantic categories to new words that do not have assigned semantic categories.

Distributed Task Assignment Algorithm for SEAD Mission of Heterogeneous UAVs Based on CBBA Algorithm (CBBA 기반 SEAD 임무를 위한 이종무인기의 분산형 임무할당 알고리듬 연구)

  • Lee, Chang-Hun;Moon, Gun-Hee;Yoo, Dong-Wan;Tahk, Min-Jea;Lee, In-Seok
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.40 no.11
    • /
    • pp.988-996
    • /
    • 2012
  • This paper presents a distributed task assignment algorithm for the suppression of enemy air defense (SEAD) mission of heterogeneous UAVs, based on the consensus-based bundle algorithm (CBBA). SEAD mission can be modeled as a task assignment problem of multiple UAVs performing multiple air defense targets, and UAVs performing SEAD mission consist of the weasel for destruction of enemy's air defense system and the striker for the battle damage assessment (BDA) or other tasks. In this paper, a distributed task assignment algorithm considering path-planning in presence of terrain obstacle is developed for heterogeneous UAVs, and then it is applied to SEAD mission. Through numerical simulations the performance and the applicability of the proposed method are tested.

Multi Agents-Multi Tasks Assignment Problem using Hybrid Cross-Entropy Algorithm (혼합 교차-엔트로피 알고리즘을 활용한 다수 에이전트-다수 작업 할당 문제)

  • Kim, Gwang
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.4
    • /
    • pp.37-45
    • /
    • 2022
  • In this paper, a multi agent-multi task assignment problem, which is a representative problem of combinatorial optimization, is presented. The objective of the problem is to determine the coordinated agent-task assignment that maximizes the sum of the achievement rates of each task. The achievement rate is represented as a concave down increasing function according to the number of agents assigned to the task. The problem is expressed as an NP-hard problem with a non-linear objective function. In this paper, to solve the assignment problem, we propose a hybrid cross-entropy algorithm as an effective and efficient solution methodology. In fact, the general cross-entropy algorithm might have drawbacks (e.g., slow update of parameters and premature convergence) according to problem situations. Compared to the general cross-entropy algorithm, the proposed method is designed to be less likely to have the two drawbacks. We show that the performances of the proposed methods are better than those of the general cross-entropy algorithm through numerical experiments.

An efficient channel assignment meghod for real-time service in the IEEE 802.11 wireless LAN system (IEEE 802.11 무선 LAN 환경에서 실시간 서비스를 제공하기 위한 채널 구간 할당 방안)

  • 박중신;류시훈;강태원;이준호;이재용;이상배
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.5
    • /
    • pp.1249-1259
    • /
    • 1998
  • This paper proposes an efficient channel assignment method for real-time service in the IEEE 802.11 Wireless LAN system, and analyzes the supportability to real-time service and the channel utilzation of that through computer simulations. The improved MAC(Medium Access Control) protocol employing the proposed channel assignment method achieved good throughput over contention period as well as contention-free period by making real-time terminals transmit the information about their desiring value before starts of data transmissions. For performance evaluation of the proposed method, a simulation analyzing the variation of allocated bandwidths to terminals using real-time service and their buffer sizes wasexecuted. Real-time data traffics was modeled s 7-stae transition VBR sources, and asynchronous data traffics modeled as Poisson processes. In the simulation, the proposed method showed smaller variation of the bandwidth of each terminal and samller buffer size than the existing method, and also recorded good throughput over contention period.

  • PDF

A Method for Assigning Clients to Servers for the Minimization of Client-Server Distance Deviation (클라이언트-서버간 거리 편차의 최소화를 위한 클라이언트의 서버 배정 방법)

  • Lee, Sunghae;Kim, Sangchul
    • Journal of Korea Game Society
    • /
    • v.16 no.3
    • /
    • pp.97-108
    • /
    • 2016
  • Multi-client online games usually employ multi-serve architectures. For group play, if the user response time deviation between the clients in a group is large, the fairness and attractions of the game will be degraded. In this paper, given new clients, we propose a method for assigning the clients to servers to minimize the deviation of client-server distance which plays a major role in the user response time. This method also supports client matching for group play and server load balancing. We formulate the client-server assignment problem as an IP one, and present a GA(Genetic Algorithm)-based algorithm to solve it. We experimented our method under various settings and analyzed its features. To our survey, little research has been previously performed on client-server assignment under consideration of client matching, distance deviation minimization and server load balancing.