Integrated strategic and tactical supply chain planning with price-sensitive demands

被引:22
作者
Fattahi, M. [1 ]
Mahootchi, M. [1 ]
Husseini, S. M. Moattar [1 ]
机构
[1] Amirkabir Univ Technol, Dept Ind Engn & Management Syst, Tehran, Iran
关键词
Supply chain network design; Strategic and tactical decisions; Capacity expansion; Mixed-integer linear programming; Dynamic pricing approach; NETWORK DESIGN PROBLEM; FACILITY LOCATION; PLANT LOCATION; WAREHOUSE LOCATION; MULTIPERIOD; DECISIONS; MODELS;
D O I
10.1007/s10479-015-1924-3
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper deals with the supply chain network design and planning for a multi-commodity and multi-layer network over a planning horizon with multiple periods in which demands of customer zones are considered to be price dependent. These prices determine the demands using plausible price-demand relationships of customer zones. The net income of the supply chain is maximized, while satisfying budget constraints for investment in network design. In addition, a new approach is considered for capacity planning to make the problem more realistic. In this regard, when production plants are opened and expanded, capacity options are taken into account for manufacturing operations. Furthermore, several aspects relevant to real world applications are captured in the problem. Different interconnected time periods in the planning horizon are considered for strategic and tactical decisions in the problem and then, a mixed-integer linear programming (MILP) model is developed. The performance and applications of the model are investigated by several test problems with reasonable sizes. The numerical results illustrate that obtained solutions after solving the MILP model by using CPLEX solver are acceptable. Moreover, using an alternative pricing approach, a tight upper bound is provided for the problem. In addition, a deep sensitivity analysis is conducted to show the validity and performance of the proposed model.
引用
收藏
页码:423 / 456
页数:34
相关论文
共 45 条
[1]   Capacity planning and warehouse location in supply chains with uncertain demands [J].
Aghezzaf, E .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (04) :453-462
[2]   Incorporating location, inventory and price decisions into a supply chain distribution network design problem [J].
Ahmadi-Javid, Amir ;
Hoseinpour, Pooya .
COMPUTERS & OPERATIONS RESEARCH, 2015, 56 :110-119
[3]   An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand [J].
Ahmadi-Javid, Amir ;
Ghandali, Razieh .
OPTIMIZATION AND ENGINEERING, 2014, 15 (03) :801-817
[4]   Network Design for Reverse and Closed-Loop Supply Chains: An Annotated Bibliography of Models and Solution Approaches [J].
Akcali, E. ;
Cetinkaya, S. ;
Uester, H. .
NETWORKS, 2009, 53 (03) :231-248
[5]  
[Anonymous], EUROPEAN J OPERATION
[6]   A branch-and-bound algorithm for minimising the number of tardy jobs in a two-machine flow-shop problem with release dates [J].
Ardakan, Mostafa Abouei ;
Hakimian, Ali ;
Rezvan, Mohammad Taghi .
INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2014, 27 (06) :519-528
[7]   Integrated strategic and tactical planning in a supply chain network design with a heuristic solution method [J].
Badri, Hossein ;
Bashiri, Mahdi ;
Hejazi, Taha Hossein .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (04) :1143-1154
[8]   DYNAMIC WAREHOUSE LOCATION ANALYSIS [J].
BALLOU, RH .
JOURNAL OF MARKETING RESEARCH, 1968, 5 (03) :271-276
[9]   A new approach to tactical and strategic planning in production-distribution networks [J].
Bashiri, Mahdi ;
Badri, Hossein ;
Talebi, Jafar .
APPLIED MATHEMATICAL MODELLING, 2012, 36 (04) :1703-1717
[10]   An algorithm for the capacitated, multi-commodity multi-period facility location problem [J].
Canel, C ;
Khumawala, BM ;
Law, J ;
Loh, A .
COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (05) :411-427