Abstract
Abstract In the existing models of bottleneck transportation problem (BTP), the transport time along a given path is taken as a fixed charge. In most practical situations, however, the transport time usually varies with the amount of transport. In order to make up this defect, an extended BTP model is built in which transport time tij is determined by a function of the amount to be transported rather than a constant. A heuristic recursive algorithm is proposed for the solution of the model. Furthermore, a special case of the model (that the supplies at sources are sufficient) is studied and a set of formulae of optimal solution are derived.
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.
