José Ángel Iranzo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
José Ángel Iranzo has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Herminia I. Calvete
Departamento de Métodos Estadísticos, Instituto Universitario de Investigación en Matemáticas y Aplicaciones (IUMA), Universidad de Zaragoza, Zaragoza, Spain
22 shared publications - Carmen Galé
Departamento de Métodos Estadísticos, Instituto Universitario de Investigación en Matemáticas y Aplicaciones (IUMA), Universidad de Zaragoza, Zaragoza, Spain
19 shared publications - Aitor Hernández
Universidad de Zaragoza
6 shared publications Herminia I. Calvete
3 shared publicationsCarmen Galé
2 shared publicationsLourdes Del-Pozo
2 shared publications
Latest Publications
- Open Access
- 16 October 2026
- Published by Springer Nature in 4OR
- p. 1-4
Correction: An exact and computationally efficient algorithm for balanced customer clustering under relocation constraints
- 16 October 2026
- Published by Springer Nature in 4OR
- p. 1-4
Open AccessCorrection: An exact and computationally efficient algorithm for balanced customer clustering under relocation constraints
- Open Access
- 22 September 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 196
A high-performance hybrid metaheuristic for the survivable one-fault-tolerant ring star problem
- 22 September 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 196
Open AccessA high-performance hybrid metaheuristic for the survivable one-fault-tolerant ring star problem
- 8 September 2026
- Published by Taylor & Francis in Journal of Mathematics and the Arts
- p. 1-26
Making mosaics from Tetris®tiles
1. Throughout history, mathematics and art have been deeply intertwined, with geometric principles and mathematical structures informing artistic practices across cultures. In Islamic art, for exam...
- 8 September 2026
- Published by Taylor & Francis in Journal of Mathematics and the Arts
- p. 1-26
Making mosaics from Tetris®tiles
1. Throughout history, mathematics and art have been deeply intertwined, with geometric principles and mathematical structures informing artistic practices across cultures. In Islamic art, for exam...
- Open Access
- 24 July 2026
- Published by Springer Nature in 4OR
- p. 1-30
An exact and computationally efficient algorithm for balanced customer clustering under relocation constraints
In logistics, customer clusters are often predefined based on geographic locations to optimize resource management and workload distribution. However, this approach frequently leads to significant cluster imbalance, particularly when not all customers require daily service or when operational constraints restrict the possibility of reallocating customers across clusters. These imbalances may affect workload equity, routing efficiency, and overall service performance. This paper addresses the problem of balancing customer clusters under relocation constraints by introducing two alternative criteria for measuring imbalance and enforcing them within a constrained reassignment framework. Our goal is to redistribute the set of customers so as to construct new clusters whose cardinalities are as balanced as possible while fully respecting the reassignment limitations. After formulating both nonlinear optimization models, we propose an exact algorithm that systematically reallocates customers through sequences of feasible moves, thereby ensuring progress toward a balanced configuration. We provide formal proofs showing that the algorithm always converges to an optimal solution for both imbalance criteria after a finite number of iterations. From these results, it follows that both models yield the same optimal solution. In addition, computational experiments demonstrate the efficiency of the method, showing that optimal solutions are obtained with very low running times for large-scale instances.
- 24 July 2026
- Published by Springer Nature in 4OR
- p. 1-30
Open AccessAn exact and computationally efficient algorithm for balanced customer clustering under relocation constraints
In logistics, customer clusters are often predefined based on geographic locations to optimize resource management and workload distribution. However, this approach frequently leads to significant cluster imbalance, particularly when not all customers require daily service or when operational constraints restrict the possibility of reallocating customers across clusters. These imbalances may affect workload equity, routing efficiency, and overall service performance. This paper addresses the problem of balancing customer clusters under relocation constraints by introducing two alternative criteria for measuring imbalance and enforcing them within a constrained reassignment framework. Our goal is to redistribute the set of customers so as to construct new clusters whose cardinalities are as balanced as possible while fully respecting the reassignment limitations. After formulating both nonlinear optimization models, we propose an exact algorithm that systematically reallocates customers through sequences of feasible moves, thereby ensuring progress toward a balanced configuration. We provide formal proofs showing that the algorithm always converges to an optimal solution for both imbalance criteria after a finite number of iterations. From these results, it follows that both models yield the same optimal solution. In addition, computational experiments demonstrate the efficiency of the method, showing that optimal solutions are obtained with very low running times for large-scale instances.
- 8 June 2026
- Published by Fundación Muy Interesante in Fundación Muy Interesante
El arte de anticiparse: cuando tu decisión depende de la reacción de otros
Organizar una cena con amigos puede parecer sencillo, pero anticipar cómo reaccionará cada invitado a tus decisiones es un desafío mucho más complejo. Detrás de situaciones cotidianas como esta se esconde un poderoso concepto matemático: la optimización binivel.
- 8 June 2026
- Published by Fundación Muy Interesante in Fundación Muy Interesante
El arte de anticiparse: cuando tu decisión depende de la reacción de otros
Organizar una cena con amigos puede parecer sencillo, pero anticipar cómo reaccionará cada invitado a tus decisiones es un desafío mucho más complejo. Detrás de situaciones cotidianas como esta se esconde un poderoso concepto matemático: la optimización binivel.
- 29 September 2025
- Published by Wiley in International Transactions in Operational Research
An iterated greedy‐based metaheuristic with local search for the rank pricing problem
The rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction phases. In this process, some components of a solution are removed, yielding partial solutions from which complete solutions are reconstructed. A local search method with three neighborhood exploration strategies is then applied. Computational experiments demonstrate the effectiveness of the proposed algorithm by comparing its performance with exact and heuristic methods from the literature. It consistently finds optimal or near‐optimal solutions for instances with known optima. For most cases where the optimal solution is unknown, the algorithm matches or outperforms the best‐known solutions. Moreover, it achieves these results with significantly lower computational times, reinforcing its suitability for solving the rank pricing problem.
- 29 September 2025
- Published by Wiley in International Transactions in Operational Research
An iterated greedy‐based metaheuristic with local search for the rank pricing problem
The rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction phases. In this process, some components of a solution are removed, yielding partial solutions from which complete solutions are reconstructed. A local search method with three neighborhood exploration strategies is then applied. Computational experiments demonstrate the effectiveness of the proposed algorithm by comparing its performance with exact and heuristic methods from the literature. It consistently finds optimal or near‐optimal solutions for instances with known optima. For most cases where the optimal solution is unknown, the algorithm matches or outperforms the best‐known solutions. Moreover, it achieves these results with significantly lower computational times, reinforcing its suitability for solving the rank pricing problem.
- Open Access
- 8 May 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 326 (3) , 439-450
Scatter search with path relinking for linear bilevel problems
- 8 May 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 326 (3) , 439-450
Open AccessScatter search with path relinking for linear bilevel problems
- Open Access
- 1 January 2025
- Published by Universidad de Zaragoza
Charrando aragonés. La lengua aragonesa en su zona de uso predominante
Eito Mateo, Antonio; Iranzo Sanz, José Ángel ; Marcuello Servós, Chaime ; Pardos Calvo, Alejandro
- 1 January 2025
- Published by Universidad de Zaragoza
Open AccessCharrando aragonés. La lengua aragonesa en su zona de uso predominante
Eito Mateo, Antonio; Iranzo Sanz, José Ángel ; Marcuello Servós, Chaime ; Pardos Calvo, Alejandro
- Open Access
- 5 November 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (22) , 3459
A Bilevel Approach to the Facility Location Problem with Customer Preferences Under a Mill Pricing Policy
This paper addresses the facility location problem under a mill pricing policy, integrating customers’ behavior through the concept of preferences. The problem is modeled as a bilevel optimization problem, where the existence of ties in customers’ preferences can lead to an ill-posed bilevel problem due to the possible existence of multiple optima to the lower-level problem. As the commonly employed optimistic and pessimistic strategies are inadequate for this problem, a specific approach is proposed bearing in mind the customers’ rational behavior. In this work, we propose a novel formulation of the problem as a bilevel model in which each customer faces a lexicographic biobjective problem in which the preference is maximized and the total cost of accessing the selected facility is minimized. This allows for a more accurate representation of customer preferences and the resulting decisions regarding facility location and pricing. To address the complexities of this model, we apply duality theory to the lower-level problems and, ultimately, reformulate the bilevel problem as a single-level mixed-integer optimization problem. This reformulation incorporates big-M constants, for which we provide valid bounds to ensure computational tractability and solution quality. The computational study conducted allows us to assess, on the one hand, the effectiveness of the proposed reformulation to address the bilevel model and, on the other hand, the impact of the length of the customer preference lists and fixed opening cost for facilities on the computational time and the optimal solution.
- 5 November 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (22) , 3459
Open AccessA Bilevel Approach to the Facility Location Problem with Customer Preferences Under a Mill Pricing Policy
This paper addresses the facility location problem under a mill pricing policy, integrating customers’ behavior through the concept of preferences. The problem is modeled as a bilevel optimization problem, where the existence of ties in customers’ preferences can lead to an ill-posed bilevel problem due to the possible existence of multiple optima to the lower-level problem. As the commonly employed optimistic and pessimistic strategies are inadequate for this problem, a specific approach is proposed bearing in mind the customers’ rational behavior. In this work, we propose a novel formulation of the problem as a bilevel model in which each customer faces a lexicographic biobjective problem in which the preference is maximized and the total cost of accessing the selected facility is minimized. This allows for a more accurate representation of customer preferences and the resulting decisions regarding facility location and pricing. To address the complexities of this model, we apply duality theory to the lower-level problems and, ultimately, reformulate the bilevel problem as a single-level mixed-integer optimization problem. This reformulation incorporates big-M constants, for which we provide valid bounds to ensure computational tractability and solution quality. The computational study conducted allows us to assess, on the one hand, the effectiveness of the proposed reformulation to address the bilevel model and, on the other hand, the impact of the length of the customer preference lists and fixed opening cost for facilities on the computational time and the optimal solution.
- 8 August 2024
- Published by Taylor & Francis in Optimization
- Vol. 74 (12) , 2823-2856
A novel approach to pessimistic bilevel problems. An application to the rank pricing problem with ties
- 8 August 2024
- Published by Taylor & Francis in Optimization
- Vol. 74 (12) , 2823-2856
A novel approach to pessimistic bilevel problems. An application to the rank pricing problem with ties