Class TSPTWSolution

java.lang.Object
es.urjc.etsii.grafo.solution.Solution<TSPTWSolution, TSPTWInstance>
es.urjc.etsii.grafo.tsptw.model.TSPTWSolution
public class TSPTWSolution extends Solution<TSPTWSolution, TSPTWInstance>

  • Constructor Details

  • Method Details

    • copy_from

      public void copy_from(TSPTWSolution solution)

    • cloneSolution

      public TSPTWSolution cloneSolution()
      Description copied from class: Solution
      Clone the current solution. Deep clone mutable data or you will regret it.
      Specified by:
      cloneSolution in class Solution<TSPTWSolution, TSPTWInstance>
      Returns:
      A deep clone of the current solution

    • clone_solution

      public TSPTWSolution clone_solution()

    • getScore

      public double getScore()

    • toString

      public String toString()
      Description copied from class: Solution
      Resume this solution Generate a toString method using your IDE
      Specified by:
      toString in class Solution<TSPTWSolution, TSPTWInstance>
      Returns:
      string representation of the current solution

    • cost

      public double cost()

    • better_than

      public boolean better_than(TSPTWSolution other)

    • constraint_violations

      public int constraint_violations()

    • add

      public void add(int current, int node)

    • add

      public void add(int[] p)

    • assert_solution

      public void assert_solution()

    • check_solution

      public boolean check_solution()

    • is_a_permutation

      public boolean is_a_permutation(List<Integer> permutation)

    • swap

      public void swap(int k)

    • is_feasible_swap

      public boolean is_feasible_swap(int k, int[] first_m)

    • delta_swap

      public double delta_swap(int k)

    • do_swap

      public double do_swap(int k)

    • do_feasible_swap

      public boolean do_feasible_swap(int k, double[] deltaCost, int[] firstM)

    • insertion_move

      public void insertion_move(int k, int i, int d)

    • infeasible_move

      public boolean infeasible_move(int initial, int end)

    • localsearch_insertion

      public TSPTWSolution localsearch_insertion(boolean first_improvement)

    • insertion_is_feasible

      public boolean insertion_is_feasible(int from, int to)

    • shuffle_1shift_feasible_nodes

      public void shuffle_1shift_feasible_nodes(List<Integer> v)

    • feasible_1shift_first

      public boolean feasible_1shift_first()

    • ls_feasibility_1shift_first

      public boolean ls_feasibility_1shift_first()

    • feasibility_1shift_first_code

      public boolean feasibility_1shift_first_code()

    • feasibility_1shift_first_paper

      public boolean feasibility_1shift_first_paper()

    • backward_violated

      public boolean backward_violated(boolean[] improved)

    • forward_nonviolated

      public boolean forward_nonviolated(boolean[] improved)

    • forward_violated

      public boolean forward_violated(boolean[] improved)

    • backward_nonviolated

      public boolean backward_nonviolated(boolean[] improved)

    • compute_feas_set

      public void compute_feas_set(List<Integer> feas)

    • compute_infeas_set

      public void compute_infeas_set(List<Integer> infeas)

    • infeasibility

      public double infeasibility()

    • feasibility_1shift_first

      public boolean feasibility_1shift_first()

    • two_opt_is_infeasible

      public int two_opt_is_infeasible(int h1, int h3)

    • two_opt_move

      public void two_opt_move(int h1, int h3)

    • two_opt_first

      public boolean two_opt_first()

    • localsearch_2opt_first

      public TSPTWSolution localsearch_2opt_first()

    • full_eval

      public void full_eval()

    • perturb_1shift_feasible

      public void perturb_1shift_feasible(int level)

    • perturb_1shift

      public void perturb_1shift(int level)

    • reinsert

      public static <T> void reinsert(List<T> v, T element, int from, int to)

    • reinsert

      public static <T> void reinsert(List<T> v, int from, int to)

    • generate_vector

      public static List<Integer> generate_vector(int size)