Abstract
In this paper, we have introduced a Solid Transportation Problem where the constrains are mixed type. The model is developed under different environment like, crisp, fuzzy and intuitionistic fuzzy etc. Using the interval approximation method we defuzzify the fuzzy amount and for intuitionistic fuzzy set we use the (<i>α,β</i>)-cut sets to get the corresponding crisp amount. To find the optimal transportation units a time and space based with order of convergence <i>O</i>(<i>MN</i><sup>2</sup>) meta-heuristic Genetic Algorithm have been proposed. Also the equivalent crisp model so obtained are solved by using LINGO 13.0. The results obtained using GA treats as the best solution by comparing with LINGO results for this present study. The proposed models and techniques are finally illustrated by providing numerical examples. Degree of efficiency have been find out for both the algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
