An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem.
Zahra Naji AzimiMajid SalariPaolo TothPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- vehicle routing problem with stochastic demands
- network design problem
- capacity constraints
- lagrangian relaxation
- lot sizing
- optimal solution
- production inventory
- heuristic solution
- np hard
- routing problem
- search algorithm
- tabu search
- single source
- simulated annealing
- search strategies
- solution quality
- approximation algorithms
- linear program
- multi source
- greedy heuristic
- dynamic programming
- multicommodity flow
- ring signature
- neural network