bidirectional Dijkstra GAMS
Posted: Wed Feb 15, 2023 10:47 am
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?
Is this possible in GAMS?