• 한국경영과학회지
• /
• 제36권1호
• /
• pp.27-38
• /
• 2011

In this paper, we deal with the periodic heterogeneous fleet vehicle routing problem (PHVRP). PHVRP is a problem of designing vehicle routes in each day of given period to minimize the sum of fixed cost and variable cost over the planning horizon. Each customer can be visited once or more times over the planning horizon according to the service combinations of that customer. Due to the complexity of the problem, we suggest a heuristic algorithm in which an initial solution is obtained by assigning the customer-day and the customer-car simultaneously and then it is improved. A performance of the proposed algorithm was compared to both well-known results and new test problems.

• 대한산업공학회지
• /
• 제32권2호
• /
• pp.91-97
• /
• 2006

The vehicle routing problem with time windows (VRPTW) is an important problem in third party logistics and supply chain management. We extend the VRPTW to the VRPTW with overtime and outsourcing vehicles (VRPTWOV) which allows the overtime of drivers and the possibility of using outsourcing vehicles. This problem can be applied to third party logistics companies for managing central distributor-local distributors, local distributor-retailers (or customers), and a manufacturer. We develop a mixed integer programming model and a genetic algorithm. Computational results demonstrate the efficiency of the developed genetic algorithm. We also develop a decision support system based on this genetic algorithm.

• Journal of Communications and Networks
• /
• 제18권6호
• /
• pp.884-891
• /
• 2016

The wireless mesh network (WMN) has attracted significant interests as a broadband wireless network to provide ubiquitous wireless access for broadband services. Especially with incorporating multiple orthogonal channels and multiple directional antennas into the WMN, each node can communicate with its neighbor nodes simultaneously without interference between them. However, as we allow more freedom, we need a more sophisticated algorithm to fully utilize it and developing such an algorithm is not easy in general. In this paper, we study a joint channel assignment, link scheduling, routing, and rate control problem for the WMN with multiple orthogonal channels and multiple directional antennas. This problem is inherently hard to solve, since the problem is formulated as a mixed integer nonlinear problem (MINLP). However, despite of its inherent difficulty, we develop an algorithm to solve the problem by using the generalized Benders decomposition approach [2]. The simulation results show the proposed algorithm provides the optimal solution to maximize the network utility, which is defined as the sum of utilities of all sessions.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2009년도 공동학술대회
• /
• pp.149-150
• /
• 2009

The problem of vehicle routing problem(VRP) with pair operations of pick up and delivery are well-known in real applications in logistics networks, as in planning the routes for automatic guided vehicles(AGVs) in an automatic container terminal(ACT), warehouses or in some just-in-time services. This paper will present a formulation to modeling the problem mathematically which can be used to generate optimal routes of carried vehicles in the field to reduce the incurred cost of moving goods. This selected model could be used in (semi-)automatic short-term planning systems for vehicle fleet working in ACT, or in modern warehouses which the long list of requests is parted and sorted in preprocessing orders systems.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
• /
• pp.591-593
• /
• 1998

As evolution of the process technology, we proposed the Over-The-Cell channel routing algorithm for the advanced three-layer process. The proposed algorithm simplifies the channel routing problem, and then makes use of Simulated Annealing Technique to converge at global optimal solution. Also, we proposed a new method to remove the cyclic vertical constraints which are known to be the hardest element in the channel routing problem and a way to detect the local minimal solution and escape from it successfully.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 하계종합학술대회 논문집(1)
• /
• pp.241-244
• /
• 2004

In recent years, WDM networks have received much attention as the Internet backbone networks because of the explosive growth of the Internet IP-based traffic. The Optical Burst Switching (OBS) has been proposed as an effective optical switching technology in the WDM networks. OBS has the advantages in 1) the high usage rate of the bandwidth, and 2) no necessity of optical buffer. However OBS has the burst-contention problem in the networks. The deflection routing is proposed as one of means to solve this problem. In this paper, we propose a new routing method of using deflection routing. In addition. we propose a QoS/CoS control method using a new routing algorithm. Finally, we show the variety of the proposed methods by computer simulations.

• Journal of information and communication convergence engineering
• /
• 제6권4호
• /
• pp.466-469
• /
• 2008

The existing routing protocols in USN environment, PEGASIS is more efficient than LEACH, which is a hierarchical routing protocol, for network configuration based on power consumption. Despite its merit that it can reduce energy consumption per node, however, the PEGASIS protocol also has a weakness that it is less responsive to frequent changes that occur in the configuration of sensor network due to BS nodes that keep changing, which is a typical characteristic of the sensor network. To address this problem, this paper proposes to select sub-cluster heads and have them serve as intermediate nodes. This paper presents and analyses that this method can resolve the aforementioned problem of the PEGASIS algorithm.

• 한국통신학회논문지
• /
• 제33권12B호
• /
• pp.1075-1082
• /
• 2008

그리디 포워딩(Greedy forwarding) 기법은 주변 노드들의 정보만을 이용해 패킷을 전달하는 기법으로, 전체 라우팅 경로를 유지해야 하는 다른 애드혹 라우팅 프로토콜에 비해 경로 유지가 쉽기 때문에 토폴로지가 자주 변하는 차량간 애드혹 네트워크에 적합한 방식이라고 할 수 있다. 그리디 포워딩 기법에서는 주기적인 비콘 전송을 통해 이웃 노드들의 위치를 획득하고, 패킷을 전달할 때 수신 노드와 가장 가까운 노드를 전달 노드로 선택한다. 이러한 그리디 포워딩의 성능을 떨어뜨리는 주요 원인 중 하나는 이웃 노드가 원래의 위치에서 벗어나면서 발생하는 링크 단절 문제이다. 본 논문에서는 그리디 포워딩 기반의 라우팅 프로토콜인 Greedy Perimeter Stateless Routing (GPSR) 프로토콜을 바탕으로 링크 단절 문제를 해결하기 위한 새로운 알고리즘을 제안한다. 제안하는 알고리즘은 이웃 노드의 위치와 비콘을 수신한 시간 등을 고려해 효율적이면서도 안정적인 라우팅 경로를 찾는 것을 목표로 한다. 다양한 환경에서의 실험 결과를 통해 우리는 제안하는 알고리즘이 GPSR과 기존의 연구 결과들에 비해 더 뛰어난 성능을 보이는 것을 확인하였다.

• 산업경영시스템학회지
• /
• 제23권61호
• /
• pp.33-39
• /
• 2000

In this paper, we present an algorithm for the multicast routing problem when there exit the cell replication limits of ATM switching nodes. This problem can be formulated as a Degree Constrained Minimum Steiner Tree Problem(DCSP). The proposed algorithm is a modification of the shortest path heuristic originally devised for minimum Steiner tree problem. From the experimental results, it can be seen that our algorithm is efficient to obtain a near optimal solution with comparatively low computational time.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 춘계종합학술대회
• /
• pp.401-405
• /
• 2007

센서네트워크에서 효율적인 에너지사용에 관한 클러스터 기반 라우팅 프로토콜이 다양하게 연구되고 있다. 하지만 기존의 클러스터 기반의 라우팅 프로토콜은 클러스터 재구성에 있어 센서 노드들의 불균형적인 에너지 소비문제와 클러스터 헤더를 선정함에 있어 헤더 노드와 싱크 노드가 멀리 떨어져 있을 때 연결이 제대로 이루어지지 않는다는 문제점이 있다. 본 논문에서는 클러스터의 재분할과 헤더 노드의 멀티 홉 전송방식을 제시한다. 클러스터 재분할은 기존의 클러스터를 소규모의 클러스터로 재분할하는 방식이고, 멀티 홉 전송방식은 헤더 노드들 사이의 중계전송에 관한 방식이다. 시뮬레이션을 통하여 제시한 라우팅 기법이 균등한 에너지 소비와 에너지 효율성에 있어서 기존의 라우팅 기법보다 우수함을 보인다.