Less is more: Solving the Max-Mean diversity problem with variable neighborhood search.
Jack BrimbergNenad MladenovicRaca TodosijevicDragan UrosevicPublished in: Inf. Sci. (2017)
Keyphrases
- variable neighborhood search
- metaheuristic
- traveling salesman problem
- vehicle routing problem
- combinatorial optimization
- heuristic methods
- routing problem
- benchmark instances
- path relinking
- optimization problems
- tabu search
- search procedure
- cost function
- dynamic programming
- exact algorithms
- single machine scheduling problem