Abstract

In this paper, we proposed three heuristic algorithms to solve multiobjective transportation problems, the first heuristic algorithm used to minimize two objective functions (total flow time and total late work), the second one used to minimize two objective functions (total flow time and total tardiness) and the last one used to minimize three objective functions (total flow time, total late work and total tardiness), where these heuristic algorithms which is different from to another existing algorithms and providing the support to decision markers for handing time oriented problems.

This work is licensed under a Creative Commons Attribution 4.0 License.