Optimal flow analysis, prediction and application
Weili Zhang

TL;DR
This thesis introduces a novel statistical learning approach to analyze and predict optimal flows in fixed charge network flow problems, significantly improving prediction accuracy and providing insights for solving these complex network optimization challenges.
Contribution
It is the first work to employ statistical learning to analyze the FCNF problem, identifying key network features that influence optimal flow and enabling accurate arc flow prediction.
Findings
Predictive model achieves 88% accuracy.
Area under ROC curve is 0.95.
Identifies 26 significant predictors for flow prediction.
Abstract
This thesis employs statistical learning technique to analyze, predict and solve the fixed charge network flow (FCNF) problem, which is common encountered in many real-world network problems. The cost structure for flows in the FCNF involves both fixed and variable costs. The FCNF problem is modeled mixed binary linear programs and can be solved with standard commercial solvers, which use branch and bound algorithm. This problem is important for its widely applications and solving challenges. There does not exist a efficient algorithm to solve this problem optimally due to lacking tight bounds. To the best of our knowledge, this is the first work that employs statistical learning technique to analyze the optimal flow of the FCNF problem. Most algorithms developed to solve the FCNF problem are based on the cost structure, relaxation, etc. We start from the network characteristics and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAviation Industry Analysis and Trends · Transportation Planning and Optimization · Smart Parking Systems Research
