Heuristic and exact algorithms for a min-max selective vehicle routing problem.
Cristiano Arbex ValleLeonardo Conegundes MartinezAlexandre Salles da CunhaGeraldo Robson MateusPublished in: Comput. Oper. Res. (2011)
Keyphrases
- min max
- exact algorithms
- vehicle routing problem
- benchmark instances
- combinatorial optimization
- knapsack problem
- vehicle routing problem with time windows
- combinatorial optimization problems
- multi depot
- metaheuristic
- tabu search
- heuristic methods
- combinatorial problems
- traveling salesman problem
- max min
- variable neighborhood search
- test instances
- routing problem
- approximation algorithms
- iterated local search
- simulated annealing
- max sat
- np hard
- optimal solution
- travel time
- memetic algorithm
- exact solution
- benchmark problems
- ant colony optimization
- hybrid metaheuristic
- branch and bound
- optimization problems
- path relinking
- vehicle routing problem with simultaneous
- neural network
- integer programming
- dynamic programming
- search procedure
- feasible solution
- constraint satisfaction
- constraint satisfaction problems
- particle swarm optimization
- pick up and delivery
- greedy randomized adaptive search procedure
- evolutionary algorithm