Parallel Variable Neighborhood Search | Zendy

José Andrés Moreno Pérez | Zendy; Pierre Hansen | Zendy; Nenad Mladenović | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parallel Variable Neighborhood Search

Author(s) -

José Andrés Moreno Pérez,

Pierre Hansen,

Nenad Mladenović

Publication year - 2005

Publication title -

citeseer x (the pennsylvania state university)

Language(s) - English

Resource type - Book series

DOI - 10.1002/0471739383.ch11

Subject(s) - variable (mathematics) , variable neighborhood search , computer science , parallel computing , mathematics , algorithm , metaheuristic , mathematical analysis

Variable Neighborhood Search (VNS) is a recent and efiective 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 research of this author has been partially supported by the Spanish Ministry of Science and Technology through the project TIC2002-04242-C03-01; 70% of which are FEDER founds.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research