METAHEURISTIC ILS WITH PATH RELINKING FOR THE NUMBER PARTITIONING PROBLEM
Fuente:
Redalyc
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artículo científico |
| Lingua: | en |
| Pubblicazione: |
Instituto Federal de Educação, Ciência e Tecnologia de São Paulo
2017
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1876455960688459776 |
|---|---|
| author | Cesar Augusto Souza de Oliveira |
| author_facet | Cesar Augusto Souza de Oliveira |
| contents | METAHEURISTIC ILS WITH PATH RELINKING FOR THE NUMBER PARTITIONING PROBLEM Cesar Augusto Souza de Oliveira William de Paula Ferreira Reinaldo Carlos Mendes Gleisson de Assis Marcone Jamilson Freitas Souza Administración y Contabilidad npp metaheuristics path relinking combinatorial optimization 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 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. 2017 artículo científico 2236-269X https://www.redalyc.org/articulo.oa?id=449551667012 en http://www.redalyc.org/revista.oa?id=4495 Independent Journal of Management & Production application/pdf Instituto Federal de Educação, Ciência e Tecnologia de São Paulo Independent Journal of Management & Production (Brasil) Num.5 Vol.8 |
| format | Artículo científico |
| id | redalyc_449551667012 |
| institution | Redalyc |
| language | en |
| publishDate | 2017 |
| publisher | Instituto Federal de Educação, Ciência e Tecnologia de São Paulo |
| spellingShingle | METAHEURISTIC ILS WITH PATH RELINKING FOR THE NUMBER PARTITIONING PROBLEM Cesar Augusto Souza de Oliveira Administración y Contabilidad npp metaheuristics path relinking combinatorial optimization Number partitioning problem METAHEURISTIC ILS WITH PATH RELINKING FOR THE NUMBER PARTITIONING PROBLEM Cesar Augusto Souza de Oliveira William de Paula Ferreira Reinaldo Carlos Mendes Gleisson de Assis Marcone Jamilson Freitas Souza Administración y Contabilidad npp metaheuristics path relinking combinatorial optimization 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 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. 2017 artículo científico 2236-269X https://www.redalyc.org/articulo.oa?id=449551667012 en http://www.redalyc.org/revista.oa?id=4495 Independent Journal of Management & Production application/pdf Instituto Federal de Educação, Ciência e Tecnologia de São Paulo Independent Journal of Management & Production (Brasil) Num.5 Vol.8 |
| title | METAHEURISTIC ILS WITH PATH RELINKING FOR THE NUMBER PARTITIONING PROBLEM |
| topic | Administración y Contabilidad npp metaheuristics path relinking combinatorial optimization Number partitioning problem |
| url | https://www.redalyc.org/articulo.oa?id=449551667012 |