Bilah Samping Artikel
Isi Artikel Utama
Abstrak
Vehicle Routing Problem (VRP) merupakan suatu permasalahan yang berkaitan dengan bagaimana menentukan rute yang dianggap optimal dan melibatkan lebih dari satu alat angkut demi memperhatikan beberapa kendala dalam melayani sejumlah tempat layanan sesuai dengan permintaan. Salah satu varian dari VRP adalah capacitated vehicle routing problem with time window (CVRPTW) varian ini menambahkan kendala kapasitas alat angkut sebagai salah satu pertimbangan didalam mengangkut ke masing masing tujuan dan kemudian memberikan jendela waktu didalam proses pengangkutannya. Tujuan dari penulisan ini adalah menjelaskan pembentukan model dari CVRPTW untuk permasalahan rute pengangkutan sampah dari tiap rumah Sampai Ke Tempat Pembuangan Akhir, dengan pertimbangan waktu yang tersedia dan kapasitas angkut alat angkut yang tersedia, Sedangkan Penyelesaiannya yaitu dengan menggunakan pendekatan algoritma sweep. Algoritma Ini merupakan algoritma yang terdiri dari dua tahap, pada tahapan pertama yaitu clustering dari masing masing rumah dan tahap selanjurtnya yaitu membentuk rute pengiriman untuk masing-masing cluster dengan metode Nearest Neighbour, kemudian dilanjutkan dengan menentukan kapasitas alat angkut terhadap waktu yang diperlukan untuk menentukan kapan sampah ini akan di angkut ke tempat pembuangan akhir. Studi ini sangat penting dilakukan dalam rangka menerapkan dasar untuk memahami kemungkinan meningkatkan tingkat layanan pada proses pengangkutan sampah di tingkat desa.
Kata Kunci
Rincian Artikel
References
- T. A. M. Toffolo, T. Vidal, and T. Wauters, “Heuristics for vehicle routing problems: Sequence or set optimization?,” Comput. Oper. Res., 2019, doi: 10.1016/j.cor.2018.12.023.
- N. Gamayanti, A. Alkafi, and R. Mangatas, “Optimisasi Multi Depot Vehicle Routing Problem ( MDVRP ) dengan Variabel Travel Time Menggunakan Algoritma Particle Swarm Optimization,” JAVA J. Electr. Electron. Eng., 2015.
- Lukmandono, M. Basuki, M. J. Hidayat, and F. B. Aji, “Application of Saving Matrix Methods and Cross Entropy for Capacitated Vehicle Routing Problem (CVRP) Resolving,” 2019, doi: 10.1088/1757-899X/462/1/012025.
- F. Arnold and K. Sörensen, “Knowledge-guided local search for the vehicle routing problem,” Comput. Oper. Res., 2019, doi: 10.1016/j.cor.2019.01.002.
- S. H. Huang and P. C. Lin, “Vehicle routing-scheduling for municipal waste collection system under the ”˜Keep Trash off the Ground”™ policy,” Omega (United Kingdom), 2015, doi: 10.1016/j.omega.2015.02.004.
- F. Stavropoulou, P. P. Repoussis, and C. D. Tarantilis, “The Vehicle Routing Problem with Profits and consistency constraints,” Eur. J. Oper. Res., 2019, doi: 10.1016/j.ejor.2018.09.046.
- R. Pérez-RodrÃguez and A. Hernández-Aguirre, “A hybrid estimation of distribution algorithm for the vehicle routing problem with time windows,” Comput. Ind. Eng., 2019, doi: 10.1016/j.cie.2019.02.017.
- S. T. Bae, H. S. Hwang, G. S. Cho, and M. J. Goan, “Integrated GA-VRP solver for multi-depot system,” Comput. Ind. Eng., 2007, doi: 10.1016/j.cie.2007.06.014.
- L. Wen and R. Eglese, “Minimum cost VRP with time-dependent speed data and congestion charge,” Comput. Oper. Res., 2015, doi: 10.1016/j.cor.2014.10.007.
- M. Casazza, A. Ceselli, and R. Wolfler Calvo, “A branch and price approach for the Split Pickup and Split Delivery VRP,” Electron. Notes Discret. Math., 2018, doi: 10.1016/j.endm.2018.07.025.
- V. Baradaran, A. Shafaei, and A. H. Hosseinian, “Stochastic vehicle routing problem with heterogeneous vehicles and multiple prioritized time windows: Mathematical modeling and solution approach,” Comput. Ind. Eng., 2019, doi: 10.1016/j.cie.2019.03.047.
- Y. H. Huang, C. A. Blazquez, S. H. Huang, G. Paredes-Belmar, and G. Latorre-Nuñez, “Solving the Feeder Vehicle Routing Problem using ant colony optimization,” Comput. Ind. Eng., 2019, doi: 10.1016/j.cie.2018.10.037.
- R. J. Kuo, B. S. Wibowo, and F. E. Zulvia, “Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time,” Appl. Math. Model., 2016, doi: 10.1016/j.apm.2016.06.025.
- B. Sawik, J. Faulin, and E. Pérez-Bernabeu, “A Multicriteria Analysis for the Green VRP: A Case Discussion for the Distribution Problem of a Spanish Retailer,” 2017, doi: 10.1016/j.trpro.2017.03.037.
References
T. A. M. Toffolo, T. Vidal, and T. Wauters, “Heuristics for vehicle routing problems: Sequence or set optimization?,” Comput. Oper. Res., 2019, doi: 10.1016/j.cor.2018.12.023.
N. Gamayanti, A. Alkafi, and R. Mangatas, “Optimisasi Multi Depot Vehicle Routing Problem ( MDVRP ) dengan Variabel Travel Time Menggunakan Algoritma Particle Swarm Optimization,” JAVA J. Electr. Electron. Eng., 2015.
Lukmandono, M. Basuki, M. J. Hidayat, and F. B. Aji, “Application of Saving Matrix Methods and Cross Entropy for Capacitated Vehicle Routing Problem (CVRP) Resolving,” 2019, doi: 10.1088/1757-899X/462/1/012025.
F. Arnold and K. Sörensen, “Knowledge-guided local search for the vehicle routing problem,” Comput. Oper. Res., 2019, doi: 10.1016/j.cor.2019.01.002.
S. H. Huang and P. C. Lin, “Vehicle routing-scheduling for municipal waste collection system under the ”˜Keep Trash off the Ground”™ policy,” Omega (United Kingdom), 2015, doi: 10.1016/j.omega.2015.02.004.
F. Stavropoulou, P. P. Repoussis, and C. D. Tarantilis, “The Vehicle Routing Problem with Profits and consistency constraints,” Eur. J. Oper. Res., 2019, doi: 10.1016/j.ejor.2018.09.046.
R. Pérez-RodrÃguez and A. Hernández-Aguirre, “A hybrid estimation of distribution algorithm for the vehicle routing problem with time windows,” Comput. Ind. Eng., 2019, doi: 10.1016/j.cie.2019.02.017.
S. T. Bae, H. S. Hwang, G. S. Cho, and M. J. Goan, “Integrated GA-VRP solver for multi-depot system,” Comput. Ind. Eng., 2007, doi: 10.1016/j.cie.2007.06.014.
L. Wen and R. Eglese, “Minimum cost VRP with time-dependent speed data and congestion charge,” Comput. Oper. Res., 2015, doi: 10.1016/j.cor.2014.10.007.
M. Casazza, A. Ceselli, and R. Wolfler Calvo, “A branch and price approach for the Split Pickup and Split Delivery VRP,” Electron. Notes Discret. Math., 2018, doi: 10.1016/j.endm.2018.07.025.
V. Baradaran, A. Shafaei, and A. H. Hosseinian, “Stochastic vehicle routing problem with heterogeneous vehicles and multiple prioritized time windows: Mathematical modeling and solution approach,” Comput. Ind. Eng., 2019, doi: 10.1016/j.cie.2019.03.047.
Y. H. Huang, C. A. Blazquez, S. H. Huang, G. Paredes-Belmar, and G. Latorre-Nuñez, “Solving the Feeder Vehicle Routing Problem using ant colony optimization,” Comput. Ind. Eng., 2019, doi: 10.1016/j.cie.2018.10.037.
R. J. Kuo, B. S. Wibowo, and F. E. Zulvia, “Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time,” Appl. Math. Model., 2016, doi: 10.1016/j.apm.2016.06.025.
B. Sawik, J. Faulin, and E. Pérez-Bernabeu, “A Multicriteria Analysis for the Green VRP: A Case Discussion for the Distribution Problem of a Spanish Retailer,” 2017, doi: 10.1016/j.trpro.2017.03.037.