ISSN: 2222-6990
Open access
Supply chain is a systematic and strategic coordination of the traditional business function to across business function within supply chain for the purpose of improving the long-term performance of the business. The objective of the paper is to understand the saving concepts are used in operational path to achieve optimization in term of cost saving. Business nowadays going towards to minimizing the operational in order to compete with others The purpose is to achieve the minimization in inventory routing problem (IRP) with cost minimization consists inventory and transportation costs focus on the single warehouse with multiple customers. The operational costs can be reduced by solving the inventory management and transportation process for vehicle to replenish the inventory. In this paper, a mathematical model was developed and simulated by using an optimization software package to achieve the optimization. The findings show that the optimization can be achieved by reducing the movement of the vehicle To conclude, the bigger the vehicle’s capacity, much capacity can add and less routes taken by the vehicle to supply the inventory to the customers.
Ahmad, M. A. (2017). Solving The Single-Period Inventory Routing Problem With The Deterministic Approach. 158–168.
Beasley, J. E. (1983). Route first—cluster second methods for vehicle routing. Omega, 11(4), 403-408.
Bertsimas, D. J., & Simchi-Levi, D. (1996). A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Operations research, 44(2), 286-304.
Chen, X., Zhou, Y., Tang, Z., & Luo, Q. (2017). A hybrid algorithm combining glowworm swarm optimization and complete 2-opt algorithm for spherical travelling salesman problems. Applied Soft Computing Journal, 58, 104–114.
Comert, S. E., Yazgan, H. R., K?r, S., & Yener, F. (2018). A cluster first-route second approach for a capacitated vehicle routing problem: A case study. International Journal of Procurement Management, 11(4), 399–419.
Fisher, M. L., & Jaikumar, R. (1984). The local delivery problem: algorithms and applications. Publication of: Elsevier Science Publishers BV.
Gillet, B., & Miller, L. (1974). A Heuristic Algorithm for the Vehicle Dispatching Problem. Opns. Res, 22-340.
Haimovich, M., & Rinnooy Kan, A. H. (1985). Bounds and heuristics for capacitated routing problems. Mathematics of operations Research, 10(4), 527-542.
Harahap, A. Z. M. K., & Abdul Rahim, M. K. I. (2022). A Single Period Deterministic Inventory Routing Model for Solving Problems in the Agriculture Industry. Journal of Applied Science and Engineering (Taiwan), 25(6), 945–950.
Harahap, A. Z. M. K., & Rahim, M. K. I. A. (2017). Deterministic inventory routing problem (DIRP): A literature review. International Journal of Supply Chain Management, 6(4), 284–288.
Iassinovskaia, G., Limbourg, S., & Riane, F. (2017). The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains. International Journal of Production Economics, 183, 570.
Karagul, K., Aydemir, E., & Tokat, S. (2016). Using 2-Opt based evolution strategy for travelling salesman problem. An International Journal of Optimization and Control: Theories & Applications (IJOCTA), 6(2), 103–113.
Lee, M. T., Chen, B. Y., & Lai, Y. C. (2020). A hybrid tabu search and 2-OPT path programming for mission route planning of multiple robots under range limitations. Electronics (Switzerland), 9(3).
Lin, S. (1965). Computer solutions of the traveling salesman problem. Bell System Technical Journal, 44(10), 2245-2269.
Markov, I., Maknoon, Y., & Varone, S. (2016). Inventory routing with non-stationary stochastic demands Inventory routing with non-stationary stochastic demands Transport and Mobility Laboratory École Polytechnique Fédérale de Lausanne Transport and Mobility Laboratory , École Polytechnique Fédérale d. April 2017.
Miranda-Bront, J. J., Curcio, B., Mendez-Díaz, I., Montero, A., Pousa, F., & Zabala, P. (2017). A cluster-first route-second approach for the swap body vehicle routing problem. Annals of Operations Research, 253(2), 935–956.
Oppen, J., Lokketangen, A., & Desrosiers, J. (2010). Solving a rich vehicle routing and inventory problem using column generation. Computers and Operations Research, 37(7), 1308–1317.
Ouelhadj, S. D., & Wall, G. (2017). Optimisation Models and Heuristic Methods for Deterministic and Stochastic Inventory Routing Problems By Chanicha Moryadee Thesis submitted to the University of Portsmouth for the degree of Doctor of Philosophy Department of Mathematics. September.
Prins, C., Lacomme, P., & Prodhon, C. (2014). Order-first split-second methods for vehicle routing problems: A review. Transportation Research Part C: Emerging Technologies, 40, 179–200.
Rahim, M. K. I. A., Abidin, R., Iteng, R., & Lamsali, H. (2016). The integrated model for solving the single-period deterministic inventory routing problem. AIP Conference Proceedings, 1761(October 2017).
Rahim, M. K. I. A., Radzuan, K., & Yaakob, M. (2016). Integrated analysis of inventory management and transportation systems for the single-period problem. Advanced Science Letters, 22(9), 2113–2116.
Rahimi, M. (2017). Inventory routing problem under dynamic, uncertain and green considerations.
Suraraksa, J., & Shin, K. S. (2019). Urban transportation network design for fresh fruit and vegetables using gis-the case of bangkok. Applied Sciences (Switzerland), 9(23).
In-Text Citation: (Harahap & Rahim, 2023)
To Cite this Article: Harahap, A. Z. M. K., & Rahim, M. K. I. A. (2023). Saving Concepts in Supply Chain Management: A Study on Inventory and Transportation Costs. International Journal of Academic Research in Business and Social Sciences, 13(6), 239 – 252.
Copyright: © 2023 The Author(s)
Published by Human Resource Management Academic Research Society (www.hrmars.com)
This article is published under the Creative Commons Attribution (CC BY 4.0) license. Anyone may reproduce, distribute, translate and create derivative works of this article (for both commercial and non0-commercial purposes), subject to full attribution to the original publication and authors. The full terms of this license may be seen at: http://creativecommons.org/licences/by/4.0/legalcode