Pareto optimal solutions of a cost–time trade-off bulk transportation problem

Efficient Solution of a Multi-Objective Bulk Transportation Problem.

“…Also, it is seen that the proposed method provides same number of cost-time trade-off pairs as compared to existing methods [12,14]. However, the proposed method is relatively much easier to apply vis-à-vis methods [12,14].…”

“…However, the proposed method is relatively much easier to apply vis-à-vis methods [12,14]. Therefore, it can be concluded that the proposed method provides a simple and useful tool to determine the exhaustive cost-time trade-off pairs in MOBTP.The results of the comparative study are shown in Table 8.…”

“…A comparative study is done on the number of cost-time trade-off pairs provided by the existing methods [6,12,14] and the proposed method. It is seen that the proposed method provides more number of cost-time trade-off pairs as compared to existing method [6].…”

A Survey on Bulk Transportation Problem.

“…Prakash et al [13] proposed two methods, one based on branch and bound technique and the other based on preemptive priority factors for solving the cost-time BTP with the objective of minimizing the total cost and duration of BTP without priorities. They proposed two algorithms to get the Pareto Optimal solutions or Cost time trade off pairs.…”

“…. Prakash et al [15] proposed a method based on the lexicographic minimum to obtain Pareto Optimal solutions of the cost-time BTP,by considering a sequence of prioritized bi-criterion BTPs whose solution gives the set of Pareto Optimal solutions of the actual problem. Lexicographic minimum is used to solve the prioritized Bi-criteria bulk transportation problems.…”