On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem.
Sandra ZajacPublished in: J. Heuristics (2018)
Keyphrases
- bi objective
- vehicle routing problem
- routing problem
- efficient solutions
- metaheuristic
- ant colony optimization
- multi objective
- tabu search
- vehicle routing
- greedy randomized adaptive search procedure
- iterated local search
- knapsack problem
- hybrid metaheuristic
- traveling salesman problem
- benchmark problems
- memetic algorithm
- vehicle routing problem with time windows
- neighborhood search
- multi objective optimization
- nsga ii
- network design
- multiple objectives
- test problems
- computational complexity
- search space
- combinatorial optimization
- benchmark instances
- search strategies
- optimal solution
- search strategy
- shortest path problem
- integer programming
- simulated annealing
- np hard
- cost function
- combinatorial optimization problems