Sensitivity analysis of ACO start strategies for subset problems

DOI10.1007/978-3-642-18466-6_30MaRDI QIDQ3075276zbMATH OpenOpenAlexFDO

Authors

Publication date 11 February 2011

Published in Numerical Methods and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18466-6_30

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Start Strategies of ACO Applied on Subset Problems
• Comparison of different ACO start strategies based on InterCriteria analysis
• Numerical Analysis and Its Applications
• scientific article; zbMATH DE number 6472050
• scientific article; zbMATH DE number 1969657

Cites work

• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• Ant colony optimization.
• scientific article; zbMATH DE number 1480194 (Why is no real title available?)
• scientific article; zbMATH DE number 1390344 (Why is no real title available?)
• New directions in cryptography

Cited in

(7)

• Intuitionistic fuzzy estimation of the ant colony optimization starting points
• Catfish bat algorithm-ant colony optimization for subset problems
• Start Strategies of ACO Applied on Subset Problems
• Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
• Comparison of different ACO start strategies based on InterCriteria analysis
• A hybrid soft computing approach for subset problems
• Numerical Analysis and Its Applications

This page was built for publication: Sensitivity analysis of ACO start strategies for subset problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075276)