摘要:River Formation Dynamics (RFD) is an evolutionary computation methodbased on copying how drops form rivers by eroding the ground and depositing sediments. Given a cost-evaluated graph, we apply RFD to find a way to connect a givenset of origins with a given destination in such a way that distances from origins to the destination are minimized (thus improving the quality of service) but costs to build theconnecting infrastructure are minimized (thus reducing investment expenses). After we prove the NP-completeness of this problem, we apply both RFD and an Ant ColonyOptimization (ACO) approach to heuristically solve it, and some experimental results are reported.