An Improved GAFSA Based on Chaos Search and Modified Simplex Method

Peng, Pei-zhen; Yuan, Jie; Wang, Zhaojia; Yu, Yi; Jiang, Min

doi:10.1007/978-3-662-46469-4_14

Cited by 2 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recent approaches for solving LPs inherit the structural properties of the Simplex Algorithm. Such algorithms include but are not limited to upper bounding the number of basic solutions of the Simplex Algorithm [1], algorithms based on a hybrid of meta-heuristic and modified Simplex Algorithm [2], [3], other algorithms can be found in [4]- [7]. Nevertheless, the Simplex Algorithm searches for the optimal solution by exploring the vertices of the polyhedron, therefore the efficiency of the algorithm will be lost by moving along the boundary of the feasible region.…”

Section: Introductionmentioning

confidence: 99%

Optimizing Gradient Methods for IoT Applications

Hosseini

Reinhardt

Rawat

2022

IEEE Internet Things J.

View full text Add to dashboard Cite

General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain.• You may freely distribute the URL identifying the publication in the public portal.

show abstract

Section: Introductionmentioning

confidence: 99%

Optimizing Gradient Methods for IoT Applications

Hosseini

Reinhardt

Rawat

2022

IEEE Internet Things J.

View full text Add to dashboard Cite

show abstract

Fish-Inspired Heuristics: A Survey of the State-of-the-Art Methods

Alhaqbani

Kurdi

Hosny

2022

Arch Computat Methods Eng

View full text Add to dashboard Cite

The collective behaviour of fish schools, shoals and other swarms in nature has long inspired researchers to develop solutions for optimization problems. Instinct influences the behaviour of fish to group into schools to increase safety, enhance foraging success, and promote breeding. According to these instinctive behaviours, several fish-inspired algorithms have been introduced to solve hard problems. This paper presents a comprehensive survey of fish-inspired heuristics, exploring their evolution within the context of general optimization problems. To our knowledge, this survey is the first to cover both main fish-inspired heuristics in the literature, namely, the artificial fish swarm algorithm (AFSA) and Fish school search (FSS), in addition to other algorithms inspired by specific fish species. The review covers more than 50 papers published in the Web of Science and IEEE databases since 2000. We first review the basic fish heuristics, highlighting their advantages and drawbacks, and then detail attempts in the literature to improve their behaviour to solve complex, multi-objective and high-dimensional problems in several domains. Our work is intended to provide guidance for researchers and practitioners for the purpose of further advancing research in the area of fish-inspired heuristics. We aspire to encourage their utilization in various fields for global optimization and in real-life applications. The survey findings indicate that fish-inspired heuristics are very alive in recent literature and still have great potential. Several challenges and future research directions are also identified among the findings of this survey, which can help to enhance this vibrant line of research.

show abstract

An Improved GAFSA Based on Chaos Search and Modified Simplex Method

Cited by 2 publications

References 5 publications

Optimizing Gradient Methods for IoT Applications

Optimizing Gradient Methods for IoT Applications

Fish-Inspired Heuristics: A Survey of the State-of-the-Art Methods

Contact Info

Product

Resources

About