研究目的
To develop an optimization model for network dimensioning for Quadratic Flow Thinning (QFT) and its variants, and to present a solution algorithm based on path generation, including deriving pricing problems and conducting a numerical study to compare efficiency and network costs.
研究成果
The paper presents an optimization model for QFT and demonstrates its effectiveness through numerical studies. QFT with general quadratic formula and full range () achieves network costs close to FT, while being more implementable. The path generation algorithm is efficient for most cases, but computational times increase for larger state scenarios. Future work includes adding modularity, improving efficiency, and testing on realistic network instances.
研究不足
The optimization process for quadratic formulas is computationally inefficient due to many variables. The study uses a specific network instance (polska) which may not fully represent all FSO networks. Signalling mechanisms for full range thinning formulas are impractical. Pricing problems for certain ranges (e.g., +(d, p)) are complex and time-consuming.