A parallel variable neighborhood search approach for the obnoxious p -median problem

2018 ◽  
Vol 27 (1) ◽  
pp. 336-360 ◽  
Author(s):  
Alberto Herrán ◽  
José M. Colmenar ◽  
Rafael Martí ◽  
Abraham Duarte
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Median Problem ◽  
Search Approach

A Variable Neighborhood Search approach for the Hamiltonian p-median problem

2019 ◽  
Vol 80 ◽  
pp. 603-616 ◽  
Author(s):  
Alberto Herrán ◽  
J. Manuel Colmenar ◽  
Abraham Duarte
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Median Problem ◽  
Search Approach

scholarly journals Less is more approach: basic variable neighborhood search for the obnoxiousp-median problem

2019 ◽  
Vol 27 (1) ◽  
pp. 480-493 ◽  
Author(s):  
Nenad Mladenović ◽  
Abdulaziz Alkandari ◽  
Jun Pei ◽  
Raca Todosijević ◽  
Panos M. Pardalos
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Basic Variable ◽  
Median Problem ◽  
Less Is More

scholarly journals Optimizing Computer Networks Communication with the Band Collocation Problem: A Variable Neighborhood Search Approach

Electronics ◽  
2020 ◽  
Vol 9 (11) ◽  
pp. 1860
Author(s):  
Isaac Lozano-Osorio ◽  
Jesus Sanchez-Oro ◽  
Miguel Ángel Rodriguez-Garcia ◽  
Abraham Duarte
Keyword(s):  
Variable Neighborhood Search ◽  
Simulated Annealing Algorithm ◽  
Previous Method ◽  
Point Of View ◽  
Telecommunication Networks ◽  
Neighborhood Search ◽  
Neighborhood Structures ◽  
Bandpass Problem ◽  
Search Approach ◽  
The Cost

The Band Collocation Problem appears in the context of problems for optimizing telecommunication networks with the aim of solving some concerns related to the original Bandpass Problem and to present a more realistic approximation to be solved. This problem is interesting to optimize the cost of networks with several devices connected, such as networks with several embedded systems transmitting information among them. Despite the real-world applications of this problem, it has been mostly ignored from a heuristic point of view, with the Simulated Annealing algorithm being the best method found in the literature. In this work, three Variable Neighborhood Search (VNS) variants are presented, as well as three neighborhood structures and a novel optimization based on Least Recently Used cache, which allows the algorithm to perform an efficient evaluation of the objective function. The extensive experimental results section shows the superiority of the proposal with respect to the best previous method found in the state-of-the-art, emerging VNS as the most competitive method to deal with the Band Collocation Problem.

A modified variable neighborhood search for the discrete ordered median problem

2014 ◽  
Vol 234 (1) ◽  
pp. 61-76 ◽  
Author(s):  
Justo Puerto ◽  
Dionisio Pérez-Brito ◽  
Carlos G. García-González
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Median Problem ◽  
Ordered Median
Sign in / Sign up

Export Citation Format

Share Document