- Published 2006 in International Symposium on Parallel Computing in…
DOI:10.1109/PARELEC.2006.74

A parallel algorithm of simulated annealing to solve the vehicle routing problem with time windows (VRPTW) is considered. The VRPTW is an NP-hard bicriterion optimization problem in which both the number of vehicles and the total distance traveled by vehicles are minimized. The objective is to establish to what extent the computation time required to solve… CONTINUE READING

### Presentations referencing similar topics