A Class of the Flow Capturing Location-Allocation Model with Service Radius

This article considers a class of the flow capturing location-allocation model(FCLM) with service radius.With the assumption that the customer flows at most be serviced for one time,the decision objective for service providers is to find the optimal locations for such service facilities to maximize the number of customers "captured".This sort of problem is called FCLM.Actually the customer flows on the path can go to the facility with a deviation distance,which can be endured.This paper proposes the FCLM with service radius and gives an heuristic greedy algorithm.For many kinds of facilities,their customers can be divided into two parts: dedicated-trip demand from the nodes and by-passing flow demand form the paths.Hence,a hybrid FCLM with dedicated-trip demand service radius D and by-passing flow demand service radius d is proposed.A heuristic greedy substitute algorithm presented solves the example network.