A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem.
Yazid M. SharaihaMichel GendreauGilbert LaporteIbrahim H. OsmanPublished in: Networks (1997)
Keyphrases
- vehicle routing problem
- routing problem
- spanning tree
- interval data
- shortest path
- metaheuristic
- tabu search
- np hard
- single source
- benchmark problems
- traveling salesman problem
- vehicle routing problem with simultaneous
- shortest common supersequence
- lot sizing
- minmax regret
- test instances
- shortest path problem
- combinatorial optimization
- multi period
- combinatorial optimization problems
- particle swarm optimization
- multi item
- search strategies
- capacity constraints
- multi source
- network design problem
- vehicle routing problem with stochastic demands
- facility location problem
- tabu search algorithm
- special case
- multi commodity
- production inventory
- data clustering
- facility location
- path length
- optimal solution