Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem.
Angel A. JuanIñaki PascualDaniel GuimaransBarry B. BarriosPublished in: Int. Trans. Oper. Res. (2015)
Keyphrases
- iterated local search
- vehicle routing problem
- combinatorial optimization
- metaheuristic
- tabu search
- vehicle routing problem with time windows
- vehicle routing problem with simultaneous
- travel time
- routing problem
- benchmark problems
- multi start
- traveling salesman problem
- benchmark instances
- combinatorial optimization problems
- simulated annealing
- particle swarm optimization
- np hard
- branch and bound
- memetic algorithm
- knapsack problem
- pick up and delivery
- combinatorial problems
- solution space
- optimization problems
- optimal solution
- search methods
- timetabling problem
- search heuristics
- path relinking
- linear programming
- dynamic programming
- multi objective
- search space