Solving a reverse supply chain design problem by improved Benders decomposition schemes

Ernesto D.R. Santibanez-Gonzalez, Ali Diabat

    Research output: Contribution to journalArticle

    Abstract

    In this paper we propose improved Benders decomposition schemes for solving a remanufacturing supply chain design problem (RSCP). We introduce a set of valid inequalities in order to improve the quality of the lower bound and also to accelerate the convergence of the classical Benders algorithm. We also derive quasi Pareto-optimal cuts for improving convergence and propose a Benders decomposition scheme to solve our RSCP problem. Computational experiments for randomly generated networks of up to 700 sourcing sites, 100 candidate sites for locating reprocessing facilities, and 50 reclamation facilities are presented. In general, according to our computational results, the Benders decomposition scheme based on the quasi Pareto-optimal cuts outperforms the classical algorithm with valid inequalities.

    Original languageEnglish (US)
    Pages (from-to)889-898
    Number of pages10
    JournalComputers and Industrial Engineering
    Volume66
    Issue number4
    DOIs
    StatePublished - Oct 4 2013

    Fingerprint

    Supply chains
    Decomposition
    Reclamation
    Experiments

    Keywords

    • Benders decomposition
    • Mixed-integer programming
    • Reverse logistics
    • Supply chain management

    ASJC Scopus subject areas

    • Computer Science(all)
    • Engineering(all)

    Cite this

    Solving a reverse supply chain design problem by improved Benders decomposition schemes. / Santibanez-Gonzalez, Ernesto D.R.; Diabat, Ali.

    In: Computers and Industrial Engineering, Vol. 66, No. 4, 04.10.2013, p. 889-898.

    Research output: Contribution to journalArticle

    Santibanez-Gonzalez, Ernesto D.R. ; Diabat, Ali. / Solving a reverse supply chain design problem by improved Benders decomposition schemes. In: Computers and Industrial Engineering. 2013 ; Vol. 66, No. 4. pp. 889-898.
    @article{fb8ac32540f9493ea0ff3cc4499c8416,
    title = "Solving a reverse supply chain design problem by improved Benders decomposition schemes",
    abstract = "In this paper we propose improved Benders decomposition schemes for solving a remanufacturing supply chain design problem (RSCP). We introduce a set of valid inequalities in order to improve the quality of the lower bound and also to accelerate the convergence of the classical Benders algorithm. We also derive quasi Pareto-optimal cuts for improving convergence and propose a Benders decomposition scheme to solve our RSCP problem. Computational experiments for randomly generated networks of up to 700 sourcing sites, 100 candidate sites for locating reprocessing facilities, and 50 reclamation facilities are presented. In general, according to our computational results, the Benders decomposition scheme based on the quasi Pareto-optimal cuts outperforms the classical algorithm with valid inequalities.",
    keywords = "Benders decomposition, Mixed-integer programming, Reverse logistics, Supply chain management",
    author = "Santibanez-Gonzalez, {Ernesto D.R.} and Ali Diabat",
    year = "2013",
    month = "10",
    day = "4",
    doi = "10.1016/j.cie.2013.09.005",
    language = "English (US)",
    volume = "66",
    pages = "889--898",
    journal = "Computers and Industrial Engineering",
    issn = "0360-8352",
    publisher = "Elsevier Limited",
    number = "4",

    }

    TY - JOUR

    T1 - Solving a reverse supply chain design problem by improved Benders decomposition schemes

    AU - Santibanez-Gonzalez, Ernesto D.R.

    AU - Diabat, Ali

    PY - 2013/10/4

    Y1 - 2013/10/4

    N2 - In this paper we propose improved Benders decomposition schemes for solving a remanufacturing supply chain design problem (RSCP). We introduce a set of valid inequalities in order to improve the quality of the lower bound and also to accelerate the convergence of the classical Benders algorithm. We also derive quasi Pareto-optimal cuts for improving convergence and propose a Benders decomposition scheme to solve our RSCP problem. Computational experiments for randomly generated networks of up to 700 sourcing sites, 100 candidate sites for locating reprocessing facilities, and 50 reclamation facilities are presented. In general, according to our computational results, the Benders decomposition scheme based on the quasi Pareto-optimal cuts outperforms the classical algorithm with valid inequalities.

    AB - In this paper we propose improved Benders decomposition schemes for solving a remanufacturing supply chain design problem (RSCP). We introduce a set of valid inequalities in order to improve the quality of the lower bound and also to accelerate the convergence of the classical Benders algorithm. We also derive quasi Pareto-optimal cuts for improving convergence and propose a Benders decomposition scheme to solve our RSCP problem. Computational experiments for randomly generated networks of up to 700 sourcing sites, 100 candidate sites for locating reprocessing facilities, and 50 reclamation facilities are presented. In general, according to our computational results, the Benders decomposition scheme based on the quasi Pareto-optimal cuts outperforms the classical algorithm with valid inequalities.

    KW - Benders decomposition

    KW - Mixed-integer programming

    KW - Reverse logistics

    KW - Supply chain management

    UR - http://www.scopus.com/inward/record.url?scp=84888307383&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84888307383&partnerID=8YFLogxK

    U2 - 10.1016/j.cie.2013.09.005

    DO - 10.1016/j.cie.2013.09.005

    M3 - Article

    VL - 66

    SP - 889

    EP - 898

    JO - Computers and Industrial Engineering

    JF - Computers and Industrial Engineering

    SN - 0360-8352

    IS - 4

    ER -