A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf
.
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
2009
Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO '09
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the one with Time Windows being the case of study in this paper. Its main objective is to find the lowest-distance set of routes to deliver goods to customers, which have service time windows, using a fleet of identical vehicles with restricted capacity. We consider the simultaneous minimisation of the number of routes
doi:10.1145/1569901.1569982
dblp:conf/gecco/Garcia-NajeraB09
fatcat:764zdwuk45hqrjfdetkzfjwgwm