Isolina Alberto
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Isolina Alberto has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Pedro Mariano Mateo
Universidad de Zaragoza
7 shared publications - David Lahoz2 shared publications
- Asunción Beamonte
Universidad de Zaragoza
1 shared publication - Carlos Artemio Coello Coello
Cinvestav-IPN
1 shared publication - Fermin Mallor
Institute of Smart Cities, Public University of Navarre, Pamplona, Spain
1 shared publication - Manuel Salvador
Department of Applied Economics, Faculty of Economics and Business, University of Zaragoza, Gran Vía 2, 50005 Zaragoza, Spain
1 shared publication
Latest Publications
- Open Access
- 3 October 2026
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 109
Efficient incremental non-dominated sorting for bi-objective problems via linear-space IDG representation
- 3 October 2026
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 109
Open AccessEfficient incremental non-dominated sorting for bi-objective problems via linear-space IDG representation
- Open Access
- 8 April 2026
- Published by Elsevier in SSRN Electronic Journal
Efficient Incremental Non-Dominated Sorting for Bi-Objective Problems via Linear-Space IDG Representation
This work presents an efficient incremental non-dominated sorting algorithm for bi-objective vectors. Non-dominated sorting algorithms organize solutions into layers, or Pareto fronts, based on dominance relations, and play a key role in the selection process of many well-known population-based algorithms for multi-objective optimization. Since the non-dominated sorting process is computationally expensive, its efficient design is of critical importance.The proposed algorithm is incremental, that is, given a population whose solutions are already assigned to layers, a new solution is incorporated and the dominance structure is updated as efficiently as possible, reconstructing the layers with minimal computational effort. The method is based on irreducible domination graphs of order 1, IDG1, for which a storage structure requiring linear space in the number of solutions is introduced, instead of the quadratic requirements of the general case. Based on this representation, an incremental non-dominated sorting algorithm with O(n) complexity is developed, matching the complexity of well-known algorithms in the literature while relying on simpler data structures. Key components of the approach include locating the appropriate front for the new solution, managing displaced nodes across layers, and efficiently updating dominance relations. This linear complexity is achieved thanks to the structure of the IDG1, which stores immediate dominance relations among solutions, i.e., the set of nodes in the previous Pareto layer that directly dominate each node.
- 8 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessEfficient Incremental Non-Dominated Sorting for Bi-Objective Problems via Linear-Space IDG Representation
This work presents an efficient incremental non-dominated sorting algorithm for bi-objective vectors. Non-dominated sorting algorithms organize solutions into layers, or Pareto fronts, based on dominance relations, and play a key role in the selection process of many well-known population-based algorithms for multi-objective optimization. Since the non-dominated sorting process is computationally expensive, its efficient design is of critical importance.The proposed algorithm is incremental, that is, given a population whose solutions are already assigned to layers, a new solution is incorporated and the dominance structure is updated as efficiently as possible, reconstructing the layers with minimal computational effort. The method is based on irreducible domination graphs of order 1, IDG1, for which a storage structure requiring linear space in the number of solutions is introduced, instead of the quadratic requirements of the general case. Based on this representation, an incremental non-dominated sorting algorithm with O(n) complexity is developed, matching the complexity of well-known algorithms in the literature while relying on simpler data structures. Key components of the approach include locating the appropriate front for the new solution, managing displaced nodes across layers, and efficiently updating dominance relations. This linear complexity is achieved thanks to the structure of the IDG1, which stores immediate dominance relations among solutions, i.e., the set of nodes in the previous Pareto layer that directly dominate each node.
- 1 July 2014
- Published by Elsevier in Information Sciences
- Vol. 273, 33-48
A comparative study of variation operators used for evolutionary multi-objective optimization
- 1 July 2014
- Published by Elsevier in Information Sciences
- Vol. 273, 33-48
A comparative study of variation operators used for evolutionary multi-objective optimization
- 14 January 2011
- Published by Springer Nature in Journal of Heuristics
- Vol. 18 (1) , 53-89
A mutation operator based on a Pareto ranking for multi-objective evolutionary algorithms
- 14 January 2011
- Published by Springer Nature in Journal of Heuristics
- Vol. 18 (1) , 53-89
A mutation operator based on a Pareto ranking for multi-objective evolutionary algorithms
- 17 November 2010
- Published by Wiley in Journal of Forecasting
- Vol. 29 (8) , 728-750
Variable selection in STAR models with neighbourhood effects using genetic algorithms
In this paper we deal with the problem of variable selection in spatiotemporal autoregressive (STAR) models with neighbourhood effects. We propose a procedure to carry out the selection process, taking into account the uncertainty associated with estimation of the parameters and the predictive behaviour of the compared models, in order to give more realism to the analysis. We set up a multi‐objective programming problem that combines the use of different criteria to measure both these aspects. We use genetic algorithms which are very flexible and suitable for our multicriteria decision problem. In particular, the procedure allows us to estimate the number of spatial and temporal nearest neighbours as well as their relative effects. The methodology is illustrated through an application to the real estate market of Zaragoza. Copyright © 2010 John Wiley & Son, Ltd.
- 17 November 2010
- Published by Wiley in Journal of Forecasting
- Vol. 29 (8) , 728-750
Variable selection in STAR models with neighbourhood effects using genetic algorithms
In this paper we deal with the problem of variable selection in spatiotemporal autoregressive (STAR) models with neighbourhood effects. We propose a procedure to carry out the selection process, taking into account the uncertainty associated with estimation of the parameters and the predictive behaviour of the compared models, in order to give more realism to the analysis. We set up a multi‐objective programming problem that combines the use of different criteria to measure both these aspects. We use genetic algorithms which are very flexible and suitable for our multicriteria decision problem. In particular, the procedure allows us to estimate the number of spatial and temporal nearest neighbours as well as their relative effects. The methodology is illustrated through an application to the real estate market of Zaragoza. Copyright © 2010 John Wiley & Son, Ltd.
- 8 April 2009
- Published by Springer Nature in TOP
- Vol. 19 (1) , 67-92
A crossover operator that uses Pareto optimality in its definition
- 8 April 2009
- Published by Springer Nature in TOP
- Vol. 19 (1) , 67-92
A crossover operator that uses Pareto optimality in its definition
- 1 January 2008
- Published by Inderscience Publishers in European J. of Industrial Engineering
- Vol. 2 (4) , 461
Optimising the service capacity by using a speed-up simulation
In this work we provide an effective method based on a speed-up simulation+optimisation tool that allows us to optimise the capacity of a queue model system subject to the completion of a Quality of Service (QoS) criterion. This criterion is expressed in terms of a very small probability of losing a customer due to system overload. To evaluate the performance of the system, multiple simulations with different capacity levels have to be made. Because of the characteristics of these kinds of systems, any speed-up tool will be necessary in order to keep the computational time reasonably bounded. Our tool uses a speed-up technique, called RESTART, once and it does not need another entire execution of the method when a new capacity level is considered. Our tool only requires a stage (partial execution) of the RESTART method in order to update the probabilities when the capacity of the system is changed, so this involves a considerable saving of computational time. [Submitted 6 November 2007; Revised 25 January 2008; Accepted 25 January 2008]
- 1 January 2008
- Published by Inderscience Publishers in European J. of Industrial Engineering
- Vol. 2 (4) , 461
Optimising the service capacity by using a speed-up simulation
In this work we provide an effective method based on a speed-up simulation+optimisation tool that allows us to optimise the capacity of a queue model system subject to the completion of a Quality of Service (QoS) criterion. This criterion is expressed in terms of a very small probability of losing a customer due to system overload. To evaluate the performance of the system, multiple simulations with different capacity levels have to be made. Because of the characteristics of these kinds of systems, any speed-up tool will be necessary in order to keep the computational time reasonably bounded. Our tool uses a speed-up technique, called RESTART, once and it does not need another entire execution of the method when a new capacity level is considered. Our tool only requires a stage (partial execution) of the RESTART method in order to update the probabilities when the capacity of the system is changed, so this involves a considerable saving of computational time. [Submitted 6 November 2007; Revised 25 January 2008; Accepted 25 January 2008]
- 1 November 2004
- Published by Elsevier in European Journal of Operational Research
- Vol. 159 (1) , 52-65
Representation and management of MOEA populations based on graphs
- 1 November 2004
- Published by Elsevier in European Journal of Operational Research
- Vol. 159 (1) , 52-65
Representation and management of MOEA populations based on graphs