A Variable Neighborhood Search approach for the Hamiltonian p-median problem.
Alberto HerranJ. Manuel ColmenarAbraham DuartePublished in: Appl. Soft Comput. (2019)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- neighborhood search
- heuristic methods
- minimum spanning tree
- routing problem
- hybrid method
- single machine scheduling problem
- vehicle routing problem
- benchmark instances
- ant colony optimization
- path relinking
- search procedure
- simulated annealing
- scatter search
- graph theory
- processing times
- neural network
- optimization problems
- search algorithm
- optimal solution
- memetic algorithm
- job shop scheduling problem
- combinatorial optimization
- cost function
- special case
- search space