• 산업공학
• /
• 제23권2호
• /
• pp.164-175
• /
• 2010

In logistics e-marketplaces, brokerage agents intermediate empty vehicles and freights registered by car owners and shippers. In the previous research, we proposed constant periodic/fixed matching algorithms for the logistics brokerage agents with the objective of minimizing the total transportation lead time and the transportation due date tardiness of freights(Jeong, 2004; Jeong, 2007). However, the constant type algorithms cannot consider changes in the balance status of an e-marketplace, i.e. the difference between the numbers of freights and vehicles to wait for matching, because they use non-changing matching periods and amounts. In this paper, we propose variable type algorithms for the logistics brokerage agent, in which the matching periods and amounts are changed continuously by considering the balance status between the freights and vehicles. In order to compare performance of the variable type algorithms to the previous constant type algorithms, we carried out computational experiments on various problem instances. The results show that the variable type algorithms give better performance than the constant type algorithms. We can expect that the logistics brokerage agents can improve their performance by using the proposed variable periodic/fixed matching algorithms.

• 대한산업공학회지
• /
• 제17권1호
• /
• pp.83-94
• /
• 1991

This study is concerned with the scheduling problem for mixed-model assembly lines in Just-In-Time(JIT) production systems. The most important goal of the scheduling for the mixed-model assembly line in JIT production systems is to keep a constant rate of usage for every part used by the systems. In this study, we develop two heuristic algorithms able to keep a constant rate of usage for every part used by the systems in the single-level and the multi-level. In the single-level, the new algorithm generates sequence schedule by backward tracking and prevents the destruction of sequence schedule which is the weakest point of Miltenburg's algorithms. The new algorithm gives better results in total variations than the Miltenburg's algorithms. In the multi-level, the new algorithm extends the concept of the single-level algorithm and shows more efficient results in total variations than Miltenburg and Sinnamon's algorithms.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 춘계학술대회 논문집 전기기기 및 에너지변환시스템부문
• /
• pp.207-212
• /
• 2002

As is well-known, the maximum power point(MPP) of PV power generation system depends on array temperature and solar insolation, it is necessary to track MPP of solar array all the time. Among various MPP control algorithms, the constant voltage control method, the perturbation and observation(P&O) method and the incremental conductance method(IncCond) have drawn many attractions due to the usefulness of each system. In this paper, the effectiveness of above mentioned three different control algorithms are thoroughly investigated via simulations and proposed efficiency evaluation method on experiment. Both the steady-state and transient characteristics of each control algorithms along with measured efficiency are analyzed, respectively. Finally, a novel MPPT control algorithm combining the constant voltage control and IncCond method for low insolation condition is proposed to improve efficiency of the 3KW PV power generation system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권8호
• /
• pp.3880-3899
• /
• 2019

Distributive desynchronization algorithms based on pulse-coupled oscillator (PCO) models have been proposed for achieving collision-free wireless transmissions. These algorithms do not depend on a global clock or infrastructure overheads. Moreover, they gradually converge to fair time-division multiple access (TDMA) scheduling by broadcasting a periodic pulse signal (called a 'firing') and adjusting the next firing time based on firings from other nodes. The time required to achieve constant spacing between phase neighbors is estimated in a closed form or via stochastic modeling. However, because these algorithms cannot guarantee the completion of desynchronization in a short and bounded timeframe, they are not practical. Motivated by the limitations of these methods, we propose a practical solution called PD-DESYNC that provides a short and deterministic convergence time using a flag firing to indicate the beginning of a cycle. We demonstrate that the proposed method guarantees the completion of desynchronization within three cycles, regardless of the number of nodes. Through extensive simulations and experiments, we confirm that PD-DESYNC not only outperforms other algorithms in terms of convergence time but also is a practical solution.

• Nuclear Engineering and Technology
• /
• 제54권4호
• /
• pp.1195-1205
• /
• 2022

Recent developments on spectral diffusion algorithms, i.e., algorithms which exploit the projection of the solution on the eigenfunctions of the Laplacian operator, demonstrated their effective applicability in fast transient conditions. Nevertheless, the numerical error introduced by these algorithms, together with the uncertainties associated with model parameters, may impact the reliability of the predictions on short-lived volatile fission product release from nuclear fuel. In this work, we provide an upper bound on the numerical error introduced by the presented spectral diffusion algorithm, in both constant and time-varying conditions, depending on the number of modes and on the time discretization. The definition of this upper bound allows introducing a methodology to a priori bound the numerical error on short-lived volatile fission product retention.

• 대한전기학회논문지:전기기기및에너지변환시스템부문B
• /
• 제51권3호
• /
• pp.142-149
• /
• 2002

As is well-known, the maximum power point (MPP) of PV power generation system depends on array temperature and solar insolation, it is necessary to track MPP of solar array all the time. Among various MPP control algorithms, the constant voltage control method, the perturbation and observation (P&O) method and the incremental conductance method (IncCond) have drawn many attractions due to the usefulness of each system. In this parer, the effectiveness of above mentioned three different control algorithms are thoroughly investigated via simulations and preposed efficiency evaluation method on experiment. Both the steady-state and transient characteristics of each control algorithms along with measured efficiency are analyzed, respectively. Finally, a novel MPPT control algorithm combining the constant voltage control and IncCond method for low insolation condition is proposed to improve efficiency of the 3KW PV power generation system.

• 한국정보과학회논문지:시스템및이론
• /
• 제26권11호
• /
• pp.1344-1352
• /
• 1999

본 논문에서는 두 단순 다각형의 교차 영역을 구하는 문제를 재구성메쉬(RMESH) 상에서 상수 시간에 해결하는 두 개의 알고리즘을 제시한다. 먼저, 두 다각형이 모두 볼록 다각형일 때, N$\times$N RMESH에서 상수 시간에 교차 영역을 구하는 알고리즘을 제시한다, 여기서 N은 두 다각형의 정점의 개수의 합이다. 그리고, 두 일반적인 단순 다각형의 교차 영역을 구하는 문제에 대해서 (N+T)$\times$(N+T)2 RMESH에서 수행되는 상수 시간 알고리즘을 제시한다, 여기서 T는 최악의 경우 두 다각형의 경계선 상의 교차점의 개수로서 두 다각형의 정점의 개수가 각각 n과 m일 때 n.m에 해당한다. 두 다각형 중 하나가 볼록 다각형인 경우는 T = 2.max{n, m}이다. 이 알고리즘은 두 다각형의 모든 교차 영역 조각들을 구한 후 RMESH의 0번째 열에 차례로 배치해 준다. Abstract In this paper, we consider two constant time algorithms for polygon intersection problems on a reconfigurable mesh(in short, RMESH). First, we present a constant time algorithm for computing the intersection of two convex polygons on an N$\times$N RMESH, where N is the total number of vertices in both polygons. Second, we present a constant time algorithm for computing the intersection of two simple polygons on an (N+T)$\times$(N+T)2 RMESH, where T is the worstcase number of intersection points between the boundaries of them. T = n m, where n and m are the numbers of vertices of two polygons respectively. If either of them is convex, then T = 2 max{n,m}. The algorithm computes the intersection of them, and then arranges each intersection component onto the 0-th column of the mesh.

• 대한기계학회논문집A
• /
• 제25권4호
• /
• pp.574-581
• /
• 2001

Transient linear elastodynamic problems are numerically analyzed in a time-domain by the Finite Element Method, for which the variational formulation based upon the equations of motion in convolution integral is newly derived. This formulation is implicit and does not include the time derivative terms so that the computation procedure is simple and less assumptions are required comparing to the conventional time-domain dynamic numerical algorithms, being able to get the improved numerical accuracy and stability. That formulation is expanded using the semi-discrete approximation to obtain the finite element equations. In the temporal approximation, the time axis is divided equally and constant and linear time variations are assumed in those intervals. It is found that unconditionally stable numerical results are obtained in case of the constant time variation. Some numerical examples are given to show the versatility of the presented formulation.

• 정보처리학회논문지A
• /
• 제8A권2호
• /
• pp.179-188
• /
• 2001

We analyze the property of candidate node set in the network graph, and propose an algorithm to decrease shortest path-finding computation time by using multiple dynamic-range queue(MDRQ) structure. This MDRQ structure is newly created for effective management of the candidate node set. The MDRQ algorithm is the shortest path-finding algorithm that varies range and size of queue to be used in managing candidate node set, in considering the properties that distribution of candidate node set is constant and size of candidate node set rapidly change. This algorithm belongs to label-correcting algorithm class. Nevertheless, because re-entering of candidate node can be decreased, the shortest path-finding computation time is noticeably decreased. Through the experiment, the MDRQ algorithm is same or superior to the other label-correcting algorithms in the graph which re-entering of candidate node didn’t frequently happened. Moreover the MDRQ algorithm is superior to the other label-correcting algorithms and is about 20 percent superior to the other label-setting algorithms in the graph which re-entering of candidate node frequently happened.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.22-25
• /
• 2005

In the paper, algorithms for disturbance observers are newly presented in the time-domain. Attention is paid to observing a ramp disturbance by introducing an integral term to the output equation of a constant disturbance observer. In order to reduce the sensitivity to the measurement noise, the disturbance observer is combined with the state observer. It will be shown that the estimation dynamics can be arbitrarily chosen by assigning the eigenvalues of a characteristic equation. Also, we provide the analysis of observer behaviors subject to non-ramp-style disturbances. Finally, we propose the generalized disturbance observer that accurately estimates disturbances of higher order in time series expansion.