Adrian Petrovan

Orcid: 0000-0001-6877-027X

According to our database1, Adrian Petrovan authored at least 9 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Design of Diploid Memetic Algorithms for Solving the Multidimensional Multi-way Number Partitioning Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

Solving the Clustered Minimum Routing Tree Problem Using Prüfer-Coding Based Hybrid Genetic Algorithms.
Proceedings of the Hybrid Artificial Intelligent Systems - 19th International Conference, 2024

Diversity Population Metrics in Diploid and Haploid Genetic Algorithm Variants.
Proceedings of the Hybrid Artificial Intelligent Systems - 19th International Conference, 2024

2023
Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem.
Expert Syst. Appl., April, 2023

A Diploid Genetic Algorithm for Solving the Multidimensional Multi-way Number Partitioning Problem.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

2022
A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code.
Proceedings of the Hybrid Artificial Intelligent Systems - 17th International Conference, 2022

2020
A Behavioural Study of the Crossover Operator in Diploid Genetic Algorithms.
Proceedings of the 15th International Conference on Soft Computing Models in Industrial and Environmental Applications, 2020

2019
Haploid Versus Diploid Genetic Algorithms. A Comparative Study.
Proceedings of the Hybrid Artificial Intelligent Systems - 14th International Conference, 2019

2018
A two-level solution approach for solving the generalized minimum spanning tree problem.
Eur. J. Oper. Res., 2018


  Loading...