A Basic Variable Neighborhood Search for the Planar Obnoxious Facility Location Problem.
Sérgio SalazarAbraham DuarteJ. Manuel ColmenarPublished in: MIC (1) (2024)
Keyphrases
- facility location problem
- variable neighborhood search
- facility location
- metaheuristic
- tabu search
- approximation algorithms
- traveling salesman problem
- heuristic methods
- routing problem
- single machine scheduling problem
- minimum spanning tree
- benchmark instances
- vehicle routing problem
- hybrid method
- integer programming
- search procedure
- path relinking
- np hard
- optimization problems
- mixed integer
- network design
- lagrangian relaxation
- solution quality
- ant colony optimization
- shortest path
- simulated annealing
- scheduling problem