Prosiding Seminar Nasional Ilmu Komputer Universitas Semarang 2022
Peminimalan Jumlah Penggunaan Kendaraan pada Capacitated Vehicle Routing Problem with Time Windows dengan Greedy Search
Dublin Core
Title
Prosiding Seminar Nasional Ilmu Komputer Universitas Semarang 2022
Peminimalan Jumlah Penggunaan Kendaraan pada Capacitated Vehicle Routing Problem with Time Windows dengan Greedy Search
Peminimalan Jumlah Penggunaan Kendaraan pada Capacitated Vehicle Routing Problem with Time Windows dengan Greedy Search
Subject
CVRPTW, greedy search
Description
Perusahaan manufaktur adalah badan bisnis yang memerhatikan berbagai aspek agar setiap aktivitas bisnis yang dilakukan selalu terpantau dan terkendali. Aktivitas bisnis manufaktur yang tidak terpantau dan terkendali oleh manajemen akan berdampak kerugian baik dari segi materiil maupun imateriil bagi perusahaan. Penyelesaian masalah Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) bertujuan dalam efisiensi proses distribusi logistik. Proses distribusi logistik yang dilakukan saat ini bertumpu pada penerapan biaya pada setiap pengiriman
dapat membebani konsumen. Pada penelitian ini akan mengkaji penggunaan Algoritma Greedy Search dalam meminimalkan jumlah penggunaan kendaraan pada penyelesaian CVRPTW. Sehingga penelitian ini dapat menjadi kajian dalam menentukan metode yang dapat diterapkan pada sistem Enterprise Resources Planning milik perusahaan manufaktur.
Manufacturing companies are business entities that pay attention to various aspects so that every business activity carried out is always monitored and controlled. Manufacturing business activities that are not monitored and controlled by management will result in losses both materially and immaterially for the company. The resolution of the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) is aimed at the efficiency of the logistics distribution process. The current logistics distribution process relies on the application of fees for each shipment, which can burden consumers. In this study, we will examine the use of the Greedy Search Algorithm in minimizing the number of vehicle usage in the completion of CVRPTW. So that this research can be a study in determining the methods that can be applied to the Enterprise Resources Planning system of a manufacturing company.
dapat membebani konsumen. Pada penelitian ini akan mengkaji penggunaan Algoritma Greedy Search dalam meminimalkan jumlah penggunaan kendaraan pada penyelesaian CVRPTW. Sehingga penelitian ini dapat menjadi kajian dalam menentukan metode yang dapat diterapkan pada sistem Enterprise Resources Planning milik perusahaan manufaktur.
Manufacturing companies are business entities that pay attention to various aspects so that every business activity carried out is always monitored and controlled. Manufacturing business activities that are not monitored and controlled by management will result in losses both materially and immaterially for the company. The resolution of the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) is aimed at the efficiency of the logistics distribution process. The current logistics distribution process relies on the application of fees for each shipment, which can burden consumers. In this study, we will examine the use of the Greedy Search Algorithm in minimizing the number of vehicle usage in the completion of CVRPTW. So that this research can be a study in determining the methods that can be applied to the Enterprise Resources Planning system of a manufacturing company.
Creator
Muhammad Zakii Rofii, Alamsyah
Publisher
Universitas Semarang
Date
19 Oktober 2022
Contributor
Sri Wahyuni
Rights
ISSN: 2614-1205
Format
PDF
Language
Indonesian
Type
Text
Coverage
Prosiding Seminar Nasional Ilmu Komputer Universitas Semarang 2022
Files
Citation
Muhammad Zakii Rofii, Alamsyah, “Prosiding Seminar Nasional Ilmu Komputer Universitas Semarang 2022
Peminimalan Jumlah Penggunaan Kendaraan pada Capacitated Vehicle Routing Problem with Time Windows dengan Greedy Search,” Repository Horizon University Indonesia, accessed November 21, 2024, https://repository.horizon.ac.id/items/show/3502.
Peminimalan Jumlah Penggunaan Kendaraan pada Capacitated Vehicle Routing Problem with Time Windows dengan Greedy Search,” Repository Horizon University Indonesia, accessed November 21, 2024, https://repository.horizon.ac.id/items/show/3502.