Ant Colony Optimization for Multi-Objective Optimization Problems

Published: 01 Jan 2007, Last Modified: 11 Nov 2024ICTAI (1) 2007EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We propose in this paper a generic algorithm based on ant colony optimization to solve multi-objective optimization problems. The proposed algorithm is parameterized by the number of ant colonies and the number of pheromone trails. We compare different variants of this algorithm on the multi-objective knapsack problem. We compare also the obtained results with other evolutionary algorithms from the literature.
Loading

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview