A New Knapsack Model for transportation of Hazardous Materials

In this paper we propose a new mathematical knapsack model for transportation of hazardous materials. The modeling formulation minimizes the risk and the cost of transportation materials. The resulted formulation is solved using discrete dynamic programming approach. The proposed method is applied for a real world nuclear plant which handles the transportation of molybdenum for different hospitals.

Keywords:

Hazardous Materials , Knapsack Problem , Dynamic Programming