Flow interception location problem of congestion facilities in competitive system

This paper studied flow an interception location problem with consideration of customers' waiting time under competitive surrounding. Customer flows on the paths obtain service from facilities according to a probabilistic distribution, which is determined by facility capacities, deviation distance from the given path and customer waiting time. With some facilities existed, the objective is to maximize the customer flows intercepted by new facilities through their locations. We employ greedy heuristic and trust region ogle method to solve this model. Through a great of computation tests, we find this methods efficient and can be applied to large network location.