EFFICIENT SOLUTION OF A MULTI-OBJECTIVE BULK TRANSPORTATION PROBLEM.

  • Department of Mathematics, Amity University, Gurugram, Haryana, India.
  • Department of Mathematics, Amity School of Engineering and Technology, Bijwasan, New Delhi, India.
Crossref Cited-by Linking logo

  • Abstract
  • Keywords
  • References
  • Cite This Article as
  • Corresponding Author

In the present work, a simple method to obtain the efficient cost-time trade-off pairs in Multi-Objective Bulk Transportation Problem (MOBTP) is proposed. This work provides a very simple alternate procedure to determine all efficient cost-time trade-off pairs. The motivation of this work came from different efficient solution pairs obtained by the methods of existing researchers [6,12,14].The proposed method unifies the existing methods to get all exhaustive solution pairs. A comparative study among the existing methods and the proposed method is also shown.

  1. Aneja, Y. P., Nair, K. P. K., ?Bicriteria transportation problem, Management Science?, Vol. 25, 1, pp. 73-78(1979).
  2. Bhatia, H.L, Puri, M.C. and Swarup, K., ?Time-cost trade-off in a transportation problem?, Opsearch, V 13, pp. 129-142(1976).
  3. Bhatia, H.L., ?A note on a zero-one time minimizing transportation problem?, NZOR, Vol.7, 159-165(1979).
  4. Dantzig, G.B., ?Linear Programming and Extensions?, Princeton University Press, Princeton, New?? Jersey, 1963.
  5. Foulds, L. R., and Gibbons, P. B., ?New Algorithms For The Bulk, Zero-One Time Mini-Max Transportation Model?,. NZOR Vol. 8, No. 2(1980).
  6. Gupta, A., Verma, V., Puri, M. C., ? Time ?Cost Trade-off Relations in Bulk transportation Problems?, Journal of Information & Optimization Sciences. Vol. 16 , No. 2, pp. 317-325(1995).
  7. Hitchcock, F.L., ?The distribution of a product from several sources to numerous locations?, Journal of?? Mathematics and Physics Vol.20, pp. 224-230(1941).
  8. Koopmans, T.C. ?Optimum utilization of Transportation System?, Econometrica, supplement 17(1949).
  9. Maio, A.D., Roveda, C. ?An all zero-one algorithm for a certain class of transportation problems", Operations Research, 19, pp. I406-1418 (1971).
  10. Murthy, M.S., ? A bulk transportation problem?, Opsearch, 13, pp. I43-155(1976).
  11. Prakash, S., Agarwal, A.K., Shah, S., ?Non dominated solutions of cost-time trade-off transportation and assignment problems?,? Opsearch Vol. 25, pp. 126-131(1988).
  12. Prakash, S., Kumar, P.,Prasad, B.V.N.S., Gupta, A., ?Pareto optimal solutions of a cost ?time trade-off? bulk transportation problem?, Eur.J. Oper. Res. Vol.188, pp. 85-110(2008).
  13. Prakash, S., Ram, P.P., ?A bulk transportation problem with objectives to minimize total cost and duration of transportation?, The Mathematics Student. Vol.64, pp. 206-214 (1995).
  14. Prakash, S.,Sharma, M.K., Singh, A. ?An efficient heuristic for multi-objective bulk? transportation problem?, IEEE, pp. 1005-1009(2009).
  15. Purusotham, S., Prakash, S., Dhyani, P., ? A transportation problem with minimization of duration and total cost of transportation as high and low priority objectives respectively?,Bulletin of the Technical University of Istanbul, Vol. 37, pp. 1-11(1984).
  16. A., Javaid. S., Khalid, M.M. ?A new method for finding an optimal solution for transportation problem?, International Journal on Computer Science and Engineering, Vol. 4, pp.
  17. 1271-1274(2012).
  18. Srinivasan, V., Thompson, G.L., ?An algorithm for assigning uses to sources in a special class of transportation problems?, Operations Research, 21, pp. 284-295(1973).
  19. Theodore, S. G., Berger, P. D., ?Cost/Completion-date trade-off in the transportation problem?, Operation Research, Vol. 25, No.1, pp. 163-168(1977).

[Sungeeta Singh, Sudhir Kumar Chauhan and Kuldeep. (2017); EFFICIENT SOLUTION OF A MULTI-OBJECTIVE BULK TRANSPORTATION PROBLEM. Int. J. of Adv. Res. 5 (Jun). 2337-2341] (ISSN 2320-5407). www.journalijar.com

Sungeeta Singh
Amity University Gurgaon Haryana

DOI:

Article DOI: 10.21474/IJAR01/4677      
DOI URL: https://dx.doi.org/10.21474/IJAR01/4677

Download Full Paper

Download PDF No. of Downloads: 62 | No. of Views: 172