Adrian Petrovan

16 papers B 2Misc 2Journal 3Unranked 9
YearRankTypeTitle / Venue / Authors
2025 — conf
A Comparative Analysis of the Algorithm Results for Designing Two-Stage Supply Chains with Fixed Costs.
OLA
Corina Pop Sitar, Petrica C. Pop, Adrian Petrovan
2025 B conf
A Prüfer-based genetic algorithm for solving a non-linear multi-objective fixed-charge transportation problem.
SMC
Cristian Pop, Petrica C. Pop, Adrian Petrovan
2025 — conf
An Adaptive Memetic Algorithm for Solving the Multiple Knapsack Assignment Problem.
HAIS (2)
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo
2025 B conf
An Improved Pareto Front for the Non-Linear Multi-Objective Fixed Cost Transportation Problem.
CEC
Cristian Pop, Petrica C. Pop, Adrian Petrovan
2025 J jnl
An improved diploid memetic algorithm for solving the multidimensional multi-way number partitioning problem.
Expert Syst. Appl.
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo
2024 — conf
A Comparative Study of Different Genetic Algorithms Approaches to Capacitated Vehicle Routing Problem for Collection of Agricultural Products.
SOCO (2)
Cosmin Sabo, Natanael Balogh, Petrica C. Pop, Adrian Petrovan
2024 — conf
A New Vision of Social Behavior on Genetic Algorithm Performance.
SOCO (2)
Andreea Tatar, Nicolae Fat, Adrian Petrovan, Oliviu Matei
2024 — conf
Diversity Population Metrics in Diploid and Haploid Genetic Algorithm Variants.
HAIS (1)
Adrian Petrovan, Oliviu Matei, Petrica C. Pop, Cosmin Sabo
2024 — conf
On the Design of Diploid Memetic Algorithms for Solving the Multidimensional Multi-way Number Partitioning Problem.
PPSN (1)
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo
2024 — conf
Solving the Clustered Minimum Routing Tree Problem Using Prüfer-Coding Based Hybrid Genetic Algorithms.
HAIS (1)
Cosmin Sabo, Bogdan Teglas, Petrica C. Pop, Adrian Petrovan
2023 — conf
A Diploid Genetic Algorithm for Solving the Multidimensional Multi-way Number Partitioning Problem.
GECCO Companion
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Oliviu Matei
2023 J jnl
Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem.
Expert Syst. Appl.
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Ioana Zelina
2022 Misc conf
A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code.
HAIS
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Ioana Zelina
2020 — conf
A Behavioural Study of the Crossover Operator in Diploid Genetic Algorithms.
SOCO
Adrian Petrovan, Oliviu Matei, Rudolf Erdei
2019 Misc conf
Haploid Versus Diploid Genetic Algorithms. A Comparative Study.
HAIS
Adrian Petrovan, Petrica Pop Sitar, Oliviu Matei
2018 J jnl
A two-level solution approach for solving the generalized minimum spanning tree problem.
Eur. J. Oper. Res.
Petrica C. Pop, Oliviu Matei, Cosmin Sabo, Adrian Petrovan