An application of ILS heuristic to Periodic Vehicle Routing Problem with heterogeneous fleet and fixed costs.
Robert Cristian AbreuJosé Elias Claudio ArroyoPublished in: CLEI (2015)
Keyphrases
- vehicle routing problem
- metaheuristic
- fixed cost
- tabu search
- multi start
- iterated local search
- benchmark instances
- optimal solution
- simulated annealing
- combinatorial optimization
- multi depot
- total cost
- variable neighborhood search
- mixed integer programming
- vehicle routing problem with time windows
- infinite horizon
- lot sizing
- ant colony optimization
- routing problem
- optimization problems
- solution quality
- path relinking
- benchmark problems
- search space
- greedy randomized adaptive search procedure
- feasible solution
- traveling salesman problem
- hybrid metaheuristic
- search methods
- genetic algorithm
- search procedure
- hyper heuristics
- search strategies
- travel time
- scatter search
- heuristic methods
- particle swarm optimization
- np hard
- planning horizon
- branch and bound algorithm
- constraint satisfaction
- search algorithm
- column generation
- neural network
- exact algorithms
- linear program
- linear programming
- scheduling problem
- dynamic programming
- production system
- reinforcement learning
- pick up and delivery
- branch and bound