Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility.
Alejandro Estrada-MorenoMartin W. P. SavelsberghAngel A. JuanJavier PanaderoPublished in: Int. Trans. Oper. Res. (2019)
Keyphrases
- iterated local search
- vehicle routing problem
- vehicle routing problem with simultaneous
- metaheuristic
- tabu search
- vehicle routing problem with time windows
- routing problem
- traveling salesman problem
- benchmark problems
- np hard
- combinatorial optimization
- multi start
- travel time
- benchmark instances
- particle swarm optimization
- simulated annealing
- memetic algorithm
- pick up and delivery
- optimization problems
- combinatorial optimization problems
- search methods
- search strategies
- variable neighborhood search
- scatter search
- genetic algorithm
- ant colony optimization
- upper bound
- scheduling problem
- multi objective