Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley It was first proposed in 1997 and has since then rapidly developed both in its methods and its applications In the present paper, these two aspects are thoroughly reviewed and an extensive bibliography is provided Moreover, one section is devoted to newcomers It consists of steps for developing a heuristic for any particular problem Those steps are common to the implementation of other metaheuristics

Variable neighbourhood search: methods and applications

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley. It was first proposed in 1997 and has since then rapidly developed both in its methods and its applications. In the present paper, these two aspects are thoroughly reviewed and an extensive bibliography is provided. Moreover, one section is devoted to newcomers. It consists of steps for developing a heuristic for any particular problem. Those steps are common to the implementation of other metaheuristics.

The p-median problem is a network problem that was originally designed for, and has been extensively applied to, facility location. In this bibliography, we summarize the literature on solution methods for the uncapacitated and capacitated p-median problem on a network. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 48(3), 125–142 2006

/pdf/solution-methods-for-the-p-median-problem-an-annotated-jln4xxve2m.pdf

Solution methods for the p-median problem: An annotated bibliography

Variable neighborhood search (VNS) is a metaheuristic, or framework for building heuristics, based upon systematic change of neighborhoods both in a decent phase to find a local minimum, and in a perturbation phase to get out of the corresponding valley. It was first proposed in 1997 and since has rapidly developed both in its methods and its applications. Both of these aspects are thouroughly reviewed and a large bibliography is given.

Variable Neighborhood Search: Methods and Applications

Variable neighborhood search for location routing

Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases

Maximum dynamic network flow interdiction problem: New formulation and solution procedures

A BSSS algorithm for the single facility location problem in two regions with different norms

This paper investigates a new variation in the continuous single facility location problem. Specifically, we address the problem of locating a new facility on a plane with different distance norms on different sides of a boundary line. Special cases and extensions of the problem, where there are more than two regions are also discussed. Finally, by investigating the properties of the models, efficient solution procedures are proposed.

Location Among Regions with Varying Norms

Every phone company customer in a given region receives phone services from a switching center through intermediate points called kavos. The problem addressed in this paper is where to locate this central facility and the kavos, how many of them and with what capacity, so that the total cable length is minimized. This problem can be formulated as a 0-1 mixed integer program; However, because of the scale of the problem, it is not possible to solve it in a reasonable amount of time with the existing software; Hence a solution procedure is developed which solves the problem very efficiently. In addition, to make the model more realistic, and to be able to take into account the decision maker’s preferences, an interactive program has been developed.

https://www.ije.ir/article_71335_cf4cab92f8724be843ac3ee100162825.pdf

H. Taghizadeh Kakhki

Papers

Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases

Maximum dynamic network flow interdiction problem: New formulation and solution procedures

A BSSS algorithm for the single facility location problem in two regions with different norms

Location Among Regions with Varying Norms

Allocation of Posts to a Tele-Communication Center Through Kavos (RESEARCH NOTE)