Petrica C. Pop

Orcid: 0000-0002-0626-9284

According to our database1, Petrica C. Pop authored at least 92 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Influence of context availability and soundness in predicting soil moisture using the Context-Aware Data Mining approach.
Log. J. IGPL, July, 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

On the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times.
Cybern. Syst., April, 2023

A Hybrid Based Genetic Algorithm for Solving the Clustered Generalized Traveling Salesman Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 18th International Conference, 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
Test Case Prioritization - ANT Algorithm With Faults Severity.
Log. J. IGPL, 2022

Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm.
Log. J. IGPL, 2022

Aspects on Image Edge Detection Based on Sensitive Swarm Intelligence.
Proceedings of the Hybrid Artificial Intelligent Systems - 17th International Conference, 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

Fuzzy Index Evaluating Image Edge Detection obtained with Ant Colony Optimization.
Proceedings of the IEEE International Conference on Fuzzy Systems, 2022

Forecasting the Number of Bugs and Vulnerabilities in Software Components Using Neural Network Models.
Proceedings of the International Joint Conference 15th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2022) 13th International Conference on EUropean Transnational Education (ICEUTE 2022), 2022

2021
Secure traveling salesman problem with intelligent transport systems features.
Log. J. IGPL, 2021

An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem.
IEEE Access, 2021

An Effective Hybrid Genetic Algorithm for Solving the Generalized Traveling Salesman Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 16th International Conference, 2021

A Comparative Study of the Most Important Methods for Forecasting the ICT Systems Vulnerabilities.
Proceedings of the 14th International Conference on Computational Intelligence in Security for Information Systems and 12th International Conference on European Transnational Educational (CISIS 2021 and ICEUTE 2021), 2021

2020
A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem.
Informatica, 2020

Economical connections between several European countries based on TSP data.
Log. J. IGPL, 2020

The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances.
Eur. J. Oper. Res., 2020

A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes.
Comput. Oper. Res., 2020

Context Quality Impact in Context-Aware Data Mining for Predicting Soil Moisture.
Cybern. Syst., 2020

Solving the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times by an Efficient Genetic Algorithm.
Proceedings of the 15th International Conference on Soft Computing Models in Industrial and Environmental Applications, 2020

How Noisy and Missing Context Influences Predictions in a Practical Context-Aware Data Mining System.
Proceedings of the 15th International Conference on Soft Computing Models in Industrial and Environmental Applications, 2020

A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Studying Heuristics Adaptation to a Specific Degree of Fuzziness.
Proceedings of the 29th IEEE International Conference on Fuzzy Systems, 2020

2019
Towards secure & green two-stage supply chain networks.
Log. J. IGPL, 2019

On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers.
IEEE Access, 2019

An Efficient Soft Computing Approach for Solving the Two-Stage Transportation Problem with Fixed Costs.
Proceedings of the 14th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2019), 2019

Context-Aware Data Mining vs Classical Data Mining: Case Study on Predicting Soil Moisture.
Proceedings of the 14th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2019), 2019

An efficient solution approach for solving the two-stage supply chain problem with fixed costs associated to the routes.
Proceedings of the 7th International Conference on Information Technology and Quantitative Management, 2019

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

An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 14th International Conference, 2019

Solving the Test Case Prioritization Problem with Secure Features Using Ant Colony System.
Proceedings of the International Joint Conference: 12th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2019) and 10th International Conference on EUropean Transnational Education (ICEUTE 2019), 2019

2018
A decomposition-based method for solving the clustered vehicle routing problem.
Log. J. IGPL, 2018

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

A novel two-level optimization approach for clustered vehicle routing problem.
Comput. Ind. Eng., 2018

Towards Secure Transportation Based on Intelligent Transport Systems. Novel Approach and Concepts.
Proceedings of the International Joint Conference SOCO'18-CISIS'18-ICEUTE'18, 2018

A Hybrid Iterated Local Search for Solving a Particular Two-Stage Fixed-Charge Transportation Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 13th International Conference, 2018

A two-level diploid genetic based algorithm for solving the family traveling salesman problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017
Feature Analysis to Human Activity Recognition.
Int. J. Comput. Commun. Control, 2017

The generalized traveling salesman problem solved with ant algorithms.
Complex Adapt. Syst. Model., 2017

A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 12th International Conference, 2017

Context-Aware Data Mining: Embedding External Data Sources in a Machine Learning Process.
Proceedings of the Hybrid Artificial Intelligent Systems - 12th International Conference, 2017

Similarities and sensitivity: Immune and ant algorithms applied towards robotics.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

2016
Design and comparison of two evolutionary approaches for automated product design.
Soft Comput., 2016

An improved hybrid ant-local search algorithm for the partition graph coloring problem.
J. Comput. Appl. Math., 2016

Denial jamming attacks on wireless sensor network using sensitive agents.
Log. J. IGPL, 2016

Towards a Secure Two-Stage Supply Chain Network: A Transportation-Cost Approach.
Proceedings of the International Joint Conference SOCO'16-CISIS'16-ICEUTE'16, 2016

An Innovative Approach to Manage Heterogeneous Information Using Relational Database Systems.
Proceedings of the Intelligent Systems Design and Applications, 2016

An Analysis of the Hardness of Novel TSP Iberian Instances.
Proceedings of the Hybrid Artificial Intelligent Systems - 11th International Conference, 2016

2015
An efficient Reverse Distribution System for solving sustainable supply chain network design problem.
J. Appl. Log., 2015

An improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem.
Neurocomputing, 2015

An improved hybrid algorithm for capacitated fixed-charge transportation problem.
Log. J. IGPL, 2015

A Novel Hybrid Algorithm for Solving the Clustered Vehicle Routing Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 10th International Conference, 2015

2014
On the complexity of the selective graph coloring problem in some special classes of graphs.
Theor. Comput. Sci., 2014

An Ant Algorithm for the Partition Graph Coloring Problem.
Proceedings of the Numerical Methods and Applications - 8th International Conference, 2014

A Variable Neighborhood Search Approach for Solving the Generalized Vehicle Routing Problem.
Proceedings of the Hybrid Artificial Intelligence Systems - 9th International Conference, 2014

On the resilience of an ant-based system in fuzzy environments. An empirical study.
Proceedings of the IEEE International Conference on Fuzzy Systems, 2014

A hybrid approach based on genetic algorithms for solving the Clustered Vehicle Routing Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014

Applying evolutionary computation for evolving ontologies.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014

2013
An improved hybrid algorithm for solving the generalized vehicle routing problem.
Neurocomputing, 2013

Optical character recognition in real environments using neural networks and k-nearest neighbor.
Appl. Intell., 2013

Sensitive Ants for Denial Jamming Attack on Wireless Sensor Network.
Proceedings of the International Joint Conference SOCO'13-CISIS'13-ICEUTE'13, 2013

A Genetic Algorithm Approach for the Multidimensional Two-Way Number Partitioning Problem.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Increasing the Antibandwidth of Sparse Matrices by a Genetic Algorithm.
Proceedings of the Recent Trends in Applied Artificial Intelligence, 2013

Application Possibilities of Hardware Implemented Hybrid Neural Networks to Support Independent Life of Elderly People.
Proceedings of the Hybrid Artificial Intelligent Systems - 8th International Conference, 2013

A Hybrid Genetic Algorithm with Variable Neighborhood Search Approach to the Number Partitioning Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 8th International Conference, 2013

A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2013, 2013

2012
Sensitive Ants in Solving the Generalized Vehicle Routing Problem
CoRR, 2012

Classical Hybrid Approaches on a Transportation Problem with Gas Emissions Constraints.
Proceedings of the Soft Computing Models in Industrial and Environmental Applications, 2012

Sensor Networks Security Based on Sensitive Robots Agents: A Conceptual Model.
Proceedings of the International Joint Conference CISIS'12-ICEUTE'12-SOCO'12 Special Sessions, 2012

Selective Graph Coloring in Some Special Classes of Graphs.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

A Robust Approach to Digit Recognition in Noisy Environments.
Proceedings of the Advanced Research in Applied Artificial Intelligence, 2012

A Genetic Programming Approach for Solving the Linear Ordering Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 7th International Conference, 2012

A Hybrid Classical Approach to a Fixed-Charged Transportation Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 7th International Conference, 2012

2011
Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem.
Int. J. Comput. Commun. Control, 2011

An Efficient Hybrid Soft Computing Approach to the Generalized Vehicle Routing Problem.
Proceedings of the Soft Computing Models in Industrial and Environmental Applications, 2011

An Improved Heuristic for the Bandwidth Minimization Based on Genetic Programming.
Proceedings of the Hybrid Artificial Intelligent Systems - 6th International Conference, 2011

A hybrid heuristic approach for solving the generalized traveling salesman problem.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

2010
A New Approach for Solving the Generalized Traveling Salesman Problem.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

A Genetic Algorithm for Solving the Generalized Vehicle Routing Problem.
Proceedings of the Hybrid Artificial Intelligence Systems, 5th International Conference, 2010

2008
A Sensitive Metaheuristic for Solving a Large Optimization Problem.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Some Communication Aspects in Extended Fibonacci Cubes.
Proceedings of the 2008 International Symposium on Applications and the Internet, 2008

A Hybrid Ant-Based System for Gate Assignment Problem.
Proceedings of the Hybrid Artificial Intelligence Systems, Third International Workshop, 2008

2007
On the prize-collecting generalized minimum spanning tree problem.
Ann. Oper. Res., 2007

A Bio-Inspired Approach for a Dynamic Railway Problem.
Proceedings of the Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2007

An Ant-Based Heuristic for the Railway Traveling Salesman Problem.
Proceedings of the Applications of Evolutinary Computing, 2007

Exact Algorithms for Generalized Combinatorial Optimization Problems.
Proceedings of the Combinatorial Optimization and Applications, 2007

2006
A new relaxation method for the generalized minimum spanning tree problem.
Eur. J. Oper. Res., 2006

2005
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2004
New Models of the Generalized Minimum Spanning Tree Problem.
J. Math. Model. Algorithms, 2004

The Railway Traveling Salesman Problem.
Proceedings of the Algorithmic Methods for Railway Optimization, 2004

2001
Relaxation methods for the Generalized Minimum Spanning Tree Problem.
Electron. Notes Discret. Math., 2001


  Loading...