vidalt / HGS-CVRP

Modern implementation of the hybrid genetic search (HGS) algorithm specialized to the capacitated vehicle routing problem (CVRP). This code also includes an additional neighborhood called SWAP*.

Home Page:https://arxiv.org/abs/2012.10384

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Temporal Distance or Spatial DIstance

menco22 opened this issue · comments

Is the distance matrix that we pass as input to the algorithm made of spatial or temporal distances? Because looking at the Individual.cpp section, it seems that the distances are indeed temporal! In case the distance are spatial, is it possible to use temporal distances?
Thank you in advance for your attention.

It does not matter which unit of distance is used in a CVRP: cost, time, distance, or emissions, for example, as long as it's a fixed scalar for any (i,j) pair.
When duration constraints are activated (as in the case of the Golden instances), the constraint on duration (for each route) is applied to the sum of the distance and service time of the customers.