Sequential and Parallel Meta-Heuristics for Solving the Single Row Routing Problem

Authors:
Albert Y. Zomaya;Daniel Patterson;Stephan Olariu
Affiliations:
School of Information Technologies, The University of Sydney, Sydney, NSW 2006, Australia;Parallel Computing Research Laboratory, Department of Electrical and Electronic Engineering, The University of Western Australia, Western Australia 6907, Australia;Department of Computer Science, Old Dominion University, Norfolk, VA, USA
Venue:
Cluster Computing
Year:
2004

Citing 8
Cited 1

Heuristic Algorithms for Single Row Routing

IEEE Transactions on Computers
A Near-Optimal Heuristic Algorithm for Single-Flow Routing

IEEE Transactions on Computers
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic algorithms in optimisation and adaptation

Advances in parallel algorithms
Using MPI: portable parallel programming with the message-passing interface

Using MPI: portable parallel programming with the message-passing interface
Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues

IEEE Transactions on Parallel and Distributed Systems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Solutions to Parallel and Distributed Computing Problems: Lessons from Biological Sciences

Solutions to Parallel and Distributed Computing Problems: Lessons from Biological Sciences

GPU-Based multi-start local search algorithms

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The design of multi-layer printed circuit boards is vital in the construction of complex electronic systems. Wire routing is a crucial step in the overall design process, which can be decomposed into a number of single row routing (SRR) problems. This paper proposes an approach to solve the SRR problem based on parallel meta-heuristics. The development of this technique involves the design of an encoding strategy that allows all possible routings to be uniquely represented and the derivation of cost functions that maximizes the quality of the developed solutions. Further, parallelization of the proposed approach is attempted to improve the computational efficiency. The different stages of the development are backed by experiments to show the pros and cons of the sequential and parallel implementations.