A Novel Ant Colony Optimization Based Training Subset Selection Algorithm for Hyperspectral Image Classification

Sharma, Shakti; Buddhiraju, Krishna Mohan

doi:10.1109/igarss.2018.8519217

Cited by 6 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This new list is obtained from the preceding list . The solution to the problem constitutes the objects loaded into the knapsack, that object which has been added in the set [4][5][6][7][8][9][10][11][12][13].…”

Section: A Mathematical Formalizationmentioning

confidence: 99%

A Step-by-Step Mathematical Derivation of Ant Colony Optimization Algorithm for solving 01 Knapsack Problem

2023

IRJMETS

View full text Add to dashboard Cite

This article provides a meticulous step-by-step mathematical derivation of the Ant Colony Optimization (ACO) algorithm designed for solving the 0/1 Knapsack Problem. Each facet of the algorithm, from initialization to pheromone updates, solution construction, and the delicate balance between exploration and exploitation, is dissected. This comprehensive understanding of ACO's underlying mathematical framework offers a clear roadmap for researchers and practitioners, guiding them in harnessing ACO's power to optimize combinatorial challenges. The 0/1 Knapsack Problem, a significant challenge in computer science due to its NP-hard nature, involves strategically loading objects into a knapsack with limited capacity. Despite its computational complexity, this problem finds applications in operations research and finance. The article addresses the urgency for swift solutions by exploring heuristic algorithms inspired by ant behavior, providing a valuable guide for efficiently solving the 0/1 Knapsack Problem.

show abstract

Section: A Mathematical Formalizationmentioning

confidence: 99%

A Step-by-Step Mathematical Derivation of Ant Colony Optimization Algorithm for solving 01 Knapsack Problem

2023

IRJMETS

View full text Add to dashboard Cite

show abstract

“…Out of a set S of n objects we have to select the best subset of' n' objects, it satisfying some more constraints. In subset selection problems are finding an optimal feasible subset of an initial set of objects with respect to an objective function or some constraints [4][5][6][7][8][9][10][11][12][13]. Subset selection is a heuristic search process where search space contains states, each of which generate a candidate subset for evaluation.…”

Section: Introductionmentioning

confidence: 99%

A Step-by-Step Mathematical Derivation of Ant Colony Optimization for Solving Subset Selection Problems

Mandal

2023

Int. J. Res. Publ. Rev.

View full text Add to dashboard Cite

This article presents a thorough, step-by-step mathematical derivation of Ant Colony Optimization (ACO) tailored specifically for solving Subset Selection Problems. ACO, inspired by the foraging behavior of ants, has proven its efficacy as a metaheuristic for combinatorial optimization, and this derivation focuses on its application to subset selection scenarios. Beginning with an exploration of the foundational principles of ACO, the derivation delves into the adaptation of these principles to address subset selection challenges, emphasizing the formulation of the objective function, pheromone updating mechanisms, and solution construction procedures. The mathematical rigor is complemented by intuitive explanations, bridging the theoretical and practical aspects of ACO. Additionally, the article highlights the algorithm's versatility in handling diverse subset selection objectives, showcasing its adaptability to various problem domains. In essence, this comprehensive derivation provides readers with a profound understanding of ACO's inner workings, enabling them to apply and customize the algorithm effectively for subset selection problems in different contexts.

show abstract

A Survey on Ant Colony Optimization for Solving Some of the Selected NP-Hard Problem

Mandal

Dehuri

2020

Learning and Analytics in Intelligent Systems

View full text Add to dashboard Cite

A Novel Ant Colony Optimization Based Training Subset Selection Algorithm for Hyperspectral Image Classification

Cited by 6 publications

References 9 publications

A Step-by-Step Mathematical Derivation of Ant Colony Optimization Algorithm for solving 01 Knapsack Problem

A Step-by-Step Mathematical Derivation of Ant Colony Optimization Algorithm for solving 01 Knapsack Problem

A Step-by-Step Mathematical Derivation of Ant Colony Optimization for Solving Subset Selection Problems

A Survey on Ant Colony Optimization for Solving Some of the Selected NP-Hard Problem

Contact Info

Product

Resources

About