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

dc.contributor.author	HARADJ, Ahlem
dc.contributor.author	SADAOUI, Amira
dc.date.accessioned	2022-11-03T09:33:32Z
dc.date.available	2022-11-03T09:33:32Z
dc.date.issued	2022-09-19
dc.identifier.issn	MTM/318
dc.identifier.uri	https://dspace.univ-bba.dz:443/xmlui/handle/123456789/2259
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	Université de Bordj Bou Arreridj Faculty of Mathematics and Computer Science	en_US
dc.subject	Approximate method, Ant Colony Optomization (ACO), Swarm Intelligence, Combinatorial Optimization, Traveling Salesman Problem,PACO algorithm, Crowding Replacement Schema.	en_US
dc.title	Crowding Population-based Ant Colony Optimization for the Multi-objective Traveling Salesman Problem	en_US
dc.type	Thesis	en_US