ON THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND MULTIPLE USE OF VEHICLES
ELENA NECHITA Department of Mathematics and Informatics, Faculty of Sciences, “Vasile Alecsandri” University of Bacău, Spiru Haret 8, 600114 Bacău, ROMANIA, email: enechita@ub.ro
Due to the energy crisis and to the new types of demands from customers, nowadays transportation and logistics environment require computational and simulation methods in order to reduce costs and improve performances. In this paper, the solutions for vehicle routing problems with time windows and multiple use of vehicles are reviewed. Also, competitiveness of Ant Colony Optimization algorithms, when compared with other metaheuristic techniques or exact algorithms for this problem, are considered.
