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

Raju Rajkanth, G. Srinivasan, Mohan Gopalakrishnan

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)105-124
Number of pages20
JournalInternational Journal of Logistics Systems and Management
Issue number1
StatePublished - 2017


  • branch-and-bound algorithm
  • heuristic
  • mixed integer linear programming model
  • optimisation
  • supply chain
  • transportation problem

ASJC Scopus subject areas

  • Management Information Systems
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'Material flow optimisation in a multi-echelon and multi-product supply chain'. Together they form a unique fingerprint.

Cite this