Skripsi
OPTIMASI VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) DENGAN PENDEKATAN HYBRID DRAGONFLY ALGORITHM PADA RUTE PENGIRIMAN PRODUK
Product distribution is an important part of the supply chain, as the timeliness of delivery has a significant impact on customer satisfaction and operational efficiency. This study aims to optimize delivery routes in the context of the Vehicle Routing Problem With Time Windows (VRPTW) problem, which is a distribution scheduling problem that considers the customer service deadline and the maximum capacity of the vehicle used. This study implements a combination of the Nearest Neighbor and Dragonfly Algorithm to produce efficient delivery routes. The study was conducted on HoneyBee Bakery & Cake located in Palembang City. Nearest Neighbor is used to develop an initial solution based on the closest distance, while the Dragonfly Algorithm is used to optimize the route to make the distance traveled more optimal. The research also resulted in a web-based software system that allows users to upload customer data and run the optimization process directly. The test results showed that Nearest Neighbor produced a total mileage of 72.54 km, while the combination of Dragonfly Algorithm and Nearest Neighbor was able to reduce the mileage to 62.65 km with an efficiency increase of 13.63%. In addition, setting parameters such as the number of dragonflies and the number of iterations also affects the quality of the optimization results.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2507003712 | T176763 | T1767632025 | Central Library (Reference) | Available but not for loan - Not for Loan |
No other version available