Optimization of heterogeneous VRP model by considering recharging station using mixed integer programming

Sundari Retno Andani, Muhammad Zarlis, Herman Mawengkang, Sutarman Sutarman


Transportation activities require substantial costs: drivers, fuel, vehicle maintenance, vehicle and equipment procurement capital, and administrative activities. In the vehicle routing problem (VRP), all vehicles have the same load capacity. But in reality, the company has vehicles with different abilities. The heterogeneous vehicle routing problem (HVRP) is a variant of VRP. Transportation is a source of pollution. Therefore, electric vehicles are starting to replace fossil fuel vehicles. However, a few electric vehicle recharging stations remain, especially in Indonesia. Consequently, the authors build a heterogeneous vehicle routing problem model by considering the filling station using mixed integer programming. This research aims to create a model by determining distribution routes with minimum costs from several capacities of electric-powered freight fleets with different capabilities by considering refilling stations. Research contributions realize the transition towards sustainable energy, one of the priority issues in Indonesia’s G20 presidency.


heterogeneous vehicle routing problem; mixed interger programming; model; optimization;

Full Text:


DOI: http://doi.org/10.12928/telkomnika.v21i6.25313


  • There are currently no refbacks.

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

TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120
Fax: +62 274 564604