Ana Dolores López Sánchez
Profesora Titular de Universidad
Research Interests
Make your next move.
Prepare your application
Review drafts before you send them.
Explore related searches
Articles (10)
Year:
2026
The ‐median problem has been widely studied in the literature. However, there are several variants that include new constraints to the classical problem that make it more realistic. In this work, we study the variant that considers interconnected facilities, that is, the distances between each pair of facilities are less than or equal to a certain threshold . This optimization problem, usually known as the median location problem with interconnected facilities, consists of locating a set of interconnected facilities to minimize the distance between those interconnected facilities and the demand points. The large variety of real‐world applications that fit into this model makes it attractive to design an algorithm able to solve the problem efficiently. To this end, a procedure based on the variable neighborhood search methodology is designed and implemented by using problem‐dependent neighborhoods. Experimental results show that our proposal is able to reach most of the optimal solutions when they are known. Additionally, it outperforms previous state‐of‐the‐art methods in those instances where the optima are unknown. These results are further confirmed by conducting nonparametrical statistical tests.
Year:
2025
Year:
2025
Year:
2025
Year:
2025
This case study tackles a real-world problem of a transportation company that is modeled as a scheduling optimization problem. The main goal of the considered problem is to schedule the maximum number of jobs that must be performed by vehicles over a specific planning horizon in order to minimize the total operational costs. Here, each customer request corresponds to a job composed of multiple operations, such as loading, unloading, and mandatory jobs, each associated with a specific location and time window. Once a job is allocated to a vehicle, all its operations must be executed by that same vehicle within their designated time constraints. Due to the imposed limitations, not every job can feasibly be scheduled. To address this challenge, two distinct methodologies are proposed. The first, a Holistic approach, solves the entire problem formulation using a black-box optimizer, serving as a comprehensive benchmark. The second, a Divide-and-Conquer approach, combines a heuristic greedy algorithm with a binary linear programming, decomposing the problem into sequential subproblems. Both approaches are implemented using the solver Hexaly. A comparative analysis is conducted under different scenarios and problem settings to highlight the advantages and drawbacks of each approach. The results show that the Divide-and-Conquer approach significantly improves computational efficiency, reducing time by up to 99% and vehicle usage by around 15–20% compared to the Holistic method. On the other hand, the Holistic method better ensures that mandatory jobs are completed, although at the cost of more resources.
Year:
2025
We propose a reference framework to apply the multiparent path relinking (MPR) methodology. MPR is an extension of path relinking (PR) that has been proposed and described but, to the best of our knowledge, it has never been applied. PR is a trajectory-based neighborhood search strategy that explores paths that traverse pairs of solutions. PR has been widely used for search intensification purposes within metaheuristic implementations. To show how MPR can be embedded in more than one setting, our proposal consists of both employing MPR as a post-processing step in a greedy randomized adaptive search procedure (GRASP) and as the combination method in a scatter search (SS). We use the power dominating set problem (PDSP) as our testing platform because its difficulty and structure enable the design and assessment of various strategies. The PDSP seeks to find the minimum placement of measurement devices in an electrical network to monitor the entire system. Our computational experiments are designed to identify the contribution of each element of our proposed MRP implementations.
Year:
2025
Year:
2025
Year:
2023
Year:
2023
Collaborators (9)
ISAAC LOZANO-OSORIO
Assistant Professor
Universidad Rey Juan Carlos
Rafael Marti
Professor
University of Valencia
Raúl Martín Santamaría
Universidad Rey Juan Carlos
ALFREDO G. Hernández-Díaz
Universidad Pablo de Olavide
Jesús Sánchez-Oro Calvo
Profesor Titular de Universidad
Universidad Rey Juan Carlos
Angel A. Juan
Full Professor
Universitat Politècnica de València
Sergio Bermudo Navarrete
Catedrático de Universidad
Universidad Pablo de Olavide
Sergio Pérez-Peló
Assistant Professor
Universidad Rey Juan Carlos
Abraham DUARTE
Universidad Rey Juan Carlos
Make your next move.
Prepare your application
Review drafts before you send them.