The Multi-purpose Network Capacitated Facility Location Problem and a Solution Algorithm

Facility location problems have taken a major place in operations research where investigate to physically locate a set of facilities so as to optimize a given function subject to a set ofconstraints. This paper focuses mainly on facility location problems on networks with multiple types of facilities andmultiple types of customers with considering the capacity constraints for the new facilities. This problem is formulated as an integer linear programming model to minimize the totallocation and allocation cost. Due to the complexity of the problem, a Greedy Exchange Algorithm (GEA) is proposedwhich an Interchange procedure is applied for the initial solutions of GEA. A number of instances are tested by the presented algorithm and the results are compared with the solution returned by the LINGO optimization software using two algorithm performance measurements

کلیدواژه ها:

mutiple-purpose facility ، capacitated location problem ، solution algorithm