A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows

Nowadays, using a rental fleet to transport goods for delivering customers at particular time frame is very important in the services and industry. That why, this study, we consider heterogeneous fixed open vehicle routing problem with windows, which one version of windows. The has not attracted attention so much operational research literature than usual problem. consists determining minimum cost routes number vehicles various capacities order fulfil demands customer population. Moreover, start headquarters terminate customers. In introduce mixed integer programming model then integrate an exact algorithm solve model. Furthermore, hybrid (HA) based on modified rank-based ant system developed its efficiency compared method some metaheuristic methods standard instances literature. results proved effectiveness our proposed HA.