/vrp

Implementation of a theory to use Generalized Partition Crossover with Vehicle Routing Problem.

Primary LanguageC++MIT LicenseMIT

Framework for algorithms aimed to solve the VRP (Vehicle Routing Problem)

Inserir todos os parametros e colocar como ativar cada um.

Arguments

Code Alias What is Required
-name -n Name of .vrp file Yes
-size -s Population Size Yes
-trucks -t Truck number Yes
-it - Max limit of iterations Yes
-id - ID of actual Run (Log) No
-cross -cx Crossover method (1-2) No
-path - Path of .vrp folder No
-fit - Fitness method (1-2) No
-mrate - Mutation Rate (0-100 No
-initm - Initial Mutation It...(0-100) No

Check the Wiki page to know more about the available methods!

Site

http://vrp.atd-lab.inf.puc-rio.br/index.php/en/

VRP Instances

http://neo.lcc.uma.es/vrp/vrp-instances/capacitated-vrp-instances/

Know Best Results

http://neo.lcc.uma.es/vrp/known-best-results/