Comparison of heuristic algorithms for solving a specific model of transportation problem

摘要

A specific transportation problem is presented in the paper. A commonly used variant for the cost value determination is analysed. A Matlab code for solving this specific transportation problem by the heuristic algorithms is developed The optimization model used is related to solving a problem with nondeterministic polynomial-time (NP) hardness and large dimension. A comparison of different heuristic algorithms for solving this problem is made. Results are commented.