The Sriwijaya University Library

  • Home
  • Information
  • News
  • Help
  • Librarian
  • Login
  • Member Area
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of VEHICLE ROUTING PROBLEM WITH TIME WINDOWS DENGAN PENDEKATAN FIREFLY ALGORITHM UNTUK OPTIMASI RUTE PADA PENGIRIMAN PRODUK

Skripsi

VEHICLE ROUTING PROBLEM WITH TIME WINDOWS DENGAN PENDEKATAN FIREFLY ALGORITHM UNTUK OPTIMASI RUTE PADA PENGIRIMAN PRODUK

Irawan, Chandra - Personal Name;

Penilaian

0,0

dari 5
Penilaian anda saat ini :  

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.


Availability
Inventory Code Barcode Call Number Location Status
2507006148T185289T1852892025Central Library (Reference)Available but not for loan - Not for Loan
Detail Information
Series Title
-
Call Number
T1852892025
Publisher
Indralaya : Prodi Teknik Informatika, Fakultas Ilmu Komputer Universitas Sriwijaya., 2025
Collation
xiii, 95 hlm.; ilus.; tab.; 29 cm.
Language
Indonesia
ISBN/ISSN
-
Classification
004.07
Content Type
Text
Media Type
unmediated
Carrier Type
other (computer)
Edition
-
Subject(s)
Pengolahan Data
Prodi Teknik Informatika
Specific Detail Info
-
Statement of Responsibility
MI
Other version/related

No other version available

File Attachment
  • VEHICLE ROUTING PROBLEM WITH TIME WINDOWS DENGAN PENDEKATAN FIREFLY ALGORITHM UNTUK OPTIMASI RUTE PADA PENGIRIMAN PRODUK
Comments

You must be logged in to post a comment

The Sriwijaya University Library
  • Information
  • Services
  • Librarian
  • Member Area

About Us

As a complete Library Management System, SLiMS (Senayan Library Management System) has many features that will help libraries and librarians to do their job easily and quickly. Follow this link to show some features provided by SLiMS.

Search

start it by typing one or more keywords for title, author or subject

Keep SLiMS Alive Want to Contribute?

© 2025 — Senayan Developer Community

Powered by SLiMS
Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search