检索结果-内蒙古大学图书馆

A Multi-start Variable Neighbourhood Search with a New Solution Construction Method for Solving inter-domain path computation problem

引用

ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2024年第9期49卷 12641-12654页

作者： Thanh, Pham Dinh Tay Bac Univ Fac Nat Sci Technol Son La Vietnam Vietnam Natl Univ Univ Engn & Technol Hanoi Vietnam

inter-domain path computation under Node-Defined domain Uniqueness Constraint (IDPC-NDU) is one of the routing cost optimization problems in multi-domain networks that has been proposed and received much attention by researchers. Because the IDPC-NDU is NP-Hard, the approaches using approximation algorithms are frequently used. These approximation algorithms often construct solutions based on connecting edges between adjacent domains, with little consideration of edges between non-adjacent domains. Furthermore, this study investigates how to combine an algorithm with the capability of exploration with another algorithm with the capability of exploiting in order to balance the ability to explore and exploit the search space. As a result, based on new encoding and decoding solution methods, this study proposes combinations of the algorithms Multi-start Method and Variable Neighbourhood Search Method. By considering the inter-domain edges connecting non-adjacent domains, the new encoding and decoding methods help to examine more possible paths between the source node and the destination node. The proposed algorithm is evaluated by comparing it to the most recent algorithms that were proposed to solve the IDPC-NDU. Analysis of experimental results on various instances shows that the proposed algorithm exceeds other algorithms in most of the experimental cases. In particular, one-fifth of the test cases on which the proposed algorithm finds the optimal solution. Besides, the study also analyses the influence of the attributes of the input data on the efficiency of the proposed algorithm.

关键词： Multi-start Method Variable Neighbourhood Search Method inter-domain path computation problem Multi-domain networks

来源：评论

学校读者我要写书评

暂无评论

A Particle Swarm Optimization and Variable Neighborhood Search based multipopulation algorithm for inter-domain path computation problem

引用

APPLIED SOFT COMPUTING 2023年 136卷

作者： Anh, Do Tuan Binh, Huynh Thi Thanh Thai, Nguyen Duc Thanh, Pham Dinh Hanoi Univ Sci & Technol Sch Informat & Commun Technol Hanoi Vietnam Taybac Univ Fac Nat Sci & Technol Son La Vietnam

It is a common occurrence nowadays for a network to be gigantic in size and complex in architecture. Network navigation thus faces many new problems in terms of routing and resource utilization, one of which arises in multi-domain networks. This paper focuses on the inter-domain path computation under Node-defined domain Uniqueness Constraint (IDPC-NDU) problem, whose purpose is to find the shortest path between two nodes in a network under a constraint that such a path is only allowed to traverse each domain at most once. Considering that this is an NP-Hard problem, an approximate approach is more practical than an exact one. Meanwhile, Particles Swarm Optimization Algorithm (PSO) has been long known for its powerful ability to discover near-optimal solutions in a reasonable time;however, its application in discrete search space is limited. Therefore, we decide to use the multi-population framework, a sub-branch of multitasking optimization which allows information exchange not only between problems but also between different optimization heuristics, to improve upon the basic PSO method. Specifically, this paper introduces a hybridization between PSO and Variable Neighborhood Search (VNS). The encoding and decoding method are created specifically for the IDPC-NDU problem and for the PSO algorithm, and VNS serves to enhance further the algorithm's ability to escape local optima. Experiments are carried out to prove the new algorithm's efficacy, especially in the context of similar multitasking methods. (c) 2023 Elsevier B.V. All rights reserved.

关键词： Multi-population multitasking evolutionary algorithm Multifactorial evolutionary algorithm inter-domain path computation problem Evolutionary algorithms Multitasking optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：