An improved hybrid algorithm for capacitated fixed-charge transportation problem.
Camelia-Mihaela PinteaPetrica C. PopPublished in: Log. J. IGPL (2015)
Keyphrases
- hybrid algorithm
- transportation problem
- capacitated fixed charge
- integer programming
- network design problem
- valid inequalities
- tabu search
- optimal solution
- particle swarm optimization
- differential evolution
- particle swarm optimization pso
- simulated annealing
- genetic algorithm
- np hard
- standard test problems
- linear programming
- imperialist competitive algorithm
- ant colony optimization
- lagrangian relaxation
- network design
- approximation algorithms
- cutting plane
- mixed integer programming
- branch and bound
- optimization method
- evolutionary algorithm
- nonlinear integer programming
- scheduling problem