article · 2007

Parallel Asynchronous Memetic Algorithms

Richard Bradwell, Ken Brown

Cited by 0Abstract and details only

Abstract

This paper discusses our recent research combining a GA (Goldberg 1989) with Tabu search (Glover 1993) in an asynchronous manner, which also extends the idea of Memetic Algorithms (Moscato 1989). Our application domain is the job-shop scheduling problem (Baker 1974). 2 The Job-Shop Scheduling Problem

Cite this paper

APA 7

Bradwell, R., & Brown, K. (2007). Parallel Asynchronous Memetic Algorithms.

MLA 9

Bradwell, Richard, and Ken Brown. “Parallel Asynchronous Memetic Algorithms.” 2007.

Chicago

Bradwell, Richard, and Ken Brown. 2007. “Parallel Asynchronous Memetic Algorithms.”

Harvard

Bradwell, R. and Brown, K. (2007) ‘Parallel Asynchronous Memetic Algorithms’.

BibTeX

@article{bradwell2007parallel,
  title = {{Parallel Asynchronous Memetic Algorithms}},
  author = {Bradwell, Richard and Brown, Ken},
  year = {2007}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.