I am trying to benchmark our vehicle routing solver against Gehring & Homberger instances. However, I got bit puzzled by the route duration constraint (maximum driving / maximum working time). In some data set format, this constraint is enforce as end time window of the depot (Option1): e.g. see here. However, in some other references, e.g. Vidal et. al 2013, this constraint is different: i.e. , which actually means arrivalTimeBackAtDepot - departureTimeFromDepot <= maxRouteDuration (Option2). Hence, an Option2 solution could be infeasible for Option1.
Could anyone shed some light on this? How are the results compared and updated on Sintef webpage?
Thank you in advance.