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

We want to solve fuzzy linear programming problems with fuzzy coefficients in the objective function using a new variable neighborhood search algorithm. In our proposed algorithm, the local search is defined based on descent directions.We make use...