Next Article in Journal
An Exploration of Big Data Practices in Retail Sector
Previous Article in Journal
A Food Transportation Framework for an Efficient and Worker-Friendly Fresh Food Physical Internet
Article Menu

Export Article

Open AccessArticle
Logistics 2017, 1(2), 11; doi:10.3390/logistics1020011

Accelerated Benders’ Decomposition for Integrated Forward/Reverse Logistics Network Design under Uncertainty

1
Department of Mechanical and Industrial Engineering, Northeastern University, Boston, MA 02114, USA
2
Department of Industrial Engineering, Yazd University, Yazd 89195-741, Iran
*
Author to whom correspondence should be addressed.
Received: 16 October 2017 / Revised: 20 November 2017 / Accepted: 27 November 2017 / Published: 9 December 2017
View Full-Text   |   Download PDF [998 KB, uploaded 21 December 2017]   |  

Abstract

In this paper, a two-stage stochastic programming modelling is proposed, to design a multi-period, multistage, and single-commodity integrated forward/reverse logistics network design problem under uncertainty. The problem involved both strategic and tactical decision levels. The first stage dealt with strategic decisions, which are the number, capacity, and location of forward and reverse facilities. In the second stage, tactical decisions, such as base stock level as an inventory policy, were determined. The generic introduced model consisted of suppliers, manufactures, and distribution centers in forward logistic and collection centers, remanufactures, redistribution, and disposal centers in reverse logistic. The strength of the proposed model is its applicability to various industries. The problem was formulated as a mixed-integer linear programming model and was solved by using Benders’ Decomposition (BD) approach. In order to accelerate the Benders’ decomposition, a number of valid inequalities were added to the master problem. The proposed accelerated BD was evaluated through small-, medium-, and large-sized test problems. Numerical results confirmed that the proposed solution algorithm improved the convergence of BD lower bound and the upper bound, enabling to reach an acceptable optimality gap in a convenient time. View Full-Text
Keywords: integrated forward/reverse logistics network; accelerated Benders’ Decomposition; two-stage stochastic programming; valid inequalities integrated forward/reverse logistics network; accelerated Benders’ Decomposition; two-stage stochastic programming; valid inequalities
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Vahdat, V.; Vahdatzad, M.A. Accelerated Benders’ Decomposition for Integrated Forward/Reverse Logistics Network Design under Uncertainty. Logistics 2017, 1, 11.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Logistics EISSN 2305-6290 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top