A two-stage supply chain problem with fixed costs: An ant colony optimization approach

Jiangtao Hong, Ali Diabat, Vinay V. Panicker, Sridharan Rajagopalan

    Research output: Contribution to journalArticle

    Abstract

    This paper focuses on a distribution-allocation problem in a two-stage supply chain with fixed costs. The problem is intended to determine a supply chain configuration of manufacturing plants, distributors, and retailers in the distribution network. The problem is formulated as an integer-programming model. The mathematical model incorporates unit transportation costs between entities and two types of fixed costs, including fixed cost for transportation routes and fixed cost for opening facilities. The objective of the model is to minimise the total costs of supply chain operation incurred in allocating the retailers to a distribution centre and the distribution centres to a manufacturing plant. An Ant Colony Optimization (ACO)-based heuristic is developed for solving the model. The heuristic is tested on various problem sizes generated. All the problem instances are solved using solver LINGO to evaluate the robustness of the ACO-based algorithm. The ACO-based heuristic emerges as a computationally efficient algorithm. Solutions can be obtained using the ACO-based heuristic within a reasonable computational time with a gap of about 10% on average from the optimal solutions.

    Original languageEnglish (US)
    Pages (from-to)214-226
    Number of pages13
    JournalInternational Journal of Production Economics
    Volume204
    DOIs
    StatePublished - Oct 1 2018

    Fingerprint

    Ant colony optimization
    Supply chains
    Costs
    Transportation routes
    Integer programming
    Electric power distribution
    Supply chain
    Heuristics
    Fixed costs
    Mathematical models
    Distribution center
    Retailers
    Manufacturing

    Keywords

    • Ant colony optimization
    • Distribution-allocation
    • Fixed charge transportation problem
    • Supply chain

    ASJC Scopus subject areas

    • Business, Management and Accounting(all)
    • Economics and Econometrics
    • Management Science and Operations Research
    • Industrial and Manufacturing Engineering

    Cite this

    A two-stage supply chain problem with fixed costs : An ant colony optimization approach. / Hong, Jiangtao; Diabat, Ali; Panicker, Vinay V.; Rajagopalan, Sridharan.

    In: International Journal of Production Economics, Vol. 204, 01.10.2018, p. 214-226.

    Research output: Contribution to journalArticle

    Hong, Jiangtao ; Diabat, Ali ; Panicker, Vinay V. ; Rajagopalan, Sridharan. / A two-stage supply chain problem with fixed costs : An ant colony optimization approach. In: International Journal of Production Economics. 2018 ; Vol. 204. pp. 214-226.
    @article{dd849ef0d8e84123adaf7f11586e93e2,
    title = "A two-stage supply chain problem with fixed costs: An ant colony optimization approach",
    abstract = "This paper focuses on a distribution-allocation problem in a two-stage supply chain with fixed costs. The problem is intended to determine a supply chain configuration of manufacturing plants, distributors, and retailers in the distribution network. The problem is formulated as an integer-programming model. The mathematical model incorporates unit transportation costs between entities and two types of fixed costs, including fixed cost for transportation routes and fixed cost for opening facilities. The objective of the model is to minimise the total costs of supply chain operation incurred in allocating the retailers to a distribution centre and the distribution centres to a manufacturing plant. An Ant Colony Optimization (ACO)-based heuristic is developed for solving the model. The heuristic is tested on various problem sizes generated. All the problem instances are solved using solver LINGO to evaluate the robustness of the ACO-based algorithm. The ACO-based heuristic emerges as a computationally efficient algorithm. Solutions can be obtained using the ACO-based heuristic within a reasonable computational time with a gap of about 10{\%} on average from the optimal solutions.",
    keywords = "Ant colony optimization, Distribution-allocation, Fixed charge transportation problem, Supply chain",
    author = "Jiangtao Hong and Ali Diabat and Panicker, {Vinay V.} and Sridharan Rajagopalan",
    year = "2018",
    month = "10",
    day = "1",
    doi = "10.1016/j.ijpe.2018.07.019",
    language = "English (US)",
    volume = "204",
    pages = "214--226",
    journal = "International Journal of Production Economics",
    issn = "0925-5273",
    publisher = "Elsevier",

    }

    TY - JOUR

    T1 - A two-stage supply chain problem with fixed costs

    T2 - An ant colony optimization approach

    AU - Hong, Jiangtao

    AU - Diabat, Ali

    AU - Panicker, Vinay V.

    AU - Rajagopalan, Sridharan

    PY - 2018/10/1

    Y1 - 2018/10/1

    N2 - This paper focuses on a distribution-allocation problem in a two-stage supply chain with fixed costs. The problem is intended to determine a supply chain configuration of manufacturing plants, distributors, and retailers in the distribution network. The problem is formulated as an integer-programming model. The mathematical model incorporates unit transportation costs between entities and two types of fixed costs, including fixed cost for transportation routes and fixed cost for opening facilities. The objective of the model is to minimise the total costs of supply chain operation incurred in allocating the retailers to a distribution centre and the distribution centres to a manufacturing plant. An Ant Colony Optimization (ACO)-based heuristic is developed for solving the model. The heuristic is tested on various problem sizes generated. All the problem instances are solved using solver LINGO to evaluate the robustness of the ACO-based algorithm. The ACO-based heuristic emerges as a computationally efficient algorithm. Solutions can be obtained using the ACO-based heuristic within a reasonable computational time with a gap of about 10% on average from the optimal solutions.

    AB - This paper focuses on a distribution-allocation problem in a two-stage supply chain with fixed costs. The problem is intended to determine a supply chain configuration of manufacturing plants, distributors, and retailers in the distribution network. The problem is formulated as an integer-programming model. The mathematical model incorporates unit transportation costs between entities and two types of fixed costs, including fixed cost for transportation routes and fixed cost for opening facilities. The objective of the model is to minimise the total costs of supply chain operation incurred in allocating the retailers to a distribution centre and the distribution centres to a manufacturing plant. An Ant Colony Optimization (ACO)-based heuristic is developed for solving the model. The heuristic is tested on various problem sizes generated. All the problem instances are solved using solver LINGO to evaluate the robustness of the ACO-based algorithm. The ACO-based heuristic emerges as a computationally efficient algorithm. Solutions can be obtained using the ACO-based heuristic within a reasonable computational time with a gap of about 10% on average from the optimal solutions.

    KW - Ant colony optimization

    KW - Distribution-allocation

    KW - Fixed charge transportation problem

    KW - Supply chain

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

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

    U2 - 10.1016/j.ijpe.2018.07.019

    DO - 10.1016/j.ijpe.2018.07.019

    M3 - Article

    AN - SCOPUS:85053142278

    VL - 204

    SP - 214

    EP - 226

    JO - International Journal of Production Economics

    JF - International Journal of Production Economics

    SN - 0925-5273

    ER -