mck-/Open-VRP — Issue #7: return to base
Author: mck-
Created: 2012-01-19 04:04:34+00:00
State: open
Labels: feature

For most VRP problems you do, but not all of them.

One approach is to start with [0] [0] as initial routes, and insert nodes in between them:

Adjust initial solutions to have two base nodes in the route
Adjust way of checking for "empty routes"
Adjust generating moves (to prevent appending to end of route, after the [0])

Another approach is to append [0] at the end:

Adjust fitness calculation
Adjust constraints checking (make sure it gets back in time)
Adjust print solution and final solution

Which one is better?