Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Very large-scale neighborhood search"”.

  1. Cyclic exchange and related neighborhood structures for combinatorial optimization problems

    In this thesis, we concentrate on neighborhood search algorithms based on very large-scale neighborhood structures. The thesis consists of three parts. In the first part, we develop a cyclic exchange neighborhood search based approach for partitioning problems. A partitioning problem is to divide a …

    mit Repository record for Cyclic exchange and related neighborhood structures for combinatorial optimization problems (opens in a new tab)

  2. Studies on optimization problems with dynamically arriving information

    … be integrated on-the-fly into decision-making. Research produced online algorithms ranging from myopic reoptimization (Reopt) to learning-based anticipation methods. However, given the complexity of real-world problems, optimal decision policies remain unknown, and effectiveness is often assessed …

    passau-thes Repository record for Studies on optimization problems with dynamically arriving information (opens in a new tab)