Skripsi
VEHICLE ROUTING PROBLEM WITH TIME WINDOWS DENGAN PENDEKATAN FIREFLY ALGORITHM UNTUK OPTIMASI RUTE PADA PENGIRIMAN PRODUK
The distribution of goods in the food and beverage industry often faces challenges related to vehicle capacity limitations and customer time windows. This issue can be modeled as a Vehicle Routing Problem with Time Windows (VRPTW). To obtain an efficient solution, this study proposes a hybrid approach by combining the Nearest Neighbor (NN) heuristic for initial solution construction and the Firefly Algorithm (FA) as the optimization method. The case study was conducted at HoneyBee Bakery & Cake, Palembang, using real-world data such as customer coordinates, demand, vehicle capacity, time windows, and travel time between locations. The problem was modeled into a graph representation and implemented using Python programming. The NN method generated the initial solution, which was further optimized by FA to minimize total travel distance and distribution time. The experimental results demonstrate that the Firefly Algorithm produces shorter total travel distances compared to Nearest Neighbor, with an average efficiency improvement of approximately 8%. Therefore, the integration of NN and FA is proven to be effective in solving VRPTW and has the potential to be applied in real distribution systems to enhance cost efficiency and delivery punctuality. Keywords: Vehicle Routing Problem with Time Windows (VRPTW), Firefly Algorithm, Nearest Neighbor, route optimization, distribution.
| Inventory Code | Barcode | Call Number | Location | Status |
|---|---|---|---|---|
| 2507006148 | T185289 | T1852892025 | Central Library (Reference) | Available but not for loan - Not for Loan |
No other version available