The rise of drones in internet of things: A survey on the evolution, prospects and challenges of unmanned aerial vehicles
The recent years have seen a rise in the incorporation and integration of new smart
connected devices and platforms such as Unmanned Aerial Vehicles (UAVs) to the …
connected devices and platforms such as Unmanned Aerial Vehicles (UAVs) to the …
Reevo: Large language models as hyper-heuristics with reflective evolution
The omnipresence of NP-hard combinatorial optimization problems (COPs) compels domain
experts to engage in trial-and-error heuristic design. The long-standing endeavor of design …
experts to engage in trial-and-error heuristic design. The long-standing endeavor of design …
A study of ant-based pheromone spaces for generation constructive hyper-heuristics
E Singh, N Pillay - Swarm and Evolutionary Computation, 2022 - Elsevier
Research into the applicability of ant-based optimisation techniques for hyper-heuristics is
largely limited. This paper expands upon the existing body of research by presenting a novel …
largely limited. This paper expands upon the existing body of research by presenting a novel …
Understanding the importance of evolutionary search in automated heuristic design with large language models
Automated heuristic design (AHD) has gained considerable attention for its potential to
automate the development of effective heuristics. The recent advent of large language …
automate the development of effective heuristics. The recent advent of large language …
[HTML][HTML] Surrogate model for memetic genetic programming with application to the one machine scheduling problem with time-varying capacity
Surrogate evaluation is a useful, if not the unique, technique in population-based
evolutionary algorithms where exact fitness calculation is too expensive. This situation …
evolutionary algorithms where exact fitness calculation is too expensive. This situation …
Automated design of heuristics for the container relocation problem using genetic programming
M Đurasević, M Đumić - Applied Soft Computing, 2022 - Elsevier
The container relocation problem is a challenging combinatorial optimisation problem
tasked with finding a sequence of container relocations required to retrieve all containers by …
tasked with finding a sequence of container relocations required to retrieve all containers by …
Collaboration methods for ensembles of dispatching rules for the dynamic unrelated machines environment
M Đurasević, FJ Gil-Gala, L Planinić… - … applications of artificial …, 2023 - Elsevier
Dynamic scheduling represents an important combinatorial optimisation problem that often
appears in the real world. The difficulty in solving these problems arises from their dynamic …
appears in the real world. The difficulty in solving these problems arises from their dynamic …
Combining single objective dispatching rules into multi-objective ensembles for the dynamic unrelated machines environment
Dispatching rules (DRs), which are simple constructive methods that incrementally build the
schedule, represent the most popular method for solving dynamic scheduling problems …
schedule, represent the most popular method for solving dynamic scheduling problems …
Evolving ensembles of heuristics for the travelling salesman problem
Abstract The Travelling Salesman Problem (TSP) is a well-known optimisation problem that
has been widely studied over the last century. As a result, a variety of exact and approximate …
has been widely studied over the last century. As a result, a variety of exact and approximate …
Designing relocation rules with genetic programming for the container relocation problem with multiple bays and container groups
M Đurasević, M Đumić - Applied soft computing, 2024 - Elsevier
The container relocation problem (CRP) is an NP-hard combinatorial optimisation problem
that arises in yard management. The problem is concerned with loading all containers from …
that arises in yard management. The problem is concerned with loading all containers from …