Package es.urjc.etsii.grafo.improve.ls

package es.urjc.etsii.grafo.improve.ls
  • Classes
    Class
    Description
    LocalSearch<M extends Move<S,I>,S extends Solution<S,I>,I extends Instance>
    Local search procedures start from a given feasible solution and explore a determined neighborhood in each iteration, replacing the current solution if a neighbor solution improves the objective function of the current one.
    LocalSearchBestImprovement<M extends Move<S,I>,S extends Solution<S,I>,I extends Instance>
    Local search procedures start from a given feasible solution and explore a determined neighborhood in each iteration, replacing the current solution if a neighbor solution improves the objective function of the current one.
    LocalSearchFirstImprovement<M extends Move<S,I>,S extends Solution<S,I>,I extends Instance>
    Local search procedures start from a given feasible solution and explore a determined neighborhood in each iteration, replacing the current solution if a neighbor solution improves the objective function of the current one.