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.
Original language | English (US) |
---|---|
Pages (from-to) | 105-124 |
Number of pages | 20 |
Journal | International Journal of Logistics Systems and Management |
Volume | 26 |
Issue number | 1 |
DOIs | |
State | Published - 2017 |
Keywords
- 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