An Efficient Procedure to Determine the Initial Basic Feasible Solution of Time Minimization Transportation Problem.
Aminur Rahman KhanAdrian VilcuMd. Sharif UddinCristiana IstratePublished in: IESS (2016)
Keyphrases
- feasible solution
- transportation problem
- objective function
- mixed integer program
- fixed charge
- linear programming
- integer programming
- tabu search
- valid inequalities
- optimal solution
- mathematical model
- lagrangian relaxation
- search procedure
- minimal cost
- infeasible solutions
- linear program
- convex hull
- mixed integer
- multi objective
- mixed integer linear program
- optimization problems
- simulated annealing
- dynamic programming
- variable neighborhood descent
- network design
- np complete
- cost function
- search space