A location-inventory supply chain problem: Reformulation and piecewise linearization

Ali Diabat, Effrosyni Theodorou

    Research output: Contribution to journalArticle

    Abstract

    In this paper, we study a two-echelon inventory management problem with multiple warehouses and retailers. The problem is a natural extension to the well-known one-warehouse multi-retailer inventory problem. The problem is formulated as a mixed integer non-linear program such that its continuous relaxation is non-convex. We propose an equivalent formulation with fewer non-linear terms in the objective function so that the continuous relaxation of the new model is a convex optimization problem. We use piecewise linearization to transform the resulting MINLP to a mixed integer program and we solve it using CPLEX. Through numerical experiments, we compare the solutions obtained by solving the new formulation using CPLEX with two previously published Lagrangian relaxation based heuristics to solve the original mixed integer non-linear program. We demonstrate that the new approach is capable of providing almost the same solutions without the need of using specialized algorithms. This important contribution further implies that additional variants of the problem, such as multiple products, capacitated warehouses and routing, can be added to result in a problem that will again be solvable by commercial optimization software, while the respective Lagrangian heuristics will fail to solve such variants or extended problems.

    Original languageEnglish (US)
    Pages (from-to)381-389
    Number of pages9
    JournalComputers and Industrial Engineering
    Volume90
    DOIs
    StatePublished - Dec 1 2015

    Fingerprint

    Warehouses
    Linearization
    Supply chains
    Convex optimization
    Experiments

    Keywords

    • Integer programming
    • Location-inventory
    • Piecewise linearization
    • Supply chain

    ASJC Scopus subject areas

    • Computer Science(all)
    • Engineering(all)

    Cite this

    A location-inventory supply chain problem : Reformulation and piecewise linearization. / Diabat, Ali; Theodorou, Effrosyni.

    In: Computers and Industrial Engineering, Vol. 90, 01.12.2015, p. 381-389.

    Research output: Contribution to journalArticle

    @article{91b951aea466413eae9213836509971e,
    title = "A location-inventory supply chain problem: Reformulation and piecewise linearization",
    abstract = "In this paper, we study a two-echelon inventory management problem with multiple warehouses and retailers. The problem is a natural extension to the well-known one-warehouse multi-retailer inventory problem. The problem is formulated as a mixed integer non-linear program such that its continuous relaxation is non-convex. We propose an equivalent formulation with fewer non-linear terms in the objective function so that the continuous relaxation of the new model is a convex optimization problem. We use piecewise linearization to transform the resulting MINLP to a mixed integer program and we solve it using CPLEX. Through numerical experiments, we compare the solutions obtained by solving the new formulation using CPLEX with two previously published Lagrangian relaxation based heuristics to solve the original mixed integer non-linear program. We demonstrate that the new approach is capable of providing almost the same solutions without the need of using specialized algorithms. This important contribution further implies that additional variants of the problem, such as multiple products, capacitated warehouses and routing, can be added to result in a problem that will again be solvable by commercial optimization software, while the respective Lagrangian heuristics will fail to solve such variants or extended problems.",
    keywords = "Integer programming, Location-inventory, Piecewise linearization, Supply chain",
    author = "Ali Diabat and Effrosyni Theodorou",
    year = "2015",
    month = "12",
    day = "1",
    doi = "10.1016/j.cie.2015.05.021",
    language = "English (US)",
    volume = "90",
    pages = "381--389",
    journal = "Computers and Industrial Engineering",
    issn = "0360-8352",
    publisher = "Elsevier Limited",

    }

    TY - JOUR

    T1 - A location-inventory supply chain problem

    T2 - Reformulation and piecewise linearization

    AU - Diabat, Ali

    AU - Theodorou, Effrosyni

    PY - 2015/12/1

    Y1 - 2015/12/1

    N2 - In this paper, we study a two-echelon inventory management problem with multiple warehouses and retailers. The problem is a natural extension to the well-known one-warehouse multi-retailer inventory problem. The problem is formulated as a mixed integer non-linear program such that its continuous relaxation is non-convex. We propose an equivalent formulation with fewer non-linear terms in the objective function so that the continuous relaxation of the new model is a convex optimization problem. We use piecewise linearization to transform the resulting MINLP to a mixed integer program and we solve it using CPLEX. Through numerical experiments, we compare the solutions obtained by solving the new formulation using CPLEX with two previously published Lagrangian relaxation based heuristics to solve the original mixed integer non-linear program. We demonstrate that the new approach is capable of providing almost the same solutions without the need of using specialized algorithms. This important contribution further implies that additional variants of the problem, such as multiple products, capacitated warehouses and routing, can be added to result in a problem that will again be solvable by commercial optimization software, while the respective Lagrangian heuristics will fail to solve such variants or extended problems.

    AB - In this paper, we study a two-echelon inventory management problem with multiple warehouses and retailers. The problem is a natural extension to the well-known one-warehouse multi-retailer inventory problem. The problem is formulated as a mixed integer non-linear program such that its continuous relaxation is non-convex. We propose an equivalent formulation with fewer non-linear terms in the objective function so that the continuous relaxation of the new model is a convex optimization problem. We use piecewise linearization to transform the resulting MINLP to a mixed integer program and we solve it using CPLEX. Through numerical experiments, we compare the solutions obtained by solving the new formulation using CPLEX with two previously published Lagrangian relaxation based heuristics to solve the original mixed integer non-linear program. We demonstrate that the new approach is capable of providing almost the same solutions without the need of using specialized algorithms. This important contribution further implies that additional variants of the problem, such as multiple products, capacitated warehouses and routing, can be added to result in a problem that will again be solvable by commercial optimization software, while the respective Lagrangian heuristics will fail to solve such variants or extended problems.

    KW - Integer programming

    KW - Location-inventory

    KW - Piecewise linearization

    KW - Supply chain

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

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

    U2 - 10.1016/j.cie.2015.05.021

    DO - 10.1016/j.cie.2015.05.021

    M3 - Article

    VL - 90

    SP - 381

    EP - 389

    JO - Computers and Industrial Engineering

    JF - Computers and Industrial Engineering

    SN - 0360-8352

    ER -