| Full text | |
| Author(s): |
Dias Frinhani, Rafael de Magalhaes
[1]
;
Moreira de Carvalho, Marco Antonio
[2]
;
Soma, Nei Yoshihiro
[3]
Total Authors: 3
|
| Affiliation: | [1] Univ Fed Itajuba, Math & Comp Sci Inst, BR-37500903 Itajuba, MG - Brazil
[2] Univ Fed Ouro Preto, Comp Sci Dept, BR-35400000 Ouro Preto, MG - Brazil
[3] Technol Inst Aeronaut, Comp Sci Div, BR-12228900 Sao Jose Dos Campos, SP - Brazil
Total Affiliations: 3
|
| Document type: | Journal article |
| Source: | PLoS One; v. 13, n. 8 AUG 30 2018. |
| Web of Science Citations: | 0 |
| Abstract | |
The minimization of open stacks problem (MOSP) aims to determine the ideal production sequence to optimize the occupation of physical space in manufacturing settings. Most of current methods for solving the MOSP were not designed to work with large instances, precluding their use in specific cases of similar modeling problems. We therefore propose a PageRank-based heuristic to solve large instances modeled in graphs. In computational experiments, both data from the literature and new datasets up to 25 times fold larger in input size than current datasets, totaling 1330 instances, were analyzed to compare the proposed heuristic with state-of-the-art methods. The results showed the competitiveness of the proposed heuristic in terms of quality, as it found optimal solutions in several cases, and in terms of shorter run times compared with the fastest available method. Furthermore, based on specific graph densities, we found that the difference in the value of solutions between methods was small, thus justifying the use of the fastest method. The proposed heuristic is scalable and is more affected by graph density than by size. (AU) | |
| FAPESP's process: | 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings |
| Grantee: | Reinaldo Morabito Neto |
| Support Opportunities: | Research Projects - Thematic Grants |