• 한국ITS학회 논문지
• /
• 제23권2호
• /
• pp.1-14
• /
• 2024

지금까지의 최적경로탐색 알고리즘은 노드표지와 링크표지를 적용하는 방안이 소개되었다. 노드표지는 2개의 노드를 최적경로 탐색과정에서 동시에 고려한다. 링크표지는 2개의 링크를 탐색과정에서 동시에 고려한다. 본 연구는 2개의 회전을 탐색과정에서 동시에 고려하는 회전표지기반 최적경로탐색기법을 제안한다. 회전표지기반 최적경로탐색은 2개의 회전을 탐색과정에서 고려하기 때문에 Bellman(1957)의 최적원리에 근거한 동적프로그래밍의 최적해가 보장된다. 한편 회전표지기반 최적경로탐색은 링크표지의 극한 접근 개념을 동일하게 적용하기 때문에 링크표지를 적용하는 장점을 수용할 수 있다. 따라서 네트워크의 확장없이 노드는 복수의 방문이 허용되면서 링크는 방문이 허용되지 않는 합리적 순환통행을 반영하는 것이 가능하다. 특히 2개의 연속회전에서 나타나는 추가적인 비용구조를 반영하는 특성이 포함되어 통행비용함수의 구조를 보다 유연하게 표현하는 것이 가능하다. 교통카드 단말기로 구성된 수도권 도시철도 네트워크를 대상으로 시행된 사례연구는 연속된 보행환승이 나타나는 통행에 대한 심리적 저항감을 나타내는 파라메타를 Turn Label 최적경로탐색에 도입하여 연구의 현실적 확장성을 검토하였다. 연속회전에 대한 심리적 저항값이 커지면서 통행시간 및 거리가 늘어나도 연속된 환승을 우회하는 방안으로 시뮬레이션 결과가 도출되어 Turn Label의 비용구조를 반영하는 것이 확인되었다. 향후 도로교통망 및 대중교통망의 통행비용함수에 대해 다양성을 확보하기 위한 추가적인 연구의 진행이 필요하다.

• 산업공학
• /
• 제22권1호
• /
• pp.63-72
• /
• 2009

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

• 산업경영시스템학회지
• /
• 제28권2호
• /
• pp.8-17
• /
• 2005

This paper dealt with a kind of heterogeneous vehicle routing problem with known demand and time deadline of customers. The customers are supposed to have one of tight deadline and loose deadline. The demand of customers with tight deadline must be fulfilled in the deadline. However, the late delivery is allowed to customers with loose deadline. That is, the paper suggests a model to minimize total acquisition cost, total travel distance and total violation time for a fleet size and mix vehicle routing problem with time deadline, and proposes a heuristic algorithm for the model. The proposed algorithm consists of two phases, i.e. generation of an initial solution and improvement of the current solution. An initial solution is generated based on a modified insertion heuristic and iterative Improvement procedure is accomplished using neighborhood generation methods such as swap and reallocation. The proposed algorithm is evaluated using a well known numerical example.

• 한국철도학회논문집
• /
• 제9권2호
• /
• pp.187-192
• /
• 2006

The regularity of railway track alignment is a crucial component fur maintaining travel safety and the smoothness of passenger ride. The conventional spectral analysis has been considered to estimate the severity of the track irregularity from measured data. The time domain data used to be changed into the frequency domain by Fourier transform. Because the measuring points can be regarded as the time points, the spatial-frequency can be introduced instead of the time-frequency. Although FFT(Fast Fourier Transform) and/or PSD(Power Spectral Density) function could provide fairly localized information within frequency domain, but chronical configurations of data could be missed. In this study, we attempt to apply the Morlet wavelet transform for the purpose of a frequency-time-domain analysis rather than a frequency-domain analysis. The applicability of wavelet transform is examined for the estimation of the track irregularity with real measured track data on the section of Kyoung-bu line by EM-120 measuring vehicle. It is shown that the wavelet transform can be an effective tool to manage the track irregularity.

• 한국정밀공학회지
• /
• 제16권9호
• /
• pp.34-40
• /
• 1999

In order to establish the design technique of the robust current controller in d.c series wound motor driver system, this paper proposes a method of the compensated Bang-Bang current control using d.c series wound motor driver system under the improperly variable load to get minimum time for the torque control. The compensated Bang-Bang current controller structure is simpler than that of PID plus Bang-Bang controller. This paper shows that a general 16 bits microprocessor is efficiently used to implement such an algorithm. The calculation time of software is extremely small when compared with that of conventional PID plus Bang-Bang controller. Both nonlinear operating characteristics of digital switching elements and describing function methods are used for the analysis and synthesis. Real-time implementation of the compensated Bang-Bang current controller is achieved. The concept of design strategy of the control and the PWM waveform generation algorithms are presented in this paper.

• 한국ITS학회 논문지
• /
• 제19권1호
• /
• pp.121-131
• /
• 2020

현재의 교통정보는 루프검지기나 영상검지기를 통해 수집된다. 이러한 방법은 날씨와 시간에 영향을 많이 받기 때문에 이를 대체할 교통정보 생성 시스템이 필요하다. 이러한 문제점을 해결할 수 있는 기술로 무선 네트워크를 이용한 교통정보생성 시스템이 연구 단계에 있다. 차량 내의 스마트폰을 이용하여 교통정보를 생성하는 시스템에 대해 제안하고 필드 테스트를 통해 얻어진 수집율과 통행시간 오차율을 통해 제안방법의 성능을 검증하였다. 또한 회전방향별 교차로 통행정보를 생성하는 알고리즘에 대해 제안하고 이러한 유효정보의 양을 증가 시키는 방안에 대해 제시하고 결과를 확인한다.

• Industrial Engineering and Management Systems
• /
• 제12권3호
• /
• pp.198-206
• /
• 2013

The team orienteering problem (TOP) or the multiple tour maximum collection problem can be considered as a generic model that can be applied to a number of challenging applications in logistics, tourism, and other fields. This problem is generally defined as the problem of determining P paths, in which the traveling time of each path is limited by $T_{max}$ that maximizes the total collected score. In the TOP, a set of N vertices i is given, each with a score $S_i$. The starting point (vertex 1) and the end point (vertex N) of all paths are fixed. The time $t_{ij}$ needed to travel from vertex i to j is known for all vertices. Some exact and heuristics approaches had been proposed in the past for solving the TOP. This paper proposes a new solution methodology for solving the TOP using the particle swarm optimization, especially by proposing a solution representation and its decoding method. The performance of the proposed algorithm is then evaluated using several benchmark datasets for the TOP. The computational results show that the proposed algorithm using specific settings is capable of finding good solution for the corresponding TOP instance.

• Ocean and Polar Research
• /
• 제34권1호
• /
• pp.85-91
• /
• 2012

Physical properties such as sound speed contrast (h) and density contrast (g) of the interested target are key parameters to understand acoustic characteristics by using theoretical scattering models. The density and sound speed of moon jellyfish (common jellyfish, Aurelia aurita s.l.) were measured. Sound speed contrast (h) was measured from travel time difference (time-of-flight method) of an acoustic signal in a water tank for APOP studies (Acoustic Properties Of zooplankton). Density contrast (g) was measured by the displacement volume and wet weight (dual-density method). The sound speed remained almost constant as the moon jellyfish increased in bell length. The mean values${\pm}$standard deviation of h and g were $1.0005{\pm}0.0012$ and $0.9808{\pm}0.0195$), respectively. These results will provide important input for use in theoretical scattering models for estimating the acoustic target strength of jellyfish.

• 한국지구물리탐사학회:학술대회논문집
• /
• 한국지구물리탐사학회 2007년도 공동학술대회 논문집
• /
• pp.203-208
• /
• 2007

Due to the long tectonic history and the very complex geologic formations in Korea, the anisotropic characteristics of subsurface material may often change very greatly and locally. The algorithms for the travel time computation commonly used, however, may not give sufficiently precise results particularly for the complex and strong anisotropic model, since they are based on the two-dimensional (2D) earth and/or weak anisotropy assumptions. This study is intended to develope a three-dimensional (3D) modeling algorithm to precisely calculate the first arrival time in the complex anisotropic media. We assume 3D TTI (tilted transversely isotropy) medium having the arbitrary symmetry axis. The algorithm includes the 2D non-linear interpolation scheme to calculate the traveltimes inside the grid and the 3D traveltime mapping to fill the 3D model with first arrival times. The weak anisotropy assumption, moreover, can be overcome through devising a numerical approach of the steepest descent method in the calculation of minimum traveltime, instead of using approximate solution.

• 물과 미래
• /
• 제29권4호
• /
• pp.187-198
• /
• 1996

난류전단 흐름에서의 비정상 수평 선오염원의 확산에 관한 수치모형을 개발하였다. 계산기법으로는 비정상 이송확산 방정식을 종방향 이송 및 연직방향 확산으로 분리하고, 이들 방정식을 방시간 간격에 대하여 번갈아 계산하는 단계분리 유한차분기법을 사용하였다. 종방향 이송방정식에 대해서는 Holly-Preissmann 기법을, 연직방향 확산방정식에 대해서는 Crank-Nicholson 기법을 각각 적용하였다. 개발된 모형을 난류전단 흐름에서의 정상 수평 선오염원의 확산 문제에 적용하여 계산결과를 반해석해와 비교함으로써 모형을 검증하였다. 또한 난류전단 흐름내로 순간적으로 방류된 면오염원의 확산문제에 계산모형을 적용하였다. 마찰계수에 대한 민감도 분석 결과, 동일한 무차원 시각에서의 혼합 정도는 마찰계수에 관계없이 거의 일정한 것으로 나타났다. 또한 동일한 정도의 혼합상태에 도달하는 데 소요되는 유하거리는 마찰계수의 제곱근에 반비례함을 알 수 있었다.