Development of Two-Stage Transportation Problem Model with Fixed Cost for Opening the Distribution Centers

S. Santoso(1*), Rainisa Maini Heryanto(2),

(1) Bachelor Program in Industrial Engineering, Universitas Kristen Maranatha
(2) Bachelor Program in Industrial Engineering, Universitas Kristen Maranatha
(*) Corresponding Author
DOI: https://doi.org/10.23917/jiti.v21i1.17571

Abstract

The Two-Stage Transportation Problem (TSTP) is a model of product transportation in the supply chain. The transportation starts from the factory to customers through a distribution center (DC), which considers the fixed cost of opening a DC, the transportation cost per unit from a certain factory to a certain DC, and the transportation cost per unit from a certain DC to certain customers. This study develops a model by allowing direct delivery from the factory to the customer. From the numerical example given, the proposed model that allows direct delivery from the factory to a customer could result in a total distribution cost that is minimized to the initial model. Both models were compared with calculation using Lingo 19.0. The model developed is expected to provide options and consideration for the management to determine the right distribution and logistics strategy for their products.

Keywords

direct delivery; distribution cost; distribution strategy; supply chain; TSTP

Full Text:

PDF

References

Aida, F. N., & Rahmanda, W. (2020). Analisis Biaya Transportasi Distribusi Pupuk Menggunakan Software Lingo. Jurnal Rekayasa Sistem Industri, 5(2), 135. https://doi.org/10.33884/jrsi.v5i2.1930

Amiri, A. (2006). Designing a distribution network in a supply chain system: Formulation and efficient solution procedure. European Journal of Operational Research, 171(2), 567–576. https://doi.org/10.1016/j.ejor.2004.09.018

Antony Arokia Durai Raj, K., & Rajendran, C. (2012). A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem. Computers and Operations Research, 39(9), 2016–2032. https://doi.org/10.1016/j.cor.2011.09.020

Calvete, H. I., Galé, C., & Iranzo, J. A. (2014). Planning of a decentralized distribution network using bilevel optimization. Omega (United Kingdom), 49, 30–41. https://doi.org/10.1016/j.omega.2014.05.004

Cosma, O., B, P. P., Oliviu, M., & Zelina, I. (2018). A Hybrid Iterated Local Search for Solving a Particular Two-Stage Fixed-Charge Transportation Problem (Vol. 1). Springer International Publishing. https://doi.org/10.1007/978-3-319-92639-1

Cosma, O., Danciulescu, D., & Pop, P. C. (2019). On the Two-Stage Transportation Problem with Fixed Charge for Opening the Distribution Centers. IEEE Access, 7, 113684–113698. https://doi.org/10.1109/ACCESS.2019.2936095

Cosma, O., Pop, P. C., & Sabo, C. (2020). An efficient hybrid genetic approach for solving the two-stage supply chain network design problem with fixed costs. Mathematics, 8(5). https://doi.org/10.3390/MATH8050712

Cosma, O., Pop, P. C., & Sitar, C. P. (2019). An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem. Carpathian Journal of Mathematics, 35(2), 153–164. https://doi.org/10.37193/cjm.2019.02.04

Cosma, O., Pop, P., & Zelina, I. (2020). An Efficient Soft Computing Approach for Solving the Two-Stage Transportation Problem with Fixed Costs. Advances in Intelligent Systems and Computing, 950, 523–532. https://doi.org/10.1007/978-3-030-20055-8_50

Del R. Santibanez-Gonzalez, E., Mateus, G. R., & Luna, H. P. (2011). Solving a public sector sustainable supply chain problem: A genetic algorithm approach. Proceedings of the 2011 International Conference on Artificial Intelligence, ICAI 2011, 2, 507–512.

Fatma, E., & Manurung, S. (2021). Optimasi Biaya Distribusi Multi-eselon untuk Multi-produk menggunakan Mix Integer Linier Programming Optimization of Multi-echelon Distribution Costs for Multi- products using Mix Integer Linear Programming. Jurnal Manajemen Transportasi & Logistik, 08(01), 75–82.

Gen, M., Altiparmak, F., & Lin, L. (2006). A genetic algorithm for two-stage transportation problem using priority-based encoding. OR Spectrum, 28(3), 337–354. https://doi.org/10.1007/s00291-005-0029-9

Hong, J., Diabat, A., Panicker, V. V., & Rajagopalan, S. (2018). A two-stage supply chain problem with fixed costs: An ant colony optimization approach. International Journal of Production Economics, 204, 214–226. https://doi.org/10.1016/j.ijpe.2018.07.019

Jawahar, N., & Balaji, A. N. (2009). A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge. In European Journal of Operational Research (Vol. 194, Issue 2). Elsevier B.V. https://doi.org/10.1016/j.ejor.2007.12.005

Jayaraman, V., & Pirkul, H. (2001). Planning and coordination of production and distribution facilities for multiple commodities. European Journal of Operational Research, 133(2), 394–408. https://doi.org/10.1016/S0377-2217(00)00033-3

Marín, A. (2007). Lower bounds for the two-stage uncapacitated facility location problem. European Journal of Operational Research, 179(3), 1126–1142. https://doi.org/10.1016/j.ejor.2005.04.052

Marín, A., & Pelegrín, B. (1997). A branch-and-bound algorithm for the transportation problem with location of p transshipment points. Computers and Operations Research, 24(7), 659–678. https://doi.org/10.1016/S0305-0548(96)00078-0

Pirkul, H., & Jayaraman, V. (1998). a Multi-Commodity , Multi-Plant , Capacitated Facility Location Problem : Formulation and. Computers and Operations Research, 25(10), 869–878.

Pop, P. C., Sabo, C., Biesinger, B., Hu, B., & Raidl, G. R. (2017). Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm. Carpathian Journal of Mathematics, 33(3), 364–370. https://doi.org/10.37193/cjm.2017.03.11

Pop, P., Matei, O., Sitar, C. P., & Zelina, I. (2016). A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem. Carpathian Journal of Mathematics, 32(2), 225–232. https://doi.org/10.37193/cjm.2016.02.10

Article Metrics

Abstract view(s): 264 time(s)
PDF: 317 time(s)

Refbacks

  • There are currently no refbacks.