Adrian Pop

Dr. Adrian Pop

Linköping University
+1
orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2020 in Modeling, Identification and Control: A Norwegian Research Bulletin
Verified
Journal Article
Closed access
PDF file
PFPeter Fritzson
Peter Fritzson
Adrian PopAdrian Pop
Adrian Pop
KAKarim Abdelhak
Karim Abdelhak
AAAdeel Ashgar
Adeel Ashgar
BBBernhard Bachmann
Bernhard Bachmann
PÖPer Östlund
Per Östlund

2 November 2022 in Processes
Verified
Journal Article
Open access
PDF file
Abdelazim HussienAbdelazim Hussien
Abdelazim Hussien
FHFatma A. Hashim
Fatma A. Hashim
Raneem QaddouraRaneem Qaddoura
Raneem Qaddoura
Laith AbualigahLaith Abualigah
Laith Abualigah
Adrian PopAdrian Pop
Adrian Pop
Water-cycle algorithm based on evaporation rate (ErWCA) is a powerful enhanced version of the water-cycle algorithm (WCA) metaheuristics algorithm. ErWCA, like other algorithms, may still fall in the sub-optimal region and have a slow convergence, especially in high-dimensional tasks problems. This paper suggests an enhanced ErWCA (EErWCA) version, which embeds local escaping operator (LEO) as an internal operator in the updating process. ErWCA also uses a control-randomization operator. To verify this version, a comparison between EErWCA and other algorithms, namely, classical ErWCA, water cycle algorithm (WCA), butterfly optimization algorithm (BOA), bird swarm algorithm (BSA), crow search algorithm (CSA), grasshopper optimization algorithm (GOA), Harris Hawks Optimization (HHO), whale optimization algorithm (WOA), dandelion optimizer (DO) and fire hawks optimization (FHO) using IEEE CEC 2017, was performed. The experimental and analytical results show the adequate performance of the proposed algorithm.

1 February 2019
Verified
Conference Paper
Closed access
PDF file
LOLennart Ochel
Lennart Ochel
RBRobert Braun
Robert Braun
BTBernhard Thiele
Bernhard Thiele
AAAdeel Asghar
Adeel Asghar
LBLena Buffoni
Lena Buffoni
MSMartin Sjölund
Martin Sjölund
Here is information on how to publish, spread your research, and search for your publications. Most of LiU's research publications are directly imported into DiVA from the Web of Science. Before registering a publication, always check if the publication is already in DiVA!

22 June 2024 in Cluster Computing
Verified
Journal Article
Open access
PDF file
Abdelazim HussienAbdelazim Hussien
Abdelazim Hussien
Amit ChhabraAmit Chhabra
Amit Chhabra
FHFatma A. Hashim
Fatma A. Hashim
Adrian PopAdrian Pop
Adrian Pop
Cloud computing has revolutionized the way a variety of ubiquitous computing resources are provided to users with ease and on a pay-per-usage basis. Task scheduling problem is an important challenge, which involves assigning resources to users’ Bag-of-Tasks applications in a way that maximizes either system provider or user performance or both. With the increase in system size and the number of applications, the Bag-of-Tasks scheduling (BoTS) problem becomes more complex due to the expansion of search space. Such a problem falls in the category of NP-hard optimization challenges, which are often effectively tackled by metaheuristics. However, standalone metaheuristics generally suffer from certain deficiencies which affect their searching efficiency resulting in deteriorated final performance. This paper aims to introduce an optimal hybrid metaheuristic algorithm by leveraging the strengths of both the Artificial Gorilla Troops Optimizer (GTO) and the Honey Badger Algorithm (HBA) to find an approximate scheduling solution for the BoTS problem. While the original GTO has demonstrated effectiveness since its inception, it possesses limitations, particularly in addressing composite and high-dimensional problems. To address these limitations, this paper proposes a novel approach by introducing a new updating equation inspired by the HBA, specifically designed to enhance the exploitation phase of the algorithm. Through this integration, the goal is to overcome the drawbacks of the GTO and improve its performance in solving complex optimization problems. The initial performance of the GTOHBA algorithm tested on standard CEC2017 and CEC2022 benchmarks shows significant performance improvement over the baseline metaheuristics. Later on, we applied the proposed GTOHBA on the BoTS problem using standard parallel workloads (CEA-Curie and HPC2N) to optimize makespan and energy objectives. The obtained outcomes of the proposed GTOHBA are compared to the scheduling techniques based on well-known metaheuristics under the same experimental conditions using standard statistical measures and box plots. In the case of CEA-Curie workloads, the GTOHBA produced makespan and energy consumption reduction in the range of 8.12–22.76% and 6.2–18.00%, respectively over the compared metaheuristics. Whereas for the HPC2N workloads, GTOHBA achieved 8.46–30.97% makespan reduction and 8.51–33.41% energy consumption reduction against the tested metaheuristics. In conclusion, the proposed hybrid metaheuristic algorithm provides a promising solution to the BoTS problem, that can enhance the performance and efficiency of cloud computing systems.

20 April 2021 in Electronics
Verified
Journal Article
Open access
PDF file
AMAlachew Mengist
Alachew Mengist
Lena BuffoniLena Buffoni
Lena Buffoni
Adrian PopAdrian Pop
Adrian Pop
In the field of model-based design of Cyber–Physical Systems (CPS), seamless traceability of the process, from requirements to models to simulation results, is becoming increasingly important. It can be used to support several activities such as variant handling, impact analysis, component reuse, software maintenance and evolution, verification, and validation. Despite the fact that the relevance of traceability in the model-based design of CPSs is well known, current tools that support traceability management are inadequate in practice. The lack of comprehensive whole-lifecycle systems engineering support in a single tool is one of the main causes of such ineffective traceability management, where traceability relationships between artifacts are still manually generated and maintained. This paper aims at presenting an approach and a prototype for automatically generating and maintaining the appropriate traceability links between heterogeneous artifacts ranging from requirement models, through design models, down to simulation and verification results throughout the product life cycle in model-based design of CPSs. A use case study is presented to validate and illustrate the proposed method and prototype.

1 February 2019
Verified
Conference Paper
Open access
PDF file
Adrian PopAdrian Pop
Adrian Pop
PÖPer Östlund
Per Östlund
FCFrancesco Casella
Francesco Casella
Martin SjölundMartin Sjölund
Martin Sjölund
RFRüdiger Franke
Rüdiger Franke
Here is information on how to publish, spread your research, and search for your publications. Most of LiU's research publications are directly imported into DiVA from the Web of Science. Before registering a publication, always check if the publication is already in DiVA!