Abstract
The purpose of this research is to know the performance of Fuzzy Evolutionary Algorithm in solving one type of Vehicle Routing Problem that is Capacitated Vehicle Routing Problem (CVRP). There are 8 different CVRP data to be solved. The performance of the algorithm can be determined by comparing the value obtained by AFE with the optimal value of the data. The result of this research is fuzzy evolution algorithm yields the best average relative error from all data for distance that is equal to 69,5855% and for minimum vehicle equal to 26%.
Highlights
The purpose of this research is to know the performance of Fuzzy Evolutionary Algorithm
The performance of the algorithm can be determined by comparing the value obtained by
fuzzy evolution algorithm yields the best average relative error from all data for distance that is equal to 69,5855%
Summary
Vehicle Routing Problem (VRP) merupakan permasalahan combinatorial optimization yang termasuk dalam kategori NP-Hard Complete. Setiap kendaraan diasumsikan sama berangkat dari satu depot tunggal yang disimbolkan dengan vertek 0 dan akan mengirimkan barang ke himpunan konsumen. Agar keluaran dari FIS mamdani menghasilkan nilai atau hasil tentunya perlu dibuatkan semesta pembicaraan dan domain yang menentukan batasan-batasan nilai untuk semua himpunan yang ada pada setiap variabel. Sedangkan misal domain untuk himpunan SMALL pada variabel generasi adalah [50 100], yang berarti bahwa generasi dikatakan small jika memiliki nilai antara 50 dan 100. Aturan nilai untuk semesta pembicaraan dan domain dalam penelitian ini menggunakan nilai batas yang dikemukan oleh. Semesta pembicaraan dan domain untuk variabel Probabilitas Crossover (Hartati & Uyun, 2011). Semesta pembicaraan dan domain untuk variabel Probabilitas Mutasi (Hartati & Uyun, 2011)
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
