Material flow optimisation in a multi-echelon and multi-product supply chain

Raju Rajkanth, G. Srinivasan and Mohan Gopalakrishnan

International Journal of Logistics Systems and Management, 2017, vol. 26, issue 1, 105-124

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.

Keywords: branch-and-bound algorithm; heuristics; mixed integer linear programming; MILP; supply chain management; SCM; transport problems; material flow optimisation; multi-echelon supply chains; multi-product supply chains; vehicle allocation. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=80633 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijlsma:v:26:y:2017:i:1:p:105-124

Access Statistics for this article

More articles in International Journal of Logistics Systems and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().