Abstract
The fixed charge transportation problem (FCTP) is an extension of the classic transportation problem in which a fixed cost is incurred for every supply point that is used in the solution. A branch and bound procedure which requires the use of two subproblems (a classic transportation problem and a knapsack problem) can be used to solve the FCTP. Unlike fixed change problems, with the FCTP, there is a many-to-one correspondence between the continuous variables of the transportation problem and the fixed charge variables of the knapsack problem. This paper incorporates penalties into the branch and bound procedure in order to improve the solution times. Also, an adjacent extreme point heuristic is presented that finds a near optimal solution quickly.
Sign-in/Register to access full text options 
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.
