TWO STAGE STOCHASTIC PROGRAMING BASED ON THE SAMPLE AVERAGE APPROXIMATION AND ACCELERATED BENDERS DECOMPOSITION FOR DESIGNING CLOSED-LOOP SUPPLY CHAIN NETWORK DESIGN UNDER UNCERTAINTY

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

HASANI ALIAKBAR

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Modeling in Engineering Year:2017 | Volume:15 | Issue:49 Page(s): 217-234

Download Full-Text

Persian Verion

View:

1,861

Download:

Cites:

Information Journal Paper

Title

TWO STAGE STOCHASTIC PROGRAMING BASED ON THE SAMPLE AVERAGE APPROXIMATION AND ACCELERATED BENDERS DECOMPOSITION FOR DESIGNING CLOSED-LOOP SUPPLY CHAIN NETWORK DESIGN UNDER UNCERTAINTY

Author(s)

HASANI ALIAKBAR | Issue Writer Certificate

Keywords

SUPPLY CHAIN NETWORK DESIGNQ1

CLOSED-LOOPQ1

UNCERTAINTYQ1

STOCHASTIC PROGRAMMINGQ1

BENDERS DECOMPOSITIONQ1

SAMPLE AVERAGE APPROXIMATIONQ1

Abstract

In this paper, a comprehensive mathematical model for designing supply chain network via considering integrated flow of forward and reverse of multiple products during multiple periods is proposed. The UNCERTAINTY of the parameters includes customer demand, products reverse flows, rates of reverse product recovery and disposal, as well as costs of products transportation, storage and reverse flow management are considered via two stage STOCHASTIC PROGRAMMING. An efficient solution algorithm based on the SAMPLE AVERAGE APPROXIMATION and new accelerated BENDERS DECOMPOSITION is developed to solve the proposed model. An accelerated BENDERS DECOMPOSITION algorithm utilizing efficient acceleration mechanisms based on the priority heuristic and adding the demand constraint to master problem is devised to cope with computational complexity. Computational analysis is also provided by using a phone cell industrial case study to present the significance of the proposed stochastic model versus deterministic one as well as the efficiency of the proposed the accelerated BENDERS DECOMPOSITION algorithm. In addition, obtained solutions of the stochastic model have a more robustness than solutions of the deterministic model.

Cites

No record.

References

No record.

Cite

APA: Copy

HASANI, ALIAKBAR. (2017). TWO STAGE STOCHASTIC PROGRAMING BASED ON THE SAMPLE AVERAGE APPROXIMATION AND ACCELERATED BENDERS DECOMPOSITION FOR DESIGNING CLOSED-LOOP SUPPLY CHAIN NETWORK DESIGN UNDER UNCERTAINTY. JOURNAL OF MODELING IN ENGINEERING, 15(49 ), 217-234. SID. https://sid.ir/paper/173744/en

Vancouver: Copy

HASANI ALIAKBAR. TWO STAGE STOCHASTIC PROGRAMING BASED ON THE SAMPLE AVERAGE APPROXIMATION AND ACCELERATED BENDERS DECOMPOSITION FOR DESIGNING CLOSED-LOOP SUPPLY CHAIN NETWORK DESIGN UNDER UNCERTAINTY. JOURNAL OF MODELING IN ENGINEERING[Internet]. 2017;15(49 ):217-234. Available from: https://sid.ir/paper/173744/en

IEEE: Copy

ALIAKBAR HASANI, “TWO STAGE STOCHASTIC PROGRAMING BASED ON THE SAMPLE AVERAGE APPROXIMATION AND ACCELERATED BENDERS DECOMPOSITION FOR DESIGNING CLOSED-LOOP SUPPLY CHAIN NETWORK DESIGN UNDER UNCERTAINTY,” JOURNAL OF MODELING IN ENGINEERING, vol. 15, no. 49 , pp. 217–234, 2017, [Online]. Available: https://sid.ir/paper/173744/en

Related Journal Papers