Using Automation and Artificial Intelligence in the Management of European Social Fund Projects
Using Automation and Artificial Intelligence in the Management of European Social Fund Projects
Matei Oliviu, Laura Andreica, Faragău Tudor
Abstract. The management of European Social Fund (ESF) projects is characterized by complex reporting, monitoring and compliance requirements that place a heavy administrative burden on project teams. This paper investigates how automation and artificial intelligence can be employed to streamline the management of ESF projects. The proposed approach combines workflow automation for recurrent administrative tasks with AI-driven assistants that help with documentation, deadline tracking, risk identification and reporting consistency. A practical implementation is discussed, illustrating measurable reductions in administrative effort and improvements in the quality and timeliness of project deliverables.
Keywords: European Social Fund; project management; automation; artificial intelligence; digital transformation
📋 Cite this publication
Matei Oliviu, Laura Andreica, Faragău Tudor, "Using Automation and Artificial Intelligence in the Management of European Social Fund Projects", Proc. ProjMAN International Conference on Project Management, 2025, 2023.
Reference: Proc. ProjMAN International Conference on Project Management, 2025.
TPC Net: An Efficient CNN Architecture for Tomato Plant Disease and Pest Classification
TPC Net: An Efficient CNN Architecture for Tomato Plant Disease and Pest ClassificationOvidiu...
Enhancing API Security Testing against BOLA and Authentication Vulnerabilities through an LLM-Enhanced Framework
Enhancing API Security Testing against BOLA and Authentication Vulnerabilities through an...
A new vision of social behavior on genetic algorithm performance
A new vision of social behavior on genetic algorithm performanceAndreea Tatar, Nicolae Fat, Adrian...
A comparative study of different genetic algorithms approaches to capacitated vehicle routing problem for collection of agricultural products
A comparative study of different genetic algorithms approaches to capacitated vehicle routing...
Evaluation of Feature Selection Methods in Estimation of Precipitation Based on Deep Learning Artificial Neural Networks
Precipitation is the most important element of the water cycle and an indispensable element of water resources management. This paper aims to model the monthly precipitation in 8 precipitation observation stations. The effects and role of different feature weights pre-processing methods (Weight by deviation, Weight by PCA, Weight by correlation, and Weight by Support Vector Machine) on artificial intelligence modeling were investigated.
A Comparison of different crossover operators in genetic algorithms for clusters shortest-path tree problem
The clustered shortest-path tree (CluSPT) problem is an extension of the classical shortest path problem, given a graph with the nodes partitioned into several mutually exclusive and collectively exhaustive clusters looks for a shortest-path spanning tree from a predefined source node to all the other nodes of the graph, with the property that every cluster should generate a connected subgraph.
A comprehensive survey on the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an extension of the classical traveling salesman
problem (TSP), and it is among the most researched combinatorial optimization problems due to its theoretical properties, complexity aspects, and real-life applications in various areas: location-routing problems, material flow design problem, distribution of medical supplies, urban waste collection management, airport selection and routing the courier airplanes, image retrieval and ranking, digital garment manufacturing, etc.
A hybrid based genetic algorithm for solving the clustered generalized traveling salesman problem
We study the clustered generalized traveling salesman problem (CGTSP), which is an extension of the generalized traveling salesman problem (GTSP), which in turn generalizes the well-known traveling salesman problem (TSP).
0 Comments