• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.8-20
• /
• 2019

The vehicle routing problem is one of the vibrant research problems for half a century. Many studies have extensively studied the vehicle routing problem in order to deal with practical decision-making issues in logistics. However, developments of new logistics strategies have inevitably required investigations on solution methods for solving the problem because of computational complexity and inherent constraints in the problem. For this reason, this paper suggests a simulated annealing (SA) algorithm for a variant of vehicle routing problem introduced by a previous study. The vehicle routing problem is a multi-depot and multi-trip vehicle routing problem with multiple heterogeneous vehicles restricted by the maximum permitted weight and the number of compartments. The SA algorithm generates an initial solution through a greedy-type algorithm and improves it using an enhanced SA procedure with three local search methods. A series of computational experiments are performed to evaluate the performance of the heuristic and several managerial findings are further discussed through scenario analyses. Experiment results show that the proposed SA algorithm can obtain good solutions within a reasonable computation time and scenario analyses show that a transportation system visiting non-dedicated factories shows better performance in truck management in terms of the numbers of vehicles used and trips for serving customer orders than another system visiting only dedicated factories.

• Journal of the Korean Geotechnical Society
• /
• v.16 no.3
• /
• pp.47-55
• /
• 2000

본 연구에서는, 유전자 알고리즘을 이용한 piled raft 기초의 최적설계 기법을 제시하였다. 최적설계에 사용한 목적함수는 구조물의 사용한계에 해당하는 부등침하량과 piled raft 기초의 시고비용 차원에서의 말뚝과 raft의 총 중량으로 하였다. 유전자 알고리즘은 다읜의 적자생존의 법칙을 따르는 자연진화 법칙을 바탕으로 한 최적화 기법이다. 본 연구에서는 piled raft 기초의 해석방법으로 Clancy(1993)가 제시한 "hybrid" 해석방법을 사용하였으며, 유전자 알고리즘기법은 Goldberg(1989)가 제시한 단순 유전자 알고리즘(SGA)을 적용하였다. 또한 유전자 알고리즘을 이용한 최적설계기법의 유효성을 평가하기 위해 설계예제 및 매개변수변화연구를 통해 piled raft 기초시스템의 중요 설계인자들에 대한 분석을 수행하였다. 매개변수변화연구로부터 말뚝의 길이와 raft의 두께가 증가할수록 piled raft 기초시스템의 전체 중량은 일정한 값에 점차적으로 수렴하였으며, 지반의 강정, raft의 두께 말뚝의 길이 및 강성이 증가할수록 말뚝의 최적위치는 raft의 중앙에 집중되는 경향으로 나타났다.경향으로 나타났다.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.6
• /
• pp.541-548
• /
• 2020

To overcome the disadvantage of hull mounted sonar, many countries operate dipping sonar system for helicopter. Although limited in performance, this system has the advantage of ensuring the survivability of the surface ship and improving the detection performance by adjusting the depth according to the ocean environment. In this paper, a method to calculate the optimal depth of the dipping sonar for helicopters is proposed by applying an optimization algorithm. In addition, in order to evaluate the performance of the sonar, the Sonar Performance Function (SPF) is defined to consider the ocean environment, the depth of the target and the depth of the dipping sonar. In order to reduce the calculation time, the optimal depth is calculated by applying Simulated Annealing (SA), one of the optimization algorithms. For the verification of accuracy, the optimal depth calculated by applying the optimization technique is compared with the calculation of the SPF. This paper also provides the results of calculation of optimal depth for ocean environment in the East sea.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.64-70
• /
• 2003

Current growth of VLSI design depends critically on the research and development (If automatic layout tool. Automatic layout is composed of placement assigning a specific shape to a block and arranging the block on the layout surface and routing finding the interconnection of all the nets. Algorithms Performing placement and routing impact on Performance and area of VLSI design. Channel routing is a problem assigning each net to a track after global routing and minimizing the track that assigned each net. In this paper we propose a genetic algorithm searching solution space for the netlist partitioning problem for 4-layer channel routing. We compare the performance of proposed genetic algorithm(GA) for channel routing with that of simulated annealing(SA) algorithm by analyzing the results which are the solution of given problems. Consequently experimental results show that out proposed algorithm reduce area over the SA algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.3
• /
• pp.355-362
• /
• 2009

In this paper, we present a framework for managing group behaviors in multi-agent swarm systems. The framework explores the benefits by dynamic associations with the proposed artificial potential functions to realize complex swarming behaviors. A key development is the introduction of a set of flocking by dynamic association (DA) algorithms that effectively deal with a host of swarming issues such as cooperation for fast migration to a target, flexible and agile formation, and inter-agent collision avoidance. In particular, the DA algorithms employ a so-called systematic singular association (SSA) rule for fast migration to a target and compact formation through inter-agent interaction. The resulting algorithms enjoy two important interrelated benefits. First, the SSA rule greatly reduces time-consuming for migration and satisfies low possibility that agents may be lost. Secondly, the SSA is advantageous for practical implementations, since it considers for agents even the case that a target is blocked by obstacles. Extensive simulation presents to illustrate the viability and effectiveness of the proposed framework.

• Journal of the Korea Society for Simulation
• /
• v.24 no.4
• /
• pp.77-88
• /
• 2015

In this paper, we consider a two-agent single-machine scheduling problem with exponential job-dependent position-based learning effects. The objective is to minimize the total weighted completion time of one agent with the restriction that the makespan of the other agent cannot exceed an upper bound. First, we propose a branch-and-bound algorithm by developing some dominance /feasibility properties and a lower bound to find an optimal solution. Second, we design an efficient simulated annealing (SA) algorithm to search a near optimal solution by considering six different SAs to generate initial solutions. We show the performance superiority of the suggested SA using a numerical experiment. Specifically, we verify that there is no significant difference in the performance of %errors between different considered SAs using the paired t-test. Furthermore, we testify that random generation method is better than the others for agent A, whereas the initial solution method for agent B did not affect the performance of %errors.

• Journal of the Korea Society for Simulation
• /
• v.20 no.1
• /
• pp.19-28
• /
• 2011

The safety applications based on the IEEE 802.11p, periodically transmit the safety-related information to all surrounding vehicles with high reliability and a strict timeline. However, due to the high vehicle mobility, dynamic network topology and limited network resource, the fixed beacon scheduling scheme excess delay and packet loss due to the channel contention and network congestion. With this motivation, we propose a novel beacon scheduling algorithm referred to as spatial-aware(SA) beacon scheduling based on the spatial context information, dynamically rescheduling the beaconing rate like a TDMA channel access scheme. The proposed SA beacon scheduling algorithm was evaluated using different highway traffic scenarios with both a realistic channel model and 802.11p model in our simulation. The simulation results showed that the performance of our proposed algorithm was better than the fixed scheduling in terms of throughput, channel access delay, and channel load. Also, our proposed algorithm is satisfy the requirements of vehicular safety application.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.689-692
• /
• 2016

출입이 없는 폐쇄된 환경에서 객체의 자동 감시 시스템은 객체의 움직임을 추적하여 객체의 지속적인 관찰과 함께 행동 패턴을 효율적으로 분석하기 위해 사용되고 있다. 특히, 국내 돈사의 경우 돈사 내 여러 마리의 돼지들을 개별적으로 관리하기 위해 이러한 감시 시스템은 필수적이다. 그러나 여러마리의 돼지들이 근접하여 개별적으로 추적하기 위해서는 비디오 스트림에서의 매 프레임마다 정확한 분리가 되어야 한다. 본 논문에서는 근접한 돼지의 시퀀스에 분리 알고리즘을 이용하여 매 프레임마다 정확도를 측정한 후 통계적 검정을 통하여 근접한 객체에 대한 최적의 분리 알고리즘을 결정하는 방법을 제안한다. 즉, 시퀀스의 연속된 프레임에서 분리 정확도를 계산하고 통계적 가설 검정을 수행하여 분리 정확도가 일정 수치를 넘지 못하면 다른 분리 알고리즘을 수행하도록 결정한다. 실험 결과, 제안 방법을 이용하여 제안된 가설에 의해 매 프레임마다 최적의 분리 알고리즘을 수행하도록 결정하였다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.12
• /
• pp.205-209
• /
• 2013

A conventional acoustic echo suppressor (AES) considering only room impulse response between a loudspeaker and a microphone eliminates acoustic echo from the microphone input. However, in a nonlinear acoustic echo environment, the conventional AES degraded because of a nonlinearity of the loudspeaker. In this paper, we adopt AES based on the frequency-domain second-order Volterra filter using Least Square method. For comparing performances, we conduct objective tests including Echo Return Loss Enhancement (ERLE) and Speech Attenuation (SA). The proposed algorithm shows better performance than the conventional in both linear and nonlinear acoustic echo environments.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.3
• /
• pp.322-333
• /
• 2012

AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability. For this reason, Radar Resource Management(RRM) becomes new challenging issue. RRM is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed a rule-based scheduling algorithm and Simulated Annealing(SA) based scheduling algorithm, which are alternatively selected and applied to beam scheduler according radar load status in real-time. The performance of the proposed algorithm was evaluated on the multi-function radar scenario. As a result, we showed that our proposed algorithm can process a lot of beams at the right time with real time capability, compared with applying only rule-based scheduling algorithm. Additionally, we showed that the proposed algorithm can save scheduling time remarkably, compared with applying only SA-based scheduling algorithm.