Metaheuristics for dynamic combinatorial optimization problems

Abstract

Many real-world optimization problems are combinatorial optimization problems subject to dynamic environments. In such dynamic combinatorial optimization problems (DCOPs), the objective, decision variables and/or constraints may change over time, and so solving DCOPs is a challenging task. Metaheuristics are a good choice of tools to tackle DCOPs because… (More)

3 Figures and Tables

Topics

  • Presentations referencing similar topics