Metaheuristic ILS with path relinking for the number partitioning problem
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...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2017 |
| País: | Brasil |
| Institución: | Instituto Federal de Educação, Ciência e Tecnologia de São Paulo (IFSP) |
| Repositorio: | Independent Journal of Management & Production |
| Idioma: | inglés |
| OAI Identifier: | oai:www.ijmp.jor.br:article/597 |
| Acceso en línea: | http://www.ijmp.jor.br/index.php/ijmp/article/view/597 |
| Access Level: | acceso abierto |
| Palabra clave: | Number Partitioning Problem NPP metaheuristics path relinking combinatorial Optimization |
| Sumario: | 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. |
|---|