Robust counterpart open capacitated vehicle routing problem with hard time windows on waste transportation problems

Abstract

Based on the problem of garbage transportation routes, this research proposes a robust counterpart open capacitated vehicle routing problems (RCOCVRP) with hard time windows. Garbage transport vehicles sometimes have delays. This model is a generalization of robust capacitated vehicle routing problems, robust open vehicle routing problems and robust vehicle routing problems with time windows. RCOCVRP with hard time windows for waste transportation is a robust optimization problem that aims to minimize the distance of vehicle routes for waste volume and time windows with uncertainty The mathematical formulation built is completed using a sequential insertion algorithm. Then, the waste transportation route obtained is completed using LINGO software. The results of this model on the problem of transporting garbage show that the total distance using the sequential insertion algorithm is more minimum than using LINGO.