An iterated local search algorithm for the vehicle routing problem with convex time penalty functions.
Toshihide IbarakiShinji ImahoriKoji NonobeKensuke SobueTakeaki UnoMutsunori YagiuraPublished in: Discret. Appl. Math. (2008)
Keyphrases
- penalty functions
- vehicle routing problem
- search algorithm
- tabu search
- objective function
- penalty function
- search strategies
- metaheuristic
- vehicle routing
- constrained optimization
- vehicle routing problem with time windows
- routing problem
- combinatorial optimization
- travel time
- benchmark problems
- branch and bound
- search strategy
- np hard
- search space
- heuristic search
- path relinking
- multi depot
- traveling salesman problem
- hybrid metaheuristic
- particle swarm optimization
- estimation problems
- optimization problems
- search methods
- neural network
- knapsack problem
- simulated annealing
- probabilistic model
- feature vectors
- genetic algorithm