A column generation approach for a cross-docking network design problem

Hayato Isa, Jun Imaizumi, Susumu Morito

    Research output: Contribution to journalArticle

    Abstract

    Cost reduction in logistics has been an important issue in supply chain management. Cross-docking is known as one of distribution strategies to cope with cost reduction. A cross-docking center is a warehouse in which incoming commodities from venders are transshipped and from which stores are supplied, without holding any stock in it. In this paper, we consider a cross-docking network design problem and propose a mathematical programming model for it. In this problem, decision variables are whether each cross-docking center is established or not, transportation quantity among venders, cross-docking points and stores in the established network. Transportation is performed by vehicles and we consider two types of vehicles. The difference between them is their capacity. This problem can be formulated into a mixed integer programming problem. We reformulate it into a set-partitioning-type problem and apply the column generation method. In the formulation, each column includes information corresponding to a "transportation pattern" giving the type and the number of vehicles used as well as their origin and destination. We also propose an acceleration strategy of column generation for finding, with a simple detection method, "effective" sub-problems which tend to yield columns with negative reduced cost. Finally, we demonstrate numerical results from computational experiments. The results suggest that our approach works well and provides good solutions within acceptable time.

    Original languageEnglish
    Pages (from-to)499-509
    Number of pages11
    JournalJournal of Japan Industrial Management Association
    Volume64
    Issue number4
    Publication statusPublished - 2013

    Fingerprint

    Column Generation
    Docking
    Network Design
    Cost reduction
    Supply chain management
    Mathematical programming
    Warehouses
    Integer programming
    Costs
    Logistics
    Set Partitioning
    Supply Chain Management
    Mixed Integer Programming
    Mathematical Programming
    Decision problem
    Computational Experiments
    Programming Model
    Column generation
    Cross-docking
    Network design

    Keywords

    • Column generation
    • Cross-docking
    • Heuristics
    • Integer program
    • Network design problem

    ASJC Scopus subject areas

    • Industrial and Manufacturing Engineering
    • Applied Mathematics
    • Management Science and Operations Research
    • Strategy and Management

    Cite this

    A column generation approach for a cross-docking network design problem. / Isa, Hayato; Imaizumi, Jun; Morito, Susumu.

    In: Journal of Japan Industrial Management Association, Vol. 64, No. 4, 2013, p. 499-509.

    Research output: Contribution to journalArticle

    Isa, Hayato ; Imaizumi, Jun ; Morito, Susumu. / A column generation approach for a cross-docking network design problem. In: Journal of Japan Industrial Management Association. 2013 ; Vol. 64, No. 4. pp. 499-509.
    @article{88b191d2430b4cc8b89856232e3a01a1,
    title = "A column generation approach for a cross-docking network design problem",
    abstract = "Cost reduction in logistics has been an important issue in supply chain management. Cross-docking is known as one of distribution strategies to cope with cost reduction. A cross-docking center is a warehouse in which incoming commodities from venders are transshipped and from which stores are supplied, without holding any stock in it. In this paper, we consider a cross-docking network design problem and propose a mathematical programming model for it. In this problem, decision variables are whether each cross-docking center is established or not, transportation quantity among venders, cross-docking points and stores in the established network. Transportation is performed by vehicles and we consider two types of vehicles. The difference between them is their capacity. This problem can be formulated into a mixed integer programming problem. We reformulate it into a set-partitioning-type problem and apply the column generation method. In the formulation, each column includes information corresponding to a {"}transportation pattern{"} giving the type and the number of vehicles used as well as their origin and destination. We also propose an acceleration strategy of column generation for finding, with a simple detection method, {"}effective{"} sub-problems which tend to yield columns with negative reduced cost. Finally, we demonstrate numerical results from computational experiments. The results suggest that our approach works well and provides good solutions within acceptable time.",
    keywords = "Column generation, Cross-docking, Heuristics, Integer program, Network design problem",
    author = "Hayato Isa and Jun Imaizumi and Susumu Morito",
    year = "2013",
    language = "English",
    volume = "64",
    pages = "499--509",
    journal = "Journal of Japan Industrial Management Association",
    issn = "0386-4812",
    publisher = "Nihon Keikei Kogakkai",
    number = "4",

    }

    TY - JOUR

    T1 - A column generation approach for a cross-docking network design problem

    AU - Isa, Hayato

    AU - Imaizumi, Jun

    AU - Morito, Susumu

    PY - 2013

    Y1 - 2013

    N2 - Cost reduction in logistics has been an important issue in supply chain management. Cross-docking is known as one of distribution strategies to cope with cost reduction. A cross-docking center is a warehouse in which incoming commodities from venders are transshipped and from which stores are supplied, without holding any stock in it. In this paper, we consider a cross-docking network design problem and propose a mathematical programming model for it. In this problem, decision variables are whether each cross-docking center is established or not, transportation quantity among venders, cross-docking points and stores in the established network. Transportation is performed by vehicles and we consider two types of vehicles. The difference between them is their capacity. This problem can be formulated into a mixed integer programming problem. We reformulate it into a set-partitioning-type problem and apply the column generation method. In the formulation, each column includes information corresponding to a "transportation pattern" giving the type and the number of vehicles used as well as their origin and destination. We also propose an acceleration strategy of column generation for finding, with a simple detection method, "effective" sub-problems which tend to yield columns with negative reduced cost. Finally, we demonstrate numerical results from computational experiments. The results suggest that our approach works well and provides good solutions within acceptable time.

    AB - Cost reduction in logistics has been an important issue in supply chain management. Cross-docking is known as one of distribution strategies to cope with cost reduction. A cross-docking center is a warehouse in which incoming commodities from venders are transshipped and from which stores are supplied, without holding any stock in it. In this paper, we consider a cross-docking network design problem and propose a mathematical programming model for it. In this problem, decision variables are whether each cross-docking center is established or not, transportation quantity among venders, cross-docking points and stores in the established network. Transportation is performed by vehicles and we consider two types of vehicles. The difference between them is their capacity. This problem can be formulated into a mixed integer programming problem. We reformulate it into a set-partitioning-type problem and apply the column generation method. In the formulation, each column includes information corresponding to a "transportation pattern" giving the type and the number of vehicles used as well as their origin and destination. We also propose an acceleration strategy of column generation for finding, with a simple detection method, "effective" sub-problems which tend to yield columns with negative reduced cost. Finally, we demonstrate numerical results from computational experiments. The results suggest that our approach works well and provides good solutions within acceptable time.

    KW - Column generation

    KW - Cross-docking

    KW - Heuristics

    KW - Integer program

    KW - Network design problem

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

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

    M3 - Article

    AN - SCOPUS:84923254220

    VL - 64

    SP - 499

    EP - 509

    JO - Journal of Japan Industrial Management Association

    JF - Journal of Japan Industrial Management Association

    SN - 0386-4812

    IS - 4

    ER -