GNOM - Grup d'Optimització Numèrica i Modelització

 


El treball del grup comprèn l'optimització numèrica, la modelització de problemes resolubles amb optimització, i l'aplicació de tècniques adients a problemes de l'enginyeria, la indústria, la logística i les tecnologies de la informació. L'optimització numèrica inclou l'estudi de les propietats del problemes estudiats, l'anàlisi de nous algorismes d'optimització (lineal, no lineal, contínua, entera i combinatòria), el desenvolupament de procediments numèrics per a la seva implementació computacional eficient i la comparació amb algorismes previs, si existeixen. La part de modelització implica la cerca de formulacions escaients que permetin la resolució de problemes reals, sovint de gran dimensió. Els problemes reals en que el grup està treballant actualment són: protecció i privacitat de dades estadístiques; i generació òptima d'electricitat en un entorn multimercat.

http://futur.upc.edu/GNOM

The group works on both the numerical optimisation and the modelling of problems that can be solved through optimisation. Its work on numerical optimisation includes the analysis of new optimisation algorithms (linear, nonlinear, continuous and integer) and their convergence, the development of numerical procedures for their efficient computational implementation, and the comparison to existing algorithms. The work on modelling focuses on the solution of real problems, which are often large-scale, by finding an equivalentmathematical formulation leading to an optimisation problem, and applying a suitable solver, that has either been specially developed or is commercially available. The modelling languages that are available are used.

http://futur.upc.edu/GNOM

The group works on both the numerical optimisation and the modelling of problems that can be solved through optimisation. Its work on numerical optimisation includes the analysis of new optimisation algorithms (linear, nonlinear, continuous and integer) and their convergence, the development of numerical procedures for their efficient computational implementation, and the comparison to existing algorithms. The work on modelling focuses on the solution of real problems, which are often large-scale, by finding an equivalentmathematical formulation leading to an optimisation problem, and applying a suitable solver, that has either been specially developed or is commercially available. The modelling languages that are available are used.

http://futur.upc.edu/GNOM

Recent Submissions

  • On optimal participation in the electricity markets of wind power plants with battery energy storage systems 

    Heredia, F.-Javier (Francisco Javier); Cuadrado Guevara, Marlyn Dayana; Corchero García, Cristina (2018-01-01)
    Article
    Open Access
    The recent cost reduction and technological advances in medium- to large-scale battery energy storage systems (BESS) makes these devices a true alternative for wind producers operating in electricity markets. Associating ...

  • Analysis of satellite constellations for the continuous coverage of ground regions 

    Dai, Guangming; Chen, Xiaoyu; Wang, Maocai; Fernández Aréizaga, Elena; Nguyen, Tuan Nam; Reinelt, Gerhard (2017-11-01)
    Article
    Open Access
    This paper studies the problem of analyzing multisatellite constellations with respect to their coverage capacity of areas on Earth’s surface. The geometric configuration of constellation projection points on Earth’s surface ...

  • A linear optimization based method for data privacy in statistical tabular data 

    Castro Pérez, Jordi; González Alastrué, José Antonio (2017-05-23)
    External research report
    Open Access
    National Statistical Agencies routinely disseminate large amounts of data. Prior to dissemination these data have to be protected to avoid releasing confidential information. Controlled tabular adjustment (CTA) is one of ...

  • Stabilized Benders methods for large-scale combinatorial optimization, with appllication to data privacy 

    Baena, Daniel; Castro Pérez, Jordi; Frangioni, Antonio (2017-10-24)
    External research report
    Open Access
    The Cell Suppression Problem (CSP) is a challenging Mixed-Integer Linear Problem arising in statistical tabular data protection. Medium sized instances of CSP involve thousands of binary variables and million of continuous ...

  • The shared customer collaboration vehicle routing problem 

    Fernández Aréizaga, Elena; Roca Riu, Mireia; Speranza, M. Grazia (Elsevier, 2018-03-16)
    Article
    Restricted access - publisher's policy
    This paper introduces a new vehicle routing problem that arises in an urban area where several carriers operate and some of their customers have demand of service for more than one carrier. The problem, called Shared ...

  • The generalized arc routing problem 

    Araoz Durand, Julian Arturo; Fernández Aréizaga, Elena; Franquesa, Carles (Springer, 2017-10)
    Article
    Restricted access - publisher's policy
    This paper focuses on the generalized arc routing problem. This problem is stated on an undirected graph in which some clusters are defined as pairwise-disjoint connected subgraphs, and a route is sought that traverses at ...

  • A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem 

    Fernández Aréizaga, Elena; Kalcsics, Jörg; Núñez del Toro, Alma Cristina (Elsevier, 2017-12-16)
    Article
    Restricted access - publisher's policy
    This paper considers the multi-period service scheduling problem with an aperiodic service policy. In this problem, a set of customers who periodically require service over a finite time horizon is given. To satisfy the ...

  • Multi-depot rural postman problems 

    Fernández Aréizaga, Elena; Rodríguez Pereira, Jessica (Springer, 2017-07-01)
    Article
    Open Access
    This paper studies multi-depot rural postman problems on an undirected graph. These problems extend the well-known undirected rural postman problem to the case where there are several depots instead of just one. Linear ...

  • Minimum Spanning Trees with neighborhoods: mathematical programming formulations and solution methods 

    Blanco, Víctor; Fernández Aréizaga, Elena; Puerto Albandoz, Justo (Elsevier, 2017-11-01)
    Article
    Restricted access - publisher's policy
    This paper studies Minimum Spanning Trees under incomplete information assuming that it is only known that vertices belong to some neighborhoods that are second order cone representable and distances are measured with a ...

  • Stochastic optimal generation bid to electricity markets with emissions risk constraints 

    Heredia, F.-Javier (Francisco Javier); Cifuentes Rubiano, Julián; Corchero García, Cristina (2018-02-01)
    Article
    Open Access
    There are many factors that influence the day-ahead market bidding strategies of a generation company (GenCo) within the framework of the current energy market. Environmental policy issues are giving rise to emission ...

  • Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem 

    Fernández Aréizaga, Elena; Pozo, Miguel Angel; Puerto Albandoz, Justo; Scozzari, Andre (Elsevier, 2017-08-01)
    Article
    Open Access
    Rework adversely impacts the performance of building projects. In this study, data were analyzed from 788 construction incidents in 40 Spanish building projects to determine the effects of project and managerial characteristics ...

  • The flexible periodic vehicle routing problem 

    Archetti, C; Fernández Aréizaga, Elena; Huerta Muñoz, Diana Lucia (2017-09)
    Article
    Restricted access - publisher's policy
    This paper introduces the Flexible Periodic Vehicle Routing Problem (FPVRP) where a carrier has to establish a distribution plan to serve his customers over a planning horizon. Each customer has a total demand that must ...

View more