PRISM: PRIority based SiMulated annealing for a closed loop supply chain network design problem.
P. SubramanianN. RamkumarT. T. NarendranK. GaneshPublished in: Appl. Soft Comput. (2013)
Keyphrases
- network design problem
- closed loop supply chain
- simulated annealing
- network design
- branch and bound
- approximation algorithms
- tabu search
- combinatorial optimization
- transportation networks
- genetic algorithm
- metaheuristic
- mixed integer
- evolutionary algorithm
- mixed integer programming
- minimal cost
- feasible solution
- valid inequalities
- integer programming
- solution quality
- global optimum
- lagrangian relaxation
- convex hull
- linear programming
- road network
- delay dependent
- traveling salesman problem
- ant colony optimization
- upper bound
- lower bound