An approximation method for the P-median problem: A bioinspired tabu search and variable neighborhood search partitioning approach.
María Beatríz Bernábe LorancaJorge A. Ruiz-VanoyeRogelio González VelázquezMartín Estrada AnalcoAbraham Sánchez LópezAlberto Ochoa-ZezzattiGerardo Martínez GuzmanMario Bustillo DíazPublished in: Int. J. Hybrid Intell. Syst. (2016)
Keyphrases
- tabu search
- variable neighborhood search
- search procedure
- heuristic methods
- metaheuristic
- path relinking
- simulated annealing
- hybrid algorithm
- feasible solution
- computational efficiency
- hybrid method
- scheduling problem
- genetic algorithm
- vehicle routing problem
- test problems
- neighborhood search
- minimum spanning tree
- candidate list
- memetic algorithm
- traveling salesman problem
- mathematical model
- support vector machine
- multi objective
- objective function