Saber Mohammed Elsayed
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Saber Mohammed Elsayed has a total of 78 co-authors. Here are the top co-authors by number of shared publications:
- Ruhul Sarker
School of Systems and Computing, University of New South Wales, Australia
90 shared publications - Daryl Essam
School of Systems & Computing, University of New South Wales (UNSW), Canberra, Australia
46 shared publications - Tapabrata Ray
University of New South Wales
17 shared publications - Forhad Zaman
School of Engineering and Information Technology, University of New South Wales, Canberra, ACT, Australia
12 shared publications - Carlos Artemio Coello Coello
Cinvestav-IPN
11 shared publications - Karam M. Sallam
Faculty of Computers and Informatics, Zagazig University, Zagazig, Egypt
8 shared publications
Latest Publications
- Open Access
- 24 October 2026
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 110
Timebox-enhanced evolutionary algorithm for electric vehicle–drone routing problem with drone stations and time windows
- 24 October 2026
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 110
Open AccessTimebox-enhanced evolutionary algorithm for electric vehicle–drone routing problem with drone stations and time windows
- Open Access
- 29 August 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 352
Supervised learning-guided individual-level operator selection in differential evolution for constrained optimization
- 29 August 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 352
Open AccessSupervised learning-guided individual-level operator selection in differential evolution for constrained optimization
- Open Access
- 4 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 80-87
An Evolutionary Computation-based Approach for a Multi-Objective Drone-Assisted Relief Distribution Problem
- 4 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 80-87
Open AccessAn Evolutionary Computation-based Approach for a Multi-Objective Drone-Assisted Relief Distribution Problem
- Open Access
- 8 November 2025
- Published by Elsevier in Ad Hoc Networks
- Vol. 181
Transfer function-guided mixed-variable optimization for joint mining decisions and resource allocation in mobile edge computing-integrated blockchain networks
- 8 November 2025
- Published by Elsevier in Ad Hoc Networks
- Vol. 181
Open AccessTransfer function-guided mixed-variable optimization for joint mining decisions and resource allocation in mobile edge computing-integrated blockchain networks
- 31 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 10 (1) , 116-129
Planning-Assisted Context-Sensitive Autonomous Shepherding of Dispersed Robotic Swarms in Obstacle-Cluttered Environments
Robotic shepherding is a bio-inspired approach to autonomously guiding a swarm of agents towards a desired location. The research area has earned increasing interest recently due to the efficacy of controlling many agents in a swarm (sheep) using a smaller number of actuators (sheepdogs). However, shepherding a highly dispersed swarm in an obstacle-cluttered environment remains challenging for existing methods. To improve the efficacy of shepherding in complex environments with obstacles and dispersed sheep, this paper proposes a planning-assisted context-sensitive autonomous shepherding framework with collision avoidance abilities. The proposed approach models the swarm shepherding problem as a variant of Travelling Salesperson Problem (TSP) with two moving modes of sheepdogs: no-interaction and interaction. An adaptive switching approach is integrated into the framework to guide real-time path planning for avoiding collisions with obstacles. We then propose an overarching mission planning system, which is made of three sub-systems: a clustering approach to group and distinguish sheep sub-swarms, an Ant Colony Optimisation algorithm as a TSP solver for determining the optimal herding sequence of the sub-swarms, and an online path planner for calculating optimal paths for both sheepdogs and sheep. The experiments on various environments, both with and without obstacles, objectively demonstrate the effectiveness of the proposed shepherding framework and planning approaches.
- 31 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 10 (1) , 116-129
Planning-Assisted Context-Sensitive Autonomous Shepherding of Dispersed Robotic Swarms in Obstacle-Cluttered Environments
Robotic shepherding is a bio-inspired approach to autonomously guiding a swarm of agents towards a desired location. The research area has earned increasing interest recently due to the efficacy of controlling many agents in a swarm (sheep) using a smaller number of actuators (sheepdogs). However, shepherding a highly dispersed swarm in an obstacle-cluttered environment remains challenging for existing methods. To improve the efficacy of shepherding in complex environments with obstacles and dispersed sheep, this paper proposes a planning-assisted context-sensitive autonomous shepherding framework with collision avoidance abilities. The proposed approach models the swarm shepherding problem as a variant of Travelling Salesperson Problem (TSP) with two moving modes of sheepdogs: no-interaction and interaction. An adaptive switching approach is integrated into the framework to guide real-time path planning for avoiding collisions with obstacles. We then propose an overarching mission planning system, which is made of three sub-systems: a clustering approach to group and distinguish sheep sub-swarms, an Ant Colony Optimisation algorithm as a TSP solver for determining the optimal herding sequence of the sub-swarms, and an online path planner for calculating optimal paths for both sheepdogs and sheep. The experiments on various environments, both with and without obstacles, objectively demonstrate the effectiveness of the proposed shepherding framework and planning approaches.
- 12 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 72 (00189391) , 2409-2423
A Decomposition-Based Hybrid Algorithm for Large-Scale Project Portfolio Selection and Scheduling With Reaction to Changing Environments
The project portfolio selection and scheduling problem (PPSSP) aims to select and schedule a set of projects, known as a portfolio, to maximize their benefits while adhering to various constraints. However, addressing PPSSP in a reasonable time becomes increasingly challenging with a growing number of projects, especially in changing environments. This paper proposes a decomposition-based hybrid algorithm with evolutionary algorithm-based global search and exact solverbased local search to optimize large-scale PPSSP, and integrates a reactive approach to re-optimize PPSSP when unexpected changes occur. Specifically, a heuristic solution repair method is designed to accelerate the evolutionary global search, which is then expanded to repair the baseline schedule when dealing with changes. A problem-specific grouping method and a constrained sub-problem construction approach are developed for conducting the cooperative local search using the exact solver. Besides, a reactive approach is crafted to deal with changing circumstances by updating the problem structure, repairing the pre-scheduled solution, and re-optimizing the solutions. Experiments conducted on 28 large-scale PPSSPs and 28 changed PPSSPs have validated the superiority of the proposed hybrid algorithm in achieving competitive results in a shorter time, saving up to 57% computational time to achieve high-quality solutions when compared to the exact solver Gurobi.
- 12 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 72 (00189391) , 2409-2423
A Decomposition-Based Hybrid Algorithm for Large-Scale Project Portfolio Selection and Scheduling With Reaction to Changing Environments
The project portfolio selection and scheduling problem (PPSSP) aims to select and schedule a set of projects, known as a portfolio, to maximize their benefits while adhering to various constraints. However, addressing PPSSP in a reasonable time becomes increasingly challenging with a growing number of projects, especially in changing environments. This paper proposes a decomposition-based hybrid algorithm with evolutionary algorithm-based global search and exact solverbased local search to optimize large-scale PPSSP, and integrates a reactive approach to re-optimize PPSSP when unexpected changes occur. Specifically, a heuristic solution repair method is designed to accelerate the evolutionary global search, which is then expanded to repair the baseline schedule when dealing with changes. A problem-specific grouping method and a constrained sub-problem construction approach are developed for conducting the cooperative local search using the exact solver. Besides, a reactive approach is crafted to deal with changing circumstances by updating the problem structure, repairing the pre-scheduled solution, and re-optimizing the solutions. Experiments conducted on 28 large-scale PPSSPs and 28 changed PPSSPs have validated the superiority of the proposed hybrid algorithm in achieving competitive results in a shorter time, saving up to 57% computational time to achieve high-quality solutions when compared to the exact solver Gurobi.
- 29 March 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 316
Efficient algorithms for optimal path planning of unmanned aerial vehicles in complex three-dimensional environments
- 29 March 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 316
Efficient algorithms for optimal path planning of unmanned aerial vehicles in complex three-dimensional environments
- 7 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (12) , 19619-19632
An Adaptive Memetic Algorithm for a Cost-Optimal Electric Vehicle-Drone Routing Problem
This paper considers a fleet of electric vehicles and drones that deliver goods collaboratively. To determine the optimal routes of this electric vehicle-drone routing problem, the problem is formulated as a mixed-integer linear program to minimize the total operational costs. To solve the model, we develop an adaptive memetic algorithm that employs a multi-operator concept with a Q-learning-based selection mechanism and a set of local search operators for exploring the complex search space of the problem. Using extensive numerical experiments, we prove the effectiveness of our proposal and reveal some interesting managerial insights.
- 7 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (12) , 19619-19632
An Adaptive Memetic Algorithm for a Cost-Optimal Electric Vehicle-Drone Routing Problem
This paper considers a fleet of electric vehicles and drones that deliver goods collaboratively. To determine the optimal routes of this electric vehicle-drone routing problem, the problem is formulated as a mixed-integer linear program to minimize the total operational costs. To solve the model, we develop an adaptive memetic algorithm that employs a multi-operator concept with a Q-learning-based selection mechanism and a set of local search operators for exploring the complex search space of the problem. Using extensive numerical experiments, we prove the effectiveness of our proposal and reveal some interesting managerial insights.
- Open Access
- 27 April 2024
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 88
Multiple landscape measure-based approach for dynamic optimization problems
- 27 April 2024
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 88
Open AccessMultiple landscape measure-based approach for dynamic optimization problems
- 3 December 2023
- Published by Springer Nature
- p. 384-395
Large-Scale Swarm Control in Cluttered Environments
- 3 December 2023
- Published by Springer Nature
- p. 384-395
Large-Scale Swarm Control in Cluttered Environments