A decomposition-based many-objective ant colony optimization algorithm with adaptive reference points

DOI10.1016/j.ins.2020.06.028zbMath1475.90142OpenAlexW3036001205MaRDI QIDQ2053815

Bin Zhang, Changsheng Zhang, Haitong Zhao

Publication date: 30 November 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2020.06.028

zbMATH Keywords

reference pointdiscrete optimizationant colony optimizationmany-objective optimizationdecomposition strategy

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Multi-objective two-level medical facility location problem and tabu search algorithm

Uses Software

• MOEA/D

Cites Work

• Unnamed Item
• An analysis of selection methods in memory consideration for harmony search
• A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
• Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems
• A many-objective particle swarm optimizer based on indicator and direction vectors for many-objective optimization

This page was built for publication: A decomposition-based many-objective ant colony optimization algorithm with adaptive reference points