|
|
|
|
|
Esra?a Alkafaween, Ahmad Hassanat, Ehab Essa and Samir Elmougy
The genetic algorithm (GA) is a well-known metaheuristic approach for dealing with complex problems with a wide search space. In genetic algorithms (GAs), the quality of individuals in the initial population is important in determining the final optimal ...
ver más
|
|
|
|
|
|
|
|
|
Chang Guo, Jianfeng Zhu and Xiaoming Wang
In recent years, the rapid growth of vehicles has imposed a significant burden on urban road resources. To alleviate urban traffic congestion in intelligent transportation systems (ITS), real-time and accurate traffic flow prediction has emerged as an ef...
ver más
|
|
|
|
|
|
|
|
|
Nasser Lotfi and Mazyar Ghadiri Nejad
Multi-objective task graph scheduling is a well-known NP-hard problem that plays a significant role in heterogeneous distributed systems. The solution to the problem is expected to optimize all scheduling objectives. Pretty large state-of-the-art algorit...
ver más
|
|
|
|
|
|
|
|
|
Fakhar Uddin, Naveed Riaz, Abdul Manan, Imran Mahmood, Oh-Young Song, Arif Jamal Malik and Aaqif Afzaal Abbasi
The travelling salesman problem (TSP) is perhaps the most researched problem in the field of Computer Science and Operations. It is a known NP-hard problem and has significant practical applications in a variety of areas, such as logistics, planning, and...
ver más
|
|
|
|
|
|
|
|
|
Francisco-David Hernandez, Domingo Cortes, Marco Antonio Ramirez-Salinas and Luis Alfonso Villa-Vargas
In control research and design it is frequently necessary to explore, evaluate, tune and compare many control strategies. These activities are assisted by software tools of increasing complexity; however, even with the existing high performance tools the...
ver más
|
|
|
|