In the paper, authors analyze information and communication technology (ICT) for planning and optimization of transport routes with time windows. This analysis helps to choose the method for solving a vehicle routing problem with time windows (VRPTW) with optimal result for decision-maker, as well as determine the influence of the internal parameters of the selected method on the result of its application. Currently, there are several well-known methods and algorithms in ICT for planning and optimization of transport routes with time windows, in particular: saving and sweeping algorithms, ant colony optimization (ACO) method, artificial bee colony (ABC) method, etc. The result of the analysis showed that: a) the speed and quality of the search for solutions can be improved by adjusting internal parameters of researched methods, b) depending on the size and specificity of the incoming data, a different methods can be more or less suitable. In this paper, the authors discussed the features of using the ACO method and the ABC method to solve VRPTW and influence of their application on the optimality of the results. Simulation results show the need and feasibility of using ICT in VRPTW.