|
|
|
|
|
Giorgio Lazzarinetti, Riccardo Dondi, Sara Manzoni and Italo Zoppis
Solving combinatorial problems on complex networks represents a primary issue which, on a large scale, requires the use of heuristics and approximate algorithms. Recently, neural methods have been proposed in this context to find feasible solutions for r...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sifang Zhou and Qingnian Zhang
The container relocation problem (CRP) is an important factor affecting the operation efficiency of container terminal yards, and it has attracted much attention for decades. The CRP during the pickup operations of import containers is still an intractab...
ver más
|
|
|
|
|
|
|
|
|
|
|
Omar Abdulkhaleq Aldabash and Mehmet Fatih Akay
An IDS (Intrusion Detection System) is essential for network security experts, as it allows one to identify and respond to abnormal traffic present in a network. An IDS can be utilized for evaluating the various types of malicious attacks. Hence, detecti...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xin Liao and Khoi D. Hoang
Distributed Constraint Optimization Problems (DCOPs) are an efficient framework widely used in multi-agent collaborative modeling. The traditional DCOP framework assumes that variables are discrete and constraint utilities are represented in tabular form...
ver más
|
|
|
|
|
|
|
|
|
|
|
Lin Guo, Anand Balu Nellippallil, Warren F. Smith, Janet K. Allen and Farrokh Mistree
When dealing with engineering design problems, designers often encounter nonlinear and nonconvex features, multiple objectives, coupled decision making, and various levels of fidelity of sub-systems. To realize the design with limited computational resou...
ver más
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|