A family system based evolutionary algorithm for obstacle-evasion minimal exposure path problem in Internet of Things-Reference-Cited by-同舟云学术

A family system based evolutionary algorithm for obstacle-evasion minimal exposure path problem in Internet of Things

Published:2022-08 Issue: Volume:200 Page:116943
ISSN:0957-4174
Container-title:Expert Systems with Applications
language:en
Short-container-title:Expert Systems with Applications

Author:

Binh Nguyen Thi My,Ngoc Nguyen Hong^ORCID,Binh Huynh Thi Thanh^ORCID,Van Nguyen Khanh,Yu Shui

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Science Applications,General Engineering

Reference26 articles.

1. Efficient approximation approaches to minimal exposure path problem in probabilistic coverage model for wireless sensor networks;Binh;Applied Soft Computing,2019

2. Efficient meta-heuristic approaches in solving minimal exposure path problem for heterogeneous wireless multimedia sensor networks in internet of things;Binh;Applied Intelligence: The International Journal of Artificial Intelligence, Neural Networks, and Complex Problem-Solving Technologies,2020

3. A new hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem;Binh,2008

4. Binh, T. T. H., McKay, R. I., Hoai, N. X., & Nghia, N. D. (2009). New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem. In Proceedings of the 11th annual conference on genetic and evolutionary computation (pp. 373–380).

5. An elite hybrid particle swarm optimization for solving minimal exposure path problem in mobile wireless sensor networks;Binh;Sensors,2020

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An efficient exact method with polynomial time-complexity to achieve k-strong barrier coverage in heterogeneous wireless multimedia sensor networks;Journal of Network and Computer Applications;2024-11

2. An Efficient Method for Solving the Best Coverage Path Problem in Homogeneous Wireless Ad-Hoc Sensor Networks;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2024

3. An Efficient Approach to the k-Strong Barrier Coverage Problem Under the Probabilistic Sensing Model in Wireless Multimedia Sensor Networks;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2024

4. Path Discovery Algorithm for Autonomous Area of Internet of Things Based on Artificial Intelligence Algorithm;2023 2nd International Conference on Data Analytics, Computing and Artificial Intelligence (ICDACAI);2023-10-17

5. Intelligent agents path planning in wireless sensor networks based on Vor-PSO algorithm;International Journal of Bio-Inspired Computation;2023