VLDB 2026 Research / reviewers in the wild / expert
Víctor Pérez-Piqueras
dblp:331/4516
· DBLP profile ↗
4ranked-venue papers
4as first author
4since 2021 · last 2026
0000-0002-2305-5755ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Intelligent support for agile release planning: an empirical evaluation of ProjectIONabstractAbstract The increasing complexity of software development has prompted a shift in project management practices toward agile methodologies, often supported by specialized software tools for planning and reporting. However, many widely adopted tools offer only limited decision support capabilities. This work introduces ProjectION, an intelligent software tool designed to enhance decision-making in agile project management through techniques relative to the Search-Based Software Engineering field. Based on an in-depth analysis of the challenges faced in agile environments, ProjectION assists decision makers in monitoring project status, forecasting progress, and automating software release planning. A comprehensive usability study was conducted with a small sample of experienced IT professionals, following the ISO/IEC 25062:2006 Common Industry Format. Key usability metrics of effectiveness, efficiency, and user satisfaction were assessed. Despite minor usability issues, results indicate that ProjectION effectively supports agile release planning. A second experiment further demonstrates the tool’s utility in generating optimal release plans, outperforming manual solutions proposed by decision makers. To foster collaboration and future development, the core algorithms and execution service have been made publicly available, enabling integration of novel approaches to the Next Release Problem. Víctor Pérez-Piqueras, Pablo Bermejo 0001, José A. Gámez 0001 |
Autom. Softw. Eng. | 1 |
| 2025 | Agile Effort Estimation Improved by Feature Selection and Model ExplainabilityabstractAgile methodologies are widely adopted in the industry, with iterative development being a common practice. However, this approach introduces certain risks in controlling and managing the planned scope for delivery at the end of each iteration. Previous studies have proposed machine learning methods to predict the likelihood of meeting this committed scope, using models trained on features extracted from prior iterations and their associated tasks. A crucial aspect of any predictive model is user trust, which depends on the model’s explainability. However, an excessive number of features can complicate interpretation. In this work, we propose feature subset selection methods to reduce the number of features without compromising model performance.To ensure interpretability, we leverage state-of-the-art explainability techniques to analyze the key features driving model predictions. Our evaluation, conducted on five large open-source projects from prior studies, demonstrates successful feature subset selection, reducing the feature set to 10% of its original size without any loss in predictive performance. Using explainability tools, we provide a synthesis of the features with the most significant impact on iteration performance predictions across agile projects. Víctor Pérez-Piqueras, Pablo Bermejo 0001, José A. Gámez 0001 |
ENASE | 1 |
| 2023 | Hybrid Multi-Objective Relinked GRASP for the constrained Next Release ProblemabstractRelease planning is a critical step in the development of a software product, and it involves many factors. Deciding what to build for the next software release requires taking into account not only the cost of building a subset of software features, but also the expected satisfaction of the clients, as well as the dependencies that the features might have among them. This problem, called Next Release Problem, can be difficult to tackle by expert judge, or even intractable if the number of requirements, dependencies and clients to consider is very large. In the literature, this problem has been approached from the so-called search-based software engineering field, introducing a variety of metaheuristic algorithms to obtain a subset of release proposals that simultaneously optimise both cost and satisfaction. In this work, we present a GRASP-based advanced method, and evaluate it against other families of algorithms commonly applied to this problem, using two public and four synthetic datasets for the evaluation. Results show that solutions obtained by our proposal are superior to those of other algorithms in terms of quality indicators and speed of execution. Algorithms, datasets and evaluation framework have been made available to the research community. Víctor Pérez-Piqueras, Pablo Bermejo 0001, José A. Gámez 0001 |
TrustCom | 1 |
| 2023 | FEDA-NRP: A fixed-structure multivariate estimation of distribution algorithm to solve the multi-objective Next Release Problem with requirements interactionsabstractIn the development of a software product, the Next Release Problem is the selection of the most appropriate subset of requirements (tasks) to include in the next release of the product, such that the selected subset maximises the overall satisfaction of the stakeholders and minimises the total cost. Furthermore, in most cases, requirements or tasks cannot be developed independently, as there are dependencies between them, which must be respected in the selection for the next release. In this paper, we approach the Next Release Problem as a constrained bi-objective optimisation problem. The main contribution is the design of an Estimation of Distribution Algorithm that exploits domain knowledge, i.e. the dependencies between the requirements, to define the structure of a Bayesian network that models the relationships between the binary variables (requirements) to be optimised. The use of a Bayesian network with a fixed structure reduces the complexity of the search process, since it is unnecessary to learn the structure at each iteration of the algorithm. Moreover, it ensures that the sampled individuals are always valid with respect to the required dependencies. The second main contribution is the generation of a corpus of synthetic datasets with cost estimations derived from agile and classic management methodologies. Standard multi-objective metrics are computed in order to assess our proposal and compare it with other evolutionary multi-criterion optimisation algorithms, determining that it is the optimal choice when dealing with complex datasets. Víctor Pérez-Piqueras, Pablo Bermejo 0001, José A. Gámez 0001 |
Eng. Appl. Artif. Intell. | 1 |