Comparison of different ACO start strategies based on InterCriteria analysis

DOI10.1007/978-3-319-59861-1_4MaRDI QIDQ4609767zbMATH OpenOpenAlexFDO

Authors Olympia Roeva, S. Fidanova, Marcin Paprzycki

Publication date 26 March 2018

Published in Recent Advances in Computational Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-59861-1_4

zbMATH Keywords

multiple knapsack problemInterCriteria analysisant colony optimizatiostart strategies

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Sensitivity analysis of ACO start strategies for subset problems
• Start Strategies of ACO Applied on Subset Problems
• scientific article; zbMATH DE number 2159380
• Ant colony optimization: An overview
• scientific article; zbMATH DE number 2079899

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
• Ant colony optimization.
• Discussion on the threshold values in the intercriteria decision making approach
• Generalized net models of the process of ant colony optimization with different strategies and intuitionistic fuzzy estimations
• Handbook of metaheuristics
• InterCriteria analysis: ideas and problems
• New directions in cryptography
• On index matrices. I: Standard cases
• On intuitionistic fuzzy sets theory
• The Multiple-Choice Knapsack Problem

Cited in

(3)

• Discovering knowledge from predominantly repetitive data by InterCriteria analysis
• Sensitivity analysis of ACO start strategies for subset problems
• InterCriteria analysis of ACO performance for workforce planning problem

This page was built for publication: Comparison of different ACO start strategies based on InterCriteria analysis

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