Flow Capturing Location-Allocation Problem with Stochastic Demand under Hurwicz Rule

摘要

The basic form of flow capturing location-allocation model is to locate facilities to intercept as much flow as possible from a given set of pre-existing flows on the network. With the assumption that the customer flow is stochastic variable in probability space, chance-constrained programming model is developed for this problem under Hurwicz rule. To solve this stochastic model, stochastic simulation, greedy search and genetic algorithm are integrated to produce a hybrid intelligent algorithm. Some examples generated randomly are tested to illustrate the effectiveness of the proposed algorithm.