Costa, Daniel An evolutionary tabu search algorithm and the NHL scheduling problem. (English) Zbl 0833.90095 INFOR 33, No. 3, 161-178 (1995). Summary: We present a new evolutionary procedure for solving general optimization problems that combines efficiently the mechanisms of genetic algorithms and tabu search. In order to explore the solution space properly interaction phases are interspersed with periods of optimization in the algorithm. An adaptation of this search principle to the National Hockey League (NHL) problem is discussed. The hybrid method developed in this paper is well suited for Open Shop Scheduling problems (OSSP). The results obtained appear to be quite satisfactory. Cited in 24 Documents MSC: 90C27 Combinatorial optimization 90B35 Deterministic scheduling theory in operations research 92D15 Problems related to evolution 90C90 Applications of mathematical programming Keywords:open shop scheduling; evolutionary procedure; genetic algorithms; tabu search PDF BibTeX XML Cite \textit{D. Costa}, INFOR 33, No. 3, 161--178 (1995; Zbl 0833.90095) Full Text: DOI OpenURL