• 제목/요약/키워드: Multi-objective routing

검색결과 35건 처리시간 0.027초

멀티캐스트 라우팅을 위한 다목적 마이크로-유전자 알고리즘 (Multi-Objective Micro-Genetic Algorithm for Multicast Routing)

  • 전성화;한치근
    • 산업공학
    • /
    • 제20권4호
    • /
    • pp.504-514
    • /
    • 2007
  • The multicast routing problem lies in the composition of a multicast routing tree including a source node and multiple destinations. There is a trade-off relationship between cost and delay, and the multicast routing problem of optimizing these two conditions at the same time is a difficult problem to solve and it belongs to a multi-objective optimization problem (MOOP). A multi-objective genetic algorithm (MOGA) is efficient to solve MOOP. A micro-genetic algorithm(${\mu}GA$) is a genetic algorithm with a very small population and a reinitialization process, and it is faster than a simple genetic algorithm (SGA). We propose a multi-objective micro-genetic algorithm (MO${\mu}GA$) that combines a MOGA and a ${\mu}GA$ to find optimal solutions (Pareto optimal solutions) of multicast routing problems. Computational results of a MO${\mu}GA$ show fast convergence and give better solutions for the same amount of computation than a MOGA.

Optimizing Energy Efficiency in Mobile Ad Hoc Networks: An Intelligent Multi-Objective Routing Approach

  • Sun Beibei
    • 대한임베디드공학회논문지
    • /
    • 제19권2호
    • /
    • pp.107-114
    • /
    • 2024
  • Mobile ad hoc networks represent self-configuring networks of mobile devices that communicate without relying on a fixed infrastructure. However, traditional routing protocols in such networks encounter challenges in selecting efficient and reliable routes due to dynamic nature of these networks caused by unpredictable mobility of nodes. This often results in a failure to meet the low-delay and low-energy consumption requirements crucial for such networks. In order to overcome such challenges, our paper introduces a novel multi-objective and adaptive routing scheme based on the Q-learning reinforcement learning algorithm. The proposed routing scheme dynamically adjusts itself based on measured network states, such as traffic congestion and mobility. The proposed approach utilizes Q-learning to select routes in a decentralized manner, considering factors like energy consumption, load balancing, and the selection of stable links. We present a formulation of the multi-objective optimization problem and discuss adaptive adjustments of the Q-learning parameters to handle the dynamic nature of the network. To speed up the learning process, our scheme incorporates informative shaped rewards, providing additional guidance to the learning agents for better solutions. Implemented on the widely-used AODV routing protocol, our proposed approaches demonstrate better performance in terms of energy efficiency and improved message delivery delay, even in highly dynamic network environments, when compared to the traditional AODV. These findings show the potential of leveraging reinforcement learning for efficient routing in ad hoc networks, making the way for future advancements in the field of mobile ad hoc networking.

자원 재배치를 위한 차량 경로계획의 다목적 최적화 (Multi-objective Optimization of Vehicle Routing with Resource Repositioning)

  • 강재구;임동순
    • 산업경영시스템학회지
    • /
    • 제44권2호
    • /
    • pp.36-42
    • /
    • 2021
  • This paper deals with a vehicle routing problem with resource repositioning (VRPRR) which is a variation of well-known vehicle routing problem with pickup and delivery (VRPPD). VRPRR in which static repositioning of public bikes is a representative case, can be defined as a multi-objective optimization problem aiming at minimizing both transportation cost and the amount of unmet demand. To obtain Pareto sets for the problem, famous multi-objective optimization algorithms such as Strength Pareto Evolutionary Algorithm 2 (SPEA2) can be applied. In addition, a linear combination of two objective functions with weights can be exploited to generate Pareto sets. By varying weight values in the combined single objective function, a set of solutions is created. Experiments accomplished with a standard benchmark problem sets show that Variable Neighborhood Search (VNS) applied to solve a number of single objective function outperforms SPEA2. All generated solutions from SPEA2 are completely dominated by a set of VNS solutions. It seems that local optimization technique inherent in VNS makes it possible to generate near optimal solutions for the single objective function. Also, it shows that trade-off between the number of solutions in Pareto set and the computation time should be considered to obtain good solutions effectively in case of linearly combined single objective function.

Multi Objective Vehicle and Drone Routing Problem with Time Window

  • Park, Tae Joon;Chung, Yerim
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권1호
    • /
    • pp.167-178
    • /
    • 2019
  • In this paper, we study the multi-objectives vehicle and drone routing problem with time windows, MOVDRPTW for short, which is defined in an urban delivery network. We consider the dual modal delivery system consisting of drones and vehicles. Drones are used as a complement to the vehicle and operate in a point to point manner between the depot and the customer. Customers make various requests. They prefer to receive delivery services within the predetermined time range and some customers require fast delivery. The purpose of this paper is to investigate the effectiveness of the delivery strategy of using drones and vehicles together with a multi-objective measures. As experiment datasets, we use the instances generated based on actual courier delivery data. We propose a hybrid multi-objective evolutionary algorithm for solving MOVDRPTW. Our results confirm that the vehicle-drone mixed strategy has 30% cost advantage over vehicle only strategy.

다수 물류기지 재고 및 경로 문제의 유전알고리즘에 의한 해법 (An Effective Genetic Algorithm for Solving the Joint Inventory and Routing Problem with Multi-warehouses)

  • 정재헌
    • 경영과학
    • /
    • 제29권3호
    • /
    • pp.107-120
    • /
    • 2012
  • In this paper we propose an effective genetic algorithm for solving the integrated inventory and routing problem of supply chain composed of multi-warehouses and multi-retailers. Unlike extant studies dealing with integrated inventory and routing problem of supply chain, our model incorporates more realistic aspect such as positive inventory at the multi-warehouses under the assumption of inventory policy of power of two-replenishment-cycle. The objective is to determine replenishment intervals for the retailers and warehouses as well as the vehicles routes so that the total cost of delivery and inventory cost is minimized. A notable feature of our algorithm is that the procedure for evaluating the fitness of objective function has the computational complexity closing to linear function. Computational results show effectiveness of our algorithm.

Adaptive Differentiated Integrated Routing Scheme for GMPLS-based Optical Internet

  • Wei, Wei;Zeng, Qingji;Ye, Tong;Lomone, David
    • Journal of Communications and Networks
    • /
    • 제6권3호
    • /
    • pp.269-279
    • /
    • 2004
  • A new online multi-layer integrated routing (MLIR) scheme that combines IP (electrical) layer routing with WDM (optical) layer routing is investigated. It is a highly efficient and cost-effective routing scheme viable for the next generation integrated optical Internet. A new simplified weighted graph model for the integrated optical Internet consisted of optical routers with multi-granularity optical-electrical hybrid switching capability is firstly proposed. Then, based on the proposed graph model, we develop an online integrated routing scheme called differentiated weighted fair algorithm (DWFA) employing adaptive admission control (routing) strategies with the motivation of service/bandwidth differentiation, which can jointly solve multi-layer routing problem by simply applying the minimal weighted path computation algorithm. The major objective of DWFA is fourfold: 1) Quality of service (QoS) routing for traffic requests with various priorities; 2) blocking fairness for traffic requests with various bandwidth granularities; 3) adaptive routing according to the policy parameters from service provider; 4) lower computational complexity. Simulation results show that DWFA performs better than traditional overlay routing schemes such as optical-first-routing (OFR) and electrical-first-routing (EFR), in terms of traffic blocking ratio, traffic blocking fairness, average traffic logical hop counts, and global network resource utilization. It has been proved that the DWFA is a simple, comprehensive, and practical scheme of integrated routing in optical Internet for service providers.

On the Need for Efficient Load Balancing in Large-scale RPL Networks with Multi-Sink Topologies

  • Abdullah, Maram;Alsukayti, Ibrahim;Alreshoodi, Mohammed
    • International Journal of Computer Science & Network Security
    • /
    • 제21권3호
    • /
    • pp.212-218
    • /
    • 2021
  • Low-power and Lossy Networks (LLNs) have become the common network infrastructure for a wide scope of Internet of Things (IoT) applications. For efficient routing in LLNs, IETF provides a standard solution, namely the IPv6 Routing Protocol for LLNs (RPL). It enables effective interconnectivity with IP networks and flexibly can meet the different application requirements of IoT deployments. However, it still suffers from different open issues, particularly in large-scale setups. These include the node unreachability problem which leads to increasing routing losses at RPL sink nodes. It is a result of the event of memory overflow at LLNs devices due to their limited hardware capabilities. Although this can be alleviated by the establishment of multi-sink topologies, RPL still lacks the support for effective load balancing among multiple sinks. In this paper, we address the need for an efficient multi-sink load balancing solution to enhance the performance of PRL in large-scale scenarios and alleviate the node unreachability problem. We propose a new RPL objective function, Multi-Sink Load Balancing Objective Function (MSLBOF), and introduce the Memory Utilization metrics. MSLBOF enables each RPL node to perform optimal sink selection in a way that insure better memory utilization and effective load balancing. Evaluation results demonstrate the efficiency of MSLBOF in decreasing packet loss and enhancing network stability, compared to MRHOF in standard RPL.

다수의 QoS 갖는 멀티캐스트 라우팅을 위한 다목적 유전자 알고리즘 (Multiple Objective Genetic Algorithms for Multicast Routing with Multi-objective QoS)

  • 이윤구;한치근
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2003년도 가을 학술발표논문집 Vol.30 No.2 (1)
    • /
    • pp.511-513
    • /
    • 2003
  • 멀티미디어 서비스의 증가로 다양한 QoS(Quality of Service) 파라미터를 보장하는 멀티캐스트 라우팅 알고리즘이 필요하게 되었다. 이러한 멀티캐스트 라우팅에서 고려해야 하는 각각의 QoS 파리미터와 비용과의 관계는 Trade-off 관계에 있으며, 이들을 동시에 최적화하는 멀티캐스트 라우팅 문제는 다목적 최적화 문제(Multi-Objective Optimization Problem: MOOP)에 속하는 어려운 문제이다. 다목적 최적화 문제의 목표는 다양한 파레토 최적해(Pareto Optimal Solution)를 찾는데 있으며, 이를 해결하기 위해서 본 논문에서는 다목적 유전자 알고리즘(Multiple Objective Genetic Algorithms: MOGA)을 적용하였다.

  • PDF

다목적 차량경로문제를 위한 발견적 해법 (A Heuristic for Multi-Objective Vehicle Routing Problem)

  • 강경환;이병기;이영훈
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
    • /
    • pp.1733-1739
    • /
    • 2006
  • This paper is concerned with multi-objective vehicle routing problem(VRP), in which objective of this problem is to minimize the total operating time of vehicles and the total tardiness of customers. A mixed integer programming formulation and a heuristic for practical use are suggested. The heuristic is based on the route-perturbation and route-improvement method(RPRI). Performances are compared with other heuristic appeared in the previous literature using the modified bench-mark data set. It is shown that the suggested heuristic give good solution within a short computation time by computational experiment.

  • PDF

센서 네트워크에서 실시간 침입탐지 라우팅을 위한 다목적 개미 군집 최적화 알고리즘 (A Multi-objective Ant Colony Optimization Algorithm for Real Time Intrusion Detection Routing in Sensor Network)

  • 강승호
    • 정보처리학회논문지:컴퓨터 및 통신 시스템
    • /
    • 제2권5호
    • /
    • pp.191-198
    • /
    • 2013
  • 이동하는 베이스 노드를 가진 무선 센서 네트워크(WSN)에서 실시간 침입탐지를 위해서는 침입을 탐지한 센서로부터 베이스 노드까지의 정보 전달이 짧은 라우팅 경로를 통해 이루어져야 한다. 센서 네트워크에서 최소 Wiener수 신장트리(MWST)기반 라우팅 방법은 최소 신장트리(MST)기반 라우팅 방법에 비해 작은 홉 수를 보장하고 있어서 실시간 침입탐지에 적합함이 알려져 있다. 하지만 주어진 네트워크로부터 최소 Wiener 수 신장트리를 찾는 문제는 NP-hard이고 특정 노드에 대한 의존성이 커서 최소 신장 트리 기반 라우팅 방법에 비해 짧은 네트워크 수명을 갖는 단점이 있다. 본 논문은 실시간 침입탐지를 위해 최소 Wiener수 신장트리를 개선해 작은 홉 수와 긴 네트워크의 수명을 동시에 보장하는 라우팅 트리를 찾는 다목적 개미 군집 최적화 알고리즘을 제안한다. 그리고 제안한 라우팅 트리의 성능을 패킷의 평균 전송 홉 수 및 네트워크 전력 소모, 네트워크의 수명 측면에서 최소 신장트리기반 라우팅 방법 및 최소 Wiener수 신장트리기반 라우팅 방법과 비교한다.