Routing DSL

For now this is just a scratchpad of Adam's thoughts.

Examples of objective functions I want to implement

• Minimize total vehicle distance
• Minimize total vehicle time
• Minimize max vehicle distance
• Minimize max vehicle time

x[k1,k2,i] = vehicle i has a route segment from k1 to k2
y[k1,k2,i] = vehicle i has a chain of route segments from k1 to k2

JuMP objective functions

Minimize total vehicle distance: sum{distances[k1,k2]*x[k1,k2,i],k1=RA,k2=RA,i=VA}

Minimize total time: sum{durations[k1,k2]*x[k1,k2,i],k1=RA,k2=RA,i=VA}

Minimize total passenger distance: sum{distances[k1,]*y[,(k1,k2)=XA,i=VA}