A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations.
Oscar L. Domínguez RiveroAngel A. JuanJavier FaulinPublished in: Int. Trans. Oper. Res. (2014)
Keyphrases
- vehicle routing problem
- randomized algorithm
- greedy algorithm
- lower bound
- routing problem
- tabu search
- benchmark problems
- metaheuristic
- vehicle routing
- np hard
- vehicle routing problem with time windows
- hybrid metaheuristic
- combinatorial optimization
- simulated annealing
- multi depot
- traveling salesman problem
- vehicle routing problem with simultaneous
- pick up and delivery
- particle swarm optimization
- search strategies
- greedy randomized adaptive search procedure
- hybrid algorithm
- dynamic programming