Abstract
This paper deals with Multiple Objective Time Transportation Problem with Additional Restrictions (MOTTP). This MOTTP with non-linear bottleneck objective functions is related to Lexicographic Multiple Time Transportation Problem with Additional Restrictions, which is solved by a lexicographic primal code. An algorithm and its underlying theory is developed to determine an initial efficient basic solution of this MOTTP. The developed algorithm is supported by a real life example of minimizing the shipping time, loading/unloading time and congestion time for transporting ore from source i to destination j for a Steel Industry.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
