Dear all,
I am conducting a research on optimising a regional road network problem. My goal is to find an optimal solution that can minimise total travel time from all starting nodes to all terminal nodes (i.e., OD-matrix) and minimize total length of newly added/planned links at the same time based on the theory of Scott (1970s). Namely, I hope to maximise connected links and minimize total number of newly added links.
I find some algorithms (short path algorithm and spanning tree algorithm) to calculate the accessibility indicators. I am right now a bit lost. As I can't access travel flow data to calculate the total cost of travel, I am not be able to conduct a linear programming study on this issue. I am right now a bit confused and lost, hope you can provide me with some pointers on how to move on with this research. Any advices and suggestions are highly appreciated.
Best,
Andrew