Optimización basada en colonias de hormigas: una aplicación a la distribución de sobres

El presente trabajo propone un método de distribución de sobres basado en el conocido problema de la literatura, el MTSP - Multiple Traveling Salesman Problem. Se propone una solución para una empresa Paraguaya distribuidora de extractos bancarios. Se consideran 4 objetivos principales: (1) minim...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Ojeda, Adrián, Barán, Benjamín, Kuna, Horacio Daniel
Formato:	Objeto de conferencia
Lenguaje:	Español
Publicado:	2015
Materias:	Ciencias Informáticas Problem Solving, Control Methods, and Search multiple traveling salesman problem Optimization optimización multi-objetivo ant colony optimization
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/53452
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

A Many-objective Ant Colony Optimization applied to the Traveling Salesman Problem
por: Riveros, Francisco, et al.
Publicado: (2016)

Global convexity in the bi-criteria Traveling Salesman problem
por: Barán, Benjamín, et al.
Publicado: (2006)

Learning classifier systems for optimisation problems: A case study on fractal travelling salesman problem
por: Tabacman, M., et al.

Learning classifier systems for optimisation problems: A case study on fractal travelling salesman problem
por: Tabacman, Maximiliano, et al.
Publicado: (2008)

Optimización multi-objetivo : Aplicaciones a problemas del mundo real
por: López, Javier
Publicado: (2015)

Algorithms for the on-line travelling salesman
por: Ausiello, G., et al.

Algorithms for the on-line travelling salesman
Publicado: (2001)

Facets and valid inequalities for the time-dependent travelling salesman problem
por: Miranda-Bront, J.J., et al.

Facets and valid inequalities for the time-dependent travelling salesman problem
por: Miranda Bront, Juan José, et al.
Publicado: (2014)

Solving the Traveling Salesman Problem with release dates via branch and cut
por: Miranda Bront, Juan José, et al.
Publicado: (2023)

Metaheurísticas Multinivel para la Resolución del Set Covering Problem
por: Valenzuela, Claudio, et al.
Publicado: (2011)

Optimización multiobjetivo difusa mediante enjambre de partículas aplicada al problema del próximo lanzamiento
por: Casanova Pietroboni, Carlos Antonio, et al.
Publicado: (2020)

The ant colony metaphor in continuous spaces using boundary search
por: Leguizamón, Guillermo
Publicado: (2003)

Extensión de algoritmos ACO usando conceptos de Tabu Search
por: Arito, Franco, et al.
Publicado: (2009)

Optimización dinámica /
por: Cerdá Tena, Emilio
Publicado: (2001)

The ant colony metaphor for multiple knapsack problem
por: Cena, Marcelo Guillermo, et al.
Publicado: (2000)

4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clusters
por: Sanz, Victoria María, et al.
Publicado: (2009)

Multi-objective optimization with a Gaussian PSO algorithm
por: Esquivel, Susana Cecilia, et al.
Publicado: (2008)

Regularity of the free boundary in an optimization problem related to the best sobolev trace constant
por: Bonder, J.F., et al.

Regularity of the free boundary in an optimization problem related to the best sobolev trace constant
por: Rossi, Julio Daniel, et al.
Publicado: (2006)

Fuzzy bi-objective particle swarm optimization for next release poblem
por: Casanova Pietroboni, Carlos Antonio, et al.
Publicado: (2020)

Adapting PALS to solve VRP with Time Windows
por: Bermúdez, Carlos, et al.
Publicado: (2023)

DE with Random Vector based Mutatiton for High Dimensional Problems
por: Hernández, Sebastián, et al.
Publicado: (2019)

An ant system for the maximum independent set problem
por: Leguizamón, Guillermo, et al.
Publicado: (2001)

An ACO model for a non-stationary formulation of the single elevator problem
por: Molina, Silvia, et al.
Publicado: (2007)

An ant colony optimization algorithm for job shop scheduling problem
por: Flórez, Edson, et al.
Publicado: (2013)

Solving hard multiobjective problems with a hybridized method
por: Cagnina, Leticia, et al.
Publicado: (2009)

A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
por: Kulich, M., et al.

A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
por: Miranda Bront, Juan José
Publicado: (2017)

Optimal design techniques for distributed parameter systems
por: Banks, H.T., et al.

Optimal design techniques for distributed parameter systems
Publicado: (2013)

Solving motion planning problems
por: Pereira, André Grahl, et al.
Publicado: (2014)

A new metaheuristic and its application to the Steiner problems in graphs
por: Urrutia, S., et al.

A new metaheuristic and its application to the Steiner problems in graphs
por: Urrutia, Sebastián, et al.
Publicado: (2001)

An integer programming approach for the time-dependent traveling salesman problem with time windows
por: Montero, A., et al.

An integer programming approach for the time-dependent traveling salesman problem with time windows
Publicado: (2017)

An improved ant colony algorithm for the job shop scheduling problem
por: Leguizamón, Guillermo, et al.
Publicado: (2002)

Current applications of ant systems for subset problems
por: Leguizamón, Guillermo
Publicado: (2000)

New ACO algorithm for image edge detection
por: Martínez, C.A., et al.

New ACO algorithm for image edge detection
Publicado: (2014)