In this paper, a two-phase algorithm, namely IVNS, is proposed for solving nonlinear optimal control problems. In each phase of the algorithm, we use a variable neighborhood search (VNS), which performs a uniform distribution in the shaking step...

as an integer linear programming model and develop a metaheuristic based on the generalized variable neighborhood search algorithm to solve it. The computational experiments based upon available test instances in the literature suggest that our algorithm...

In this paper we introduce the Generalized Covering Salesman Problem. A Variable Neighborhood Search Algorithm has been applied to solve the problem....

-based mathematical models and two metaheuristic algorithms including memetic algorithm and a variable neighborhood search for the problem. Computational tests on a set of randomly generated instances and on set of benchmark data indicate the effectiveness...

. The problem is a generalization of the Traveling Salesman Problem, hence it is NP-hard. We present a new heuristic approach based on a Variable Neighborhood Search (VNS), that incorporates an Integer Linear Programming (ILP) based improvement procedure...

disruption. We used CPLEX solver to solve this model in the exact way. Since this model is non-linear, solving it in the exact way need a lot of computational effort. We proposed a greedy approach and a variable neighborhood search (VNS) algorithm to obtain...

Here, we propose a hybrid metaheuristic algorithm based on genetic

algorithm and variable neighborhood search for solving uncapacitated

facility location problem which is one of the most important problem in the...

Problems of global optimization naturally arise in many applications.

We present two new metaheuristic algorithms that are hybridization of

genetic algorithm and variable neighborhood search for finding a global optimum

of a...