Question

Objective function in Local Search , I don't seem to understand how to formulate it .

do i just write how i found the local\global minimum ?

Answer 1

Local Search is a heuistic method for solving computationally hard optimization problems. It can be used on problems that can be formulated as finding a solution maximizing criterion among a number of candidate solutions. Local search algorithm move from solution to solution in space of candidate solutions by applying local changes, until a solution deemend optimal is found or time bound is elapsed. It performs generic optimization of scalar functions. Therefore any local search algorithm is suitable to optimize the function. The local search algorithm starts from a randomly chosen complete instantiation and moves from one complete instantiation to the next. In its most greedy variant, ata each step the value of variable that leads to the grestest rduction of cost function is changed. The algorithm stops either when the cost is zero(a global minimum), in which case the problem is solved, or when there is no way to improve the current assignment by changing just one variable(a local minimum).