首页 | 本学科首页   官方微博 | 高级检索  
     


A modified ant colony system for finding the expected shortest path in networks with variable arc lengths and probabilistic nodes
Affiliation:1. Hamedan Science and Technology Park, Hamedan, Iran;2. Department of Industrial Engineering, Mazandaran University of Science & Technology, Babol, Iran;3. Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran;1. Department of Physics, Urmia University of Technology, Orumieh, Iran;2. Department of Physics, University of Mohaghegh Ardabili, Ardabil, Iran;3. Department of Computer Engineering, Islamic Azad University, Urmia Branch, Urmia, Iran;1. Forestry College, Shandong Agricultural University, Taian 271018, China;2. College of Water Conservancy and Civil Engineering, Shandong Agricultural University, Taian 271018, China;3. School of Energy and Power Engineering, Beihang University, Beijing 100191, China;1. Gwangju Institute of Science and Technology, South Korea;2. International Islamic University, Islamabad, Pakistan;3. National University of Computer and Emerging Sciences, Islamabad, Pakistan;4. College of Computer and Information Sciences, Al-Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh, Saudi Arabia;1. Computer Science and Communications Research Unit, University of Luxembourg, Luxembourg;2. Laboratoire d’Informatique Fondamentale de Lille, University of Lille 1, France
Abstract:The problem of finding the expected shortest path in stochastic networks, where the presence of each node is probabilistic and the arc lengths are random variables, have numerous applications, especially in communication networks. The problem being NP-hard we use an ant colony system (ACS) to propose a metaheuristic algorithm for finding the expected shortest path. A new local heuristic is formulated for the proposed algorithm to consider the probabilistic nodes. The arc lengths are randomly generated based on the arc length distribution functions. Examples are worked out to illustrate the applicability of the proposed approach.
Keywords:Ant colony system (ACS)  Stochastic networks  Expected shortest path  Probabilistic nodes  Random arc lengths
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号