Large-scale reverse supply chain network design

An accelerated Benders decomposition algorithm

Ahmed Alshamsi, Ali Diabat

    Research output: Contribution to journalArticle

    Abstract

    Reverse logistics (RL) is a term that captures any process that involves the movement of goods or services from their destination back to their source. RL is increasingly gaining recognition as an essential component in the design process of supply chains. In this paper, we formulate a mixed-integer linear programming (MILP) model that aims to determine the optimal locations and capacities of various nodes such as inspection centers and remanufacturing facilities and to help decision makers find optimal transportation decisions and to determine the number and type of transportation units required in the network. We develop an exact method to solve large-scale real-sized instances of this problem. We initially attempt to solve the problem using the traditional Benders Decomposition (BD) technique which fails to solve the problem in reasonable computational times. We improve the traditional BD technique by adding several accelerating methods such as trust-region, logistics constraints, Pareto-optimal cuts, restructuring of the problem, and continuous relaxation of the integer variables to increase the convergence rate and to reduce the total number of cuts required in the master problem. In almost all the instances, we were able to reach optimal solutions. For the remaining instances, we succeed in solving the largest problem with an optimality gap of 0.5% and within a reasonable running time. The paper highlights and evaluates the performance and effectiveness of the different acceleration techniques of our improved BD algorithm along with the computational results.

    Original languageEnglish (US)
    Pages (from-to)545-559
    Number of pages15
    JournalComputers and Industrial Engineering
    Volume124
    DOIs
    StatePublished - Oct 1 2018

    Fingerprint

    Supply chains
    Logistics
    Decomposition
    Linear programming
    Inspection

    Keywords

    • Acceleration techniques
    • Benders decomposition
    • Large-scale optimization
    • Pareto-optimal cut
    • Reverse logistics

    ASJC Scopus subject areas

    • Computer Science(all)
    • Engineering(all)

    Cite this

    Large-scale reverse supply chain network design : An accelerated Benders decomposition algorithm. / Alshamsi, Ahmed; Diabat, Ali.

    In: Computers and Industrial Engineering, Vol. 124, 01.10.2018, p. 545-559.

    Research output: Contribution to journalArticle

    @article{dcc1c702158344089f9e0705f32bc6e4,
    title = "Large-scale reverse supply chain network design: An accelerated Benders decomposition algorithm",
    abstract = "Reverse logistics (RL) is a term that captures any process that involves the movement of goods or services from their destination back to their source. RL is increasingly gaining recognition as an essential component in the design process of supply chains. In this paper, we formulate a mixed-integer linear programming (MILP) model that aims to determine the optimal locations and capacities of various nodes such as inspection centers and remanufacturing facilities and to help decision makers find optimal transportation decisions and to determine the number and type of transportation units required in the network. We develop an exact method to solve large-scale real-sized instances of this problem. We initially attempt to solve the problem using the traditional Benders Decomposition (BD) technique which fails to solve the problem in reasonable computational times. We improve the traditional BD technique by adding several accelerating methods such as trust-region, logistics constraints, Pareto-optimal cuts, restructuring of the problem, and continuous relaxation of the integer variables to increase the convergence rate and to reduce the total number of cuts required in the master problem. In almost all the instances, we were able to reach optimal solutions. For the remaining instances, we succeed in solving the largest problem with an optimality gap of 0.5{\%} and within a reasonable running time. The paper highlights and evaluates the performance and effectiveness of the different acceleration techniques of our improved BD algorithm along with the computational results.",
    keywords = "Acceleration techniques, Benders decomposition, Large-scale optimization, Pareto-optimal cut, Reverse logistics",
    author = "Ahmed Alshamsi and Ali Diabat",
    year = "2018",
    month = "10",
    day = "1",
    doi = "10.1016/j.cie.2018.05.057",
    language = "English (US)",
    volume = "124",
    pages = "545--559",
    journal = "Computers and Industrial Engineering",
    issn = "0360-8352",
    publisher = "Elsevier Limited",

    }

    TY - JOUR

    T1 - Large-scale reverse supply chain network design

    T2 - An accelerated Benders decomposition algorithm

    AU - Alshamsi, Ahmed

    AU - Diabat, Ali

    PY - 2018/10/1

    Y1 - 2018/10/1

    N2 - Reverse logistics (RL) is a term that captures any process that involves the movement of goods or services from their destination back to their source. RL is increasingly gaining recognition as an essential component in the design process of supply chains. In this paper, we formulate a mixed-integer linear programming (MILP) model that aims to determine the optimal locations and capacities of various nodes such as inspection centers and remanufacturing facilities and to help decision makers find optimal transportation decisions and to determine the number and type of transportation units required in the network. We develop an exact method to solve large-scale real-sized instances of this problem. We initially attempt to solve the problem using the traditional Benders Decomposition (BD) technique which fails to solve the problem in reasonable computational times. We improve the traditional BD technique by adding several accelerating methods such as trust-region, logistics constraints, Pareto-optimal cuts, restructuring of the problem, and continuous relaxation of the integer variables to increase the convergence rate and to reduce the total number of cuts required in the master problem. In almost all the instances, we were able to reach optimal solutions. For the remaining instances, we succeed in solving the largest problem with an optimality gap of 0.5% and within a reasonable running time. The paper highlights and evaluates the performance and effectiveness of the different acceleration techniques of our improved BD algorithm along with the computational results.

    AB - Reverse logistics (RL) is a term that captures any process that involves the movement of goods or services from their destination back to their source. RL is increasingly gaining recognition as an essential component in the design process of supply chains. In this paper, we formulate a mixed-integer linear programming (MILP) model that aims to determine the optimal locations and capacities of various nodes such as inspection centers and remanufacturing facilities and to help decision makers find optimal transportation decisions and to determine the number and type of transportation units required in the network. We develop an exact method to solve large-scale real-sized instances of this problem. We initially attempt to solve the problem using the traditional Benders Decomposition (BD) technique which fails to solve the problem in reasonable computational times. We improve the traditional BD technique by adding several accelerating methods such as trust-region, logistics constraints, Pareto-optimal cuts, restructuring of the problem, and continuous relaxation of the integer variables to increase the convergence rate and to reduce the total number of cuts required in the master problem. In almost all the instances, we were able to reach optimal solutions. For the remaining instances, we succeed in solving the largest problem with an optimality gap of 0.5% and within a reasonable running time. The paper highlights and evaluates the performance and effectiveness of the different acceleration techniques of our improved BD algorithm along with the computational results.

    KW - Acceleration techniques

    KW - Benders decomposition

    KW - Large-scale optimization

    KW - Pareto-optimal cut

    KW - Reverse logistics

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

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

    U2 - 10.1016/j.cie.2018.05.057

    DO - 10.1016/j.cie.2018.05.057

    M3 - Article

    VL - 124

    SP - 545

    EP - 559

    JO - Computers and Industrial Engineering

    JF - Computers and Industrial Engineering

    SN - 0360-8352

    ER -