• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.193-196
• /
• 2002

Vehicle routing problem is known to be a NP-hard problem, and is traditionally solved by some heuristic approaches. This paper investigates the application of the computer method COMSOAL to the optimal vehicle routing selection problem. The COMSOAL (Computer Method of Sequencing Operations for Assembly Lines) is a computer heuristic originally developed to solve an assembly line balancing problem a few decades ago. The solution methodology of repeatedly running COMSOAL will result in many feasible solutions from which the best is chosen. This solution approach now becomes viable thanks to the significantly increased speed of recent computer technology. This paper discusses the adaptation of the COMSOAL approach to the known set of simple vehicle routing example problem. The results show that the COMSOAL can be a good possible approach to solve the vehicle routing problem.

• 한국정보처리학회논문지
• /
• 제6권1호
• /
• pp.42-48
• /
• 1999

최단경로를 포함한 어떤 문제를 해결하는데 필요한 정보가 네트워상의 프로세서에 분산되어 있는 상황에서 그들 정보를 교환하면서, 그 문제를 해결하는 알고리즘을 분산알고리즘(Distributed Algorithm)이라고 한다. 본 논문에서는 비동기식 네트워크에서 최단경로문제를 해결하는 분산 알고리즘을 제안한다. 일반적으로 분산 알고리즘은 메시지 복잡도와 이상시간 복잡도로 평가되는데, 본 논문에서 제안하는 분산 알고리즘이 메시지 복잡도와 이상 시간 복잡도는 각각 O(n53)와 O(nln)이다. 여기서, n은 네트상에 있는 프로세서 수를 나타낸다.

• 경영과학
• /
• 제26권1호
• /
• pp.197-208
• /
• 2009

In this paper, we study stochastic maximal covering location problem considering floating population. Traditional maximal covering location problem assumed that number of populations at demand point is already known and fixed. In this manner, someone who try to solve real world maximal covering location problem must consider administrative population as a population at demand point. But, after observing floating population, appliance of population in steady-state is more reasonable. In this paper, we suggest revised numerical model of maximal covering location problem. We suggest heuristic methodology to solve large scale problem by using genetic algorithm.

• 경영과학
• /
• 제26권1호
• /
• pp.65-76
• /
• 2009

The undirected Steiner tree problem in graphs is known to be NP-hard. The objective of this problem is to find a shortest tree containing a subset of nodes, called terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step. graph reduction rules eliminate useless nodes and edges which do not contribute to make an optimal solution. In the second step, a max-min ant colony optimization combined with Prim's algorithm is developed to solve the reduced problem. The proposed algorithm is tested in the sets of standard test problems. The results show that the algorithm efficiently presents very correct solutions to the benchmark problems.

• 제어로봇시스템학회논문지
• /
• 제11권2호
• /
• pp.144-151
• /
• 2005

We propose an optimization method to reduce the assembly time of chip mounters. Feeder arrangement and assembly sequence are determined considering the multiple feeder assignment. The problem is divided into two sub-problems: feeder arrangement problem and assembly sequence problem. We present mathematical model for each sub-problem. The clustering algorithm and assignment algorithm are applied to solve the feeder arrangement problem. The assignment algorithm and connection algorithm are applied to solve the assembly sequence problem. Simulation results are then presented to verity the usefulness of the proposed method.

• Journal of Electrical Engineering and Technology
• /
• 제11권2호
• /
• pp.480-489
• /
• 2016

Hidden station problem can occur in power-line communication (PLC) networks. A simple solution to the problem has been proposed to use request-to-send (RTS)/clear-to-send (CTS) exchange, but this approach cannot solve the hidden station problem perfectly. This paper revisits the problem for PLC networks and designs a protocol to solve it. We first analyze the throughput performance degradation when the hidden station problem occurs in PLC networks. Then, we propose an interferer aware multiple access (IAMA) protocol to enhance throughput and fairness performances, which uses unique characteristics of PLC networks. Using the RTS/CTS exchange adaptively, the IAMA protocol protects receiving stations from being interfered with neighboring networks. Through extensive simulations, we show that our proposed protocol outperforms conventional random access protocols in terms of throughput and fairness.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.108.3-108
• /
• 2001

In this work, we consider a real time optimal control problem of mechanical systems with restrictions for actuators i.e. input restrictions and constraints for the movable area i.e. state constraints. First, we formulate an optimal control problem which evaluates the cost function for a finite time horizon with input restrictions and state constraints of a wheeled vehicle as an example of mechanical systems. In this problem, the differentiability of the cost function is not required and this implies that the problem cannot be solved analytically. Therefore, in this work, we use an optimization method to solve the optimal control problem and a new real time optimization method is proposed to solve the problem. In this method, we provide a parameter that indicates the ...

• ETRI Journal
• /
• 제44권2호
• /
• pp.244-259
• /
• 2022

Bicycle- or bike-sharing systems (BSSs) have received increasing attention as a secondary transportation mode due to their advantages, for example, accessibility, prevention of air pollution, and health promotion. However, in BSSs, due to bias in bike demands, the bike rebalancing problem should be solved. Various methods have been proposed to solve this problem; however, it is difficult to apply such methods to small cities because bike demand is sparse, and there are many practical issues to solve. Thus, we propose a demand prediction model using multiple classifiers, time grouping, categorization, weather analysis, and station correlation information. In addition, we analyze real-world relocation data by relocation managers and propose a relocation algorithm based on the analytical results to solve the bike rebalancing problem. The proposed system is compared experimentally with the results obtained by the real relocation managers.

• 한국산업정보학회논문지
• /
• 제7권3호
• /
• pp.54-61
• /
• 2002

원격 영상전송 장치는 안전상의 문제가 있거나 사람이 갈 수 없는 곳을 관찰하기 위해 로봇 기술과 영상전송 기술을 결합한 것이다. 최근 원격 제어를 위해 웹서버와 로봇간 유선 및 RF를 이용한 제어 장치들이 개발되고 있지만, 작동 거리 및 인터넷 라인을 설치해야 하는 제한점이 있으며, 무선 방식의 통신장비를 이용할 경우 무선 라우터의 가격이 고가라는 문제가 있다. 본 연구에서는 이러한 문제점을 해결하기 위해 CDMA 셀룰러 폰 통신망을 이용하여 영상전송 및 영상전송 장치를 원격으로 제어할 수 있는 시스템을 개발하였으며, 개발된 시스템은 기존의 무선동신(RF)을 이용한 영상 전송시의 단점인 거리 제한 문제와 인터넷을 이용한 영상전송시의 문제를 해결할 수 있었고, 현재의 통신망을 비롯한 제한된 조건하에서 최적의 영상 및 음성을 전송할 수 있었다.

• 인터넷정보학회논문지
• /
• 제3권1호
• /
• pp.1-10
• /
• 2002

원격 영상전송 장치는 안전상의 문제가 있거나 사람이 갈 수 없는 곳을 관찰하기 위해 로봇 기술과 영상전송 기술을 결합한 것이다. 최근 원격 제어를 위해 웹서버와 로봇간 유선 및 RF를 이용한 제어 장치들이 개발되고 있지만, 작동 거리 및 인터넷 라인을 설치해야 하는 제한점이 있으며, 무선 방식의 통신장비를 이용할 경우 무선 라우터의 가격이 고가라는 문제가 있다. 본 연구에서는 이러한 문제점을 해결하기 위해 셀룰러 폰 통신망을 이용하여 영상전송 및 영상전송 장치를 원격으로 제어할 수 있는 시스템을 개발하였으며, 개발된 시스템은 기존의 무선통신(RF)을 이용한 영상 전송시의 단점인 거리 제한 문제와 인터넷을 이용한 영상전송시의 문제를 해결할 수 있었고, 현재의 통신망을 비롯한 제한된 조건 하에서 최적의 영상 및 음성을 전송할 수 있었다.