Abstract
This paper presents a new mixed integer non-linear fractional programming model for multi-commodity, multi-period, budget constrained and capacitated global supply chain design problem. Our model simultaneously optimizes the facility location, capacity acquisition, and production-distribution decisions so as to maximize the profitability of the total investment over a planning horizon. The model is also compared with the profit-maximization model and the cost-minimization model. A branch-and-bound method and a rounding heuristic algorithm are developed to tackle the problem at hand. The computational results of solving 30 instances generated randomly show that our proposed model differs fundamentally from the other models and the rounding heuristic algorithm provides an efficient solution.
Original language | English |
---|---|
Pages (from-to) | 629-649 |
Number of pages | 21 |
Journal | Journal of Industrial and Management Optimization |
Volume | 5 |
Issue number | 3 |
DOIs | |
Publication status | Published - 6 Aug 2009 |
Keywords
- Branch-and-bound
- Facility location
- Fractional programming
- Rounding heuristic algorithm
- Supply chain design
ASJC Scopus subject areas
- Business and International Management
- Strategy and Management
- Control and Optimization
- Applied Mathematics