Abstract
This paper addresses a distribution problem in a multi-product, multi-echelon supply chain. We develop a mixed integer linear programming formulation that considers allocation of vehicles with varying capacities for the transportation of products between the stages of the supply chain. The cost of transportation includes the fixed and variable costs of using the vehicles. The proposed formulations are solved optimally up to certain sizes, and we propose a heuristic based on total opportunity penalty cost method to solve the large sized problems. These proposed solution procedure is tested over a set of hypothetical problem sets. The results indicate that the proposed heuristic algorithm yields solutions within 5% from the optimal solutions.
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 callMore From: International Journal of Logistics Systems and Management
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.
