Solving the capacitated clustering problem with variable neighborhood search.
Jack BrimbergNenad MladenovicRaca TodosijevicDragan UrosevicPublished in: Ann. Oper. Res. (2019)
Keyphrases
- variable neighborhood search
- routing problem
- vehicle routing problem
- metaheuristic
- tabu search
- combinatorial optimization
- clustering method
- benchmark instances
- lot sizing
- traveling salesman problem
- heuristic methods
- evolutionary algorithm
- neural network
- data objects
- memetic algorithm
- test instances
- minimum spanning tree
- path relinking