Commit 2dac93d

authored

Update README.md

1 parent e399152 commit 2dac93dCopy full SHA for 2dac93d

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -18,7 +18,7 @@ vehicle routing problem](http://citeseerx.ist.psu.edu/viewdoc/downloa[d?doi=10.1`
`18`	`18`	`# A-benchmarks`
`19`	`19`
`20`	`20`	`---`
`21`		`-\| \| benchmark \| n_locations \| n_trucks \| capacity \| optimal_cost \| ABC_cost \| ABC_time \| error \| is_feasible \|`
	`21`	`+\| \| benchmark \| n_locations \| n_trucks \| capacity \| optimal_cost \| ABC_cost \| time (s) \| error \| is_feasible \|`
`22`	`22`	`\|---:\|:--------------\|--------------:\|-----------:\|-----------:\|---------------:\|-----------:\|-----------:\|----------:\|:--------------\|`
`23`	`23`	`\| 0 \| A-n32-k5.vrp \| 32 \| 5 \| 100 \| 784 \| 793.689 \| 34.4186 \| 0.0123585 \| True \|`
`24`	`24`	`\| 1 \| A-n33-k5.vrp \| 33 \| 5 \| 100 \| 661 \| 677.849 \| 33.94 \| 0.0254898 \| True \|`
`@@ -51,7 +51,7 @@ vehicle routing problem](http://citeseerx.ist.psu.edu/viewdoc/downloa[d?doi=10.1`
`51`	`51`	`# B-benchmarks`
`52`	`52`
`53`	`53`	`---`
`54`		`-\| \| benchmark \| n_locations \| n_trucks \| capacity \| optimal_cost \| ABC_cost \| ABC_time \| error \| is_feasible \|`
	`54`	`+\| \| benchmark \| n_locations \| n_trucks \| capacity \| optimal_cost \| ABC_cost \| time (s) \| error \| is_feasible \|`
`55`	`55`	`\|---:\|:--------------\|--------------:\|-----------:\|-----------:\|---------------:\|-----------:\|-----------:\|----------:\|:--------------\|`
`56`	`56`	`\| 0 \| B-n31-k5.vrp \| 31 \| 5 \| 100 \| 672 \| 706.569 \| 20.9377 \| 0.0514423 \| True \|`
`57`	`57`	`\| 1 \| B-n34-k5.vrp \| 34 \| 5 \| 100 \| 788 \| 808.974 \| 23.4713 \| 0.0266171 \| True \|`

Comments

(0)