Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations
Journal of Heuristics
A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Internet growth: is there a "Moore's law" for data traffic?
Handbook of massive data sets
Parallel tabu search for a pickup and delivery problem under track contention
Parallel Computing - Special issue: Parallel computing in logistics
A parallel tabu search algorithm for solving the container loading problem
Parallel Computing - Special issue: Parallel computing in logistics
Management agent for search algorithms with surface optimization applications
WSEAS Transactions on Computers
WSEAS Transactions on Information Science and Applications
Adaptive Tabu Search and Applications in Engineering Design
Proceedings of the 2006 conference on Integrated Intelligent Systems for Engineering Design
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Engineering evolutionary algorithm to solve multi-objective OSPF weight setting problem
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
IEEE Communications Magazine
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Dynamic compensation of hard-disk R/W head and head-stack
WSEAS TRANSACTIONS on SYSTEMS
Hi-index | 0.00 |
The problem of setting the Open Shortest Path First (OSPF) weights on links such that congestion can be avoided is proved to be NP-hard. Many iterative heuristics have been applied to solve the OSPF weight setting (OSPFWS) problem. As the size of any combinatorial optimization problem increases, it becomes more difficult to find an optimum solution using sequential algorithms. Parallelization of modern iterative heuristics has been proven to produce improved solution precision and timing. In this paper, we investigate the parallelization of Tabu Search and apply two variants of a Parallel Tabu Search (PTS) heuristic on the OSPFWS problem. It is shown through experimental results that both PTS approaches produced better solutions quality compared to the sequential heuristics; specifically for larger topologies. In one approach, we propose a new design for our parallel cooperative search algorithm, which performs better than the conventional parallel heuristic. The purpose of this new design is to induce diversification into the search to explore a larger search space. We also show that the new approach performs better than the conventional parallel heuristic.