Sistema multi-tipos de colonias de hormigas para la solución del problema de múltiples agentes vendedores
El problema de los múltiples viajeros vendedores (Multiple Traveling Salesman Problem, mTSP) es una extensión del bien conocido problema del viajero vendedor (Traveling Salesman Problem, TSP), en dicha extensión se puede utilizar más de un vendedor con la finalidad de visitar un conjunto de ciudades...
Main Authors: | Yasel José Costa Salas, René Abreu Ledón, Norge Isaías Coello Machado, Ann Nowé |
---|---|
Format: | Article |
Language: | English |
Published: |
Universidad del Zulia
|
Series: | Revista Técnica de la Facultad de Ingeniería |
Subjects: | |
Online Access: | http://www.scielo.org.ve/scielo.php?script=sci_arttext&pid=S0254-07702012000300012&lng=en&tlng=en |
Similar Items
-
Experimental Analysis of Ant System on Travelling Salesman Problem Dataset TSPLIB
by: Kalaipriyan Thirugnanasambandam, et al.
Published: (2019-08-01) -
An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets
by: Furqan Hussain Essani, et al.
Published: (2018-09-01) -
Evaluating pheromone intensities and 2-opt local search for the Ant System applied to the Dynamic Travelling Salesman Problem
by: Svensson, Erik R., et al.
Published: (2017) -
Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem
by: Fadl Dahan, et al.
Published: (2019-04-01) -
Improvement of Traveling Salesman Problem Solution Using Hybrid Algorithm Based on Best-Worst Ant System and Particle Swarm Optimization
by: Muhammad Salman Qamar, et al.
Published: (2021-05-01)