Meta-Heuristic Algorithm based on Ant Colony Optimization Algorithm , Tabu Search and Project Scheduling Problem (PSP) for the Traveling Salesman Problem

Fuente: Redalyc

Salvato in:

Dettagli Bibliografici
Autore principale:	Alejandro Fuentes-Penna
Natura:	Artículo científico
Lingua:	en
Pubblicazione:	International Journal of Combinatorial Optimization Problems and Informatics 2014
Soggetti:	Computación Tabu Search Ant Colony Optimization Project Scheduling Problem Travelin g Salesman Problem
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

An ACO approach for the Parallel Machines Scheduling Problem
di: Claudia Ruth Gatica
Pubblicazione: (2010)

Structural and Landscape Analysis for the Robust Capacitated International Sourcing Problem (RoCIS)
di: Héctor Joaquín Fraire Huacuja
Pubblicazione: (2010)

A Self-Adaptive Ant Colony System for Semantic Query Routing Problem in P2P Networks
di: Claudia Gómez Santillán
Pubblicazione: (2010)

An algorithm based on granular tabu search for the problem of balancing public bikes by using multiple vehicles
di: Rodrigo Linfati
Pubblicazione: (2014)

A Many-objective Ant Colony Optimizationapplied to the Traveling Salesman Problem
di: Francisco Riveros
Pubblicazione: (2016)

Project Management for Farm Production
di: Alejandro Fuentes-Penna
Pubblicazione: (2017)

Grafos hamiltonianos aplicado al turismo de Panamá.
di: Julio Enrique Trujillo González
Pubblicazione: (2019)

Un algoritmo metaheurístico híbrido para el problema de localización y ruteo con restricciones de capacidad
di: John Willmer Escobar
Pubblicazione: (2015)

Construction of an Optimal Solution for a Real-World Routing-Scheduling-Loading Problem
di: Juan Javier González Barbosa
Pubblicazione: (2010)

Statistical distributions of quasi-optimal paths in the traveling salesman problem: the role of the initial distribution of cities
di: H. Hernández-Saldaña
Pubblicazione: (2012)

Enhanced Differential Evolution Based on Adaptive Mutation and Wrapper Local Search Strategies for Global Optimization Problems
di: Chun-Liang Lu
Pubblicazione: (2014)

Combined Mutation Operators of Genetic Algorithm for the Travelling Salesman problem
di: Kusum Deep
Pubblicazione: (2011)

The Hybrid ColorAnt-RT Algorithms and an Application to Register Allocation
di: Carla Negri Lintzmayer
Pubblicazione: (2015)

Optimización con múltiples objetivos utilizando Tabú Search
di: Pedro Albor
Pubblicazione: (2005)

Hybrid GRASP with Composite Local Search And Path-Relinking for the Linear Ordering Problem with Cumulative Costs
di: David Terán Villanueva
Pubblicazione: (2012)

A Study of Rescheduling Strategies for the Quay Crane Scheduling Problem under Random Disruptions
di: Christopher Expósito-Izquierdo
Pubblicazione: (2014)

A Polynomial-Time Heuristic for the Travelling Salesman Problem Verified Against Held-Karp
di: Aggarwal, Minakshi
Pubblicazione: (2025)

Geometric based heuristic TSP
di: ben abdessalem, maher
Pubblicazione: (2025)

LG-PACKAGE: New Frontier
di: Boris Stilman
Pubblicazione: (2010)

A Meta-Optimization Approach to Solve the Set Covering Problem
di: Broderick Crawford
Pubblicazione: (2018)

Oil Platform Transport Problem (OPTP) is NP-hard
di: Ocotlán Díaz-Parra
Pubblicazione: (2017)

Software Engineering applied to Manufacturing Problems
di: Jorge A. Ruiz-Vanoye
Pubblicazione: (2010)

Identification of Problems in Search Strategies in Cochrane Reviews
di: Franco, Juan Víctor Ariel, et al.
Pubblicazione: (2018)

School Library Scheduling: Problems and Solutions.
di: Hutchinson, Barbara
Pubblicazione: (1986)

Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms
di: Ana Maria Rodrigues
Pubblicazione: (2012)

Bounded variables nonlinear multiple criteria optimization using scatter search
di: Ricardo P. Beausoleil
Pubblicazione: (2004)

A Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem
di: Kenan KARAGUL
Pubblicazione: (2014)

School Bus Routing Problem Library-SBRPLIB
di: Ocotlán Díaz-Parra
Pubblicazione: (2011)

Experiences in Learning Problem-Solving through Computational Thinking
di: Jacqueline M. Fernández
Pubblicazione: (2018)

A Statistical comparative analysis of Simulated Annealing and Variable Neighborhood Search for the Geographic Clustering Problem
di: Beatriz Bernábe Loranca
Pubblicazione: (2011)

A Parallel Nash Genetic Algorithm for the 3D Orthogonal Knapsack Problem
di: Daniel Soto
Pubblicazione: (2013)

Desarrollo de una Herramienta para la Minimización de Tardanza Total en Ambientes JOB SHOP Apoyada en Búsqueda Tabú
di: Elkin Rodríguez Velásquez
Pubblicazione: (2006)

Optimizing Constrained Problems through a T-Cell Artificial Immune System
di: Victoria S. Aragón
Pubblicazione: (2008)

Enrutamiento y secuenciación óptimos en un Flexible Job Shop multiobjetivo mediante algoritmos genéticos
di: Guillermo Tejada Muñoz
Pubblicazione: (2016)

Evaluating simple metaheuristics for the Generalized Steiner Problem
di: Sergio Nesmachnow
Pubblicazione: (2005)

Considerations on Applying Cross Entropy Methods to the Vehicle Routing Problem
di: Marta Cabo
Pubblicazione: (2015)

Branch and Bound Algorithm for the Heterogeneous Computing Scheduling Multi-Objective Problem
di: J. Carlos Soto-Monterrubio
Pubblicazione: (2016)

COMPARING MIXED & INTEGER PROGRAMMING VS. CONSTRAINT PROGRAMMING BY SOLVING JOB-SHOP SCHEDULING PROBLEMS
di: Renata Melo e Silva de Oliveira
Pubblicazione: (2015)

Discovering Hidden Analogies in an Online Humanities Database.
di: Cory, Kenneth A.
Pubblicazione: (1999)

Adaptive Memory Procedure to solve the Profitable Arc Tour Problem
di: Jalel Euchi
Pubblicazione: (2010)