Hybridizations of GRASP with path relinking for the far from most string problem
Year of publication: |
May 2016
|
---|---|
Authors: | Ferone, Daniele ; Festa, Paola ; Resende, Mauricio G. C. |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 23.2016, 3, p. 481-506
|
Subject: | string problems | consensus problems | combinatorial optimization | hybrid metaheuristics | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics |
-
Integrated timetabling and vehicle scheduling with balanced departure times
Schmid, Verena, (2015)
-
A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem
Paes, Frederico Galaxe, (2017)
-
Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
Alvarez-Valdes, Ramon, (2015)
- More ...
-
Efficient GRASP solution approach for the prisoner transportation problem
Ferone, Daniele, (2023)
-
A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
Ferone, Daniele, (2019)
-
Enhancing and extending the classical GRASP framework with biased randomisation and simulation
Ferone, Daniele, (2019)
- More ...