Crowding Population-based Ant Colony Optimization for the Multi-objective Traveling Salesman Problem

No Thumbnail Available

Date

2022-09-19

Journal Title

Journal ISSN

Volume Title

Publisher

Université de Bordj Bou Arreridj Faculty of Mathematics and Computer Science

Abstract

In this thesis, we propose an approximate optimization of an ant colony that depends on swarm intelligence, in order to solve one of the combinatorial optimization problems which is the multi-objective peddler problem, using the populationbased ant colony (PACO) algorithm, which uses a population in addition to a traditional pheromone matrix, after So we used PACO with Crowding Population Replacement Scheme in order to increase the efficiency and effectiveness of the research.

Description

Keywords

Approximate method, Ant Colony Optomization (ACO), Swarm Intelligence, Combinatorial Optimization, Traveling Salesman Problem,PACO algorithm, Crowding Replacement Schema.

Citation

Endorsement

Review

Supplemented By

Referenced By