Decomposition heuristic to minimize total cost in a multi-level supply chain network

Byung Ki Lee, Kyung Hwan Kang, Young Hoon Lee

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

In this paper, the distribution planning model for the multi-level supply chain network is studied. Products which are manufactured at factory are delivered to customers through warehouses and distribution centers for the given customer demands. The objective function of suggested model is to minimize logistic costs such as replenishment cost, inventory holding cost and transportation cost. A mixed integer programming formulation and heuristics for practical use are suggested. Heuristics are composed of two steps: decomposition and post improving process. In the decomposition heuristics, the problems are solved optimally only considering the transportation route first by the minimum cost flow problem, and the replenishment plan is generated by applying the cost-saving heuristic which was originally suggested in the manufacturing assembly line operation, and integrating with the transportation plan. Another heuristic, in which the original model is segmented due to the time periods, and run on a rolling horizon based method, is suggested. With the post-improving process using tabu search method, the performances are evaluated, and it was shown that solutions can be computed within a reasonable computation time by the gap of about 10% in average from the lower bound of the optimal solutions.

Original languageEnglish
Pages (from-to)945-959
Number of pages15
JournalComputers and Industrial Engineering
Volume54
Issue number4
DOIs
Publication statusPublished - 2008 May 1

Fingerprint

Supply Chain
Supply chains
Heuristics
Decomposition
Minimise
Decompose
Costs
Customers
Minimum Cost Flow
Distribution Center
Transportation routes
Assembly Line
Mixed Integer Programming
Tabu Search
Search Methods
Tabu search
Warehouses
Logistics
Integer programming
Horizon

All Science Journal Classification (ASJC) codes

  • Management Science and Operations Research
  • Information Systems and Management
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this

@article{697f8b0757d6432e924c6c0f4e3b18b2,
title = "Decomposition heuristic to minimize total cost in a multi-level supply chain network",
abstract = "In this paper, the distribution planning model for the multi-level supply chain network is studied. Products which are manufactured at factory are delivered to customers through warehouses and distribution centers for the given customer demands. The objective function of suggested model is to minimize logistic costs such as replenishment cost, inventory holding cost and transportation cost. A mixed integer programming formulation and heuristics for practical use are suggested. Heuristics are composed of two steps: decomposition and post improving process. In the decomposition heuristics, the problems are solved optimally only considering the transportation route first by the minimum cost flow problem, and the replenishment plan is generated by applying the cost-saving heuristic which was originally suggested in the manufacturing assembly line operation, and integrating with the transportation plan. Another heuristic, in which the original model is segmented due to the time periods, and run on a rolling horizon based method, is suggested. With the post-improving process using tabu search method, the performances are evaluated, and it was shown that solutions can be computed within a reasonable computation time by the gap of about 10{\%} in average from the lower bound of the optimal solutions.",
author = "Lee, {Byung Ki} and Kang, {Kyung Hwan} and Lee, {Young Hoon}",
year = "2008",
month = "5",
day = "1",
doi = "10.1016/j.cie.2007.11.005",
language = "English",
volume = "54",
pages = "945--959",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",
number = "4",

}

Decomposition heuristic to minimize total cost in a multi-level supply chain network. / Lee, Byung Ki; Kang, Kyung Hwan; Lee, Young Hoon.

In: Computers and Industrial Engineering, Vol. 54, No. 4, 01.05.2008, p. 945-959.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Decomposition heuristic to minimize total cost in a multi-level supply chain network

AU - Lee, Byung Ki

AU - Kang, Kyung Hwan

AU - Lee, Young Hoon

PY - 2008/5/1

Y1 - 2008/5/1

N2 - In this paper, the distribution planning model for the multi-level supply chain network is studied. Products which are manufactured at factory are delivered to customers through warehouses and distribution centers for the given customer demands. The objective function of suggested model is to minimize logistic costs such as replenishment cost, inventory holding cost and transportation cost. A mixed integer programming formulation and heuristics for practical use are suggested. Heuristics are composed of two steps: decomposition and post improving process. In the decomposition heuristics, the problems are solved optimally only considering the transportation route first by the minimum cost flow problem, and the replenishment plan is generated by applying the cost-saving heuristic which was originally suggested in the manufacturing assembly line operation, and integrating with the transportation plan. Another heuristic, in which the original model is segmented due to the time periods, and run on a rolling horizon based method, is suggested. With the post-improving process using tabu search method, the performances are evaluated, and it was shown that solutions can be computed within a reasonable computation time by the gap of about 10% in average from the lower bound of the optimal solutions.

AB - In this paper, the distribution planning model for the multi-level supply chain network is studied. Products which are manufactured at factory are delivered to customers through warehouses and distribution centers for the given customer demands. The objective function of suggested model is to minimize logistic costs such as replenishment cost, inventory holding cost and transportation cost. A mixed integer programming formulation and heuristics for practical use are suggested. Heuristics are composed of two steps: decomposition and post improving process. In the decomposition heuristics, the problems are solved optimally only considering the transportation route first by the minimum cost flow problem, and the replenishment plan is generated by applying the cost-saving heuristic which was originally suggested in the manufacturing assembly line operation, and integrating with the transportation plan. Another heuristic, in which the original model is segmented due to the time periods, and run on a rolling horizon based method, is suggested. With the post-improving process using tabu search method, the performances are evaluated, and it was shown that solutions can be computed within a reasonable computation time by the gap of about 10% in average from the lower bound of the optimal solutions.

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

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

U2 - 10.1016/j.cie.2007.11.005

DO - 10.1016/j.cie.2007.11.005

M3 - Article

VL - 54

SP - 945

EP - 959

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

IS - 4

ER -