Solving the planar p-median problem by variable neighborhood and concentric searches
نویسندگان
چکیده
منابع مشابه
Solving Capacitated P-Median Problem by Hybrid K-Means Clustering and Fixed Neighborhood Search algorithm
Capacitated P-median problem (CPMP) is one of the popular discrete location problems. CPMP locates P facilities between the candidate points, in order to satisfy the customer demand. This problem is a NP-hard problem. In this paper, a new hybrid algorithm is proposed to solve CPMP. In proposed method, K-means clustering algorithm will find a proper solution for Fixed Neighborhood Search algorit...
متن کاملParallel Variable Neighborhood Searches
Variable Neighborhood Search (VNS) is a recent and effective metaheuristic for solving combinatorial and global optimization problems. It is capable of escaping from the local optima by systematic changes of the neighborhood structures within the search. In this paper several parallelization strategies for VNS have been proposed and compared on the large instances of the p-median problem. ∗The ...
متن کاملThe Parallel Variable Neighborhood Search for the <Emphasis Type="Italic">p</Emphasis>-Median Problem
The Variable Neighborhood Search (VNS) is a recent metaheuristic that combines series of random and improving local searches based on systematically changed neighborhoods. When a local minimum is reached, a shake procedure performs a random search. This determines a new starting point for running an improving search. The use of interchange moves provides a simple implementation of the VNS algor...
متن کاملLarge Neighborhood Search for the P-median Problem
In this paper we consider the well known p-median problem. We study the behavior of the local improvement algorithm with a new large neighborhood. Computational experiments on the difficult instances show that the algorithm with the neighborhood is fast and finds feasible solutions with small relative error.
متن کاملSolving the p-Center problem with Tabu Search and Variable Neighborhood Search
The p-Center problem consists of locating p facilities and assigning clients to them in order to minimize the maximum distance between a client and the facility to which he or she is allocated. In this paper, we present a basic Variable Neighborhood Search and two Tabu Search heuristics for the p-Center problem without the triangle inequality. Both proposed methods use the 1-interchange (or ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2014
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-014-0183-1