This paper considers a topological optimization of a local area network design with a reliability constraint. The objective is to find the topological layout of links, hubs, and the users, at minimal cost, under the constraint that the network reliability is more than a given reliability. To efficiently solve the problem, a scatter search approach is proposed. Two illustrative examples are used to explain and test the proposed approach. Experimental results show evidence that the proposed approach performs more efficiently for finding a good solution or near optimal solution in comparison with genetic algorithm approach.
This paper considers a topological optimization of a local area network design with a reliability constraint. The objective is to find the topological layout of links, hubs, and the users, at minimal cost, under the constraint that the network reliability is more than a given reliability. To efficiently solve the problem, a scatter search approach is proposed. Two illustrative examples are used to explain and test the proposed approach. Experimental results show evidence that the proposed approach performs more efficiently for finding a good solution or near optimal solution in comparison with genetic algorithm approach.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.