AN ALGORITHM TO SOLVE MULTI-OBJECTIVE FRACTIONAL BOTTLENECK TRANSPORTATION PROBLEM WITH RESTRICTIONS

Cite this:
P.K. Saxena, R. D. M. J. P. S. (2013). AN ALGORITHM TO SOLVE MULTI-OBJECTIVE FRACTIONAL BOTTLENECK TRANSPORTATION PROBLEM WITH RESTRICTIONS. Asian Journal of Current Engineering and Maths, 1(5). Retrieved from http://innovativejournal.in/index.php/ajcem/article/view/110
© 2022 Interactive Protocols
RIGHTS & PERMISSIONS
Article Views
135
Altmetric
1
Citations
-
LEARN ABOUT THESE METRICS
   PDF  

Abstract

The transportation problems with multiple objectives having more than one restriction are very important from the practical point of view. In this paper, an algorithm is developed to solve Multiple Fractional Time Transportation Problem with Restrictions (MFTPR), which is solved by a lexicographic primal code. The developed algorithm is supported by a real life example of Metal Scrap Trade Corporation Limited.

KEYWORDS:

 Special Issue

Article Metrics Graph

Chart Graph | Range Graph

Content

Section

Source

License

COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY

 

All paper submissions must carry the following duly signed by all the authors:

“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.”