-
1
Scatter search algorithm for the cross-dock door assignment problem
Published 2014“…A lot of research has been conducted regarding this topic still, up to our knowledge, none used Scatter Search (SS). In this paper, we implemented this evolutionary metaheuristic algorithm and tested it, then compared the results with those of another evolutionary algorithm, Genetic Algorithm (GA). …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
2
A survey for recent applications and variants of nature-inspired immune search algorithm
Published 2020“…Artificial Immune Systems (AIS) is a well-known nature inspired and population based algorithm that proved its effectiveness for solving engineering and practical real-world problems. …”
Get full text
Get full text
-
3
A fast exact sequential algorithm for the partial digest problem
Published 2016“…The percentage of improvement is more than 75% over the best known practical algorithm for the worst case. For large numbers of inputs, our algorithm is able to solve the problem in a suitable time, while the best known practical algorithm is unable.…”
-
4
Matheuristic Fixed Set Search Applied to the Two-Stage Capacitated Facility Location Problem
Published 2025“…We propose a twofold contribution: first, an adaptive greedy algorithm that generates high-quality initial solutions, achieving markedly better results than traditional constructive heuristics at comparable computational costs; and second, the adaptation of the Matheuristic Fixed Set Search (MFSS) to the TSCFLP. …”
-
5
-
6
MSD-NAS: multi-scale dense neural architecture search for real-time pedestrian lane detection
Published 2023“…This paper proposes a novel neural architecture search (NAS) algorithm, named MSD-NAS, to automate this laborious task. …”
-
7
Practical Multiple Node Failure Recovery in Distributed Storage Systems
Published 2016Get full text
Get full text
Get full text
Get full text
conferenceObject -
8
A hybrid graph representation for exact graph algorithms
Published 2014“…Many exact search algorithms for NP-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. …”
Get full text
Get full text
Get full text
conferenceObject -
9
A hybrid graph representation for recursive backtracking algorithms
Published 2017“…The performance of these algorithms often suffers from the increasing number of graph modifications, such as deletions, that reduce the problem instance and have to be “taken back” frequently during the search process. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
10
Natural optimization algorithms for the cross-dock door assignment problem
Published 2016“…A lot of research has been conducted regarding this topic; still, up to our knowledge, none used scatter search (SS). This paper modifies a classical mathematical model that represents the CDAP and implements an evolutionary metaheuristic SS algorithm and tests it and then compares the results with those of another evolutionary algorithm, i.e., genetic algorithm (GA). …”
Get full text
Get full text
Get full text
Get full text
article -
11
Practical single node failure recovery using fractional repetition codes in data centers
Published 2016“…This makes our work practical to apply. Hence, a practical solution for node failures is presented by using a self-designed genetic algorithm that searches within the feasible solution space. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
12
A parallel optimization algorithm for the maximum clique problem. (c2008)
Published 2008Get full text
Get full text
masterThesis -
13
-
14
DAP: A dataset-agnostic predictor of neural network performance
Published 2024“…This task often must be repeated many times, especially when developing a new deep learning algorithm or performing a neural architecture search. …”
-
15
Autonomous Demand-Side Management in the Future Smart Grid
Published 2016Get full text
doctoralThesis -
16
-
17
Optimal shunt compensators at nonsinusoidal busbars
Published 1995“…This model was solved employing the penalty function approach and the golden Section Search algorithm for solving the linear load case. …”
Get full text
Get full text
article -
18
-
19
OPTIMAL SHUNT COMPENSATORS AT NON-SINUSOIDAL BUSBARS
Published 2020“…This model was solved employing the penalty function approach and the golden Section Search algorithm for solving the linear load case. …”
Get full text
article -
20
The bus sightseeing problem
Published 2023“…A mixed-integer programming formulation for the BSP is provided and solved by a Benders decomposition algorithm. For large-scale instances, an iterated local search based metaheuristic algorithm is developed with some tailored neighborhood operators. …”
