English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

187  Design Genetic Algorithm To Find The Optimal Critical Path Network Project (GAOCPN)  Lamyaa Jasim Mohammed Niam Al-Thanoon  Samaa Tlayea Azeez  Lomuaa Jasem@uomosul.edu.iq niam.munim@uomosul.edu.iq  samatalee843@gmail.com  College of Computer Sciences and Mathematics  University of Mosul  Received on: 30/6/2011 Accepted on:2/11/2011 ABSTRACT The present study deals with using up-to-date intelligent techniques. We try to utilize the genetic algorithm efficiently and integrate it with the problem of study by designing and applying a genetic algorithm to find the optimal critical path of networks GAOCPN achieving many results, e.g., real time. Accuracy in representing the steps of project execution as a net of nodes and paths has a great role in the accuracy of program results GAOCPN written in C++ version 5.0 under Window. The program was applied on many networks, such as Al-Sarafiya Bridge networks, and the execution time and results were checked and compared with the execution time and results of traditional methods (dynamic programming) and Win_QSB program. The GAOCPN showed accuracy of results in a standard time. Sometimes, it showed optimal results better than those of the traditional methods and it showed results identical to Win_QSB but in standard time.