Abstract
Operations research is frequently applied to economics activities, where more attention has also been directed to transportation problems (TP). Another application of this type of transportation problem can be shown as multi objective transportation problems (MOTPs). Usually, in a transportation problem, only one objective of transporting goods from source to destination is considered. However, in a MOTP, different objectives such as time, cost, and risk must be considered. The basic requirement of a multi objective transportation problem in such way as to obtain a minimum value for the objectives mentioned above. Therefore, researchers are developing various algorithms to find an efficient solution to these specific problems. Also, in this paper, we focus on presenting a new approach for an efficient solution to the MOTP. It is recommended to build the method based on the harmonic mean algorithm and spanning tree, compare its solutions with the methods of other concurrent researchers and check the effectiveness of this article. We can say that this new approach is an efficient and easy-to-understand method that provides relatively accurate solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.