Smart Root Search (SRS)

A New Search Algorithm to Investigate Combinatorial Problems

Narjes Khatoon Naseri, Elankovan A Sundararajan, Masri Ayob, Amin Jula

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In recent years researchers have tried to apply Stochastic Algorithms for solving Optimization problems. Some of these algorithms like Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) and Artificial Immune Systems (AIS) are more known because of their significant abilities in finding optimal solutions of the problems comparing to others. Although these algorithms show many advantages in solving optimization problems, they face some drawbacks affect on their performance. Local optima issues and lack of local search capability are two obvious weaknesses that each of the algorithms confronts at least one. To cope these challenges, in this study, plants' root growth intelligences will be inspired in proposing a novel nature-inspired optimization algorithm called Smart Root Search (SRS). The SRS simulates the extracted intelligent behaviors of plant roots in finding nutrition and water in soil. The proposed algorithm will provide embedded exploitation mechanisms besides quick and effective exploring features for escaping of the trap of local optima, and uses problem-space division. Using partitioned problem search space not only enhances ability of the algorithm to avoid of local optima, but makes it a scalable and flexible method in performing balanced search activities. The algorithm will further demonstrate its high-performance search ability in confronting high-dimensional search-space problems.

Original languageEnglish
Title of host publicationProceedings - 2015 7th International Conference on Computational Intelligence, Modelling and Simulation, CIMSim 2015
PublisherIEEE Computer Society
Pages11-16
Number of pages6
Volume2016-September
ISBN (Electronic)9781467380836
DOIs
Publication statusPublished - 29 Sep 2016
Event7th International Conference on Computational Intelligence, Modelling and Simulation, CIMSim 2015 - Kuantan, Pahang, Malaysia
Duration: 27 Jul 201629 Jul 2016

Other

Other7th International Conference on Computational Intelligence, Modelling and Simulation, CIMSim 2015
CountryMalaysia
CityKuantan, Pahang
Period27/7/1629/7/16

Fingerprint

Combinatorial Problems
Search Algorithm
Roots
Search Space
Optimization Problem
Root Growth
Artificial Immune System
Nutrition
Stochastic Algorithms
Trap
Exploitation
Local Search
Particle Swarm Optimization
Soil
Ant colony optimization
Immune system
Division
Optimization Algorithm
High-dimensional
High Performance

Keywords

  • Combinatorial Search
  • NP-hard problem
  • Optimization
  • Root Growth
  • Smart Root Search

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Modelling and Simulation

Cite this

Naseri, N. K., A Sundararajan, E., Ayob, M., & Jula, A. (2016). Smart Root Search (SRS): A New Search Algorithm to Investigate Combinatorial Problems. In Proceedings - 2015 7th International Conference on Computational Intelligence, Modelling and Simulation, CIMSim 2015 (Vol. 2016-September, pp. 11-16). [7579689] IEEE Computer Society. https://doi.org/10.1109/CIMSim.2015.23

Smart Root Search (SRS) : A New Search Algorithm to Investigate Combinatorial Problems. / Naseri, Narjes Khatoon; A Sundararajan, Elankovan; Ayob, Masri; Jula, Amin.

Proceedings - 2015 7th International Conference on Computational Intelligence, Modelling and Simulation, CIMSim 2015. Vol. 2016-September IEEE Computer Society, 2016. p. 11-16 7579689.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Naseri, NK, A Sundararajan, E, Ayob, M & Jula, A 2016, Smart Root Search (SRS): A New Search Algorithm to Investigate Combinatorial Problems. in Proceedings - 2015 7th International Conference on Computational Intelligence, Modelling and Simulation, CIMSim 2015. vol. 2016-September, 7579689, IEEE Computer Society, pp. 11-16, 7th International Conference on Computational Intelligence, Modelling and Simulation, CIMSim 2015, Kuantan, Pahang, Malaysia, 27/7/16. https://doi.org/10.1109/CIMSim.2015.23
Naseri NK, A Sundararajan E, Ayob M, Jula A. Smart Root Search (SRS): A New Search Algorithm to Investigate Combinatorial Problems. In Proceedings - 2015 7th International Conference on Computational Intelligence, Modelling and Simulation, CIMSim 2015. Vol. 2016-September. IEEE Computer Society. 2016. p. 11-16. 7579689 https://doi.org/10.1109/CIMSim.2015.23
Naseri, Narjes Khatoon ; A Sundararajan, Elankovan ; Ayob, Masri ; Jula, Amin. / Smart Root Search (SRS) : A New Search Algorithm to Investigate Combinatorial Problems. Proceedings - 2015 7th International Conference on Computational Intelligence, Modelling and Simulation, CIMSim 2015. Vol. 2016-September IEEE Computer Society, 2016. pp. 11-16
@inproceedings{6d9824757b1e4e6eae414de67308046f,
title = "Smart Root Search (SRS): A New Search Algorithm to Investigate Combinatorial Problems",
abstract = "In recent years researchers have tried to apply Stochastic Algorithms for solving Optimization problems. Some of these algorithms like Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) and Artificial Immune Systems (AIS) are more known because of their significant abilities in finding optimal solutions of the problems comparing to others. Although these algorithms show many advantages in solving optimization problems, they face some drawbacks affect on their performance. Local optima issues and lack of local search capability are two obvious weaknesses that each of the algorithms confronts at least one. To cope these challenges, in this study, plants' root growth intelligences will be inspired in proposing a novel nature-inspired optimization algorithm called Smart Root Search (SRS). The SRS simulates the extracted intelligent behaviors of plant roots in finding nutrition and water in soil. The proposed algorithm will provide embedded exploitation mechanisms besides quick and effective exploring features for escaping of the trap of local optima, and uses problem-space division. Using partitioned problem search space not only enhances ability of the algorithm to avoid of local optima, but makes it a scalable and flexible method in performing balanced search activities. The algorithm will further demonstrate its high-performance search ability in confronting high-dimensional search-space problems.",
keywords = "Combinatorial Search, NP-hard problem, Optimization, Root Growth, Smart Root Search",
author = "Naseri, {Narjes Khatoon} and {A Sundararajan}, Elankovan and Masri Ayob and Amin Jula",
year = "2016",
month = "9",
day = "29",
doi = "10.1109/CIMSim.2015.23",
language = "English",
volume = "2016-September",
pages = "11--16",
booktitle = "Proceedings - 2015 7th International Conference on Computational Intelligence, Modelling and Simulation, CIMSim 2015",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Smart Root Search (SRS)

T2 - A New Search Algorithm to Investigate Combinatorial Problems

AU - Naseri, Narjes Khatoon

AU - A Sundararajan, Elankovan

AU - Ayob, Masri

AU - Jula, Amin

PY - 2016/9/29

Y1 - 2016/9/29

N2 - In recent years researchers have tried to apply Stochastic Algorithms for solving Optimization problems. Some of these algorithms like Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) and Artificial Immune Systems (AIS) are more known because of their significant abilities in finding optimal solutions of the problems comparing to others. Although these algorithms show many advantages in solving optimization problems, they face some drawbacks affect on their performance. Local optima issues and lack of local search capability are two obvious weaknesses that each of the algorithms confronts at least one. To cope these challenges, in this study, plants' root growth intelligences will be inspired in proposing a novel nature-inspired optimization algorithm called Smart Root Search (SRS). The SRS simulates the extracted intelligent behaviors of plant roots in finding nutrition and water in soil. The proposed algorithm will provide embedded exploitation mechanisms besides quick and effective exploring features for escaping of the trap of local optima, and uses problem-space division. Using partitioned problem search space not only enhances ability of the algorithm to avoid of local optima, but makes it a scalable and flexible method in performing balanced search activities. The algorithm will further demonstrate its high-performance search ability in confronting high-dimensional search-space problems.

AB - In recent years researchers have tried to apply Stochastic Algorithms for solving Optimization problems. Some of these algorithms like Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) and Artificial Immune Systems (AIS) are more known because of their significant abilities in finding optimal solutions of the problems comparing to others. Although these algorithms show many advantages in solving optimization problems, they face some drawbacks affect on their performance. Local optima issues and lack of local search capability are two obvious weaknesses that each of the algorithms confronts at least one. To cope these challenges, in this study, plants' root growth intelligences will be inspired in proposing a novel nature-inspired optimization algorithm called Smart Root Search (SRS). The SRS simulates the extracted intelligent behaviors of plant roots in finding nutrition and water in soil. The proposed algorithm will provide embedded exploitation mechanisms besides quick and effective exploring features for escaping of the trap of local optima, and uses problem-space division. Using partitioned problem search space not only enhances ability of the algorithm to avoid of local optima, but makes it a scalable and flexible method in performing balanced search activities. The algorithm will further demonstrate its high-performance search ability in confronting high-dimensional search-space problems.

KW - Combinatorial Search

KW - NP-hard problem

KW - Optimization

KW - Root Growth

KW - Smart Root Search

UR - http://www.scopus.com/inward/record.url?scp=84994316434&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84994316434&partnerID=8YFLogxK

U2 - 10.1109/CIMSim.2015.23

DO - 10.1109/CIMSim.2015.23

M3 - Conference contribution

VL - 2016-September

SP - 11

EP - 16

BT - Proceedings - 2015 7th International Conference on Computational Intelligence, Modelling and Simulation, CIMSim 2015

PB - IEEE Computer Society

ER -