Learn More
This paper proposes the design and analysis of two metaheuristics, simulated annealing (SA) and tabu search (TS), for solving the feeder bus network design problem. The results are compared to those published in the literature. A comparative study is also carried out on several test problems generated at random to evaluate the performance of these(More)
One of the most basic problems in data networks is that of assigning routing paths. In the context of this paper, the problem can be divided into two parts. First, understanding the solutions which minimize the expected delay, and second, finding a way to effectively find these solutions (i.e. computationally tractable). In the paper " A Minimum Delay "(More)
  • 1