A general variable neighborhood search for solving the multi-objective open vehicle routing problem.
Jesús Sánchez-OroAna Dolores López-SánchezJ. Manuel ColmenarPublished in: J. Heuristics (2020)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- multi objective
- hybrid metaheuristic
- metaheuristic
- combinatorial optimization
- tabu search
- routing problem
- neighborhood search
- benchmark instances
- traveling salesman problem
- particle swarm optimization
- optimization algorithm
- vehicle routing problem with simultaneous
- evolutionary algorithm
- test instances
- multi objective optimization
- np hard
- memetic algorithm
- special case
- benchmark problems
- travel time
- heuristic methods
- search space
- combinatorial optimization problems
- search strategies
- knapsack problem
- neural network
- ant colony optimization
- scheduling problem
- optimal solution
- objective function
- search methods
- minimum spanning tree
- bi objective
- genetic algorithm