A algorithm for the weighted minisum problem on an undirected network with continuous link demands
Ma Ming · Machinery Design and Manufacture · 2001
Facility location is an active Operation Research area and plays a significant role in strategic planing of Supply Chains. Enterprises will confront with the problem of locating their service facilities to minimize the sum of travel distances from the facilities to the demands during establishing geographically' distributed service systems. On basis of Operation Research and Graph theory, we developed an algorithm for the Minisum problem on an undirected network with continuous link demands. We also develop a program based on this algorithm. This algorithm can solve the Minisum problem on any undirected ichnography with continuous link demands. This algorithm use dispersed method instead of derivative method. In this paper we validate the algorithm with numerical examples. This algorithm can solve the problem in shorter time because of avoidance of NP problem.