A parallel variable neighborhood search approach for the obnoxious p-median problem.
Alberto HerranJosé Manuel ColmenarRafael MartíAbraham DuartePublished in: Int. Trans. Oper. Res. (2020)
Keyphrases
- variable neighborhood search
- metaheuristic
- traveling salesman problem
- tabu search
- heuristic methods
- single machine scheduling problem
- routing problem
- minimum spanning tree
- search procedure
- benchmark instances
- vehicle routing problem
- hybrid method
- path relinking
- parallel computing
- neural network
- particle swarm optimization
- computational complexity