A modified variable neighborhood search for the discrete ordered median problem.
Justo PuertoDionisio Pérez-BritoCarlos G. García-GonzálezPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- variable neighborhood search
- tabu search
- metaheuristic
- traveling salesman problem
- heuristic methods
- hybrid method
- path relinking
- vehicle routing problem
- routing problem
- minimum spanning tree
- search procedure
- neural network
- partially ordered
- benchmark instances
- single machine scheduling problem
- evolutionary algorithm
- scheduling problem
- cost function
- combinatorial problems
- multi objective
- scatter search