A novel hybrid jellyfish algorithm for minimizing fuel consumption capacitated vehicle routing problem

Dana Marsetiya Utama, Bahru Widjonarko, Dian Setiya Widodo


Distribution is a critical activity that must be carefully planned in order to minimize the company's fuel costs. The hybrid jellyfish (HJF) algorithm is proposed in this study to solve the fuel consumption capacity vehicle routing problem (FCCVRP). This problem's objective function is to minimize fuel consumption costs. The proposed HJF algorithm is used in this study to generate optimal fuel consumption through a population and iteration parameter experiment. The experiment results indicate that the HJF increasing parameter has an effect on reducing the total cost of fuel. Additionally, this study presents an algorithm comparison that demonstrates how effectively the proposed HJF algorithm solves FCCVRP.


Distribution; Fuel consumption; Jellyfish algorithm; Vehicle routing problem

Full Text:


DOI: https://doi.org/10.11591/eei.v11i3.3263


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

Bulletin of EEI Stats