Solving the Capacitated Dispersion Problem with variable neighborhood search approaches: From basic to skewed VNS.
Nenad MladenovicRaca TodosijevicDragan UrosevicMustapha RatliPublished in: Comput. Oper. Res. (2022)
Keyphrases
- variable neighborhood search
- routing problem
- vehicle routing problem
- metaheuristic
- heuristic methods
- tabu search
- traveling salesman problem
- neighborhood search
- hybrid metaheuristic
- single machine scheduling problem
- hybrid method
- minimum spanning tree
- path relinking
- scatter search
- combinatorial optimization
- search procedure
- benchmark instances
- optimal solution
- search algorithm
- genetic algorithm
- lot sizing
- travel time
- graph model
- search methods
- search space
- lower bound