A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem.
Claudia ArchettiElena FernándezDiana L. Huerta-MuñozPublished in: Comput. Oper. Res. (2018)
Keyphrases
- benchmark problems
- optimal solution
- vehicle routing problem
- dynamic programming
- combinatorial optimization
- computational complexity
- search space
- particle swarm optimization
- solution quality
- optimization algorithm
- traveling salesman problem
- iterated local search
- memetic algorithm
- solution space
- objective function
- ant colony optimization
- search strategy
- hybrid algorithm
- language model
- worst case
- mixed integer
- test instances
- vehicle routing problem with time windows
- upper bound
- greedy randomized adaptive search procedure