Espanhol (pdf)
Artigo em XML
Referências do artigo
Tradução automática
Enviar este artigo por email
Permalink
VER CONTENIDO COMPLETO EN PDF
Serviços Personalizados
Journal
Artigo
Indicadores
-
Citado por SciELO -
Acessos
Links relacionados
-
Similares em
SciELO
Compartilhar
Revista de Matemática Teoría y Aplicaciones
versão impressa ISSN 1409-2433
Rev. Mat vol.25 no.1 San José Jan./Jun. 2018
http://dx.doi.org/10.15517/rmta.v1i25.32234
Artículos
Búsqueda tabú multiobjetivo con Enteros-mixtos y punto de referencia
Multiobjective tabu search with mixedIntegers and reference point
1Matemática Interdiciplinaria, ICIMAF, La Habana, Cuba. E-Mail: rbeau@icimaf.cu, rbeau3105@gmail.com
En este trabajo presentamos un enfoque de Búsqueda Tabú independiente del dominio para problemas con múltiples objetivos y variables mixtas (enteras y reales). En el mismo investigamos dos aspectos: la independencia del dominio y la aplicabilidad en la optimización práctica, para ello nos centramos en problemas que se encuentran frecuentemente en el mundo real, como son los problemas de redes logísticas (por ejemplo: problemas de redes de distribución con múltiples etapas, localización asignación, tablas de tiempo); también investigamos su desempeño sobre problemas clásicos como cubri-miento de conjuntos, particionamiento de conjunto, mochila multidimensional y camino más corto. Todos los problemas considerados son de la clase NP-duros, con gran número de variables, conteniendo un número de restricciones heterogéneas, presentando un reto para hallar soluciones factibles.
Palabras clave: múltiples objetivos; metaheurísticas; búsqueda tabú
In this work we present a domain-independent Tabu Search approach for multiobjective optimization with mixed-integer variables. In this we investigate two aspects: domain-independence and applicability in optimization practice and focus our attention in problems that appear frequently in the real world, like logistic network (for example: multi-stage distribution networks problems, location-allocation problems, time-tabling problems); however, other classical problems were investigated, like: coverage set problem, partitioning set problem, multidimentional knapsack problem and shortest path problem. All these problems belong to the NP-hard class, with a great number of decision variables, containing a great number of heterogeneous constrains, presenting a challenge to find feasible solutions.
Keywords: multiple objetives; metaheuristics; tabu search
Referencias
Balas, E.; Padberg, M. (1976) “Set partitioning: a survey´´, SIAM Review 18(4): 710-760. [ Links ]
Beausoleil, R.P. (2014) “Interactive multiobjective tabu/scatter search based on reference point´´, Revista de Matemática : Teoría y Aplicaciones 21(2): 261-282. [ Links ]
Campos, V.; Laguna, M.; Martí, R. (2005) “Context-independent scatter and tabu search for permutation problems´´, INFORMS Journal on Computing 17(1): 111-122. [ Links ]
Davis, E.W.; Patterson, J.H. (1975) “A comparison of heuristic and optimum solutions in resource constrained project scheduling´´, Management Science 21(8): 944-955. [ Links ]
Deb, K.; Sundar, J.; Bhaskara, U.; Chaudhuri, S. (2006) “Reference point based multi-objective optimization using evolutionary algorithms´´, International Journal of Computational Intelligence Research (IJCIR) 2(3): 273-286. [ Links ]
Elmaghraby, S.E.; Moder, J.J. (1977) Handbook of Operations Research. [ Links ]
Geoffrion, A.M.; Graves, G.W. (1974) “Multicommodity distribution system design by benders decomposition´´, Management Science 20(5): 822- 844. [ Links ]
Glover, F.; Laguna, M. (1997) “General purpose heuristics for integer programming part I", Journal of Heuristics 2(4): 343-358. [ Links ]
Greenwood, G.W.; Hu, X.S.; D’Ambrosio, J.G. (1997) “Fitness functions for multiple objective optimization problems: combining preferences with Pareto rankings", in: R.K. Belew & M.D. Vose (Eds.) Foundations of Genetic Algorithms, San Francisco: 437-455. [ Links ]
Hitchcock, F.L. (1941) “The distribution of a product from several sources to numerous localities", Studies in Applied Mathematics 20(1-4): 224-230. [ Links ]
Jaskiewicz, A. (2004) “A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the pareto memetic algorithm", Annals of Operation Research 131(1-4): 135-158. [ Links ]
Kelly, J.P.; Xu, J. (1999) “A set-partitioning-based heuristic for the vehicle routing problem", INFORMS Journal on Computing 11(2): 161-172. [ Links ]
Laguna, M.; Gortázar F.; Gallego, M.; Martí, R. (2014) “A black-box scatter search for optimization problems with integer variables", Journal of Global Optimization 58(3): 497-516. [ Links ]
Laguna, M.; Martí, R. (2003) The OptQuest Callable Library, in: S. Voss & D.L. Woodruff (Eds.) Optimization Software Class Libraries, Kluwer Academic Publishers, Boston: 193-218. [ Links ]
Michalewicz, Z. (1995) “A survey of constraint handling techniques in evolutionary computation methods", in: Proceedings of the 4th Annual Conference on Evolutionary Programming, MIT Press Cambridge MA, Estados Unidos: 135-155. [ Links ]
Mitsuo, G.; Runwei, G.; Lin, L. (2008) Network Models and Optimization: Multiobjective Genetic Algorithms Approach. Springer-Verlag London, Reino Unido. [ Links ]
Samed, M.M.A.; Ravagnani, M.A. da S.S. (2008) “Coevolutionary genetic algorithm to solve economic dispatch", in: P. Siarry & Z. Michalewicz (Eds.) Advances in Metaheuristics for Hard Optimization, Natural Computing Series, Springer Berlin Heidelberg: 317-327. [ Links ]
Smith, B.; Brailsford, S.; Hubbard, P.; Williams, H. (1996) “The progressive party problem: Integer linear programming and constraint programming compared", Constraints 1(1-2): 119-138. [ Links ]
Walser J.P. (1999) Integer Optimization by Local Search: A DomainIndependent Approach. Springer-Verlag Berlin Heidelberg, Alemania . [ Links ]
Wierzbicki, A.P. (1982) “A mathematical basis for satisficing decision making", Mathematical Modelling 3(5): 391-405. [ Links ]
Zitzler, E.; Laumanns, M. (2001) “Test problems for multiobjective optimizers“. Institute TIK, Swiss Federal Institute of Technology (ETH) Zurich, Switzerland. [ Links ]
Zitzler E.; Thiele, L. (1999) “Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach", IEEE Transactions on Evolutionary Computation 3(4): 257-271 [ Links ]
Recibido: 10 de Noviembre de 2016; Revisado: 22 de Septiembre de 2017; Aprobado: 17 de Octubre de 2017
Este es un artículo publicado en acceso abierto bajo una licencia Creative Commons
