|
|
|
|
|
Zhu Wang, Junfeng Cheng and Hongtao Hu
Port operations have been suffering from hybrid uncertainty, leading to various disruptions in efficiency and tenacity. However, these essential uncertain factors are often considered separately in literature during berth and quay crane assignments, lead...
ver más
|
|
|
|
|
|
|
|
|
|
|
Domagoj Jakobovic, Marko Ðurasevic, Karla Brkic, Juraj Fosin, Tonci Caric and Davor Davidovic
Many real-world applications of the vehicle routing problem (VRP) are arising today, which range from physical resource planning to virtual resource management in the cloud computing domain. A common trait of these applications is usually the large scale...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nima Khodadadi, Ehsan Harati, Francisco De Caso and Antonio Nanni
This article highlights the absence of published paradigms hybridized by The Cuckoo Search (CS) and Stochastic Paint Optimizer (SPO) for optimizing truss structures using composite materials under natural frequency constraints. The article proposes a nov...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bianca Goia, Tudor Cioara and Ionut Anghel
Virtual power plants (VPPs) are promising solutions to address the decarbonization and energy efficiency goals in the smart energy grid. They assume the coordination of local energy resources such as energy generation, storage, and consumption. They are ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Abdelraouf Ishtaiwi and Qasem Abu Al-Haija
The Maximum Satisfiability (Maximum Satisfiability (MaxSAT)) approach is the choice, and perhaps the only one, to deal with most real-world problems as most of them are unsatisfiable. Thus, the search for a complete and consistent solution to a real-worl...
ver más
|
|
|
|
|
|
|
|
|
|
|
Qibing Jin, Nan Lin and Yuming Zhang
K-Means Clustering is a popular technique in data analysis and data mining. To remedy the defects of relying on the initialization and converging towards the local minimum in the K-Means Clustering (KMC) algorithm, a chaotic adaptive artificial bee colon...
ver más
|
|
|
|
|
|
|
|
|
|
|
Abdelraouf Ishtaiwi, Feda Alshahwan, Naser Jamal, Wael Hadi and Muhammad AbuArqoub
For decades, the use of weights has proven its superior ability to improve dynamic local search weighting algorithms? overall performance. This paper proposes a new mechanism where the initial clause?s weights are dynamically allocated based on the probl...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rafael D. Tordecilla, Pedro J. Copado-Méndez, Javier Panadero, Carlos L. Quintero-Araujo, Jairo R. Montoya-Torres and Angel A. Juan
The location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with large-scale instances that need to be so...
ver más
|
|
|
|
|
|
|
|
|
|
|
Vincenzo Cutello, Georgia Fargetta, Mario Pavone and Rocco A. Scollo
Community detection is one of the most challenging and interesting problems in many research areas. Being able to detect highly linked communities in a network can lead to many benefits, such as understanding relationships between entities or interaction...
ver más
|
|
|
|
|
|
|
|
|
|
|
Maite Dewinter, Christophe Vandeviver, Tom Vander Beken and Frank Witlox
Police patrol is a complex process. While on patrol, police officers must balance many intersecting responsibilities. Most notably, police must proactively patrol and prevent offenders from committing crimes but must also reactively respond to real-time ...
ver más
|
|
|
|
|
|