Abstract
In this paper, a unit shipping cost problem for a transportation problem with mixed constraints is constructed in which the unit shipping cost of the problem is minimized. Then, a new method namely, less-more method is proposed for solving the unit shipping cost problem for the transportation problem with mixed constraints. The optimal solution of the unit shipping cost problem provides a shipping plan for the transportation problem with mixed constraints such that its unit shipping cost is fewer and the number of transporting items is more than or equal to its optimal solution. Numerical examples in Pharmaceutical Logistics are presented to illustrate the solution procedure of the less-more method.
Sign-in/Register to access full text options 
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
