bidirectional Dijkstra GAMS

Problems with syntax of GAMS
Post Reply
GAMS_practitioner
User
User
Posts: 9
Joined: 1 year ago

bidirectional Dijkstra GAMS

Post by GAMS_practitioner »

I need to do some preprocessing on a simple transport ntwork to find a set of nodes and then create a parameter/set. More specifically, I need to find the the shortest trip time from location i to location j then to location i′ . Then sore all such "j" locations inside a set.

Is this possible in GAMS?
Post Reply