A multi-start variable neighborhood search for solving the single path multicommodity flow problem.
Hela MasriSaoussen KrichenAdel GuitouniPublished in: Appl. Math. Comput. (2015)
Keyphrases
- multi start
- variable neighborhood search
- metaheuristic
- path relinking
- tabu search
- combinatorial optimization
- scatter search
- simulated annealing
- feasible solution
- optimization problems
- traveling salesman problem
- search algorithm
- max min
- benchmark instances
- heuristic methods
- search procedure
- shortest path
- search space
- vehicle routing problem
- global optimization
- vehicle routing problem with time windows
- stochastic approximation
- hill climbing
- genetic programming
- dynamic programming
- special case
- objective function