Genetic Algorithm for Optimizing Footwear Logistics Distribution Using the Capacitated Vehicle Routing Problem (CVRP)
DOI:
https://doi.org/10.24014/sitekin.v23i1.37620Abstract
Micro, small, and medium enterprises (MSMEs) are important economic drivers for Indonesia, especially in labor-intensive sectors like footwear manufacturing. MSMEs, though, face acute logistical problems because of heterogeneous customer demand, limited production capacity, and ever-increasing transportation costs. Few existing works have focused on monthly logistics planning for MSMEs in developing countries with realistic costing and demand structures. To develop and analyze a Genetic Algorithm (GA) optimization model to maximize profit within a constrained monthly footwear profit distribution network. To achieve this, we needed to assess how multi-retailer product allocation balance could be achieved with minimum operational constraints such as production caps, cost-efficient logistics, and streamlined processes. This study employed a quantitative experimental design approach and implemented a GA with real-valued chromosome representation, tournament selection, single-point crossover, and Gaussian mutation. The model was built using real data from a footwear MSME operating in the Lamongan and Tulungagung regions of Indonesia. The algorithm was implemented using Python and tested for reliability with 10 executed validations for independence. Within 60 generations, the GA maintained consistent convergence and achieved a final fitness value with a coefficient of variation of 0.24%. The optimized allocation achieved a net profit margin of 15.22% while utilizing the available production capacity (600 units/month). Because of increased profit contribution, greater-distance wholesale customers were served first despite incurring higher transport costs. The model had no constraint violation and reduced transportation costs to 1.45% of total revenue. Using GA to address multi-objective distribution challenges in the context of MSMEs appeared to have positive results, confirming the effectiveness of this approach. The proposed approach helps frame and guide critical allocation and routing decisions, which can be made within the boundaries of operational constraints. Further work is needed to incorporate stochastic demand modelling and multi-objective problem extensions and seek real-time application to bolster support for decision-making in dynamic scenarios.References
K. J. Sinha, S. Sinha, and B. J. Sinha, “Micro, Small, and Medium-Sized Enterprises (MSMEs): The Significant Role and Challenges in Indonesia’s Economy,” International Journal For Multidisciplinary Research, vol. 6, no. 3, p. 20824, 2024.
A. C. Jurnalita, “The Impact of Digital Transformation on MSME Competitiveness and Economic Growth,” Arthatama: Journal of Business Management and Accounting, vol. 8, no. 2, pp. 95–106, 2024.
M. I. Ketut, U. I. D. Nyoman, and S. N. Wayan, “The Importance of Micro, Small, and Medium Enterprises Competitiveness through Digital Transformation,” JASF: Journal of Accounting and Strategic Finance, vol. 7, no. 1, pp. 18–38, 2024.
R. I. Muslem and M. K. M. Nasution, “Algorithms and Approaches for the Vehicle Routing Problem with Pickup and Delivery (VRPPD): A Survey,” in 2024 Ninth International Conference on Informatics and Computing (ICIC), IEEE, 2024, pp. 1–5.
A. Bogyrbayeva, M. Meraliyev, T. Mustakhov, and B. Dauletbayev, “Machine learning to solve vehicle routing problems: A survey,” IEEE Transactions on Intelligent Transportation Systems, vol. 25, no. 6, pp. 4754–4772, 2024.
R. R. Chandan et al., “Genetic algorithm and machine learning,” in Advanced Bioinspiration Methods for Healthcare Standards, Policies, and Reform, IGI Global, 2023, pp. 167–182.
D. L. Shanthi and N. Chethan, “Genetic algorithm based hyper-parameter tuning to improve the performance of machine learning models,” SN Comput Sci, vol. 4, no. 2, p. 119, 2022.
M. O. Okwu and L. K. Tartibu, Metaheuristic optimization: Nature-inspired algorithms swarm and computational intelligence, theory and applications, vol. 927. Springer Nature, 2020.
H. Jiang, M. Lu, Y. Tian, J. Qiu, and X. Zhang, “An evolutionary algorithm for solving capacitated vehicle routing problems by using local information,” Appl Soft Comput, vol. 117, p. 108431, 2022.
I. P. Malashin et al., “Two-Stage Genetic Algorithm for Optimization Logistics Network for Groupage Delivery,” Applied Sciences, vol. 14, no. 24, p. 12005, 2024.
L. Judijanto, T. R. Fauzan, and B. Fisher, “Enhancing logistic efficiency in product distribution through genetic algorithms (GAs) for route optimization,” International Journal Software Engineering and Computer Science (IJSECS), vol. 3, no. 3, pp. 504–510, 2023.
R. García-Torres, A. A. Macias-Infante, S. E. Conant-Pablos, J. C. Ortiz-Bayliss, and H. Terashima-Marín, “Combining constructive and perturbative deep learning algorithms for the capacitated vehicle routing problem,” arXiv preprint arXiv:2211.13922, 2022.
J. Xu et al., “Optimization of Worker Scheduling at Logistics Depots Using Genetic Algorithms and Simulated Annealing,” arXiv preprint arXiv:2405.11729, 2024.
E. Rodríguez-Esparza, A. D. Masegosa, D. Oliva, and E. Onieva, “A new hyper-heuristic based on adaptive simulated annealing and reinforcement learning for the capacitated electric vehicle routing problem,” Expert Syst Appl, vol. 252, p. 124197, 2024.
H. Malik, A. Iqbal, P. Joshi, S. Agrawal, and F. I. Bakhsh, Metaheuristic and evolutionary computation: algorithms and applications, vol. 916. Springer Nature, 2020.
C. Prins, “A simple and effective evolutionary algorithm for the vehicle routing problem,” Comput Oper Res, vol. 31, no. 12, pp. 1985–2002, 2004.
P. Dasha, “A comparative review of approaches for the evolutionary search to prevent premature convergence in GA,” Appl. Soft Comput, vol. 25, pp. 1047–1077, 2023.
Downloads
Additional Files
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License
Copyright Notice
An author who publishes in the SITEKIN Journal agrees to the following terms:
- Author retains the copyright and grants the journal the right of first publication of the work simultaneously licensed under the Creative Commons Attribution-ShareAlike 4.0 License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal
- Author is able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book) with the acknowledgement of its initial publication in this journal.
- Author is permitted and encouraged to post his/her work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of the published work (See The Effect of Open Access).
Read more about the Creative Commons Attribution-ShareAlike 4.0 Licence here: https://creativecommons.org/licenses/by-sa/4.0/.