Metaheuristic ILS with path relinking for the number partitioning problem

• Autores: Carlos Augusto de Souza Oliveira, William de Paula Ferreira, Reinaldo Carlos Mendes, Gleisson de Assis, Marcone Jamilson Freitas Souza
• Localización: Independent Journal of Management & Production, ISSN-e 2236-269X, Vol. 8, Nº. Extra 5, 2017 (Ejemplar dedicado a: Independent Journal of Management & Production (Special Edition)), págs. 767-779
• Idioma: inglés
• DOI: 10.14807/ijmp.v8i5.597
• Enlaces
  • Texto completo (pdf)
• Resumen

  • This study brings an implementation of a metaheuristic procedure to solve the Number Partitioning Problem (NPP), which is a classic NP-hard combinatorial optimization problem. The presented problem has applications in different areas, such as: logistics, production and operations management, besides important relationships with other combinatorial problems. This paper aims to perform a comparative analysis between the proposed algorithm with others metaheuristics using a group of instances available on the literature. Implementations of constructive heuristics, local search and metaheuristics ILS with path relinking as mechanism of intensification and diversification were made in order to improve solutions, surpassing the others algorithms.

• Referencias bibliográficas
  • ARAGON, C. R.; JOHNSON, D.; MCGEOCH, L.; SCHEVON, C. (1991) Optimization by simulated annealing: An experimental evaluation; part ii, graph...
  • ARGÜELLO, M. F.; FEO, T. A.; GOLDSCHMIDT, O. (1996) Randomized methods for the number partitioning problem. Computers & Operations Research,...
  • BERRETTA, R.; MOSCATO, P. (1999) The number partitioning problem: an open challenge for evolutionary computation? In New ideas in optimization....
  • CITESEER. KARP, R. M. (1972) Reducibility among combinatorial problems. Springer.
  • COOK, S. A. (1971) The complexity of theorem-proving procedures. In Proceedings of the third annual ACM symposium on Theory of computing,...
  • ARAUJO, S. A.; CONSTANTINO, A. A.; MENDONÇA NETO, C. F. X. (2004) Meta-heurísticaspara o problema de partição de números. XXXVI – SBPO. São...
  • DIAZ, A.; GLOVER, F.; GHAZIRI, H.; GONZÁLEZ, J.; LAGUNA, M.; MOSCATO, P.; AND TSENG, F. (1996) Optimización heurıstica y redes neuronales....
  • DUCHA, F. A.; DE SOUZA, S. R. (2013) Algorithms analysis for the number partition problem. XXXIV CILAMCE.
  • DUCHA, F. A. (2014) Algoritmos e modelos para solução do problema de partição de números. Dissertation (Master in Mathematical and Computational...
  • GAREY, M. R.; JOHNSON, D. S. (1979) Computers and intractability: a guide to the theory of np-completeness. San Francisco, LA: Freeman.
  • GENT, I. P.; WALSH, T. (1995) The number partition phase transition. Department of Computer Science, University of Strathclyde.
  • H. W. CORLEY; ROBERTA JR., S. D. (1972) A Partitioning Problem with Applications in Regional Design. Operations Research, v. 20, n. 5 (Sep....
  • HOFFMAN, K.; PADBERG, M. (2008) Set covering, packing and partitioning problems Set Covering, Packing and Partitioning Problems. Encyclopedia...
  • LARSEN J. Set Partitioning and Applications. Available at: http://www2.imm.dtu.dk/courses/02735/sppintro.pdf. Access: 09/10/2016.
  • MACDONALD, P. (1976) Combinatorial Programming: Methods and Applications. Journal of the Operational Research Society, v. 27, n. 3, p. 640-640.
  • PEDROSO, J. P.; KUBO, M. (2010) Heuristics and exact methods for number partitioning. European Journal of Operational Research, v. 202, n....
  • PERCUS, A.; ISTRATE, G.; MOORE, C. (2006) Computational complexity and statistical physics. Oxford University Press..
  • STADLER, P. F.; HORDIJK, W.; FONTANARI, J. F. (2003) Phase transition and landscape statistics of the number partitioning problem. Physical...