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...

The resource-constrained project scheduling problem is a notoriously difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms to find ...

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...

Disorders caused by deliberate sabotage and terrorist attacks have always been considered as a major threat by the governments. Hence, identifying and planning for strengthening of critical facilities have become a priority ...

. 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...