An accelerating Benders’ decomposition approach to the integrated supply chain network design with distributed generation

Distributed generation (DG) is one of the new trends in distribution networks under the effect of various policies, such as distribution loss reduction. It is important to find the position and determine the size of DGs in the existing distribution network. In this paper, we consider DGs for the integrated supply chain networks and obtain the optimal locations, sizing, and the service areas of DGs. First, a mixed integer programming model is proposed to formulate the problem. Then, an accelerating Benders’ decomposition approach with two valid cuts and Pareto-optimal cuts is described for this problem. Computational results show the efficiency of the our model and proposed algorithm.

[1]  S. Rebennack,et al.  Stochastic Hydro-Thermal Scheduling Under ${\rm CO}_{2}$ Emissions Constraints , 2012, IEEE Transactions on Power Systems.

[2]  Mir Saman Pishvaee,et al.  An accelerated Benders decomposition algorithm for sustainable supply chain network design under uncertainty: A case study of medical needle and syringe supply chain , 2014 .

[3]  Kannan Govindan,et al.  Reverse logistics and closed-loop supply chain: A comprehensive review to explore the future , 2015, Eur. J. Oper. Res..

[4]  Vedat Verter,et al.  Multi-period reverse logistics network design , 2012, Eur. J. Oper. Res..

[5]  Yasuhiro Hayashi,et al.  Application of tabu search to optimal placement of distributed generators , 2001, 2001 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No.01CH37194).

[6]  Steffen Rebennack,et al.  Tailored Benders Decomposition for a Long-Term Power Expansion Model with Short-Term Demand Response , 2017, Manag. Sci..

[7]  Panos M. Pardalos,et al.  Supply Chain Optimization , 2007 .

[8]  Shyamal Kumar Mondal,et al.  A fixed-charge transportation problem in two-stage supply chain network in Gaussian type-2 fuzzy environments , 2015, Inf. Sci..

[9]  M. Shahidehpour,et al.  Accelerating the Benders decomposition for network-constrained unit commitment problems , 2010 .

[10]  Steffen Rebennack,et al.  Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming , 2015, Mathematical Programming.

[11]  Nikolaos Papadakos,et al.  Practical enhancements to the Magnanti-Wong method , 2008, Oper. Res. Lett..

[12]  P. Chiradeja,et al.  Benefit of Distributed Generation: A Line Loss Reduction Analysis , 2005, 2005 IEEE/PES Transmission & Distribution Conference & Exposition: Asia and Pacific.

[13]  Thomas L. Magnanti,et al.  Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..

[14]  Ali H. Diabat,et al.  Solving a reverse supply chain design problem by improved Benders decomposition schemes , 2013, Comput. Ind. Eng..

[15]  Babak Hossein Khalaj,et al.  Minimum cost multiple multicast network coding with quantized rates , 2013, Comput. Networks.

[16]  Seyed Taghi Akhavan Niaki,et al.  Bi-objective optimization of a multi-product multi-period three-echelon supply chain problem under uncertain environments: NSGA-II and NRGA , 2015, Inf. Sci..

[17]  Mohsen Akbarpour Shirazi,et al.  A new multi-criteria scenario-based solution approach for stochastic forward/reverse supply chain network design , 2016, Ann. Oper. Res..

[18]  Masoud Rabbani,et al.  A comprehensive dynamic cell formation design: Benders' decomposition approach , 2011, Expert Syst. Appl..

[19]  P. C. Schuur,et al.  Business case Océ: Reverse logistic network re-design for copiers , 1999 .

[20]  Qi Zhang,et al.  Multiscale production routing in multicommodity supply chains with complex production facilities , 2017, Comput. Oper. Res..

[21]  Jean-François Cordeau,et al.  An integrated model for logistics network design , 2006, Ann. Oper. Res..

[22]  J. F. Benders Partitioning procedures for solving mixed-variables programming problems , 1962 .

[23]  Shanlin Yang,et al.  Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm , 2016, Int. J. Syst. Sci..

[24]  Hanif D. Sherali,et al.  On generating maximal nondominated Benders cuts , 2013, Ann. Oper. Res..

[25]  Der-Horng Lee,et al.  A HEURISTIC APPROACH TO LOGISTICS NETWORK DESIGN FOR END-OF-LEASE COMPUTER PRODUCTS RECOVERY , 2008 .

[26]  Gerald W. Evans,et al.  A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs , 2007, Comput. Oper. Res..

[27]  Ali Amiri,et al.  Production , Manufacturing and Logistics Designing a distribution network in a supply chain system : Formulation and efficient solution procedure , 2005 .

[28]  Jean-François Cordeau,et al.  A Benders Decomposition Approach for the Locomotive and Car Assignment Problem , 1998, Transp. Sci..

[29]  Carlos A. Méndez,et al.  Multi-period design and planning of closed-loop supply chains with uncertain supply and demand , 2014, Comput. Chem. Eng..

[30]  Alysson M. Costa,et al.  Two-level network design with intermediate facilities: An application to electrical distribution systems , 2011 .

[31]  Hasan Pirkul,et al.  Planning and coordination of production and distribution facilities for multiple commodities , 2001, Eur. J. Oper. Res..

[32]  Wei Jiang,et al.  An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions , 2013, Ann. Oper. Res..

[33]  Yu-Chung Tsao Joint location, inventory, and preservation decisions for non-instantaneous deterioration items under delay in payments , 2016, Int. J. Syst. Sci..

[34]  Mir Saman Pishvaee,et al.  A memetic algorithm for bi-objective integrated forward/reverse logistics network design , 2010, Comput. Oper. Res..

[35]  K. Tomsovic,et al.  Placement of dispersed generation systems for reduced losses , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[36]  Michel Gendreau,et al.  Accelerating Benders decomposition for closed-loop supply chain network design: Case of used durable products with different quality levels , 2016, Eur. J. Oper. Res..

[37]  Gongyun Zhao,et al.  A Log-Barrier method with Benders decomposition for solving two-stage stochastic linear programs , 2001, Math. Program..

[38]  Panos M. Pardalos,et al.  Network optimization in supply chain management and financial engineering: An annotated bibliography , 2003, Networks.

[39]  Mir Saman Pishvaee,et al.  A robust optimization approach to closed-loop supply chain network design under uncertainty , 2011 .

[40]  Alysson M. Costa A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..

[41]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[42]  F. Pilo,et al.  A multiobjective evolutionary algorithm for the sizing and siting of distributed generation , 2005, IEEE Transactions on Power Systems.

[43]  Mitsuo Gen,et al.  A steady-state genetic algorithm for multi-product supply chain network design , 2009, Comput. Ind. Eng..

[44]  Panos M. Pardalos,et al.  Mixed-integer LP model for volt/var control and energy losses minimization in distribution systems , 2016 .