Abstract
This paper considers a garbage collection problem, in which vehicles with multiple compartments collect the garbage on multiple trips. Vehicles are Alternative Fuel-powered Vehicles (AFVs) which can be refueled at refilling stations located at the garbage disposal site. Each vehicle starts from the main depot and visits the disposal site where it is fueled. The vehicle then collects the garbage from residential households and returns to the disposal site either for refueling or disposing of the picked-up garbage. At the end of driver’s working hours, the vehicle returns to the main depot. We develop a heuristic algorithm and a metaheuristic algorithm to solve the problem. New problem instances have been generated to evaluate the performance of the proposed algorithms.
Keywords:
- Keyword: Vehicle Routing Problem; Multi compartment
- Keyword: Sustainability; Ant colony; Metaheuristic.
- Keyword: Vehicle Routing Problem
- Keyword: Multi compartment
- Keyword: Sustainability
- Keyword: Ant colony
- Keyword: Metaheuristic
How to Cite:
Gajpal, Y., Abdulkader, M. M. & Malagoda, N., (2026) “Multi Trip Multi Compartment Vehicle Routing Problem with Alternative Fuel-powered Vehicles for Garbage Collection ”, Journal of Intelligent and Sustainable Systems (JISS) 2(1).