Pareto optimal solutions of small fixed-charge bicriterion transportation problems using a heuristic method

In this paper a heuristic method is developed to find Pareto optimal solutions of small fixed-charge bicriterion transportation problems (FCTP’s). The two objectives are minimization of cost and time. We have applied the Vogel’s approximation method and then used a new entry criterion method to solve such problems. The solid waste management problem falls in the category of such problems. In comparison with the already existing approximate, exact and heuristic methods, our method is easier to understand and implement. It also saves time and computational work. A numerical example is presented to illustrate the proposed method.