A variable neighborhood search for Open Vehicle Routing Problem.
Erdener OzcetinGürkan ÖztürkPublished in: Concurr. Comput. Pract. Exp. (2023)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- metaheuristic
- tabu search
- routing problem
- benchmark instances
- hybrid metaheuristic
- traveling salesman problem
- neighborhood search
- benchmark problems
- test instances
- combinatorial optimization
- np hard
- memetic algorithm
- search space
- heuristic methods
- combinatorial optimization problems
- travel time
- simulated annealing
- optimization problems
- minimum spanning tree
- path relinking
- feasible solution
- search strategies
- single machine scheduling problem
- particle swarm optimization
- hybrid method
- hybrid algorithm
- worst case
- search methods