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 OPTIMASI VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) DENGAN PENDEKATAN HYBRID DRAGONFLY ALGORITHM PADA RUTE PENGIRIMAN PRODUK

Skripsi

OPTIMASI VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) DENGAN PENDEKATAN HYBRID DRAGONFLY ALGORITHM PADA RUTE PENGIRIMAN PRODUK

Putra, Muhammad Rizky Ramadhian - Personal Name;

Penilaian

0,0

dari 5
Penilaian anda saat ini :  

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.


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

No other version available

File Attachment
  • OPTIMASI VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) DENGAN PENDEKATAN HYBRID DRAGONFLY ALGORITHM PADA RUTE 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