A Lagrangian Relaxation for a Fuzzy Random EPQ Problem with Shortages and Redundancy Allocation: Two Tuned Meta-heuristics.
Javad SadeghiSeyed Taghi Akhavan NiakiMohammad Reza MalekianYong WangPublished in: Int. J. Fuzzy Syst. (2018)
Keyphrases
- lagrangian relaxation
- metaheuristic
- feasible solution
- tabu search
- integer programming
- simulated annealing
- branch and bound algorithm
- optimal solution
- ant colony optimization
- lower bound
- combinatorial optimization
- optimization problems
- np hard
- total weighted tardiness
- column generation
- combinatorial optimization problems
- linear programming
- dynamic programming
- lower and upper bounds
- search methods
- genetic algorithm
- artificial bee colony algorithm
- series parallel
- search space
- memetic algorithm
- vehicle routing problem
- mixed integer program
- redundancy allocation
- branch and bound
- particle swarm optimization
- upper bound
- optimization method
- single machine scheduling problem
- objective function
- np complete
- cost function
- genetic algorithm ga
- shortest path
- evolutionary algorithm
- neural network