An efficient heuristic to obtain a better initial feasible solution to the transportation problem.
Z. A. M. S. JumanM. A. HoquePublished in: Appl. Soft Comput. (2015)
Keyphrases
- feasible solution
- transportation problem
- linear programming
- tabu search
- solution quality
- optimal solution
- mixed integer program
- integer programming
- heuristic solution
- lagrangian relaxation
- fixed charge
- objective function
- closest string
- mixed integer
- mathematical model
- mixed integer linear program
- minimal cost
- simulated annealing
- convex hull
- metaheuristic
- infeasible solutions
- packing problem
- np hard
- scheduling problem
- evolutionary algorithm
- multidimensional knapsack problem
- multi start
- neural network