ABSTRACT
This chapter is an extension of the priority-based time minimization transportation problem. It is discussed with some additional restrictions, such as mixed constraints and flow constraints, with lexicographic optimization technique. An algorithm to obtain an optimal value is developed. This algorithm is also implemented and tested in MATLAB for various problems of different sizes. A numerical example is exhibited in favour of developed theory. Computational results are reported toward the end.
