Items where Author / Artist / Editor is "Ouaarab, Aziz"

See full list of headings
Export as [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 5.

Article

Ouaarab, Aziz, Ahiod, Belaïd and Yang, Xin-She ORCID logoORCID: https://orcid.org/0000-0001-8231-5556 (2015) Random-key cuckoo search for the travelling salesman problem. Soft Computing, 19 (4) . pp. 1099-1106. ISSN 1432-7643 [Article] (doi:10.1007/s00500-014-1322-9)

Ouaarab, Aziz, Ahiod, Belaïd and Yang, Xin-She ORCID logoORCID: https://orcid.org/0000-0001-8231-5556 (2014) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Computing and Applications, 24 (7-8) . pp. 1659-1669. ISSN 0941-0643 [Article] (doi:10.1007/s00521-013-1402-2)

Book Section

Ouaarab, Aziz and Yang, Xin-She ORCID logoORCID: https://orcid.org/0000-0001-8231-5556 (2016) Cuckoo search: from Cuckoo reproduction strategy to combinatorial optimization. In: Nature-Inspired Computation in Engineering. Studies in Computational Intelligence, 637 . Springer, pp. 91-110. . [Book Section] (doi:10.1007/978-3-319-30235-5_5)

Ouaarab, Aziz, Ahiod, Belaïd and Yang, Xin-She ORCID logoORCID: https://orcid.org/0000-0001-8231-5556 (2015) Discrete Cuckoo search applied to job shop scheduling problem. In: Recent advances in swarm intelligence and evolutionary computation. Yang, Xin-She ORCID logoORCID: https://orcid.org/0000-0001-8231-5556, ed. Studies in Computational Intelligence (585) . Springer, pp. 121-137. ISBN 9783319138251. [Book Section] (doi:10.1007/978-3-319-13826-8_7)

Conference or Workshop Item

Ouaarab, Aziz, Ahiod, Belaïd, Yang, Xin-She ORCID logoORCID: https://orcid.org/0000-0001-8231-5556 and Abbad, Mohammed (2014) Discrete cuckoo search algorithm for job shop scheduling problem. 2014 IEEE International Symposium on Intelligent Control (ISIC). In: 2014 IEEE International Symposium on Intelligent Control (ISIC), 8-10 Oct 2014, France. . [Conference or Workshop Item] (doi:10.1109/ISIC.2014.6967636)

This list was generated on Fri Sep 29 04:20:13 2023 BST.