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*.

https://arxiv.org/abs/2012.10384

vidalt/HGS-CVRP Issues

What if `start` is greater than `end` ?
Closed 10 months ago
EDGE_WEIGHT_FORMAT keyword in vrp file is not supported
Updated a year ago1
Last offspring kept after resetting the algorithm
Closed a year ago2
Unexpected Calculation of BiasedFitnesses
Closed a year ago3
Broken pairs distance is not symmetric
Updated a year ago3
Branch Management
Closed a year ago1
Is there any way to feed an initial solution to the algorithm?
Closed a year ago3
Git action recently failing on Windows
Closed a year ago8
Does this repo support GPU?
Closed 2 years ago1
package naming
Closed 2 years ago3
The plan for improving the solver interface
Closed 2 years ago2
Question about divRank and fitRank in updateBiasedFitnesses()
Closed 2 years ago3
Could you provide a more detailed description of the dataset?
Closed 3 years ago1
Is it possible to let the vehicle return to the depot and start a new route?
Closed 3 years ago3
[bug] segfault if number of vehicles is too low
Closed 3 years ago1
great job
Closed 3 years ago1
Cryptic error: `terminate called after throwing an instance of 'char const*'` when failing demand or distance checks
Closed 3 years ago1