考虑消费者路径选择的多元需求FIFLP

Multi-demand FIFLP with Customer Path Choice

考虑了顾客的多元需求和需求流的路径选择的截流设施选址问题,网络上顾客行走的OD对存在不同的路径,引用重力模型来确定路径的选择概率,运用需求系数函数实现需求流的部分截得,建立了数目约束下的截得最大流量模型,给出了求解模型的启发式算法,先用增加算法求初始解,再用交换算法改进。最后给出一个算例,通过与精确解的比较,证明了算法的可行性和有效性。

This paper study flow intercepting facility location problems（FIFLP） with multi-de mand and path choice of customers. There are different paths in the OD pairs on network, we intro duce gravity model to decide the path choice probability and consider flow part intercepting through demand coefficient function. Under the facility number constraint, this paper gives the maximization flow model, and offers heuristic algorithm to solve the model. Firstly, we get the initial solution with Add algorithm and then we improve it with inter-change algorithm. Finally, a numerical example is presented, and through comparing the results with exact solution, it shows the feasibility and effec tiveness of the heuristic algorithm.