Tabu Search for Dynamicrouting Communicationsnetwork
نویسندگان
چکیده
This paper presents a tabu search approach for optimizing the link capacities in a dynamic routing telecommunications network. The traac between any two nodes in the network is routed over a one-link direct path or, if no direct capacity is available, over a two-link alternate path. The alternate routing paths can be changed dynamically from hour to hour as the traac between pairs of nodes may vary with the time of day. The problem is to determine the optimal capacity level for each link in the network to minimize cost while satisfying the grade-of-service constraints. Although the problem can be formulated as a nonlinear integer programming problem, no eecient solution procedures are available. In this paper, we develop a two-level tabu search heuristic for solving the problem that utilizes probabilistic move selection and coordinated solution recovery strategies. The macro level of the algorithm iteratively determines an hour for possible improvement and then the micro level seeks to optimize the routing paths for that hour. Our computational experience with both real and simulated problems indicates that signiicant savings can be obtained by this approach over the conventional network designs.
منابع مشابه
Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملAPPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT
The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملComparison of particle swarm optimization and tabu search algorithms for portfolio selection problem
Using Metaheuristics models and Evolutionary Algorithms for solving portfolio problem has been considered in recent years.In this study, by using particles swarm optimization and tabu search algorithms we optimized two-sided risk measures . A standard exact penalty function transforms the considered portfolio selection problem into an equivalent unconstrained minimization problem. And in final...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کامل