A hybrid simulated annealing algorithm to estimate a better upper bound of the minimal total cost of a transportation problem with varying demands and supplies.
Z. A. M. S. JumanM. A. HoqueIntesar M. Al-MudahkaPublished in: RAIRO Oper. Res. (2023)
Keyphrases
- total cost
- simulated annealing algorithm
- transportation problem
- upper bound
- planning horizon
- simulated annealing
- lower bound
- optimal solution
- service level
- search algorithm
- branch and bound algorithm
- minimum total cost
- production cost
- lead time
- integer programming
- worst case
- lot size
- branch and bound
- genetic algorithm
- neural network
- evolutionary algorithm
- approximation algorithms
- tabu search
- linear programming
- premature convergence
- np hard
- bayesian networks
- fixed cost