Petrica C. Pop

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 51

Top Topics

Genetic Algorithm

Vehicle Routing Problem

Transportation Problem

Traveling Salesman Problem

Top Venues

Publications

Petrica C. Pop, Ovidiu Cosma, Cosmin Sabo, Corina Pop Sitar
A comprehensive survey on the generalized traveling salesman problem. Eur. J. Oper. Res. 314 (3) (2024)
Anca Avram, Oliviu Matei, Camelia-Mihaela Pintea, Petrica C. Pop
Influence of context availability and soundness in predicting soil moisture using the Context-Aware Data Mining approach. Log. J. IGPL 31 (4) (2023)
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Oliviu Matei
A Diploid Genetic Algorithm for Solving the Multidimensional Multi-way Number Partitioning Problem. GECCO Companion (2023)
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Ioana Zelina
Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem. Expert Syst. Appl. 215 (2023)
Ovidiu Cosma, Petrica C. Pop, Laura Cosma
A Hybrid Based Genetic Algorithm for Solving the Clustered Generalized Traveling Salesman Problem. HAIS (2023)
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
On the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times. Cybern. Syst. 54 (3) (2023)
Cristina Ticala, Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Oliviu Matei, Mara Hajdu-Macelaru, Petrica C. Pop
Aspects on Image Edge Detection Based on Sensitive Swarm Intelligence. HAIS (2022)
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo, Laura Cosma
Forecasting the Number of Bugs and Vulnerabilities in Software Components Using Neural Network Models. CISIS-ICEUTE (2022)
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm. Log. J. IGPL 30 (4) (2022)
Andreea Vescan, Camelia-Mihaela Pintea, Petrica C. Pop
Test Case Prioritization - ANT Algorithm With Faults Severity. Log. J. IGPL 30 (2) (2022)
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Ioana Zelina
A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code. HAIS (2022)
Cristina Ticala, Camelia-Mihaela Pintea, Simone A. Ludwig, Mara Hajdu-Macelaru, Oliviu Matei, Petrica C. Pop
Fuzzy Index Evaluating Image Edge Detection obtained with Ant Colony Optimization. FUZZ-IEEE (2022)
Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Anisoara Calinescu, Corina Pop Sitar, Petrica C. Pop
Secure traveling salesman problem with intelligent transport systems features. Log. J. IGPL 29 (6) (2021)
Ovidiu Cosma, Mara Macelaru, Petrica C. Pop, Cosmin Sabo, Ioana Zelina
A Comparative Study of the Most Important Methods for Forecasting the ICT Systems Vulnerabilities. CISIS-ICEUTE (2021)
Ovidiu Cosma, Petrica C. Pop, Ioana Zelina
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem. IEEE Access 9 (2021)
Ovidiu Cosma, Petrica C. Pop, Laura Cosma
An Effective Hybrid Genetic Algorithm for Solving the Generalized Traveling Salesman Problem. HAIS (2021)
Petrica C. Pop
The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances. Eur. J. Oper. Res. 283 (1) (2020)
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
Solving the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times by an Efficient Genetic Algorithm. SOCO (2020)
Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop
Studying Heuristics Adaptation to a Specific Degree of Fuzziness. FUZZ-IEEE (2020)
Ovidiu Cosma, Petrica C. Pop, Daniela Danciulescu
A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem. Informatica 31 (4) (2020)
Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop, Oliviu Matei
Economical connections between several European countries based on TSP data. Log. J. IGPL 28 (1) (2020)
Anca Avram, Oliviu Matei, Camelia-Mihaela Pintea, Petrica C. Pop, Carmen Ana Anton
How Noisy and Missing Context Influences Predictions in a Practical Context-Aware Data Mining System. SOCO (2020)
Anca Avram, Oliviu Matei, Camelia-Mihaela Pintea, Petrica C. Pop
Context Quality Impact in Context-Aware Data Mining for Predicting Soil Moisture. Cybern. Syst. 51 (7) (2020)
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes. SOFSEM (2020)
Ovidiu Cosma, Petrica C. Pop, Daniela Danciulescu
A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes. Comput. Oper. Res. 118 (2020)
Anca Avram, Oliviu Matei, Camelia-Mihaela Pintea, Petrica C. Pop, Carmen Ana Anton
Context-Aware Data Mining vs Classical Data Mining: Case Study on Predicting Soil Moisture. SOCO (2019)
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem. HAIS (2019)
Andreea Vescan, Camelia-Mihaela Pintea, Petrica C. Pop
Solving the Test Case Prioritization Problem with Secure Features Using Ant Colony System. CISIS-ICEUTE (2019)
Ovidiu Cosma, Petrica C. Pop, Ioana Zelina
An Efficient Soft Computing Approach for Solving the Two-Stage Transportation Problem with Fixed Costs. SOCO (2019)
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
An efficient solution approach for solving the two-stage supply chain problem with fixed costs associated to the routes. ITQM (2019)
Ovidiu Cosma, Daniela Danciulescu, Petrica C. Pop
On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers. IEEE Access 7 (2019)
Camelia-Mihaela Pintea, Anisoara Calinescu, Corina Pop Sitar, Petrica C. Pop
Towards secure & green two-stage supply chain networks. Log. J. IGPL 27 (2) (2019)
Ovidiu Cosma, Petrica C. Pop, Oliviu Matei, Ioana Zelina
A Hybrid Iterated Local Search for Solving a Particular Two-Stage Fixed-Charge Transportation Problem. HAIS (2018)
Andrei Horvat Marc, Levente Fuksz, Petrica C. Pop, Daniela Danciulescu
A decomposition-based method for solving the clustered vehicle routing problem. Log. J. IGPL 26 (1) (2018)
Petrica C. Pop, Oliviu Matei, Cosmin Sabo, Adrian Petrovan
A two-level solution approach for solving the generalized minimum spanning tree problem. Eur. J. Oper. Res. 265 (2) (2018)
Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Petrica C. Pop
Towards Secure Transportation Based on Intelligent Transport Systems. Novel Approach and Concepts. SOCO-CISIS-ICEUTE (2018)
Petrica C. Pop, Oliviu Matei, Camelia-Mihaela Pintea
A two-level diploid genetic based algorithm for solving the family traveling salesman problem. GECCO (2018)
Petrica C. Pop, Levente Fuksz, Andrei Horvat Marc, Cosmin Sabo
A novel two-level optimization approach for clustered vehicle routing problem. Comput. Ind. Eng. 115 (2018)
Petrica C. Pop, Oliviu Matei, Cosmin Sabo
A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem. HAIS (2017)
Camelia-Mihaela Pintea, Petrica C. Pop, Camelia Chira
The generalized traveling salesman problem solved with ant algorithms. Complex Adapt. Syst. Model. 5 (2017)
Camelia-Mihaela Pintea, Simone A. Ludwig, Petrica C. Pop, Oliviu Matei
Similarities and sensitivity: Immune and ant algorithms applied towards robotics. CEC (2017)
Camelia-Mihaela Pintea, Petrica C. Pop, Ioana Zelina
Denial jamming attacks on wireless sensor network using sensitive agents. Log. J. IGPL 24 (1) (2016)
Cosmin Sabo, Petrica C. Pop, Honoriu Valean, Daniela Danciulescu
An Innovative Approach to Manage Heterogeneous Information Using Relational Database Systems. ISDA (2016)
Camelia-Mihaela Pintea, Anisoara Calinescu, Petrica C. Pop, Cosmin Sabo
Towards a Secure Two-Stage Supply Chain Network: A Transportation-Cost Approach. SOCO-CISIS-ICEUTE (2016)
Stefka Fidanova, Petrica C. Pop
An improved hybrid ant-local search algorithm for the partition graph coloring problem. J. Comput. Appl. Math. 293 (2016)
Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop, Oliviu Matei
An Analysis of the Hardness of Novel TSP Iberian Instances. HAIS (2016)
Oliviu Matei, Diana Contras, Petrica C. Pop, Honoriu Valean
Design and comparison of two evolutionary approaches for automated product design. Soft Comput. 20 (11) (2016)
Andrei Horvat Marc, Levente Fuksz, Petrica C. Pop, Daniela Danciulescu
A Novel Hybrid Algorithm for Solving the Clustered Vehicle Routing Problem. HAIS (2015)
Oliviu Matei, Petrica C. Pop, Jozsef Laszlo Sas, Camelia Chira
An improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem. Neurocomputing 150 (2015)
Camelia-Mihaela Pintea, Petrica C. Pop
An improved hybrid algorithm for capacitated fixed-charge transportation problem. Log. J. IGPL 23 (3) (2015)
Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar, Mara Hajdu-Macelaru
An efficient Reverse Distribution System for solving sustainable supply chain network design problem. J. Appl. Log. 13 (2) (2015)
Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop
On the resilience of an ant-based system in fuzzy environments. An empirical study. FUZZ-IEEE (2014)
Petrica C. Pop, Levente Fuksz, Andrei Horvat Marc
A Variable Neighborhood Search Approach for Solving the Generalized Vehicle Routing Problem. HAIS (2014)
Petrica C. Pop, Camelia Chira
A hybrid approach based on genetic algorithms for solving the Clustered Vehicle Routing Problem. IEEE Congress on Evolutionary Computation (2014)
Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
On the complexity of the selective graph coloring problem in some special classes of graphs. Theor. Comput. Sci. 540 (2014)
Stefka Fidanova, Petrica C. Pop
An Ant Algorithm for the Partition Graph Coloring Problem. NMA (2014)
Oliviu Matei, Diana Contras, Petrica C. Pop
Applying evolutionary computation for evolving ontologies. IEEE Congress on Evolutionary Computation (2014)
Camelia-Mihaela Pintea, Petrica C. Pop
Sensitive Ants for Denial Jamming Attack on Wireless Sensor Network. CoRR (2013)
Levente Fuksz, Petrica C. Pop
A Hybrid Genetic Algorithm with Variable Neighborhood Search Approach to the Number Partitioning Problem. HAIS (2013)
Petrica C. Pop, Oliviu Matei
A Genetic Algorithm Approach for the Multidimensional Two-Way Number Partitioning Problem. LION (2013)
Camelia-Mihaela Pintea, Petrica C. Pop, Camelia Chira
The Generalized Traveling Salesman Problem solved with Ant Algorithms. CoRR (2013)
Petrica C. Pop, Bin Hu, Günther R. Raidl
A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem. EUROCAST (1) (2013)
Camelia-Mihaela Pintea, Petrica C. Pop
Sensitive Ants for Denial Jamming Attack on Wireless Sensor Network. SOCO-CISIS-ICEUTE (2013)
Petrica C. Pop, Oliviu Matei, Corina Pop Sitar
An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109 (2013)
Petrica C. Pop, Oliviu Matei
Increasing the Antibandwidth of Sparse Matrices by a Genetic Algorithm. IEA/AIE (2013)
Oliviu Matei, Petrica C. Pop, Honoriu Valean
Optical character recognition in real environments using neural networks and k-nearest neighbor. Appl. Intell. 39 (4) (2013)
Camelia-Mihaela Pintea, Petrica C. Pop, Mara Hajdu-Macelaru
Classical hybrid approaches on a transportation problem with gas emissions constraints CoRR (2012)
Camelia-Mihaela Pintea, Petrica C. Pop
Sensor networks security based on sensitive robots agents. A conceptual model CoRR (2012)
Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
Selective Graph Coloring in Some Special Classes of Graphs. ISCO (2012)
Camelia-Mihaela Pintea, Petrica C. Pop, Mara Hajdu-Macelaru
Classical Hybrid Approaches on a Transportation Problem with Gas Emissions Constraints. SOCO (2012)
Camelia-Mihaela Pintea, Camelia Chira, D. Dumitrescu, Petrica C. Pop
Sensitive Ants in Solving the Generalized Vehicle Routing Problem CoRR (2012)
Camelia-Mihaela Pintea, Corina Pop Sitar, Mara Hajdu-Macelaru, Petrica C. Pop
A Hybrid Classical Approach to a Fixed-Charged Transportation Problem. HAIS (1) (2012)
Camelia-Mihaela Pintea, Petrica C. Pop
Sensor Networks Security Based on Sensitive Robots Agents: A Conceptual Model. CISIS/ICEUTE/SOCO Special Sessions (2012)
Petrica C. Pop, Oliviu Matei
A Genetic Programming Approach for Solving the Linear Ordering Problem. HAIS (2) (2012)
Oliviu Matei, Petrica C. Pop, Honoriu Valean
A Robust Approach to Digit Recognition in Noisy Environments. IEA/AIE (2012)
Petrica C. Pop, Oliviu Matei, Honoriu Valean
An Efficient Hybrid Soft Computing Approach to the Generalized Vehicle Routing Problem. SOCO (2011)
Petrica C. Pop, Ioana Zelina, Vasile Lupse, Corina Pop Sitar, Camelia Chira
Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem. Int. J. Comput. Commun. Control 6 (1) (2011)
Petrica C. Pop, Oliviu Matei
An Improved Heuristic for the Bandwidth Minimization Based on Genetic Programming. HAIS (2) (2011)
Petrica C. Pop, Serban Iordache
A hybrid heuristic approach for solving the generalized traveling salesman problem. GECCO (2011)
Petrica C. Pop, Oliviu Matei, Cosmin Sabo
A New Approach for Solving the Generalized Traveling Salesman Problem. Hybrid Metaheuristics (2010)
Petrica C. Pop, Oliviu Matei, Corina Pop Sitar, Camelia Chira
A Genetic Algorithm for Solving the Generalized Vehicle Routing Problem. HAIS (2) (2010)
Camelia-Mihaela Pintea, Camelia Chira, D. Dumitrescu, Petrica C. Pop
A Sensitive Metaheuristic for Solving a Large Optimization Problem. SOFSEM (2008)
Camelia-Mihaela Pintea, Petrica C. Pop, Camelia Chira, Dumitru Dumitrescu
A Hybrid Ant-Based System for Gate Assignment Problem. HAIS (2008)
Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar, Dumitru Dumitrescu
A Bio-Inspired Approach for a Dynamic Railway Problem. SYNASC (2007)
Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar
An Ant-Based Heuristic for the Railway Traveling Salesman Problem. EvoWorkshops (2007)
Petrica C. Pop, Corina Pop Sitar, Ioana Zelina, Ioana Tascu
Exact Algorithms for Generalized Combinatorial Optimization Problems. COCOA (2007)
Petrica C. Pop
On the prize-collecting generalized minimum spanning tree problem. Ann. Oper. Res. 150 (1) (2007)
Petrica C. Pop, Walter Kern, Georg Still
A new relaxation method for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 170 (3) (2006)
Petrica C. Pop, Georg Still, Walter Kern
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size. ACiD (2005)
Petrica C. Pop
New Models of the Generalized Minimum Spanning Tree Problem. J. Math. Model. Algorithms 3 (2) (2004)
Georgia Hadjicharalambous, Petrica C. Pop, Evangelia Pyrga, George Tsaggouris, Christos D. Zaroliagis
The Railway Traveling Salesman Problem. ATMOS (2004)
Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle
Relaxation methods for the Generalized Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 8 (2001)