• KEPCO Journal on Electric Power and Energy
• /
• 제6권1호
• /
• pp.59-64
• /
• 2020

Scheduling of electric vehicles and optimizing for charging waiting time have been critical. Meanwhile, it is challengeable to exploit the fluctuating data from electric vehicles in real-time. We introduce an optimal routing algorithm and a simulator with electric vehicles obeying the Poisson distribution of the observed information about time, space and energy-demand. Electric vehicle routing is updated in every cycle even it is already set. Also, we suggest an electric vehicle routing algorithm for minimizing total trip time, considering a threshold of the waiting time. Total trip time and charging waiting time are decreased 34.3% and 86.4% respectively, compared to the previous algorithm. It can be applied to the information service of charging stations and utilized as a reservation service.

• 산업공학
• /
• 제16권spc호
• /
• pp.14-20
• /
• 2003

This paper presents a multi-criteria decision model and Multi-Criteria Generic Algorithm(MCGA) approach to improve backbone topology by leveraging the Virtual Link(VL) system in an hierarchical Link-State(LS) routing domain. Given that the sound backbone topology structure has a great impact on the overall routing performance in an hierarchical LS domain, the importance of this research is evident. The proposed decision model is to find an optimal configuration of VLs that properly meets two-pronged engineering goals in installing and maintaining VLs: i.e., operational costs and network reliability. The experiment results clearly indicates that it is essential to the effective operations of hierarchical LS routing domain to consider not only engineering aspects but also specific benefits from systematical layout of VLs, thereby presenting the validity of the decision model and MCGA.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.116-122
• /
• 2006

Most of the multimedia applications require strict quality of service (QoS) guarantee during the communication between a single source and multiple destinations. This gives rise to the need for an efficient QoS multicast routing strategy. Determination of such QoS-based optimal multicast routes basically leads to a multi-objective optimization problem, which is computationally intractable in polynomial time due to the uncertainty of resources in Internet. This paper describes a network model for researching the routing problem and proposes a new multicast tree selection algorithm based on genetic algorithms to simultaneously optimize multiple QoS parameters. The paper mainly presents a QoS multicast routing algorithm based on genetic algorithm (QMRGA). The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or near-optimal solution within few iterations, even for the networks environment with uncertain parameters. The incremental rate of computational cost can close to polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated using simulations. The simulation results show that this approach has fast convergence speed and high reliability. It can meet the real-time requirement in multimedia communication networks.

• Journal of Communications and Networks
• /
• 제17권3호
• /
• pp.306-320
• /
• 2015

Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.

• 대한조선학회논문집
• /
• 제51권2호
• /
• pp.99-106
• /
• 2014

Weather routing of a ship provides an optimal route to the destination by using minimal time or fuel in a given sea condition. These days, weather routing came into a spotlight with soaring fuel price and the environmental regulations of IMO and several countries. This study presents three scenarios of voyaging strategies for a ship and compared them in terms of the fuel consumption. The first strategy fixes the speed of a ship as a constant value for entire sailing course, the second fixes the RPM of the ship as constant for entire course, and the third determines the RPMs of the ship for each segment of the course. For each strategy, a ship route is optimized by using the $A^*$ search method. Wind, ocean current and wave are considered as ocean environment factors when seeking the optimal routes. Based on 7000 TEU container ship's sea trial records, simulation has been conducted for three scenarios, and the most efficient routing scenario is determined in the view of fuel consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권2호
• /
• pp.234-252
• /
• 2013

Due to the uncertain of connections in Delay Tolerant Networks (DTNs), most routing algorithms in DTNs need nodes to forward the message to others based on the opportunistic contact. The contact is related with the beaconing rate. In particular, nodes have more chances to encounter with each other with bigger beaconing rate, but more energy will be used. On the other hand, if the nodes forward the message to every node all the time, the efficiency of the routing algorithm is better, but it needs more energy, too. This paper tries to exploit the optimal beaconing rate and forwarding rate when the total energy is constraint. First, a theoretical framework is proposed, which can be used to evaluate the performance with different forwarding rate and beaconing rate. Then, this paper formulates a joint optimization problem based on the framework. Through Pontryagin's Maximal Principle, this paper obtains the optimal policy and proves that both the optimal forwarding and beaconing rates conform to threshold form. Simulation results show the accuracy of the theoretical framework. Extensive numerical results show that the optimal policy obtained in this paper is the best.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2202-2217
• /
• 2012

The transmission opportunities between nodes in Delay Tolerant Network (DTNs) are uncertain, and routing algorithms in DTNs often need nodes serving as relays for others to carry and forward messages. Due to selfishness, nodes may ask the source to pay a certain reward, and the reward may be varying with time. Moreover, the reward that the source obtains from the destination may also be varying with time. For example, the sooner the destination gets the message, the more rewards the source may obtain. The goal of this paper is to explore efficient ways for the source to maximize its total reward in such complex applications when it uses the probabilistic two-hop routing policy. We first propose a theoretical framework, which can be used to evaluate the total reward that the source can obtain. Then based on the model, we prove that the optimal forwarding policy confirms to the threshold form by the Pontryagin's Maximum Principle. Simulations based on both synthetic and real motion traces show the accuracy of our theoretical framework. Furthermore, we demonstrate that the performance of the optimal forwarding policy with threshold form is better through extensive numerical results, which conforms to the result obtained by the Maximum Principle.

• 한국지능시스템학회논문지
• /
• 제15권6호
• /
• pp.736-741
• /
• 2005

다단계 호핑(multi-hop) 무선 센서네트워크의 라우팅 경로를 설정하는데 있어서 데이터 전송의 요구가 있는 경우에만 경로를 만드는 Demand-Driven 방식의 대표적인 방법이 DSR(Dynamic Source Routing)인데 라우트 레코드를 패킷에 실어 보내기 때문에 이 또한 센서노드들의 수가 많아질수록 패킷이 무거워질 수밖에 없다. 본 논문에서는 DSR 프로토콜을 기반하면서도 라우팅 테이블을 적절히 이용하여 노드 수 증가에 대해 고정된 패킷크기를 가지도록 하였으며 라우팅 비용함수를 적용하여 각 센서노드들의 전원 소모량, 이동성(Mobility), 네트워크 내에서의 Traffic, 거리(Hop) 등을 복합적으로 고려한 안정적이고 신뢰성 있는 최적의 라우팅 설정알고리즘을 제안한다.

• 산업공학
• /
• 제17권spc호
• /
• pp.28-36
• /
• 2004

The main purpose of this study is to find out the optimal solution of the vehicle routing problem considering heterogeneous vehicle(s), double-trips, and multi depots. This study suggests a mathematical programming model with new numerical formula which considers the amount of delivery and sub-tour elimination and gives optimal solution by using OPL-STUDIO(ILOG). This study also suggests modified genetic algorithm which considers the improvement of the creation method for initial solution, application of demanding point, individual and last learning method in order to find excellent solution, survival probability of infeasible solution for allowance, and floating mutation rate for escaping from local solution. The suggested modified genetic algorithm is compared with optimal solution of the existing problems. We found the better solution rather than the existing genetic algorithm. The suggested modified genetic algorithm is tested by Eilon and Fisher data(Eilon 22, Eilon 23, Eilon 30, Eilon 33, and Fisher 10), respectively.

• 전자공학회논문지A
• /
• 제31A권10호
• /
• pp.1-9
• /
• 1994

In this paper, we have studied optimal FCL(Frequently Called List) table sizes in a grid topology circuit-switched network including wireless subscribers. The FCL table gives the position information of a destination subscriber for a call. When the call is generated in a node, this call is routed by the referenced position information of the destination subscriber in FCL table. In this paper, we have proposed an efficient routing algorithm, mixed FSR(Flood Search Routing) and DAR(Dynamic Adaptive Routing), considering moving wireless subscribers. Also, we have simulated hit ratio and incorrect ratio as performance parameters, consequently proposed the object function composed of table search time, hit ratio, incorrect ratio, FSR time and DAR time, and derived the optimal FCL table size by using it.