A novel hybrid genetic algorithm for the location routing problem with tight capacity constraints.
Xue YuYuren ZhouXiao-Fang LiuPublished in: Appl. Soft Comput. (2019)
Keyphrases
- hybrid genetic algorithm
- capacity constraints
- lower bound
- lagrangian relaxation
- network flow
- minimum cost
- quadratic assignment problem
- upper bound
- single item
- bicriteria
- vehicle routing problem
- genetic algorithm
- worst case
- crossover operator
- lot sizing
- neural network
- mutation operator
- lower and upper bounds
- multi item
- branch and bound algorithm
- optimization problems
- supply chain