• 산업경영시스템학회지
• /
• 제46권4호
• /
• pp.238-245
• /
• 2023

As technologies have been more quickly developed in this 4th Industry Revolution era, their application to defense industry has been also growing. With these much advanced technologies, we attempt to use Manned-Unmanned Teaming systems in various military operations. In this study, we consider the Location-Routing Problem for reconnaissance surveillance missions of the maritime manned-unmanned surface vehicles. As a solution technique, the two-phase method is presented. In the first location phase, the p-median problem is solved to determine which nodes are used as the seeds for the manned vehicles using Lagrangian relaxation with the subgradient method. In the second routing phase, using the results obtained from the location phase, the Vehicle Routing Problems are solved to determine the search routes of the unmanned vehicles by applying the Location Based Heuristic. For three network data sets, computational experiments are conducted to show the performance of the proposed two-phase method.

• Journal of Information Processing Systems
• /
• 제5권4호
• /
• pp.237-242
• /
• 2009

The classical vehicle routing problem (VRP) can be extended by including customers who want to send goods to the depot. This type of VRP is called the vehicle routing problem with pickups and deliveries (VRPPD). This study proposes a novel way to solve VRPPD by introducing a two-phase heuristic routing algorithm which consists of a clustering phase and uses the geometrical center of a cluster and route establishment phase by applying a two-way search of each route after applying the TSP algorithm on each route. Experimental results show that the suggested algorithm can generate better initial solutions for more computer-intensive meta-heuristics than other existing methods such as the giant-tour-based partitioning method or the insertion-based method.

• Journal of Communications and Networks
• /
• 제12권3호
• /
• pp.246-252
• /
• 2010

A binary linear integer program is formulated for the problem of expanding the capacity of a fiber optic network and routing the traffic to deliver new interactive multimedia services. A two-phase Lagrangian dual search procedure and a Lagrangian heuristic are developed. Computational results show superior performance of the two-phase subgradient optimization compared with the conventional one-phase approach.

• 산업공학
• /
• 제17권spc호
• /
• pp.103-110
• /
• 2004

This paper presents a two-phase method for the vehicle routing problems with time windows(VRPTW). In a supply chain management(SCM) environment, timely distribution is very important problem faced by most industries. The VRPTW is associated with SCM for each customer to be constrained the time of service. In the VRPTW, the objective is to design the least total travel time routes for a fleet of identical capacitated vehicles to service geographically scattered customers with pre-specified service time windows. The proposed approach is based on ant colony optimization(ACO) and improvement heuristic. In the first phase, an insertion based ACO is introduced for the route construction and its solutions is improved by an iterative random local search in the second phase. Experimental results show that the proposed two-phase method obtains very good solutions with respect to total travel time minimization.

• 한국산학기술학회논문지
• /
• 제14권4호
• /
• pp.1969-1975
• /
• 2013

ICN(Information-Centric Network)은 인터넷 상에 존재하는 방대한 정보를 효율적으로 이용하기 위하여 기존의 인터넷 통신 패러다임을 정보 기반의 통신 방법으로 전환하기 위한 차세대 인터넷 통신 기술이다. 따라서 ICN은 호스트 주소를 중심으로 통신 절차에 집중하던 기존 인터넷 통신 기술과는 달리 인터넷 상에 존재하는 모든 것을 정보라는 개념으로 정의함으로써 각 정보를 이용하기 위한 통신 목적에 집중한다. 이를 위하여 ICN에서는 각 정보에 이름을 붙여 사용하는 이름 기반 라우팅(NbR, Name-based Routing) 방법을 사용하며 ICN에 참여하는 모든 라우터는 각 라우터 마다 정보를 공유할 수 있도록 물리적인 스토리지를 가지는 특징이 있다. ICN에서의 NbR 방법은 각 라우터에서 보유하고 있는 스토리지에 도달하는 방법에 따라 one-phase routing과 two-phase routing으로 나뉜다. 그러나 현재 제시되고 있는 ICN에서의 NbR 방법은 ICN이 가지고 있는 고유한 특징을 반영하지 못하고 있기 때문에 많은 문제점을 발생시키고 있다. 따라서 본 논문에서는 ICN을 위한 효율적인 NbR 방법을 제시하기 위하여 정보에 대한 캐싱, 접근 시간, 분산, 이동성, 확장성, 배포 측면에서 NbR 이슈들을 점검하고, ICN을 위해 제안된 기존 방법들에 대한 비교 분석을 수행하였다. 또한 분석된 내용을 기반으로 ICN에서의 효율적인 NbR 기법에 대한 연구 방향을 제시하였다.

• 한국통신학회논문지
• /
• 제28권12B호
• /
• pp.1066-1080
• /
• 2003

본 논문에서는 대규모 고속 통신망에서 분산 멀티미디어 응용을 지원하기 위한 확장가능한 2단계의 QoS 라우팅 방식을 제안한다. QoS 라우팅 문제는 다중척도 최단거리 문제로 변형될 수 있으며 이는 NP-complete로 알려져 있다. 계층적 통신망을 위하여 제안된 라우팅 방식은 두 단계로 이루어져 있다. 첫번째 단계는 특정 응용의 요구와 관계없이 모든 수준의 도메인에서 들어오는 경계노드와 나가는 경계노드 쌍간에 도메인을 경유하는 횡단트래픽을 위한 경로의 QoS distance 값을 정기적으로 선계산한다. 두번째 단계는 응용에서의 요구가 왔을때 실행되며, 계층적 완전경로 계산에 필요한 그래프 구축을 위한 분산알고리즘이 실행된다. 이와같이 자원가용성 정보를 공시하지 않고 조회방식을 사용함으로써 정보의 flood로 생성되는 많은 통신 오버헤드를 줄일 수 있다. 제안된 알고리즘에서는 또한 기존의 방식에서 완전히 무시되거나 혹은 부분적으로 고려되었던 통신망의 위상도 고려하여 계층적 완전경로의 불완전성을 보완하였다. 마지막으로 대략적으로 계산된 계층적 완전경로부터 QoS 라우팅 문제를 체계적으로 분할하여 수준1 도메인의 경로로 확장하는 분산 알고리즘을 제안하였다.

• 한국해양공학회지
• /
• 제29권3호
• /
• pp.263-269
• /
• 2015

This paper proposes a new approach for solving the weather routing problem by dividing it into two phases with the goal of fuel saving. The problem is to decide two optimal variables: the heading angle and speed of the ship under several constraints. In the first phase, the optimal route is obtained using the Real-Time Adaptive A* algorithm with a fixed ship speed. In other words, only the heading angle is decided. The second phase is the speed scheduling phase. In this phase, the original problem, which is a nonlinear optimization problem, is converted into a geometric programming problem. By solving this geometric programming problem, which is a convex optimization problem, we can obtain an optimal speed scheduling solution very efficiently. A simple case of numerical simulation is conducted in order to validate the proposed method, and the results show that the proposed method can save fuel compared to a constant engine output voyage and constant speed voyage.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.943-946
• /
• 1999

In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm onstructs a bounded-skew tree(BST) in two steps:(ⅰ) a bottom-up phase to construct a binary tree of shortest-distance feasible regions which represent the loci of possible placements of clock entry points, and (ⅱ) a top-down phase to determine the exact locations of clock entry points. Experimental results show that our clock routing algorithm, named BST/DME, can produce a set of solutions with skew and wirelength trade-off.

• 경영과학
• /
• 제24권2호
• /
• pp.43-56
• /
• 2007

VRP(Vehicle Routing Problem) is studied in this paper, where two different kinds of missions are to be completed. The objective is to minimize the total vehicle operating distance. A mixed integer programming formulation and a heuristic algorithm for a practical use are suggested. A heuristic algorithm consists of three phases such as clustering, constructing routes, and adjustment. In the first phase, customers are clustered so that the supply nodes are grouped with demand nodes to be served by the same vehicle. Vehicle routes are generated within the cluster in the second phase. Clusters and routes are adjusted in the third phase using the UF (unfitness) rule designed to determine the customers and the routes to be moved properly. It is shown that the suggested heuristic algorithm yields good performances within a relatively short computational time through computational experiment.

• 전자공학회논문지A
• /
• 제29A권10호
• /
• pp.49-56
• /
• 1992

A new global routing algorithm which dynamically adjusts its cost parameters depending on the given routing poroblem to find a near optimum solution has been developed. The proposed algorithm efficiently performs global routing on general area in which all the pin positions are given. This algorithm is composed of two phases`In the first phase, it routes each net by searching a minimum cost path while ignoring the channel capacity. In the second iterative phase, it rips up nets which pass the channel at which the horizontal or vertical routing density exceeds the capacity and then it reroutes them using a modified set of cost parameters. Applying the above phases, paths for nets are found such that routing density doesn't exceed the capacity in each channel and that nets are routed with minimum cost. Experimental results for several benchmark examples including difficult-4, difficult-8, difficult-16, Primary1 and Primary2 show that our method generates better results than other published ones.