Journal ArticleDOI
Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases
Reads0
Chats0
TLDR
In this article, the p-median problem with positive and negative weights has been introduced by Burkard and Krarup [Computing 60 (1998) 193] and discussed some special cases of this problem on trees and proposed a variable neighborhood search procedure for general networks.About:
This article is published in European Journal of Operational Research.The article was published on 2006-04-16. It has received 31 citations till now. The article focuses on the topics: Tabu search & Variable neighborhood search.read more
Citations
More filters
Journal ArticleDOI
Variable neighbourhood search: methods and applications
TL;DR: 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 as mentioned in this paper.
Journal ArticleDOI
Variable neighbourhood search: methods and applications
TL;DR: Variable neighbourhood search 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.
Journal IssueDOI
Solution methods for the p-median problem: An annotated bibliography
TL;DR: This bibliography summarizes the literature on solution methods for the uncapacitated and capacitated p-median problem on a network.
Variable Neighborhood Search: Methods and Applications
TL;DR: 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.
Journal ArticleDOI
Variable neighborhood search for location routing
TL;DR: This paper proposes various neighborhood search heuristics (VNS) for solving the location routing problem with multiple capacitated depots and one uncapacitated vehicle per depot, and proposes five neighborhood structures which are either of routing or location type.
References
More filters
Journal ArticleDOI
Variable neighborhood search: Principles and applications
Pierre Hansen,Nenad Mladenović +1 more
TL;DR: In this article, a simple and effective metaheuristic for combinatorial and global optimization, called variable neighborhood search (VNS), is presented, which can easily be implemented using any local search algorithm as a subroutine.
Journal ArticleDOI
An Algorithmic Approach to Network Location Problems. II: The p-Medians
O. Kariv,S. L. Hakimi +1 more
TL;DR: An algorithm is presented which finds a p-median of a tree (for $p > 1$) in time $O(n^2 \cdot p^2 )$.
Book
Facility location : applications and theory
Zvi Drezner,Horst W. Hamacher +1 more
TL;DR: The Weber Problem, a study of location problems in the public sector, and an Efficient Genetic Algorithm for the p-Median Problem, provide insights into the design of location models.