### Abstract

Original language | English |
---|---|

Title of host publication | PART '99: Proceedings of the 6th Australasian Conference on Parallel and Real-Time Systems, Melbourne, Australia, 29 November - 1 December 1999 |

Editors | Wilson C. H. Cheng, A. S. M. Sajeev |

Place of Publication | Singapore |

Publisher | Springer |

Pages | 68-79 |

Number of pages | 12 |

ISBN (Print) | 9814021598 |

Publication status | Published - 1999 |

### Fingerprint

### Cite this

*PART '99: Proceedings of the 6th Australasian Conference on Parallel and Real-Time Systems, Melbourne, Australia, 29 November - 1 December 1999*(pp. 68-79). Singapore: Springer.

}

*PART '99: Proceedings of the 6th Australasian Conference on Parallel and Real-Time Systems, Melbourne, Australia, 29 November - 1 December 1999.*Springer, Singapore, pp. 68-79.

**A General Parallel Tabu Search Algorithm for Combinatorial Optimisation Problems.** / Randall, Marcus; Abramson, David.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

TY - GEN

T1 - A General Parallel Tabu Search Algorithm for Combinatorial Optimisation Problems

AU - Randall, Marcus

AU - Abramson, David

PY - 1999

Y1 - 1999

N2 - Tahu Search (TS) is a meta-heuristic search algorithm that is easy to parallelise. Efficient parallelisation of TS can represent a significant saving in the real-time required to solve a problem over an equivalent sequential algorithm. In this study, a general parallel TS algorithm for solving combinatorial optimisation problems (COPs) is presented. The unique feature of our approach is that the TS solves a wide range of COPs expressed in a high level syntax. The benefit of this general code is that it can be used in real-time applications due to its parallel scalability and the fact that it can accept changing problem definitions. After reviewing a number of suitable parallelisation strategies, results are presented that show that good parallel speedup is achieved while efficient solutions to hard COPs are obtained.

AB - Tahu Search (TS) is a meta-heuristic search algorithm that is easy to parallelise. Efficient parallelisation of TS can represent a significant saving in the real-time required to solve a problem over an equivalent sequential algorithm. In this study, a general parallel TS algorithm for solving combinatorial optimisation problems (COPs) is presented. The unique feature of our approach is that the TS solves a wide range of COPs expressed in a high level syntax. The benefit of this general code is that it can be used in real-time applications due to its parallel scalability and the fact that it can accept changing problem definitions. After reviewing a number of suitable parallelisation strategies, results are presented that show that good parallel speedup is achieved while efficient solutions to hard COPs are obtained.

M3 - Conference contribution

SN - 9814021598

SP - 68

EP - 79

BT - PART '99: Proceedings of the 6th Australasian Conference on Parallel and Real-Time Systems, Melbourne, Australia, 29 November - 1 December 1999

A2 - Cheng, Wilson C. H.

A2 - Sajeev, A. S. M.

PB - Springer

CY - Singapore

ER -