A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints
7
0
0
Texto
Documentos relacionados
Para tanto, são propostos dois modelos matemáticos, ambos baseados no Time Dependent Vehicle Routing Problem (TDVRP) sendo que um tem como objetivo a redução do momento de retorno
Iterated local search algorithm for the vehicle routing problem with backhauls and soft time windows
Because of the first aim, in phase 1 (the meaning of the phases is explained below), the search starts with the route with the least number of customers (least route, for short),
