• DOI:10.4018/jisscm.2009062902
• Corpus ID: 16171630

Genetic Algorithm to Solve Multi-Period, Multi-Product, Bi-Echelon Supply Chain Network Design Problem

@article{Dhanalakshmi2009GeneticAT,
  title={Genetic Algorithm to Solve Multi-Period, Multi-Product, Bi-Echelon Supply Chain Network Design Problem},
  author={R. Dhanalakshmi and P. Parthiban and K. Ganesh and T. Arunkumar},
  journal={Int. J. Inf. Syst. Supply Chain Manag.},
  year={2009},
  volume={2},
  pages={24-42}
}

• R. Dhanalakshmi, P. Parthiban, +1 author T. Arunkumar
• Published 1 October 2009
• Business
• Int. J. Inf. Syst. Supply Chain Manag.

In many multi-stage manufacturing supply chains, transportation related costs are a significant portion of final product costs. It is often crucial for successful decision making approaches in multi-stage manufacturing supply chains to explicitly account for non-linear transportation costs. In this article, we have explored this problem by considering a Two-Stage Production-Transportation (TSPT). A two-stage supply chain that faces a deterministic stream of external demands for a single product is considered. A finite supply of raw materials, and finite production at stage one has been assumed. Items are manufactured at stage one and transported to stage two, where the storage capacity of the warehouses is limited. Packaging is completed at stage two (that is, value is added to each item, but no new items are created), and the finished goods inventories are stored which is used to meet the final demand of customers. During each period, the optimized production levels in stage one, as well as transportation levels between stage one and stage two and routing structure from the production plant to warehouses and then to customers, must be determined. The authors consider “different cost structures,†for both manufacturing and transportation. This TSPT model with capacity constraint at both stages is optimized using Genetic Algorithms (GA) and the results obtained are compared with the results of other optimization techniques of complete enumeration, LINDO, and CPLEX.