Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases.
Jafar FathaliHossein Taghizadeh KakhkiPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- variable neighborhood search
- special case
- metaheuristic
- tabu search
- computational complexity
- path relinking
- np hard
- combinatorial optimization
- traveling salesman problem
- vehicle routing problem
- search procedure
- routing problem
- minimum spanning tree
- hybrid method
- single machine scheduling problem
- heuristic methods
- benchmark instances
- np complete
- feasible solution
- weighted graph
- genetic algorithm