BUILDING MATHEMATICS MODELING FOR SOLVED TRANSPORTATION PROBLEMS AND OPTIMIZING WITH MORE FOR FEWER ALGORITHMS IN THE BUSINESS COMMUNITY

Authors

  • Luftan Anas Zahir Tulungagung University
  • Abdul Halim National Dong Hwa University

DOI:

https://doi.org/10.36563/proceeding.v4i0.74

Keywords:

Mathematics Modeling, More for Less, Mathem Transportation, Mix Problem, Optimizing

Abstract

Mathematical modeling supports the development of the business world and the industrial world, especially in transportation (Widana, 2020). Many emerging algorithms are combined with the adoption of changes in the form of real problems modeled into mathematical problems. The modeling aims to optimize to produce the most optimal objective function value based on the formed constraints. Optimization of the mathematical model can be assisted by several optimization algorithms, such as the More for Less Algorithm. The algorithm, as a form of looping, is based on the constraint function with the specified parameters until it reaches the final objective function, namely optimization related to time and cost(Muftikhali et al., 2018). In general, it is hoped that supply and demand will be balanced in transportation. However, in reality, often in field conditions, mixed transportation problems result in non-optimal costs. The study results show that the More for Less Algorithm can provide the most optimal solution according to the allocation of factory requests to shops with the minimum cost. The dual variable matrix index is positive, so the solution to the transportation problem with mixed constraints is called optimal. The solutions obtained in the transportation case study with mixed constraint functions in the field of the Amarta Bakery industry community business are as follows:with a total cost of 580 (in units of money). Combinations - factory-to-store combinations for companies are interpreted as first factory at the first store with an allocation of 90 product units, first factory at the second shop with an allocation of 110 product units, second factory at the second shop with an allocation of 0 product units, factory the second factory at the third store with an allocation of 70 units of product, and the third factory at the third store with an allocation of 0 units of product. The number zero means that to carry out efficiency and optimization according to mixed constraints, it is necessary to make conditions where factories do not distribute to shops.

Downloads

Download data is not yet available.

References

Acharya, D., Basu, M., & Das, A. (2015). More-For-Less Paradox in a Transportation Problem under Fuzzy Environments. Journal of Applied & Computational Mathematics, 04(01), 10–13. https://doi.org/10.4172/2168-9679.1000202
Gamal, M., Bahri Jurusan Matematika, Z., & Riau, U. (2003). Pendekatan Program Linear untuk Persoalan Pemotongan Stok (Pola Pemotongan Satu Dimensi). Jurnal Natur Indonesia, 5(2), 113–118.
Keristiana Sinaga, E., Djuraidah, A., & Wigena, A. H. (2013). PENDEKATAN KUADRAT TERKECIL PARSIAL KEKAR UNTUKPENANGANAN PENCILAN PADA DATA KALIBRASI(Partial Least Squares Robust Regression Approach to Handle Outliers inCalibration Data). Indonesian Journal of Statistics, 18(1), 11–20.

M, M., & Subanar. (2017). Kajian terhadap Beberapa Metode Optimasi (Survey of Optimization Methods). Survey of Optimization ... | Munirah, V, 45.
Massalesse, J. (2019). Penerapan Algoritma Genetika Pada Penentuan Lintasan Terpendek Jalur Bus Rapid Transit Makassar. Jurnal Matematika, Statistika Dan Komputasi, 16(2), 114. https://doi.org/10.20956/jmsk.v16i2.7016
Muftikhali, Q. E., Yudhistira, A. Y. F. D., Kusumawati, A., & Hidayat, S. (2018). Optimasi Algoritma Genetika Dalam Menentukan Rute Optimal Topologi Cincin Pada Wide Area Network. Informatika Mulawarman : Jurnal Ilmiah Ilmu Komputer, 13(1), 43. https://doi.org/10.30872/jim.v13i1.1007
Nurmayanti, L., & Sudrajat, A. (2021). Implementasi Linear Programming Metode Simpleks pada Home Industry. Jurnal Manajemen, 13(3), 431–438.
Pandian, P., & Natarajan, G. (2010). A new method for finding an optimal solution of fully interval integer transportation problems. Applied Mathematical Sciences, 4(36–39), 1819–1830.
Simanullang, B., & Budhayanti, C. I. S. (2003). Pemodelan Matematika. Pemecahan Masalah Matematika,Pertemuan2,1–29. http://file.upi.edu/Direktori/FPMIPA/PRODI._ILMU_KOMPUTER/196603252001121-MUNIR/Multimedia/Multimedia_Bahan_Ajar_PJJ/Pem_Mslh_Mat/unit8_konsep_dasar_pemodelan_matematika.pdf
Widana, Y. (2020). Aplikasi Optimalisasi Penjadwalan Proyek dengan Metode Harmony Search ( Studi Kasus : AKSDAI ). 1(3), 88–9

Downloads

Published

2022-11-01

How to Cite

BUILDING MATHEMATICS MODELING FOR SOLVED TRANSPORTATION PROBLEMS AND OPTIMIZING WITH MORE FOR FEWER ALGORITHMS IN THE BUSINESS COMMUNITY. (2022). INTERNATIONAL SEMINAR, 4, 34-47. https://doi.org/10.36563/proceeding.v4i0.74

Similar Articles

21-30 of 35

You may also start an advanced similarity search for this article.