Decomposition based hybrid metaheuristics

  title={Decomposition based hybrid metaheuristics},
  author={G{\"u}nther R. Raidl},
  journal={European Journal of Operational Research},
Difficult combinatorial optimization problems coming from practice are nowadays often approached by hybrid metaheuristics that combine principles of classical metaheuristic techniques with advanced methods from fields like mathematical programming, dynamic programming, and constraint programming. If designed appropriately, such hybrids frequently outperform simpler “pure” approaches as they are able to exploit the underlying methods’ individual advantages and benefit from synergy. This article… CONTINUE READING