需求不确定情况下的服务站截流选址分配问题研究

FIP Problem with Uncertain Demand in Several Scenarios

主要研究当每条道路的顾客流量在不同情形下,流量不同条件下,如何设立服务站的FIP问题。根据截得的流量最小值最大和遗憾度最小目标准则建立了在需求不确定条件下的两个FIP模型,并给出了相应的启发式算法,最后通过启发式算法和分支定界法对一个算例计算比较。

The paper uses the Maxmin and regret approaches to formulate two models so as to address the FIP problem under uncertainty. A heuristic method is developed and computational experiments are described and compared with the solutions using brand-and-bound.