Penentuan Rute Kendaraan Heterogen Menggunakan Algoritma Insertion Heuristic
Main Article Content
Keywords
Distribusi, Vehicle Routing Problem(VRP), Heterogeneous Fleet Vehicle Routing Problem(HFVRP), Model matematis, Insertion Heuristic
Abstract
Distribution process at PT XYZ is identical to one of the variants of Vehicle Routing Problem (VRP) which there are several vehicles with different capacities and operation cost, called as Heterogeneous Fleet Vehicle Routing Problem (HFVRP). There are two kinds of vehicle that have been used, namely, vehicle As and vehicle Bs. Vehicle As has the higher operation cost than vehicle Bs. Currently, the company implements policies where vehicle Bs is used if all vehicle As have been used. This policy may lead the distribution cost is so expensive and its equal with the operation cost of vehicle As that also high. Routing aims to combine the use of available vehicles to generate minimal distribution costs in servicing the customers. This research uses mathematical model according to the description of the distribution system in the company. The model is verified and tested using the optimization software. Then the constraints of the verifiable mathematical model are used as the basis for developing Insertion Heuristic (IH) algorithm. Comparison of model solutions with developed algorithm solutions showed a difference of 11.6%. This implies that the algorithm generated solution is quite good as one of the heuristic approaches that result in optimal local solutions. Implementation of IH algorithm provides cost savings of 5.97% towards the actual distribution system in the company.
References
[2] A. Arvianto, A. H. Setiawan, and S. Saptadi, “Model Vehicle Routing Problem dengan Karakteristik Rute Majemuk, Multiple Time Windows, Multiple Products dan Heterogeneous Fleet untuk Depot Tunggal,” J. Tek. Ind., vol. 16, no. 2, pp. 83–94, 2014, https://doi.org/10.9744/jti.16.2.83-94.
[3] I. A. Fajarwati and W. Anggraeni, “Penerapan Algoritma Differential Evolution untuk Penyelesaian Permasalahan Vehicle Routing Problem with Delivery and Pick-up,” J. Tek. ITS, vol. 1, no. 2301–9271, pp. A391–A396, 2012.
[4] Suthikarnnarunai N., “A Sweep Algorithm for the Mix Fleet Vehicle Routing Problem,” Int. MultiConference Eng. Comput. Sci. 2008. IMECS 2008, vol. 2, pp. 19–21, 2008.
[5] M. N. Kritikos and G. Ioannou, “The Heterogeneous fleet vehicle routing problem with overloads and time windows,” Int. J. Prod. Econ., vol. 144, no. 1, pp. 68–75, 2013, https://doi.org/10.1016/j.ijpe.2013.01.020.
[6] C. Lin, K. L. Choy, G. T. Ho, S. H. Chung, and H. Y. Lam, “Survey of green vehicle routing problem: past and future trends,” Expert Syst. Appl., vol. 41, no. 4, pp. 1118–1138, 2014, https://doi.org/10.1016/j.eswa.2013.07.107.
[7] F. Belmecheri, C. Prins, F. Yalaoui, and L. Amodeo, “Particle swarm optimization algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls, and time windows,” J. Intell. Manuf., vol. 24, no. 4, pp. 775–789, 2013, https://doi.org/10.1007/s10845-012-0627-8.
[8] S. N. Kumar and R. Panneerselvam, “A survey on the vehicle routing problem and its variants,” Intell. Inf. Manag., vol. 4, no. 3, p. 66, 2012, https://dx.doi.org/10.4236/iim.2012.43010.
[9] M. Gendreau, Classical heuristics for the vehicle routing problem, April 2017. 2000.
[10] L. Octora, A. Imran, and S. Susanty, “Pembentukan Rute Distribusi Menggunakan Algoritma Clarke & Wright Savings dan Algoritma Sequential Insertion,” Reka Integr., vol. 2, no. 2, pp. 1–11, 2014.
[11] A. Purnomo, “Analisis Rute Pendistribusian dengan Menggunakan Metode Nearest Insertion Heuristic Persoalan The Vehicle Routing Problem with Time Windows (VRPTW) (Studi Kasus di Koran Harian Pagi Tribun Jabar),” in Pemberdayaan Rekayasa Industri Berbasis Eco-Efficiency pada Era Perdagangan Bebas, 2010.
Article Sidebar
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Authors' Retention of Copyright
Authors retain the copyright of their original work published in Jurnal Optimasi Sistem Industri (JOSI). By submitting their manuscript to the journal, authors grant Jurnal Optimasi Sistem Industri (JOSI) a non-exclusive license to publish the work under the CC BY-NC-SA 4.0 International License. This means that others are permitted to:
- Share and adapt the work for non-commercial purposes, provided proper attribution is given to the original authors and source.
- Create derivative works based on the original article, as long as the new work is non-commercial and under the same CC BY-NC-SA 4.0 International License.
Non-Commercial Usage
The CC BY-NC-SA 4.0 International License restricts commercial use of the published work and its derivatives. Commercial use includes generating revenue, financial gain, or any form of commercial exploitation. This limitation aims to preserve the scholarly and educational nature of the content.
ShareAlike Requirement
If you remix, adapt, or build upon the work, you must distribute your contributions under the same CC BY-NC-SA 4.0 International License as the original work. This "ShareAlike" requirement ensures that any new works based on the original content adhere to the same non-commercial, share-alike principles.
Usage, Attribution, and Citations
Authors and readers are allowed to:
- Share and distribute the published article in any medium or format.
- Adapt, remix, transform, and build upon the article for non-commercial purposes.
- Provide appropriate attribution to the original authors and the journal.
When using content from Jurnal Optimasi Sistem Industri (JOSI), proper attribution must be provided through citation of the original source and authors.
Copyright Infringement and Ethical Considerations
If you believe that any material published in Jurnal Optimasi Sistem Industri (JOSI) infringes upon your copyright or the copyright of someone you represent, please contact the editorial team promptly. The journal is committed to addressing copyright concerns in accordance with established ethical guidelines set forth by the Committee on Publication Ethics (COPE).
For any questions or inquiries related to copyright and licensing, please contact the editorial team at editor_josi[at]eng.unand.ac.id.