LAHC aplicado ao problema de escalonamento de múltiplos projetos com múltiplos modos e restrições de recursos.

Content Provider	Semantic Scholar
Author	Baltar, Davi D.
Copyright Year	2017
Abstract	This work addresses late acceptance hill climbing for the MMRCMPSP (Multi-Mode Resource Constrained Multi-Project Scheduling Problem). The problem seen above can be solved using Integer Programming (IP), constraint programming, heuristics, etc. This assignment was largely focused on heuristics; however some Integer Programming was also utilized. This study was focused on researching efficient methods for problem solving. In this case, 14 neighborhood were evaluated. For this purpose, the heuristics were manipulated by the algorithm Late Acceptance Hill-Climbing (LAHC) algorithm, which is an adaptation of the Hill-Climbing (HC) algorithm, in which it has a late acceptance hill climb. After several tests, we selected the best parameters to compose the input of the algorithm in question. To optimize improvements in code performance, a multi-threaded parallelization was also made, allowing more than one neighborhood to be executed at the same time, which brought the final results to a satisfactory level. With the methods used in this study, better results were obtained in relation to those found in other researches.
File Format	PDF HTM / HTML
Alternate Webpage(s)	https://www.monografias.ufop.br/bitstream/35400000/321/1/MONOGRAFIA_LAHCAplicadoProblema.pdf
Language	English
Access Restriction	Open
Content Type	Text
Resource Type	Article