Solving Close-Open Mixed Vehicle Routing Problem Using Bat Algorithm

Atika Dwi Hanun Amalia, Herry Suprajitno, Asri Bekti Pratiwi

= http://dx.doi.org/10.20473/conmatha.v2i1.19301
Abstract views = 170 times | downloads = 53 times

Abstract


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.

Keywords


bat algorithm, close-open mixed vehicle routing problem.

Full Text:

PDF

References


Batubara, S., Maulidya, R., and Kusumaningrum, I., 2013, Perbaikan Sistem Distribusi dan Transportasi dengan Menggunakan Distribution Requirement Planning (DRP) dan Alogaritma Djikstra, Jurnal Teknik Industri, 1411-6430.

Belfiore, P., Tsugunobu, H., and Yoshizaki, Y., 2008, Scatter Search for Vehicle Routing Problem with Time Windows and Split Deliveries, Vehicle Routing Problem, 1, 1-14

Bräysy, O., 2001. Genetic Algorithms for the Vehicle Routing Problem with Time Windows, Arpakannus Special Issue on Bioinformatics and Genetic Algorithms, 1, 33-38.

Liu, R. and Jiang, Z., 2012, The Close–Open Mixed Vehicle Routing Problem. European Journal of Operational Research, 220, 349–360.

Yang, X.S., 2010, A New Metaheuristic Bat-Inspired Algorithm, Nature Inspired Cooperatives Strategies for Optimization, Springer, Berlin, 284, 65-74.

Yang, X.S., 2013, Bat Algorithm: Literature Review And Applications, Int. J. Bio-Inspired Computation, 5, 141–149.

Čičková, Z., Brezina, I., dan Pekár, J., 2015, Cost Analysis of Open VRP, Logic 2𝑛𝑑 Logistic International Conference, 8-13


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

View My Stats

Contemporary Mathematics and Applications is licensed under a  Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License

Indexed by: