Start Strategies of ACO Applied on Subset Problems

DOI10.1007/978-3-642-18466-6_29MaRDI QIDQ3075275zbMATH 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_29

Mathematics Subject Classification ID

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

Recommendations

• Sensitivity analysis of ACO start strategies for subset problems
• Research on convergence of ACO subset algorithms
• Stochastic Algorithms: Foundations and Applications
• Multi-start methods for combinatorial optimization
• scientific article; zbMATH DE number 1975099
• scientific article; zbMATH DE number 1390344

Cites work

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

Cited in

(6)

• Ant algorithm with local search procedure for multiple knapsack problem
• Comparison of different ACO start strategies based on InterCriteria analysis
• A hybrid soft computing approach for subset problems
• Catfish bat algorithm-ant colony optimization for subset problems
• Hybrid Ant Colony Optimization Algorithms—Behaviour Investigation Based on Intuitionistic Fuzzy Logic
• Sensitivity analysis of ACO start strategies for subset problems

This page was built for publication: Start Strategies of ACO Applied on Subset Problems

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