Vehicle routing problem with stochastic travel and service times and hard time windows - Mofidied Solomon Instances

These are the modified Solomon instances used in the article: A multi-population algorithm to solve the VRP with stochastic service and travel times.

Time windows (closure) are modified to guarantee feasibility in all routes visiting only one customer. Travel times are modelled as Log-normal random variables with a coefficient of variation of 0.2. Meanwhile, service times are modelled as Gamma random variables, also with a coefficient of variation of 0.2. For both, travel and service times, the original values are taken as means (Euclidean distance for the travel times).