Abstract
In this paper we provide a heuristic algorithm for solving transportation problems with mixed constraints and extend the algorithm to find a more-for-less (MFL) solution, if one exists. Though many transportation problems in real life have mixed constraints, these problems are not addressed in the literature because of the rigor required to solve these problems optimally. The proposed algorithm builds on the initial solution of the transportation problem.
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 callMore From: International Journal of Management Science and Engineering Management
Disclaimer: 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.
