The project tackles the Capacitated Vehicle Routing problem with Time windows. It will design algorithms and develop C++ software for the optimal routing of a fleet of vehicles in order to transport orders to gas stations as economically as possible, while maximizing the load of the vehicle compartments. Safety rules are observed, preferences of customers are taken into account, and special restrictions are imposed, most importantly on not mixing orders.