EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-SA 4.0

Solving Close-Open Mixed Vehicle Routing Problem Using Bat Algorithm

Atika Dwi Hanun Amalia, Herry Suprajitno, Asri Bekti Pratiwi

Contemporary Mathematics and Applications (ConMathA) · 2020

DOI: 10.20473/conmatha.v2i1.19301 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Contemporary Mathematics and Applications (ConMathA), 2020. Verfasst von Atika Dwi Hanun Amalia und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The purpose of this research is to solve the Close-Open Mixed Vehicle Routing Problem (COMVRP) using Bat Algorithm. COMVRP which is a combination of Close Vehicle Routing Problem or commonly known as Vehicle Routing Problem (VRP) with Open Vehicle Routing Problem (OVRP) is a problem to determine vehicles route in order to minimize total distance to serve customers without exceed vehicle capacity. COMVRP occurs when the company already has private vehicles but its capacity could not fulfill all customer demands so the company must rent several vehicles from other companies to complete the distribution process. In this case, the private vehicle returns to the depot after serving the last customer while the rental vehicle does not need to return. Bat algorithm is an algorithm inspired by the process of finding prey from small bats using echolocation. The implementation program to solve was created using Java programming with NetBeans IDE 8.2 software which was implemented using 3 cases, small data with 18 customers, medium data with 75 customers and large data with 100 customers. Based on the implementation results, it can be concluded that the more iterations, the smaller total costs are obtained, while for the pulse rate and the amount of bat tends not to affect the total cost obtained.

Zitieren

APA

Amalia, A. D. H., Suprajitno, H., & Pratiwi, A. B. (2020). Solving Close-Open Mixed Vehicle Routing Problem Using Bat Algorithm. Contemporary Mathematics and Applications (ConMathA). https://doi.org/10.20473/conmatha.v2i1.19301

Vancouver

Amalia ADH, Suprajitno H, Pratiwi AB. Solving Close-Open Mixed Vehicle Routing Problem Using Bat Algorithm. Contemporary Mathematics and Applications (ConMathA). 2020. doi:10.20473/conmatha.v2i1.19301

BibTeX
@article{Amalia2020,
  author = {Amalia, Atika Dwi Hanun and Suprajitno, Herry and Pratiwi, Asri Bekti},
  title = {Solving Close-Open Mixed Vehicle Routing Problem Using Bat Algorithm},
  journal = {Contemporary Mathematics and Applications (ConMathA)},
  year = {2020},
  doi = {10.20473/conmatha.v2i1.19301}
}
Kostenlos starten →